A multi-phase constructive heuristic for the vehicle routing problem with multiple trips

An extension to the classical vehicle routing problem where vehicles can be assigned more than one route within a working time period is investigated. A multi-phase constructive heuristic, which is enhanced by suitable data structure, is proposed. Results are given comparing to benchmarks from the l...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete Applied Mathematics Jg. 133; H. 1; S. 69 - 92
Hauptverfasser: Petch, R.J, Salhi, S
Format: Journal Article Tagungsbericht
Sprache:Englisch
Veröffentlicht: Lausanne Elsevier B.V 15.11.2003
Amsterdam Elsevier
New York, NY
Schlagworte:
Applied sciences
Bin-packing
Calculus of variations and optimal control
Exact sciences and technology
Heuristic
Mathematical analysis
Mathematical programming
Mathematics
Multiple trip
Operational research and scientific management
Operational research. Management science
Population
Scheduling, sequencing
Sciences and techniques of general use
Multiple trip
Population
Bin-packing
Heuristic
Vehicle routing problem
Benchmarks
Period
Routing
Data
Scheduling
Time
Algorithm
Result
Extension
Heuristic method
Bin packing
Population dynamics
Problem
Data structure
ISSN:0166-218X, 1872-6771
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:An extension to the classical vehicle routing problem where vehicles can be assigned more than one route within a working time period is investigated. A multi-phase constructive heuristic, which is enhanced by suitable data structure, is proposed. Results are given comparing to benchmarks from the literature.
ISSN:0166-218X
1872-6771
DOI:10.1016/S0166-218X(03)00434-7