|
|||||
|
|
A multistart adaptive memory-based tabu search algorithm for the heterogeneous fixed fleet open vehicle routing problem |
|
| Authors: | Xiangyong LiStephen CH Leung Peng Tian |
| Affiliation: | a School of Economics & Management, Tongji University, Shanghai 200092, China b Department of Management Sciences, City University of Hong Kong, Hong Kong c Antai College of Economics & Management, Shanghai Jiao Tong University, Shanghai 200052, China |
| Abstract: | This paper addressed the heterogeneous fixed fleet open vehicle routing problem (HFFOVRP), in which the demands of customers are fulfilled by a fleet of fixed number of vehicles with various capacities and related costs. Moreover, the vehicles start at the depot and terminate at one of the customers. This problem is an important variant of the classical vehicle routing problem and can cover more practical situations in transportation and logistics. We propose a multistart adaptive memory programming metaheuristic with modified tabu search algorithm to solve this new vehicle routing problem. The algorithmic efficiency and effectiveness are experimentally evaluated on a set of generated instances. |
| Keywords: | Vehicle routing Distribution management Heterogeneous fleet Metaheuristics Adaptive memory programming |
| 本文献已被 ScienceDirect 等数据库收录！ | |