The pickup and delivery traveling salesman problem with first-in-first-out loading

被引：32
|
作者：
Erdogan, Guenes [1 ,2 ,3 ]
Cordeau, Jean-Francois [2 ,3 ]
Laporte, Gilbert [1 ,2 ]
机构：
[1] HEC Montreal, Canada Res Chair Distribut Management, 3000 Chem Cote St Catherine, Montreal, PQ H3T 2A7, Canada
[2] HEC Montreal, CIRRELT, Montreal, PQ H3T 2A7, Canada
[3] HEC Montreal, Canada Res Chair Logist & Transportat, Montreal, PQ H3T 2A7, Canada
来源：
COMPUTERS & OPERATIONS RESEARCH | 2009年 / 36卷 / 06期
基金：
加拿大自然科学与工程研究理事会;
关键词：
Traveling salesman problem; Pickup and delivery; First-in-first-out; Integer programming; Tabu search; Iterated local search; HEURISTICS; ALGORITHM; SEARCH; LIFO;
D O I：
10.1016/j.cor.2008.05.005
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
This paper addresses a variation of the traveling salesman problem with pickup and delivery in which loading and unloading operations have to be executed in a first-in-first-out fashion. It provides an integer programming formulation of the problem. It also describes five operators for improving a feasible solution, and two heuristics that utilize these operators: a probabilistic tabu search algorithm, and an iterated local search algorithm. The heuristics are evaluated on data adapted from TSPLIB instances. (C) 2008 Elsevier Ltd. All rights reserved.
引用
收藏
页码：1800 / 1808
页数：9
相关论文
共 50 条
  • [1] Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints
    Cheang, Brenda
    Gao, Xiang
    Lim, Andrew
    Qin, Hu
    Zhu, Wenbin
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 223 (01) : 60 - 75
  • [2] The tree representation for the pickup and delivery traveling salesman problem with LIFO loading
    Li, Yongquan
    Lim, Andrew
    Oon, Wee-Chong
    Qin, Hu
    Tu, Dejian
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 212 (03) : 482 - 496
  • [3] A heuristic for the pickup and delivery traveling salesman problem
    Renaud, J
    Boctor, FF
    Ouenniche, J
    COMPUTERS & OPERATIONS RESEARCH, 2000, 27 (09) : 905 - 916
  • [4] Heuristics for the traveling salesman problem with pickup and delivery
    Gendreau, M
    Laporte, G
    Vigo, D
    COMPUTERS & OPERATIONS RESEARCH, 1999, 26 (07) : 699 - 714
  • [5] Variable neighborhood search for the pickup and delivery traveling salesman problem with LIFO loading
    Carrabs, Francesco
    Cordeau, Jean-Francois
    Laporte, Gilbert
    INFORMS JOURNAL ON COMPUTING, 2007, 19 (04) : 618 - 632
  • [6] Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
    Cordeau, Jean-Francois
    Dell'Amico, Mauro
    Iori, Manuel
    COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (05) : 970 - 980
  • [7] The double traveling salesman problem with partial last-in-first-out loading constraints
    Chagas, Jonatas B. C.
    Toffolo, Tulio A. M.
    Souza, Marcone J. F.
    Iori, Manuel
    INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2022, 29 (04) : 2346 - 2373
  • [8] Perturbation heuristics for the pickup and delivery traveling salesman problem
    Renaud, J
    Boctor, FF
    Laporte, G
    COMPUTERS & OPERATIONS RESEARCH, 2002, 29 (09) : 1129 - 1141
  • [9] AN ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM WITH PICKUP AND DELIVERY CUSTOMERS
    KALANTARI, B
    HILL, AV
    ARORA, SR
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1985, 22 (03) : 377 - 386
  • [10] The pickup and delivery traveling salesman problem with handling costs
    Veenstra, Marjolein
    Roodbergen, Kees Jan
    Vis, Iris F. A.
    Coelho, Leandro C.
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2017, 257 (01) : 118 - 132
12345