Models for the single-vehicle preemptive pickup and delivery problem

Authors:
H. L. Kerivin;M. Lacroix;A. R. Mahjoub
Affiliations:
LIMOS, CNRS UMR 6158, Université Blaise-Pascal---Clermont-Ferrand II, Complexe Scientifique des Cézeaux, Aubière Cedex, France 63173 and Department of Mathematical Sciences, Clemson ...;LIMOS, CNRS UMR 6158, Université Blaise-Pascal---Clermont-Ferrand II, Complexe Scientifique des Cézeaux, Aubière Cedex, France 63173 and Université Paris Dauphine, LAMSADE, CNR ...;LIMOS, CNRS UMR 6158, Université Blaise-Pascal---Clermont-Ferrand II, Complexe Scientifique des Cézeaux, Aubière Cedex, France 63173 and Université Paris Dauphine, LAMSADE, CNR ...
Venue:
Journal of Combinatorial Optimization
Year:
2012

Citing 6
Cited 2

Efficient solutions to some transportation problems with applications to minimizing robot arm travel

SIAM Journal on Computing
Preemptive ensemble motion planning on a tree

SIAM Journal on Computing
NP-completeness of some edge-disjoint paths problems

Discrete Applied Mathematics
Perturbation heuristics for the pickup and delivery traveling salesman problem

Computers and Operations Research
The Common Optimization INterface for Operations Research: Promoting open-source software in the operations research community

IBM Journal of Research and Development
The preemptive swapping problem on a tree

Networks

On the complexity of the Eulerian closed walk with precedence path constraints problem

Theoretical Computer Science
A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

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.