| Article ID: | iaor20133559 |
| Volume: | 54 |
| Issue: | 1 |
| Start Page Number: | 67 |
| End Page Number: | 78 |
| Publication Date: | Aug 2013 |
| Journal: | Transportation Research Part E |
| Authors: | Liu Shuguang |
| Keywords: | supply & supply chains, heuristics: genetic algorithms, heuristics: local search |
The heterogeneous vehicle routing problem (HVRP) plays an important role in supply chain logistics. Two variants of HVRP are treated in this paper: one with fixed and variable costs (HVRPFD), and the other with only variable cost (HVRPD). A hybrid population heuristic that is able to solve both variants is proposed, in which a population of solutions are progressively evolved by crossovers and local searches. Computational results on a set of eight benchmark test problems from literature show that the proposed heuristic produces excellent solutions in short computing times.