Author:
Hanne Thomas,Dornberger Rolf
Publisher
Springer International Publishing
Reference72 articles.
1. Ahmed, Z. H. (2010). Genetic algorithm for the traveling salesman problem using sequential constructive crossover operator. International Journal of Biometrics and Bioinformatics (IJBB), 3(6), 96–105.
2. Albayrak, M., & Allahverdi, N. (2011). Development a new mutation operator to solve the traveling salesman problem by aid of genetic algorithms. Expert Systems with Applications, 38(3), 1313–1320.
3. Anbuudayasankar, S. P., Ganesh, K., & Mohapatra, S. (2014). Models for practical routing problems in logistics. Springer.
4. Applegate, D., Cook, W., & Rohe, A. (2003). Chained Lin-Kernighan for large traveling salesman problems. INFORMS Journal on Computing, 15(1), 82–92.
5. Beasley, J. E. (2014). OR-library. http://people.brunel.ac.uk/~mastjjb/jeb/info.html. Zugegriffen am 12.03.2016.