Scatter search for the fleet size and mix vehicle routing problem with time windows

Scatter search for the fleet size and mix vehicle routing problem with time windows

This work proposes a scatter search (SS) approach to solve the fleet size and mix vehicle routing problem with time windows (FSMVRPTW). In the FSMVRPTW the customers need to be serviced in their time windows at minimal costs by a heterogeneous fleet. Computational results on 168 benchmark problems a...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Central European journal of operations research 2007-11, Vol.15 (4), p.351-368
Hauptverfasser: Belfiore, Patrícia Prado, Fávero, Luiz Paulo Lopes
Format: Artikel
Sprache:eng
Schlagworte:
Adaptation
Algorithms
Cost control
Customers
Heuristic
Literature reviews
Mathematical programming
Mathematical research
Operations research
Vehicles
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This work proposes a scatter search (SS) approach to solve the fleet size and mix vehicle routing problem with time windows (FSMVRPTW). In the FSMVRPTW the customers need to be serviced in their time windows at minimal costs by a heterogeneous fleet. Computational results on 168 benchmark problems are reported. Computational testing revealed that our algorithm presented better results compared to other methods published in the literature. Keywords Scatter search * Vehicle routing * Heterogeneous fleet * Time windows
ISSN:1435-246X
1613-9178
DOI:10.1007/s10100-007-0036-9