Models for the single-vehicle preemptive pickup and delivery problem

被引：6

作者：

Kerivin, H. L. M. ^{[1
]}

Lacroix, M. ^{[1
]}

Mahjoub, A. R. ^{[1
]}

机构：

[1] Univ Clermont Ferrand, CNRS, LIMOS, UMR 6158, F-63173 Aubiere, France

来源：

JOURNAL OF COMBINATORIAL OPTIMIZATION | 2012年 / 23卷 / 02期

关键词：

Pickup and delivery; Reloads; Minimal representations; Complexity; Integer linear programs; Separation problems; Preemptive stacker crane problem; OPERATIONS;

D O I：

10.1007/s10878-010-9349-z

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

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.

引用

页码：196 / 223

页数：28

共 50 条

[1] Models for the single-vehicle preemptive pickup and delivery problem
H. L. M. Kerivin
M. Lacroix
A. R. Mahjoub
[J]. Journal of Combinatorial Optimization, 2012, 23 : 196 - 223
[2] VARIABLE-DEPTH SEARCH FOR THE SINGLE-VEHICLE PICKUP AND DELIVERY PROBLEM WITH TIME WINDOWS
VANDERBRUGGEN, LJJ
LENSTRA, JK
SCHUUR, PC
[J]. TRANSPORTATION SCIENCE, 1993, 27 (03) : 298 - 311
[3] The single-vehicle two-echelon one-commodity pickup and delivery problem
Hernandez-Perez, Hipolito
Landete, Mercedes
Rodriguez-Martin, Inmaculada
[J]. COMPUTERS & OPERATIONS RESEARCH, 2021, 127
[4] Single-Commodity Vehicle Routing Problem with Pickup and Delivery Service
Martinovic, Goran
Aleksi, Ivan
Baumgartner, Alfonzo
[J]. MATHEMATICAL PROBLEMS IN ENGINEERING, 2008, 2008
[5] Comparative mathematical models for split delivery simultaneous pickup and delivery vehicle routing problem
Bayrak, Ayse
Ozyoruk, Bahar
[J]. JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GAZI UNIVERSITY, 2017, 32 (02): : 469 - 479
[6] A stochastic and dynamic model for the single-vehicle pick-up and delivery problem
Swihart, MR
Papastavrou, JD
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1999, 114 (03) : 447 - 464
[7] The single-vehicle routing problem with unrestricted backhauls
Süral, H
Bookbinder, JH
[J]. NETWORKS, 2003, 41 (03) : 127 - 136
[8] A tabu search heuristic for the single vehicle pickup and delivery problem with time windows
Antoine Landrieu
Yazid Mati
Zdenek Binder
[J]. Journal of Intelligent Manufacturing, 2001, 12 : 497 - 508
[9] Ant Colony Optimization for the Single Vehicle Pickup and Delivery Problem with Time Window
Huang, Yu-Hsuan
Ting, Chuan-Kang
[J]. INTERNATIONAL CONFERENCE ON TECHNOLOGIES AND APPLICATIONS OF ARTIFICIAL INTELLIGENCE (TAAI 2010), 2010, : 537 - 543
[10] A tabu search heuristic for the single vehicle pickup and delivery problem with time windows
Landrieu, A
Mati, Y
Binder, Z
[J]. JOURNAL OF INTELLIGENT MANUFACTURING, 2001, 12 (5-6) : 497 - 508

← 1 2 3 4 5 →