| Autor: |
NAGYa, Zsuzsanna, WERNER-STARK, Ágnes, DULAI, Tibor |
| Předmět: |
|
| Zdroj: |
Proceedings of the Multidisciplinary Academic Conference; Nov2021, p64-83, 20p |
| Abstrakt: |
The Capacitated Arc Routing Problem (CARP) is a combinatorial optimization problem that requires determining the least cost route plans on a graph for vehicles subject to some constraints. Dynamic CARP (DCARP) is a variant of CARP that considers dynamic changes in the problem during the execution of the plan. Most of the existing works only consider one type of dynamic event and when such event occurs, all the route plans are re-planned. Nowadays, technologies can provide nearly instant updates on information about the roads (e.g., travel time and road closure). Furthermore, data can be gathered in real time about the traversed and served road sections. In this work, a data-driven DCARP framework is proposed, that can handle all the events that can make the original schedule infeasible or obsolete. Furthermore, a novel rerouting algorithm (RR1) is also introduced, that aims to find the least cost route plans by utilizing a travel and service log and rerouting at most one route plan. The results showed that RR1 can give solutions fast and the given solutions in around half of the cases have the same cost as the solutions given by the currently most accurate routing algorithm. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
