• Beam-ACO based on stochastic sampling: a case study on the TSP with time windows 

    López Ibáñez, Manuel; Blum, Christian (2009)
    Artículo
    Acceso restringido por política de la editorial
    Beam-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
    Acceso abierto
    Beam-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
    Acceso abierto
    The 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)
    Texto en actas de congreso
    Acceso restringido por política de la editorial
    Los 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 ...