Models for the single-vehicle preemptive pickup and delivery problem

In this paper, we study a variant of the well-known single-vehicle pickup and delivery problem where the demands can be unloaded/reloaded at any node. By proving new complexity results, we give the minimum information which is necessary to represent feasible solutions. Using this, we present integer...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Journal of combinatorial optimization 2012-02, Vol.23 (2), p.196-223
Hauptverfasser:	Kerivin, H. L. M., Lacroix, M., Mahjoub, A. R.
Format:	Artikel
Sprache:	eng
Schlagworte:	Applied sciences Combinatorics Computer Science Convex and Discrete Geometry Exact sciences and technology Logistics Mathematical Modeling and Industrial Mathematics Mathematical programming Mathematics Mathematics and Statistics Operational research and scientific management Operational research. Management science Operations Research/Decision Theory Optimization Theory of Computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!