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] NEW LOWER BOUNDS FOR THE CAPACITATED ARC ROUTING PROBLEM
    PEARN, WL
    NETWORKS, 1988, 18 (03) : 181 - 191
  • [32] The capacitated arc routing problem: Valid inequalities and facets
    Belenguer, JM
    Benavent, E
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 1998, 10 (02) : 165 - 187
  • [33] The cumulative vehicle routing problem with arc time windows
    Kritikos, Manolis N.
    Metzidakis, Theocharis
    Ioannou, George
    EXPERT SYSTEMS WITH APPLICATIONS, 2024, 240
  • [34] The Capacitated Arc Routing Problem: Valid Inequalities and Facets
    J.M. Belenguer
    E. Benavent
    Computational Optimization and Applications, 1998, 10 : 165 - 187
  • [35] A lower bound for the Node, Edge, and Arc Routing Problem
    Bach, Lukas
    Hasle, Geir
    Wohlk, Sanne
    COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (04) : 943 - 952
  • [36] The Clustered Prize-Collecting Arc Routing Problem
    Araoz, Julian
    Fernandez, Elena
    Franquesa, Carles
    TRANSPORTATION SCIENCE, 2009, 43 (03) : 287 - 300
  • [37] A cutting plane algorithm for the capacitated arc routing problem
    Belenguer, JM
    Benavent, E
    COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (05) : 705 - 728
  • [38] New lower bound for the capacitated arc routing problem
    Wohlk, Sanne
    COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (12) : 3458 - 3472
  • [39] A hybrid metaheuristic approach for the capacitated arc routing problem
    Chen, Yuning
    Hao, Jin-Kao
    Glover, Fred
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 253 (01) : 25 - 39
  • [40] A tabu search heuristic for the capacitated arc routing problem
    Hertz, A
    Laporte, G
    Mittaz, M
    OPERATIONS RESEARCH, 2000, 48 (01) : 129 - 135
12345