An adaptive memory programming metaheuristic for the heterogeneous fixed fleet vehicle routing problem |
| |
Authors: | Xiangyong Li Peng Tian YP Aneja |
| |
Institution: | 1. Antai College of Economics & Management, Shanghai Jiao Tong University, Shanghai 200052, China;2. Odette School of Business, University of Windsor, Windsor, Ontario, Canada N9B 3P4 |
| |
Abstract: | This paper studies the heterogeneous fixed fleet vehicle routing problem (HFFVRP), in which the fleet is composed of a fixed number of vehicles with different capacities, fixed costs, and variable costs. Given the fleet composition, the HFFVRP is to determine a vehicle scheduling strategy with the objective of minimizing the total transportation cost. We propose a multistart adaptive memory programming (MAMP) and path relinking algorithm to solve this problem. Through the search memory, MAMP at each iteration constructs multiple provisional solutions, which are further improved by a modified tabu search. As an intensification strategy, path relinking is integrated to enhance the performance of MAMP. We conduct a series of experiments to evaluate and demonstrate the effectiveness of the proposed algorithm. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|