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 combining 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 uses stochastic sampling as a useful alternative. An extensive experimental evaluation on seven benchmark sets from the literature shows that the proposed Beam-ACO algorithm is currently a stateof-the-art technique for the travelling salesman problem with time windows when travel-cost optimization is concerned.
López-Ibáñez and Blum REF proposed a Beam-ACO for the TSP with time windows.
Beam-ACO for the travelling salesman problem with time windows
Comput. Oper. Res.
Comput. Oper. Res.
Mathematics Computer Science