Heuristic Approaches for the Fleet Size and Mix Vehicle Routing Problem with Time Windows

Mauro Dell'Amico (), Michele Monaci (), Corrado Pagani () and Daniele Vigo ()
Additional contact information
Mauro Dell'Amico: DISMI, Università di Modena e Reggio Emilia, Via Amendola 2, 42100, Reggio Emilia, Italy
Michele Monaci: DEI, Università di Padova, Via Gradenigo 6/A, 35131, Padova, Italy
Corrado Pagani: DISMI, Università di Modena e Reggio Emilia, Via Amendola 2, 42100, Reggio Emilia, Italy
Daniele Vigo: DEIS, Università di Bologna, Viale Risorgimento 2, 40136, Bologna, Italy

Transportation Science, 2007, vol. 41, issue 4, 516-526

Abstract: The fleet size and mix vehicle routing problem with time windows (FSMVRPTW) is the problem of determining, at the same time, the composition and the routing of a fleet of heterogeneous vehicles aimed to serve a given set of customers. The routing problem requires us to design a set of minimum-cost routes originating and terminating at a central depot and serving customers with known demands, within given time windows. This paper develops a constructive insertion heuristic and a metaheuristic algorithm for FSMVRPTW. Extensive computational experiments on benchmark instances show that the proposed method is robust and efficient, and outperforms the previously published results.

Keywords: vehicle routing problem; time windows; heterogeneous fleet; metaheuristics (search for similar items in EconPapers)
Date: 2007
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (12)

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.1070.0190 (application/pdf)

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:inm:ortrsc:v:41:y:2007:i:4:p:516-526

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().