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 条
  • [21] A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
    Hernández-Pérez, H
    Salazar-González, JS
    DISCRETE APPLIED MATHEMATICS, 2004, 145 (01) : 126 - 139
  • [22] Formulations and algorithms for the Pickup and Delivery Traveling Salesman Problem with Multiple Stacks
    Pereira, Armando H.
    Urrutia, Sebastian
    COMPUTERS & OPERATIONS RESEARCH, 2018, 93 : 1 - 14
  • [23] The traveling salesman problem with pickup, delivery, and ride-time constraints
    Bartolini, Enrico
    Bodin, Lawrence
    Mingozzi, Aristide
    NETWORKS, 2016, 67 (02) : 95 - 110
  • [24] An Algorithm for the One Commodity Pickup and Delivery Traveling Salesman Problem with Restricted Depot
    Han, Lanshan
    Luong, Binh T.
    Ukkusuri, Satish
    NETWORKS & SPATIAL ECONOMICS, 2016, 16 (03): : 743 - 768
  • [25] An Iterated Local Search for the Traveling Salesman Problem with Pickup, Delivery and Handling Costs
    Rey, Carlos
    Toth, Paolo
    Vigo, Daniele
    2020 39TH INTERNATIONAL CONFERENCE OF THE CHILEAN COMPUTER SCIENCE SOCIETY (SCCC), 2020,
  • [26] Heuristics for the one-commodity pickup-and-delivery traveling salesman problem
    Hernández-Pérez, H
    Salazar-González, JJ
    TRANSPORTATION SCIENCE, 2004, 38 (02) : 245 - 255
  • [27] Large neighborhood search for the pickup and delivery traveling salesman problem with multiple stacks
    Cote, Jean-Francois
    Gendreau, Michel
    Potvin, Jean-Yves
    NETWORKS, 2012, 60 (01) : 19 - 30
  • [28] Exponential-Size Neighborhoods for the Pickup-and-Delivery Traveling Salesman Problem
    Pacheco, Toni
    Martinelli, Rafael
    Subramanian, Anand
    Toffolo, Tulio A. M.
    Vidal, Thibaut
    TRANSPORTATION SCIENCE, 2022, 57 (02) : 463 - 481
  • [29] An Algorithm for the One Commodity Pickup and Delivery Traveling Salesman Problem with Restricted Depot
    Lanshan Han
    Binh T. Luong
    Satish Ukkusuri
    Networks and Spatial Economics, 2016, 16 : 743 - 768
  • [30] The curse of the first-in-first-out queue discipline
    Platz, Trine Tornoe
    Osterdal, Lars Peter
    GAMES AND ECONOMIC BEHAVIOR, 2017, 104 : 165 - 176
12345