An Exact Approach for Solving Pickup-and-Delivery Traveling Salesman Problems with Neighborhoods

被引:0
|
作者
Gao, Cai [1 ]
Wei, Ningji [2 ]
Walteros, Jose L. [1 ]
机构
[1] Univ Buffalo, Ind & Syst Engn Dept, Buffalo, NY 14260 USA
[2] Texas Tech Univ, Ind Mfg & Syst Engn Dept, Lubbock, TX 79409 USA
关键词
transportation and logistics; UAV routing; mixed-integer nonlinear programing; close-enough traveling salesman problem; generalized Benders decomposition; APPROXIMATION ALGORITHMS; ROUTING PROBLEM; SEARCH; HEURISTICS; NETWORK; SCHEME; CUT;
D O I
10.1287/trsc.2022.0138
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
This paper studies a variant of the traveling salesman problem, called the pickup-and-delivery traveling salesman problem with neighborhoods, that combines traditional pickup and delivery requirements with the flexibility of visiting the customers at locations within compact neighborhoods of arbitrary shape. We derive two optimality conditions for the problem, a local condition that verifies whether a given tour is locally optimal at the visiting points and a global condition that can be used to cut off suboptimal regions of the neighborhoods. We model the problem as a mixed-integer nonlinear program and propose a generalized Benders decomposition to solve instances of the problem with convex and nonconvex neighborhoods. Finally, we conduct extensive computational experiments to demonstrate the efficacy of our solution framework.
引用
收藏
页码:1560 / 1580
页数:22
相关论文
共 50 条
  • [1] Exponential-Size Neighborhoods for the Pickup-and-Delivery Traveling Salesman Problem
    Pacheco, Toni
    Martinelli, Rafael
    Subramanian, Anand
    Toffolo, Tulio A. M.
    Vidal, Thibaut
    [J]. TRANSPORTATION SCIENCE, 2022, 57 (02) : 463 - 481
  • [2] The Multi-commodity Pickup-and-Delivery Traveling Salesman Problem
    Hernandez-Perez, Hipolito
    Salazar-Gonzalez, Juan-Jose
    [J]. NETWORKS, 2014, 63 (01) : 46 - 59
  • [3] A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem
    Hernandez-Perez, Hipolito
    Rodriguez-Martin, Inmaculada
    Salazar-Gonzalez, Juan-Jose
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 251 (01) : 44 - 52
  • [4] Heuristics for the one-commodity pickup-and-delivery traveling salesman problem
    Hernández-Pérez, H
    Salazar-González, JJ
    [J]. TRANSPORTATION SCIENCE, 2004, 38 (02) : 245 - 255
  • [5] On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands
    François Louveaux
    Juan-José Salazar-González
    [J]. Mathematical Programming, 2009, 119 : 169 - 194
  • [6] Decision diagrams for solving traveling salesman problems with pickup and delivery in real time
    O'Neil, Ryan J.
    Hoffman, Karla
    [J]. OPERATIONS RESEARCH LETTERS, 2019, 47 (03) : 197 - 201
  • [7] On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands
    Louveaux, Francois
    Salazar-Gonzalez, Juan-Jose
    [J]. MATHEMATICAL PROGRAMMING, 2009, 119 (01) : 169 - 194
  • [8] The one-commodity pickup-and-delivery traveling salesman problem:: Inequalities and algorithms
    Hernandez-Perez, Hipolito
    Salazar-Gonzalez, Juan-Jose
    [J]. NETWORKS, 2007, 50 (04) : 258 - 272
  • [9] Genetic algorithm for the one-commodity pickup-and-delivery traveling salesman problem
    Zhao, Fanggeng
    Li, Sujian
    Sun, Jiangsheng
    Mei, Dong
    [J]. COMPUTERS & INDUSTRIAL ENGINEERING, 2009, 56 (04) : 1642 - 1648
  • [10] The Discrete Bacterial Memetic Evolutionary Algorithm for Solving the One-Commodity Pickup-and-Delivery Traveling Salesman Problem
    Tuu-Szabo, Boldizsar
    Foldesi, Peter
    Koczy, Laszlo T.
    [J]. COMPUTATIONAL INTELLIGENCE AND MATHEMATICS FOR TACKLING COMPLEX PROBLEMS, 2020, 819 : 15 - 22