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
关键词
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 条
  • [21] Graph Transformation Method for Time Dependent Rural Postman Problem with Time Windows
    Tan, Guozhen
    Sun, Jinghao
    Meng, Xianchao
    INFORMATION-AN INTERNATIONAL INTERDISCIPLINARY JOURNAL, 2012, 15 (12A): : 5279 - 5286
  • [22] Variable neighborhood search algorithm for heterogeneous traveling repairmen problem with time windows
    Bjelic, Nenad
    Vidovic, Milorad
    Popovic, Drazen
    EXPERT SYSTEMS WITH APPLICATIONS, 2013, 40 (15) : 5997 - 6006
  • [23] A Multiobjective Large Neighborhood Search Metaheuristic for the Vehicle Routing Problem with Time Windows
    Konstantakopoulos, Grigorios D.
    Gayialis, Sotiris P.
    Kechagias, Evripidis P.
    Papadopoulos, Georgios A.
    Tatsiopoulos, Ilias P.
    ALGORITHMS, 2020, 13 (10)
  • [24] An Adaptive Large Neighborhood Search for the Larger-Scale Instances of Green Vehicle Routing Problem with Time Windows
    Yu, Zixuan
    Zhang, Ping
    Yu, Yang
    Sun, Wei
    Huang, Min
    COMPLEXITY, 2020, 2020
  • [25] An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem
    Aksen, Deniz
    Kaya, Onur
    Salman, F. Sibel
    Tuncel, Ozge
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2014, 239 (02) : 413 - 426
  • [26] An Adaptive Large Neighborhood Search Algorithm for the Satellite Data Transmission Scheduling Problem
    Chen, Yingguo
    Chen, Ming
    Wen, Jun
    Chen, Yingwu
    Xiang, Wen
    INTERNATIONAL JOURNAL OF AEROSPACE ENGINEERING, 2020, 2020
  • [27] An adaptive large neighborhood search for the larger-scale multi depot green vehicle routing problem with time windows
    Wen, Muyang
    Sun, Wei
    Yu, Yang
    Tang, Jiafu
    Ikou, Kaku
    JOURNAL OF CLEANER PRODUCTION, 2022, 374
  • [28] A Large Neighborhood Search for the Pickup and Delivery Problem with Time Windows, Split Loads and Transshipments
    Wolfinger, David
    COMPUTERS & OPERATIONS RESEARCH, 2021, 126
  • [29] A hybrid heuristic procedure for the Windy Rural Postman Problem with Zigzag Time Windows
    Lum, Oliver
    Zhang, Rui
    Golden, Bruce
    Wasil, Edward
    COMPUTERS & OPERATIONS RESEARCH, 2017, 88 : 247 - 257
  • [30] A hybrid adaptive large neighborhood search and tabu search algorithm for the electric vehicle relocation problem
    Cai, Lei
    Wang, Xin
    Luo, Zhixing
    Liang, Yijing
    COMPUTERS & INDUSTRIAL ENGINEERING, 2022, 167