A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks

被引：21

作者：

Cote, Jean-Francois ^{[1
,2
]}

Archetti, Claudia ^{[3
]}

Speranza, Maria Grazia ^{[3
]}

Gendreau, Michel ^{[2
,4
]}

Potvin, Jean-Yves ^{[1
,2
]}

机构：

[1] Univ Montreal, Dept Informat & Rech Operat, CP 6128,Succ Ctr Ville, Montreal, PQ H3C 3J7, Canada

[2] Univ Montreal, Ctr Interuniv Rech Reseaux Entreprise Logist & Tr, Montreal, PQ H3C 3J7, Canada

[3] Univ Brescia, Dipartimento Metodi Quantitat, I-25122 Brescia, Italy

[4] Ecole Polytech, Dept Math & Genie Ind, Montreal, PQ H3C 3A7, Canada

来源：

NETWORKS | 2012年 / 60卷 / 04期

基金：

加拿大自然科学与工程研究理事会;

关键词：

traveling salesman; pickup; delivery; loading; multiple stacks; VEHICLE-ROUTING PROBLEM; 2-DIMENSIONAL LOADING CONSTRAINTS; VARIABLE NEIGHBORHOOD SEARCH; TIME WINDOWS; BOUND ALGORITHM; LIFO; FORMULATION; TSP;

D O I：

10.1002/net.21459

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

This article studies the pickup and delivery traveling salesman problem with multiple stacks. The vehicle contains a number of (horizontal) stacks of finite capacity for loading items from the rear of the vehicle. Each stack must satisfy the last-in-first-out constraint that states that any new item must be loaded on top of a stack and any unloaded item must be on top of its stack. A branch-and-cut algorithm is proposed for solving this problem. Computational results are reported on different types of randomly generated instances as well as on classical instances for some well-known special cases of the problem. (c) 2012 Wiley Periodicals, Inc. NETWORKS, Vol. 60(4), 212-226 2012

引用

页码：212 / 226

页数：15

共 50 条

[1] Valid inequalities and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
Pereira, Armando Honorio
Mateus, Geraldo Robson
Urrutia, Sebastian Alberto
[J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2022, 300 (01) : 207 - 220
[2] New formulation and branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
Sampaio, Afonso H.
Urrutia, Sebastian
[J]. INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2017, 24 (1-2) : 77 - 98
[3] A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
Hernández-Pérez, H
Salazar-González, JS
[J]. DISCRETE APPLIED MATHEMATICS, 2004, 145 (01) : 126 - 139
[4] A Branch-and-Cut Algorithm for the Double Traveling Salesman Problem with Multiple Stacks
Martinez, Manuel A. Alba
Cordeau, Jean-Francois
Dell'Amico, Mauro
Iori, Manuel
[J]. INFORMS JOURNAL ON COMPUTING, 2013, 25 (01) : 41 - 55
[5] The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
Dumitrescu, Irina
Ropke, Stefan
Cordeau, Jean-Francois
Laporte, Gilbert
[J]. MATHEMATICAL PROGRAMMING, 2010, 121 (02) : 269 - 305
[6] A Branch-and-Cut Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading
Cordeau, Jean-Francois
Iori, Manuel
Laporte, Gilbert
Salazar Gonzalez, Juan Jose
[J]. NETWORKS, 2010, 55 (01) : 46 - 59
[7] The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
Irina Dumitrescu
Stefan Ropke
Jean-François Cordeau
Gilbert Laporte
[J]. Mathematical Programming, 2010, 121 : 269 - 305
[8] A branch-and-cut algorithm for pickup-and-delivery traveling salesman problem with handling costs
Krishnan, Devaraj Radha
Liu, Tieming
[J]. NETWORKS, 2022, 80 (03) : 297 - 313
[9] Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
Cordeau, Jean-Francois
Dell'Amico, Mauro
Iori, Manuel
[J]. COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (05) : 970 - 980
[10] Polyhedral results and a branch-and-cut algorithm for the double traveling Salesman problem with multiple stacks
Barbato, Michele
Grappe, Roland
Lacroix, Mathieu
Calvo, Roberto Wolfler
[J]. DISCRETE OPTIMIZATION, 2016, 21 : 25 - 41

← 1 2 3 4 5 →