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 条
  • [41] Branch-Price-and-Cut Algorithms for the Pickup and Delivery Problem with Time Windows and Last-in-First-Out Loading
    Cherkesly, Marilene
    Desaulniers, Guy
    Laporte, Gilbert
    TRANSPORTATION SCIENCE, 2015, 49 (04) : 752 - 766
  • [42] THE TRAVELING SALESMAN PROBLEM WITH DELIVERY AND BACKHAULS
    ANILY, S
    MOSHEIOV, G
    OPERATIONS RESEARCH LETTERS, 1994, 16 (01) : 11 - 18
  • [43] A branch-and-cut algorithm for pickup-and-delivery traveling salesman problem with handling costs
    Krishnan, Devaraj Radha
    Liu, Tieming
    NETWORKS, 2022, 80 (03) : 297 - 313
  • [44] A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem
    Hernandez-Perez, Hipolito
    Rodriguez-Martin, Inmaculada
    Salazar-Gonzalez, Juan-Jose
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 251 (01) : 44 - 52
  • [45] The One-Commodity Traveling Salesman Problem with Selective Pickup and Delivery: an Ant Colony Approach
    Falcon, Rafael
    Li, Xu
    Nayak, Amiya
    Stojmenovic, Ivan
    2010 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2010,
  • [46] The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
    Hernandez-Perez, Hipolito
    Salazar-Gonzalez, Juan-Jose
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2009, 196 (03) : 987 - 995
  • [47] A Genetic Algorithm for the Traveling Salesman Problem with Pickup and Delivery Using Depot Removal and Insertion Moves
    Cinar, Volkan
    Oncan, Temel
    Sural, Haldun
    APPLICATIONS OF EVOLUTIONARY COMPUTATION, PT II, PROCEEDINGS, 2010, 6025 : 431 - +
  • [48] Implementing first-in-first-out in the cell transmission model for networks
    Carey, Malachy
    Bar-Gera, Hillel
    Watling, David
    Balijepalli, Chandra
    TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2014, 65 : 105 - 118
  • [49] The probabilistic pickup-and-delivery travelling salesman problem
    Benavent, Enrique
    Landete, Mercedes
    Jose Salazar-Gonzalez, Juan
    Tirado, Gregorio
    EXPERT SYSTEMS WITH APPLICATIONS, 2019, 121 : 313 - 323
  • [50] Impact of a First-In-First-Out Rule on the Merge of a Metro Line with a Junction
    Farrando, Rodolphe
    Farhi, Nadir
    Christoforou, Zoi
    Urban, Alain
    TRANSPORTATION RESEARCH RECORD, 2024, 2678 (02) : 223 - 234
12345