A memetic algorithm with iterated local search for the capacitated are routing problem
| Year of publication: |
2013
|
|---|---|
| Authors: | Liu, Tiantang ; Jiang, Zhibin ; Geng, Na |
| Published in: |
International journal of production research. - London : Taylor & Francis, ISSN 0020-7543, ZDB-ID 160477-6. - Vol. 51.2013, 10 (15.5.), p. 3075-3084
|
| Subject: | Capacitated arc routing problem | Iterated local search | Longest common substring crossover | Memetic algorithm | Tourenplanung | Vehicle routing problem | Heuristik | Heuristics | Algorithmus | Algorithm | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
A memetic algorithm for the Orienteering Problem with Mandatory Visits and Exclusionary Constraints
Lu, Yongliang, (2018)
-
Iterated local search for consecutive block minimization
Haddadi, Salim, (2021)
-
Well-tuned algorithms for the Team Orienteering Problem with Time Windows
Gunawan, Aldy, (2017)
- More ...
-
Metamodel-based simulation optimisation for bed allocation
Wang, Xiuxian, (2020)
-
Multi-objective capacity allocation of hospital wards combining revenue and equity
Zhou, Liping, (2018)
-
Geng, Na, (2013)
- More ...