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 条
  • [31] Dynamic user equilibrium problem with link capacity and first-in-first-out Constraints
    Chen, HK
    Lui, SH
    Chang, CW
    IEEE 5TH INTERNATIONAL CONFERENCE ON INTELLIGENT TRANSPORTATION SYSTEMS, PROCEEDINGS, 2002, : 466 - 471
  • [32] Knowledge-guided two-stage memetic search for the pickup and delivery traveling salesman problem with FIFO loading
    Zhu, Yiyao
    Chen, Yongquan
    Fu, Zhang-Hua
    KNOWLEDGE-BASED SYSTEMS, 2022, 242
  • [33] On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands
    Louveaux, Francois
    Salazar-Gonzalez, Juan-Jose
    MATHEMATICAL PROGRAMMING, 2009, 119 (01) : 169 - 194
  • [34] The one-commodity pickup-and-delivery traveling salesman problem:: Inequalities and algorithms
    Hernandez-Perez, Hipolito
    Salazar-Gonzalez, Juan-Jose
    NETWORKS, 2007, 50 (04) : 258 - 272
  • [35] Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem
    Zhao, Fanggeng
    Li, Sujian
    Sun, Jiangsheng
    Mei, Dong
    COMPUTERS & INDUSTRIAL ENGINEERING, 2009, 56 (04) : 1642 - 1648
  • [36] A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks
    Cote, Jean-Francois
    Archetti, Claudia
    Speranza, Maria Grazia
    Gendreau, Michel
    Potvin, Jean-Yves
    NETWORKS, 2012, 60 (04) : 212 - 226
  • [37] 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
    Mathematical Programming, 2010, 121 : 269 - 305
  • [38] On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands
    François Louveaux
    Juan-José Salazar-González
    Mathematical Programming, 2009, 119 : 169 - 194
  • [39] Creating lasso-solutions for the traveling salesman problem with pickup and delivery by Tabu search
    Hoff A.
    Løkketangen A.
    Central European Journal of Operations Research, 2006, 14 (2) : 125 - 140
  • [40] 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
    MATHEMATICAL PROGRAMMING, 2010, 121 (02) : 269 - 305
12345