Premium
The rescheduling arc routing problem
Author(s) -
MonroyLicht Marcela,
Amaya Ciro Alberto,
Langevin André,
Rousseau LouisMartin
Publication year - 2017
Publication title -
international transactions in operational research
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.032
H-Index - 52
eISSN - 1475-3995
pISSN - 0969-6016
DOI - 10.1111/itor.12346
Subject(s) - arc routing , computer science , integer programming , scheduling (production processes) , operations research , mathematical optimization , schedule , routing (electronic design automation) , decision maker , computer network , mathematics , algorithm , operating system
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.