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 条
  • [21] A hybrid genetic algorithm for the traveling salesman problem with pickup and delivery
    Zhao F.-G.
    Sun J.-S.
    Li S.-J.
    Liu W.-M.
    International Journal of Automation and Computing, 2009, 6 (1) : 97 - 102
  • [22] A Hybrid Genetic Algorithm for the Traveling Salesman Problem with Pickup and Delivery
    Fang-Geng Zhao1
    International Journal of Automation & Computing, 2009, 6 (01) : 97 - 102
  • [23] Multi-restart iterative search for the pickup and delivery traveling salesman problem with FIFO loading
    Lu, Yongliang
    Benlic, Una
    Wu, Qinghua
    COMPUTERS & OPERATIONS RESEARCH, 2018, 97 : 18 - 30
  • [24] Improving local search for the traveling salesman problem
    Misevicius, Alfonsas
    Ostreika, Armantas
    Simaitis, Antanas
    Zilevicius, Vilius
    INFORMATION TECHNOLOGY AND CONTROL, 2007, 36 (02): : 187 - 195
  • [25] LOCAL SEARCH FOR THE ASYMMETRIC TRAVELING SALESMAN PROBLEM
    KANELLAKIS, PC
    PAPADIMITRIOU, CH
    OPERATIONS RESEARCH, 1980, 28 (05) : 1086 - 1099
  • [26] A Multi-Start Iterated Local Search Algorithm for the Maximum Scatter Traveling Salesman Problem
    Venkatesh, Pandiri
    Singh, Alok
    Mallipeddi, Rammohan
    2019 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2019, : 1390 - 1397
  • [27] A Multi-objective Iterated Local Search Approach to Solve the Insular Traveling Salesman Problem
    Rodriguez-Zbinden, Sebastian
    Montero, Elizabeth
    Blazquez, Carola
    Miranda, Pablo
    2021 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC 2021), 2021, : 2339 - 2346
  • [28] Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs
    Erdogan, Gunes
    Battarra, Maria
    Laporte, Gilbert
    Vigo, Daniele
    COMPUTERS & OPERATIONS RESEARCH, 2012, 39 (05) : 1074 - 1086
  • [29] The Multi-commodity Pickup-and-Delivery Traveling Salesman Problem
    Hernandez-Perez, Hipolito
    Salazar-Gonzalez, Juan-Jose
    NETWORKS, 2014, 63 (01) : 46 - 59
  • [30] 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
12345