This paper expands the typical Vehicle Routing Problem, and synthetically considers the situation of customs with soft time windows and a depot with several distributing vehicle types. After constructing a mathematical model for the problem, the paper emphasizes the procedure of TS algorithm for solving this problem. Finally, combined with Adaptive Memory procedure, the paper presents the pseudo-code description of TS algorithm. Some computational results are reported too.
Study on Model and Algorithm of the Heterogeneous Fleet Vehicle Routing Problem with Soft Time Windows
International Conference on Traffic and Transportation Studies (ICTTS) 2002 ; 2002 ; Guilin, China
2002-07-10
Conference paper
Electronic Resource
English
British Library Conference Proceedings | 2002
|Optimasi Rute Pengiriman dengan Heterogeneous Fleet Vehicle Routing Problem with Time Windows
BASE | 2018
|A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows
BASE | 2015
|