In this work we present an Enhanced Ant Colony System algorithm for the Probabilistic Traveling Salesman Problem. More in detail, we identify drawbacks of the well-known Ant Colony System metaheuristic when applied to the Probabilistic Traveling Salesman Problem. We then propose enhancements to overcome those drawbacks. Comprehensive computational studies on common benchmark instances reveal the efficiency of this novel approach. The Enhanced Ant Colony System algorithm clearly outperforms the original Ant Colony System metaheuristic. Additionally, improvements over best-known results for the Probabilistic Traveling Salesman Problem could be obtained for many instances.

An enhanced ant colony system for the probabilistic traveling salesman problem / Weyland, Dennis; Montemanni, Roberto; Gambardella Luca, Maria. - (2012), pp. 237-249. ((Intervento presentato al convegno BIONETICS 2012: Bio-Inspired Models of Network, Information, and Computing Systems tenutosi a Lugano, Switzerland nel December 2012.

I documenti presenti in Iris Unimore sono rilasciati con licenza Creative Commons Attribuzione - Non commerciale - Non opere derivate 3.0 Italia, salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris

Powered by IRIS-about IRIS-Utilizzo dei cookie

 Copyright © 2021