کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
1023851 | 941649 | 2010 | 17 صفحه PDF | دانلود رایگان |
![عکس صفحه اول مقاله: An adaptive memory programming metaheuristic for the heterogeneous fixed fleet vehicle routing problem An adaptive memory programming metaheuristic for the heterogeneous fixed fleet vehicle routing problem](/preview/png/1023851.png)
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.
Journal: Transportation Research Part E: Logistics and Transportation Review - Volume 46, Issue 6, November 2010, Pages 1111–1127