Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Beam-ACO for the travelling salesman problem with time windows

Autor
López, M.; Blum, C.
Tipus d'activitat
Document cientificotècnic
Data
2009-07
Codi
LSI-09-29-R
Repositori
http://hdl.handle.net/2117/88010 Obrir en finestra nova
Resum
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 proposes a Beam-ACO algorithm, which is a hybrid method that combines ant colony optimization with beam search. In general, Beam-ACO algorithms heavily rely on accurate and computationally inexpensive bounding information for differentiating between partial solutions. This work...
Citació
López, M., Blum, C. "Beam-ACO for the travelling salesman problem with time windows". 2009.
Paraules clau
Ant Colony Optimization, Beam Search, Hybridization, Travelling Salesman

Participants

  • López Ibáñez, Manuel  (autor)
  • Blum, Christian  (autor)

Arxius