An Iterated Local Search for the Traveling Salesman Problem with Pickup, Delivery and Handling Costs

被引：0
|
作者：
Rey, Carlos [1 ]
Toth, Paolo [1 ]
Vigo, Daniele [1 ,2 ]
机构：
[1] Univ Bologna, Dept Elect Elect & Informat Engn G Marconi DEI, Bologna, Italy
[2] Univ Bologna, CIRI ICT, Bologna, Italy
来源：
2020 39TH INTERNATIONAL CONFERENCE OF THE CHILEAN COMPUTER SCIENCE SOCIETY (SCCC) | 2020年
关键词：
Traveling Salesman Problem; Combinatorial Optimization; Iterated Local Search; Handling Cost;
D O I：
暂无
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
In this paper the Traveling Salesman Problem with pickup, delivery and handling costs is studied. We have to find a route from a depot to a set of customers, each of which requires a pickup and delivery service. The goal is to minimize the global routing and handling cost. We have developed an Iterated Local Search for this problem combining different heuristics of the Traveling Salesman Problem, and using frequency of improvements and a perturbation with memory. The proposed algorithm is tested on different benchmark instances from the literature with up to 200 vertices, obtaining high quality solutions in reasonable computing times.
引用
收藏
页数：8
相关论文
共 50 条
  • [1] 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
  • [2] 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
  • [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] Distributed Scheduling Combined with Traveling Salesman Problem: An Iterated Local Search
    Li, Peng
    Yang, Yixin
    Li, Zhengyang
    Duan, Wenzhe
    Li, Xiaoya
    Liu, Bo
    2017 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC), 2017, : 1948 - 1953
  • [6] 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
  • [7] 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
  • [8] Iterated local search approach using genetic transformation to the traveling salesman problem
    Katayama, K
    Narihisa, H
    GECCO-99: PROCEEDINGS OF THE GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 1999, : 321 - 328
  • [9] New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem
    Schmidt, Jeanette
    Irnich, Stefan
    EURO JOURNAL ON COMPUTATIONAL OPTIMIZATION, 2022, 10
  • [10] Perturbation heuristics for the pickup and delivery traveling salesman problem
    Renaud, J
    Boctor, FF
    Laporte, G
    COMPUTERS & OPERATIONS RESEARCH, 2002, 29 (09) : 1129 - 1141
12345