This work assessed the performance of a solution to the problem of assigning service squads, incorporating the variability of service times. The initial problem was modelled as a Travelling Salesman Problem (TSP), whose solution was obtained by the ant colony algorithm, showing the efficient rout...
Enlace original:
http://repositoriodigital.uct.cl/handle/10925/2606
Lagos, Dafne
,
Mancilla, Rodrigo
,
Leal Mora, Paola
,
Fox, Franco
,
[Performance measurement of a solution for the travelling salesman problem for routing through the incorporation of service time variability]
,
Performance measurement of a solution for the travelling salesman problem for routing through the incorporation of service time variability
