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 条
  • [41] Adaptive large neighborhood search algorithm for multi-stage weapon target assignment problem
    Chang, Xuening
    Shi, Jianmai
    Luo, Zhihao
    Liu, Yao
    COMPUTERS & INDUSTRIAL ENGINEERING, 2023, 181
  • [42] An Improved Adaptive Large Neighborhood Search Algorithm for the Heterogeneous Fixed Fleet Vehicle Routing Problem
    Wu, Yan
    Yang, Wang
    He, Guochao
    Zhao, Shennan
    PROCEEDINGS OF 2017 8TH IEEE INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND SERVICE SCIENCE (ICSESS 2017), 2017, : 657 - 663
  • [43] Asynchronous Adaptive Large Neighborhood Search Algorithm for Dynamic Matching Problem in Ride Hailing Services
    Syed, Arslan Ali
    Kaltenhaeuser, Bernd
    Gaponova, Irina
    Bogenberger, Klaus
    2019 IEEE INTELLIGENT TRANSPORTATION SYSTEMS CONFERENCE (ITSC), 2019, : 3006 - 3012
  • [44] Vehicle Routing Problem with Reverse Cross-Docking: An Adaptive Large Neighborhood Search Algorithm
    Gunawan, Aldy
    Widjaja, Audrey Tedja
    Vansteenwegen, Pieter
    Yu, Vincent F.
    COMPUTATIONAL LOGISTICS, ICCL 2020, 2020, 12433 : 167 - 182
  • [45] A Multistage Very Large-Scale Neighborhood Search for the Vehicle Routing Problem with Soft Time Windows
    Mouthuy, Sebastien
    Massen, Florence
    Deville, Yves
    Van Hentenryck, Pascal
    TRANSPORTATION SCIENCE, 2015, 49 (02) : 223 - 238
  • [46] Efficient Consideration of Soft Time Windows in a Large Neighborhood Search for the Districting and Routing Problem for Security Control
    Kim, Bong-Min
    Kloimuellner, Christian
    Raidl, Guenther R.
    EVOLUTIONARY COMPUTATION IN COMBINATORIAL OPTIMIZATION (EVOCOP 2017), 2017, 10197 : 91 - 107
  • [47] Effective adaptive large neighborhood search for a firefighters timetabling problem
    Ouberkouk, Mohamed-Amine
    Boufflet, Jean-Paul
    Moukrim, Aziz
    JOURNAL OF HEURISTICS, 2023, 29 (4-6) : 545 - 580
  • [48] Learning Variable Neighborhood Search for a scheduling problem with time windows and rejections
    Thevenin, Simon
    Zufferey, Nicolas
    DISCRETE APPLIED MATHEMATICS, 2019, 261 : 344 - 353
  • [49] An Adaptive Large Neighborhood Search for the Periodic Vehicle Routing Problem
    Zajac, Sandra
    COMPUTATIONAL LOGISTICS, ICCL 2017, 2017, 10572 : 34 - 48
  • [50] An Adaptive Large Neighborhood Search Heuristic for Dynamic Ridesharing Problem
    Hua, Shijia
    Qi, Mingyao
    2019 IEEE 6TH INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND APPLICATIONS (ICIEA), 2019, : 888 - 892
12345