Prof. Juan José Salazar González, Universidad de la Laguna, Tenerife
Chair: Prof. Carlo Filippi, Università di Brescia
When: May 20th, 2026, 2:30 PM
Where: Room D2, Brixia Building, via San Faustino 64
The consistent travelling salesman problem looks for a minimum-cost set of Hamiltonian routes, one for every day of a given time period. When a customer requires service in several days, the service times on different days must differ by no more than a given threshold (for example, one hour). There are many variants of this problem addressed in the literature (see some of them in the references). The simplest variant, the vehicle is not allowed to wait along the route. This talk details models and algorithms for solving the problem with and without idle times, and analyses computational results.