A branch-and-bound algorithm for the time-Dependent rural postman problem

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.

https://doi.org/10.1016/j.cor.2018.07.016

Cite as:

@article{Calogiuri_2019,
	doi = {10.1016/j.cor.2018.07.016},
	url = {https://doi.org/10.1016%2Fj.cor.2018.07.016},
	year = 2019,
	month = {feb},
	publisher = {Elsevier {BV}},
	volume = {102},
	pages = {150--157},
	author = {Tobia Calogiuri and Gianpaolo Ghiani and Emanuela Guerriero and Renata Mansini},
	title = {A branch-and-bound algorithm for the time-Dependent rural postman problem},
	journal = {Computers {&}amp$mathsemicolon$ Operations Research}
}