Beam-ACO for the travelling salesman problem with time windows
Year of publication: |
2010
|
---|---|
Authors: | López-Ibáñez, Manuel ; Blum, Christian |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 37.2010, 9, p. 1570-1583
|
Subject: | Theorie | Theory | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem |
-
Review of solution approaches for the symmetric traveling salesman problem
Saharidis, Georgios K. D., (2014)
-
Analysis and branch-and-cut algorithm for the time-dependent travelling salesman problem
Cordeau, Jean-François, (2014)
-
Baltz, Andreas, (2015)
- More ...
-
Beam search for the longest common subsequence problem
Blum, Christian, (2009)
-
Construct, merge, solve & adapt a new general algorithm for combinatorial optimization
Blum, Christian, (2016)
-
The irace package: Iterated racing for automatic algorithm configuration
López-Ibáñez, Manuel, (2016)
- More ...