Models for the single-vehicle preemptive pickup and delivery problem

H. L. M. Kerivin (), M. Lacroix () and A. R. Mahjoub ()
Additional contact information
H. L. M. Kerivin: Université Blaise-Pascal–Clermont-Ferrand II, Complexe Scientifique des Cézeaux
M. Lacroix: Université Blaise-Pascal–Clermont-Ferrand II, Complexe Scientifique des Cézeaux
A. R. Mahjoub: Université Blaise-Pascal–Clermont-Ferrand II, Complexe Scientifique des Cézeaux

Journal of Combinatorial Optimization, 2012, vol. 23, issue 2, No 4, 196-223

Abstract: Abstract 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 linear programs for both the unitary and the general versions. We then show that the associated linear relaxations are polynomial-time solvable and present some computational results.

Keywords: Pickup and delivery; Reloads; Minimal representations; Complexity; Integer linear programs; Separation problems; Preemptive stacker crane problem (search for similar items in EconPapers)
Date: 2012
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-010-9349-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:23:y:2012:i:2:d:10.1007_s10878-010-9349-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-010-9349-z

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().