The rescheduling arc routing problem

被引：17
作者：
Monroy-Licht, Marcela [1 ,2 ]
Alberto Amaya, Ciro [3 ]
Langevin, Andre [1 ,2 ]
Rousseau, Louis-Martin [1 ,2 ]
机构：
[1] Ecole Polytech Montreal, Dept Mathemat & Genie Ind, Montreal, PQ, Canada
[2] CIRRELT, Montreal, PQ, Canada
[3] Univ Los Andes, Dept Ingn Ind, Bogota, Colombia
来源：
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH | 2017年 / 24卷 / 06期
关键词：
rescheduling; disruption schedule costs; mixed-integer programming; arc routing problem; VEHICLE; CONSTRAINTS; ALGORITHMS;
D O I：
10.1111/itor.12346
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper, the rescheduling arc routing problem is introduced. This is a dynamic routing and scheduling problem that considers adjustments to an initial routing itinerary when one or more vehicle failures occur during the execution stage and the original plan must be modified. We minimize the operational and schedule disruption costs. Formulations based on mixed-integer programming are presented to compare different policies in the rerouting phase. A solution strategy is developed when both costs are evaluated and it is necessary to find a solution quickly. Computational tests on a large set of instances compare the different decision-maker policies.
引用
收藏
页码：1325 / 1346
页数：22
相关论文
共 50 条
  • [31] Modeling and solving the non-smooth arc routing problem with realistic soft constraints
    de Armas, Jesica
    Ferrer, Albert
    Juan, Angel A.
    Lalla-Ruiz, Eduardo
    EXPERT SYSTEMS WITH APPLICATIONS, 2018, 98 : 205 - 220
  • [32] A MATHEMATICAL MODEL FOR THE CAPACITATED LOCATION-ARC ROUTING PROBLEM WITH DEADLINES AND HETEROGENEOUS FLEET
    Mirzaei-Khafri, Soheila
    Bashiri, Mahdi
    Soltani, Roya
    Khalilzadeh, Mohammad
    TRANSPORT, 2019, 34 (06) : 692 - 707
  • [33] A two ant colony approaches for the multi-depot capacitated arc routing problem
    Kansou, Ali
    Yassine, Adnan
    CIE: 2009 INTERNATIONAL CONFERENCE ON COMPUTERS AND INDUSTRIAL ENGINEERING, VOLS 1-3, 2009, : 1040 - 1045
  • [34] An adaptive large neighborhood search method for the drone-truck arc routing problem
    Liu, Xufei
    Chung, Sung Hoon
    Kwon, Changhyun
    COMPUTERS & OPERATIONS RESEARCH, 2025, 176
  • [35] Adaptive Large Neighborhood Search for the Periodic Capacitated Arc Routing Problem with Inventory Constraints
    Riquelme-Rodriguez, Juan-Pablo
    Langevin, Andre
    Gamache, Michel
    NETWORKS, 2014, 64 (02) : 125 - 139
  • [36] An improved ant colony optimization for the multi-trip Capacitated Arc Routing Problem
    Tirkolaee, Erfan Babaee
    Alinaghian, Mehdi
    Hosseinabadi, Ali Asghar Rahmani
    Sasi, Mani Bakhshi
    Sangaiah, Arun Kumar
    COMPUTERS & ELECTRICAL ENGINEERING, 2019, 77 : 457 - 470
  • [37] An Improved Genetic Programming Hyper-Heuristic for the Uncertain Capacitated Arc Routing Problem
    MacLachlan, Jordan
    Mei, Yi
    Branke, Juergen
    Zhang, Mengjie
    AI 2018: ADVANCES IN ARTIFICIAL INTELLIGENCE, 2018, 11320 : 432 - 444
  • [38] An efficiency-based path-scanning heuristic for the capacitated arc routing problem
    Arakaki, Rafael Kendy
    Usberti, Fabio Luiz
    COMPUTERS & OPERATIONS RESEARCH, 2019, 103 : 288 - 295
  • [39] A multi-level rescheduling approach for a dynamic remote operations scheduling problem
    Castelletti, Annalisa
    Moreschini, Lorenzo
    Corvaglia, Marzia
    Mansini, Renata
    INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2024,
  • [40] A Routing Problem in Global Production Planning
    Huang, Qian
    Weng, Jiahua
    Ohmori, Shunichi
    Yoshimoto, Kazuho
    INDUSTRIAL ENGINEERING AND MANAGEMENT SYSTEMS, 2020, 19 (02): : 335 - 346
12345