Adaptive large neighborhood search algorithm for the rural postman problem with time windows

被引：11
|
作者：
Monroy-Licht, Marcela [1 ,2 ]
Alberto Amaya, Ciro [3 ,4 ]
Langevin, Andre [1 ,2 ]
机构：
[1] Polytech Montreal, Dept Math & Genie Ind, Montreal, PQ, Canada
[2] CIRRELT, Montreal, PQ, Canada
[3] Univ Los Andes, Dept Ingn Ind, Bogota, Colombia
[4] Grp Invest Prod & Logist PYLO, Bogota, Colombia
来源：
NETWORKS | 2017年 / 70卷 / 01期
关键词：
rural postman problem; time windows; adaptive large neighborhood search; metaheuristics; WINTER ROAD MAINTENANCE; DEPENDENT PROCESSING TIMES; ARC ROUTING-PROBLEMS; SYNCHRONIZED ARC; SYSTEM-DESIGN; MODELS;
D O I：
10.1002/net.21747
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
The rural postman problem with time windows is the problem of serving some required edges with one vehicle; the vehicle must visit these edges during established time windows. This article presents a competitive adaptive large neighborhood search algorithm to solve the problem. Computational experiments are performed on a large set of instances with up to 104 required edges. The results show that this approach is efficient, significantly reducing the computational time on large instances and achieving good solutions: the algorithm is able to solve to optimality 224 of 232 instances. (c) 2017 Wiley Periodicals, Inc. NETWORKS, Vol. 70(1), 44-59 2017
引用
收藏
页码：44 / 59
页数：16
相关论文
共 50 条
  • [1] AN ADAPTIVE LARGE NEIGHBORHOOD SEARCH ALGORITHM FOR VEHICLE ROUTING PROBLEM WITH MULTIPLE TIME WINDOWS CONSTRAINTS
    Feng, Bin
    Wei, Lixin
    Hu, Ziyu
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2023, 19 (01) : 573 - 593
  • [2] The Rural Postman Problem with Time Windows
    Monroy-Licht, Marcela
    Alberto Amaya, Ciro
    Langevin, Andre
    NETWORKS, 2014, 64 (03) : 169 - 180
  • [3] An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows
    Ropke, Stefan
    Pisinger, David
    TRANSPORTATION SCIENCE, 2006, 40 (04) : 455 - 472
  • [4] Multigraph modeling and adaptive large neighborhood search for the vehicle routing problem with time windows
    Ben Ticha, Hamza
    Absi, Nabil
    Feillet, Dominique
    Quilliot, Alain
    COMPUTERS & OPERATIONS RESEARCH, 2019, 104 : 113 - 126
  • [5] An Adaptive Large Neighborhood Search for the Reverse Open Vehicle Routing Problem with Time Windows
    Schopka, Kristian
    Kopfer, Herbert
    LOGISTICS MANAGEMENT, 2016, : 243 - 257
  • [6] Adaptive large neighborhood search for the time-dependent profitable pickup and delivery problem with time windows
    Sun, Peng
    Veelenturf, Lucas P.
    Hewitt, Mike
    Van Woensel, Tom
    TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW, 2020, 138
  • [7] An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and synchronized visits
    Liu, Ran
    Tao, Yangyi
    Xie, Xiaolei
    COMPUTERS & OPERATIONS RESEARCH, 2019, 101 : 250 - 262
  • [8] An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots
    Chen, Cheng
    Demir, Emrah
    Huang, Yuan
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 294 (03) : 1164 - 1180
  • [9] An adaptive large neighborhood search heuristic for the Pickup and Delivery Problem with Time Windows and Scheduled Lines
    Ghilas, Veaceslav
    Demir, Emrah
    Van Woensel, Tom
    COMPUTERS & OPERATIONS RESEARCH, 2016, 72 : 12 - 30
  • [10] Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests
    Li, Yuan
    Chen, Haoxun
    Prins, Christian
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 252 (01) : 27 - 38
12345