A branch-and-bound algorithm for the time-dependent travelling salesman problem

© 2018 Wiley Periodicals, Inc. Given a graph whose arc traversal times vary over time, the Time-Dependent Travelling Salesman Problem consists of finding a Hamiltonian tour of least total duration. In this paper we exploit some properties of the problem and develop a branch-and-bound algorithm which outperforms the state-of-the-art branch-and-cut procedure by Cordeau et al. [5].

https://doi.org/10.1002/net.21830

Cite as:

@article{Arigliano_2018,
	doi = {10.1002/net.21830},
	url = {https://doi.org/10.1002%2Fnet.21830},
	year = 2018,
	month = {jun},
	publisher = {Wiley},
	volume = {72},
	number = {3},
	pages = {382--392},
	author = {Anna Arigliano and Tobia Calogiuri and Gianpaolo Ghiani and Emanuela Guerriero},
	title = {A branch-and-bound algorithm for the time-dependent travelling salesman problem},
	journal = {Networks}
}