Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
388288 | Expert Systems with Applications | 2012 | 10 Pages |
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.
► We study the heterogeneous fixed fleet open vehicle routing problem. ► We propose a multistart adaptive memory programming metaheuristic to solve this problem. ► The algorithmic efficiency and effectiveness are evaluated on a set of generated instances.