The rescheduling arc routing problem

doi:10.1111/itor.12346

The rescheduling arc routing problem

2016-10-17

19

PRE

AI

M

Marcela Monroy‐Licht *

Louis‐Martin Rousseau

DOI：10.1111/itor.12346

原文链接

原文求助

摘要

En 中文

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.

Keyword:

rescheduling

disruption schedule costs

mixed-integer programming

arc routing problem

The rescheduling arc routing problem

摘要

AI总结

期刊

机构