| Article ID: | iaor20031895 |
| Country: | United Kingdom |
| Volume: | 53 |
| Issue: | 11 |
| Start Page Number: | 1232 |
| End Page Number: | 1238 |
| Publication Date: | Nov 2002 |
| Journal: | Journal of the Operational Research Society |
| Authors: | Janssens G.K., Dullaert W., Srensen K., Vernimmen B. |
In the Fleet Size and Mix Vehicle Routing Problem with Time Windows (FSMVRPTW) customers need to be serviced in their time windows at minimal costs by a heterogeneous fleet. In this paper new heuristics for the FSMVRPTW are developed. The performance of the heuristics is shown to be significantly higher than that of any previous heuristic approach and therefore likely to achieve better solutions to practical routing problems.