A memetic algorithm for the team orienteering problem
Year of publication: |
2010
|
---|---|
Authors: | Bouly, Hermann ; Dang, Duc-Cuong ; Moukrim, Aziz |
Published in: |
4OR : a quarterly journal of operations research. - Berlin, Heidelberg : Springer, ZDB-ID 2127815-5. - Vol. 8.2010, 1, p. 49-70
|
Subject: | Arbeitsgruppe | Team | Tourenplanung | Vehicle routing problem | Algorithmus | Algorithm |
-
An effective PSO-inspired algorithm for the team orienteering problem
Dang, Duc-cuong, (2013)
-
Branch-Price-and-Cut algorithms for the team orienteering problem with interval-varying profits
Liu, Jiaojiao, (2024)
-
Ghandehari, Mahsa, (2014)
- More ...
-
Subgraph extraction and meteheuristics for the maximum clique problem
Dang, Duc-cuong, (2012)
-
An effective PSO-inspired algorithm for the team orienteering problem
Dang, Duc-cuong, (2013)
-
Solving the team orienteering problem with cutting planes
El-Hajj, Racha, (2016)
- More ...