Solving real-life vehicle routing problems efficiently using tabu search
Annals of Operations Research - Special issue on Tabu search
A tabu search heuristic for the heterogenous fleet vehicle routing problem
Computers and Operations Research
A column generation approach to the heterogeneous fleet vehicle routing problem
Computers and Operations Research
A record-to-record travel algorithm for solving the heterogeneous fleet vehicle routing problem
Computers and Operations Research
A well-scalable metaheuristic for the fleet size and mix vehicle routing problem with time windows
Expert Systems with Applications: An International Journal
Heuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows
Transportation Science
Two memetic algorithms for heterogeneous fleet vehicle routing problems
Engineering Applications of Artificial Intelligence
A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem
Computers and Operations Research
| Hi-index | 12.05 |
In this paper, a problem variant of the vehicle routing problem with time windows is introduced to consider vehicle routing with a heterogeneous fleet, a limited number of vehicles and time windows. A method that extends an existing tabu search procedure to solve the problem is then proposed. To evaluate the performance of the proposed method, experiments are conducted on a large set of test cases, which comprises several benchmark problems from numerous problem variants of the vehicle routing problem with a heterogeneous fleet. It is observed that the proposed method can be used to give reasonably good results for these problem variants. In addition, some ideas are presented to advance the research in heuristics, such as fair reporting standards, publication of benchmark problems and executable routines developed for algorithmic comparison.