AbstractThis 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.
An adaptive memory programming metaheuristic for the heterogeneous fixed fleet vehicle routing problem
Transportation Research Part E: Logistics and Transportation Review ; 46 , 6 ; 1111-1127
2010-02-03
17 pages
Article (Journal)
Electronic Resource
English
A hybrid metaheuristic algorithm for the green vehicle routing problem with a heterogeneous fleet
Automotive engineering | 2016
|Heterogeneous fixed fleet vehicle routing considering carbon emission
Online Contents | 2013
|Heterogeneous fixed fleet vehicle routing considering carbon emission
Elsevier | 2013
|A Constraint Programming Model for the Open Vehicle Routing Problem with Heterogeneous Vehicle Fleet
Springer Verlag | 2023
|