New heuristics for the Fleet Size and Mix Vehicle Routing Problem with Time Windows

W Dullaert (), G K Janssens, K Sörensen and B Vernimmen ()
Additional contact information
W Dullaert: University of Antwerp
G K Janssens: Limburg University Centre
K Sörensen: University of Antwerp
B Vernimmen: University of Antwerp

Journal of the Operational Research Society, 2002, vol. 53, issue 11, 1232-1238

Abstract: 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.

Keywords: vehicle routing; heuristics; time windows; heterogeneous fleet (search for similar items in EconPapers)
Date: 2002
References: Add references at CitEc
Citations: View citations in EconPapers (18)

Downloads: (external link)
http://link.springer.com/10.1057/palgrave.jors.2601422 Abstract (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:pal:jorsoc:v:53:y:2002:i:11:d:10.1057_palgrave.jors.2601422

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/41274

DOI: 10.1057/palgrave.jors.2601422

Access Statistics for this article

Journal of the Operational Research Society is currently edited by Tom Archibald and Jonathan Crook

More articles in Journal of the Operational Research Society from Palgrave Macmillan, The OR Society
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().