Show simple item record

dc.contributor.authorLópez Ibáñez, Manuel
dc.contributor.authorBlum, Christian
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Llenguatges i Sistemes Informàtics
dc.identifier.citationLópez, M., Blum, C. "Beam-ACO based on stochastic sampling: a case study on the TSP with time windows". 2008.
dc.description.abstractBeam-ACO algorithms are hybrid methods that combine the metaheuristic ant colony optimization with beam search. They heavily rely on accurate and computationally inexpensive bounding information for choosing between different partial solutions during the solution construction process. In this work we present the use of stochastic sampling as a useful alternative to bounding information in cases were computing accurate bounding information is too expensive. As a case study we choose the well-known travelling salesman problem with time windows. Our results clearly demonstrate that Beam-ACO, even when bounding information is replaced by stochastic sampling, may have important advantages over standard ACO algorithms.
dc.format.extent15 p.
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.otherStochastic sampling
dc.subject.otherTravelling salesman problem with time windows
dc.titleBeam-ACO based on stochastic sampling: a case study on the TSP with time windows
dc.typeExternal research report
dc.rights.accessOpen Access
dc.description.versionPostprint (published version)
upcommons.citation.authorLópez, M.; Blum, C.

Files in this item


This item appears in the following Collection(s)

Show simple item record

All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder