An adaptive memory heuristic for a class of vehicle routing problems with minmax objective

An adaptive memory heuristic for a class of vehicle routing problems with minmax objective

We propose a heuristic for a class of vehicle routing problems (VRPs) with minmax objective. These include the Capacitated VRP, the Capacitated VRP with multiple use of vehicles, and the m-Travelling Salesman Problem with multiple use of vehicles. A tabu search based adaptive memory procedure of ins...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers & operations research 1997-05, Vol.24 (5), p.445-452
Hauptverfasser: Golden, Bruce L., Laporte, Gilbert, Taillard, Éric D.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Applied sciences
Exact sciences and technology
Flows in networks. Combinatorial problems
Heuristic
Mathematical models
Operational research and scientific management
Operational research. Management science
Operations research
Routing
Statistical analysis
Studies
Vehicles
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We propose a heuristic for a class of vehicle routing problems (VRPs) with minmax objective. These include the Capacitated VRP, the Capacitated VRP with multiple use of vehicles, and the m-Travelling Salesman Problem with multiple use of vehicles. A tabu search based adaptive memory procedure of instances indicate that the method produces very good solutions within reasonable computing times.
ISSN:0305-0548
1873-765X
0305-0548
DOI:10.1016/S0305-0548(96)00065-2