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 条
  • [31] Effective neighborhood search with optimal splitting and adaptive memory for the team orienteering problem with time windows
    Amarouche, Youcef
    Guibadj, Rym Nesrine
    Chaalal, Elhadja
    Moukrim, Aziz
    COMPUTERS & OPERATIONS RESEARCH, 2020, 123
  • [32] Large neighbourhood search with adaptive guided ejection search for the pickup and delivery problem with time windows
    Curtois, Timothy
    Landa-Silva, Dario
    Qu, Yi
    Laesanklang, Wasakorn
    EURO JOURNAL ON TRANSPORTATION AND LOGISTICS, 2018, 7 (02) : 151 - 192
  • [33] Adaptive large neighborhood search algorithm for the Unmanned aerial vehicle routing problem with recharging
    Shi, Jianmai
    Mao, Huiting
    Zhou, Zhongbao
    Zheng, Long
    APPLIED SOFT COMPUTING, 2023, 147
  • [34] Solving open vehicle routing problem with time windows based on variable neighborhood search algorithm
    Chen, Jiumei
    Li, Yingjuan
    Hu, Ting
    Dan, Bin
    Li, Jun
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2021, 27 (10): : 3014 - 3025
  • [35] Solving the Vehicle Routing Problem with Time Windows Using Modified Rat Swarm Optimization Algorithm Based on Large Neighborhood Search
    Wei, Xiaoxu
    Xiao, Zhouru
    Wang, Yongsheng
    MATHEMATICS, 2024, 12 (11)
  • [36] A HEURISTIC ALGORITHM FOR THE DRONE RURAL POSTMAN PROBLEM
    Xie, Ailing
    Miyagawa, Keigo
    Wu, Wei
    Yagiura, Mutsunori
    JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION, 2024, 20 (05) : 1951 - 1966
  • [37] AN ALGORITHM FOR THE RURAL POSTMAN PROBLEM ON A DIRECTED GRAPH
    CHRISTOFIDES, N
    CAMPOS, V
    CORBERAN, A
    MOTA, E
    MATHEMATICAL PROGRAMMING STUDY, 1986, 26 : 155 - 166
  • [38] A hybrid adaptive large neighborhood search algorithm for the large-scale heterogeneous container loading problem
    Li, Ying
    Chen, Mingzhou
    Huo, Jiazhen
    EXPERT SYSTEMS WITH APPLICATIONS, 2022, 189
  • [39] An Adaptive Large Neighborhood Search Heuristic for the Electric Vehicle Routing Problems with Time Windows and Recharging Strategies
    Duan, Ya-ru
    Hu, Yong-shi
    Wu, Peng
    JOURNAL OF ADVANCED TRANSPORTATION, 2023, 2023
  • [40] Adapted large neighborhood search algorithm with optimized golden ratio spiral initial solution for capacitated vehicle routing problem with time windows
    Celikdin, Alperen Ekrem
    JOURNAL OF THE FACULTY OF ENGINEERING AND ARCHITECTURE OF GAZI UNIVERSITY, 2024, 39 (02): : 797 - 810
12345