Exploració per autor "López Ibáñez, Manuel"
Ara es mostren els items 1-4 de 4
-
Beam-ACO based on stochastic sampling: a case study on the TSP with time windows
López Ibáñez, Manuel; Blum, Christian (2009)
Article
Accés restringit per política de l'editorialBeam-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 ... -
Beam-ACO based on stochastic sampling: a case study on the TSP with time windows
López Ibáñez, Manuel; Blum, Christian (2008-10)
Report de recerca
Accés obertBeam-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 ... -
Beam-ACO for the travelling salesman problem with time windows
López Ibáñez, Manuel; Blum, Christian (2009-07)
Report de recerca
Accés obertThe travelling salesman problem with time windows is a difficult optimization problem that arises, for example, in logistics. This paper deals with the minimization of the travel cost. For solving this problem, this paper ... -
Un estudio aplicado al problema del viajante del comercio con ventanas de tiempo
López Ibáñez, Manuel; Blum, Christian (2009)
Text en actes de congrés
Accés restringit per política de l'editorialLos algoritmos Beam-ACO son métodos híbridos que combinan la metaheurística de optimización basada en colonias de hormigas (Ant Colony Optimisation, ACO) con la búsqueda en haz (beam-search). Estos algotitmos dependen en ...