This paper deals with the time-dependent version of the classical Rural Postman Problem in which arc traversal times vary along the planning horizon. The relationship with the time-invariant counterpart is investigated and a branch-and-bound algorithm is developed. Extensive computational results indicate that the algorithm is capable of solving much larger instances than previously reported.
A branch-and-bound algorithm for the time-Dependent rural postman problem
Mansini, Renata
2019-01-01
Abstract
This paper deals with the time-dependent version of the classical Rural Postman Problem in which arc traversal times vary along the planning horizon. The relationship with the time-invariant counterpart is investigated and a branch-and-bound algorithm is developed. Extensive computational results indicate that the algorithm is capable of solving much larger instances than previously reported.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.