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
关键词
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 条
[41]   Solving the time capacitated arc routing problem under fuzzy and stochastic travel and service times [J].
Martin, Xabier A. ;
Panadero, Javier ;
Peidro, David ;
Perez-Bernabeu, Elena ;
Juan, Angel A. A. .
NETWORKS, 2023, 82 (04) :318-335
[42]   Branch-Price-and-Cut for the Soft-Clustered Capacitated Arc-Routing Problem [J].
Hintsch, Timo ;
Irnich, Stefan ;
Kiilerich, Lone .
TRANSPORTATION SCIENCE, 2021, 55 (03) :687-705
[43]   Ant colony optimization for the arc routing problem with intermediate facilities under capacity and length restrictions [J].
Ghiani, Gianpaolo ;
Lagana, Demetrio ;
Laporte, Gilbert ;
Mari, Francesco .
JOURNAL OF HEURISTICS, 2010, 16 (02) :211-233
[44]   Match-up approaches to a dynamic rescheduling problem [J].
Moratori, Patrick ;
Petrovic, Sanja ;
Vazquez-Rodriguez, Jose Antonio .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2012, 50 (01) :261-276
[45]   Transgenic Algorithm Applied to the Job Shop Rescheduling Problem [J].
Beltran-Bernal, Nestor Andres ;
Rodriguez-Molano, Jose Ignacio ;
Mendoza-Patino, Diego Ernesto .
INGENIERIA, 2024, 29 (01)
[46]   Decision support system for the operating room rescheduling problem [J].
van Essen, J. Theresia ;
Hurink, Johann L. ;
Hartholt, Woutske ;
van den Akker, Bernd J. .
HEALTH CARE MANAGEMENT SCIENCE, 2012, 15 (04) :355-372
[47]   Decision support system for the operating room rescheduling problem [J].
J. Theresia van Essen ;
Johann L. Hurink ;
Woutske Hartholt ;
Bernd J. van den Akker .
Health Care Management Science, 2012, 15 :355-372
[48]   Arc Routing with Time-Dependent Travel Times and Paths [J].
Vidal, Thibaut ;
Martinelli, Rafael ;
Tuan Anh Pham ;
Minh Hoang Ha .
TRANSPORTATION SCIENCE, 2021, 55 (03) :706-724
[49]   A Decision System for Routing Problems and Rescheduling Issues Using Unmanned Aerial Vehicles [J].
Lin, I-Ching ;
Lin, Tsan-Hwan ;
Chang, Sheng-Hung .
APPLIED SCIENCES-BASEL, 2022, 12 (12)
[50]   Real-time rescheduling metaheuristic algorithms applied to FMS with routing flexibility [J].
Souier, Mehdi ;
Sari, Zaki ;
Hassam, Ahmed .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2013, 64 (1-4) :145-164