New heuristics for the fleet size and mix vehicle routing problem with time windows

W. Dullaert*, Gerrit K. Janssens, K. Sirensen, Bert Vernimmen

*Corresponding author for this work

Research output: Contribution to JournalArticleAcademicpeer-review

Abstract

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.

Original languageEnglish
Pages (from-to)1232-1238
Number of pages7
JournalThe Journal of the Operational Research Society
Volume53
Issue number11
DOIs
Publication statusPublished - Nov 2002

Keywords

  • Heterogeneous fleet
  • Heuristics
  • Time windows
  • Vehicle routing

Fingerprint

Dive into the research topics of 'New heuristics for the fleet size and mix vehicle routing problem with time windows'. Together they form a unique fingerprint.

Cite this