A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints

This paper presents a heuristic, which concentrates on solving a large-scale static dial-a-ride problem bearing complex constraints. In this heuristic, a properly organized local search strategy and a diversification strategy are used to improve initial solutions. Then the improved solutions can be...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research 2006-10, Vol.174 (2), p.1117-1139
Hauptverfasser:	Xiang, Zhihai, Chu, Chengbin, Chen, Haoxun
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Computer Science Dial-a-ride problem Exact sciences and technology Flows in networks. Combinatorial problems Heuristic Heuristics Operational research and scientific management Operational research. Management science Operations Research Route optimization Studies Transportation Vehicle routing problem
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!