We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
The rescheduling arc routing problem.
- Authors
Monroy‐Licht, Marcela; Amaya, Ciro Alberto; Langevin, André; Rousseau, Louis‐Martin
- Abstract
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.
- Subjects
ROUTING (Computer network management); COMPUTER scheduling; INTEGER programming; COMPUTATIONAL complexity; DECISION making
- Publication
International Transactions in Operational Research, 2017, Vol 24, Issue 6, p1325
- ISSN
0969-6016
- Publication type
Article
- DOI
10.1111/itor.12346