An adaptive memory programming metaheuristic for the heterogeneous fixed fleet vehicle routing problem

作者：Li, Xiangyong^*; Tian, Peng; Aneja, Y P

来源：Transportation Research Part E: Logistics and Transportation Review , 2010, 46(6): 1111-1127.

DOI：10.1016/j.tre.2010.02.004

• Vehicle routing
• Heterogeneous fixed fleet
• Adaptive memory programming
• Path relinking
• Metaheuristic

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.

• 出版日期2010-11
• 单位上海交通大学