Author:
Liu Yinhao,Chen Xu,Dib Omar
Publisher
Springer Nature Switzerland
Reference30 articles.
1. Aarts, E.H., Korst, J.H., van Laarhoven, P.J.: A quantitative analysis of the simulated annealing algorithm: a case study for the traveling salesman problem. J. Stat. Phys. 50(1), 187–206 (1988)
2. Ali, I.M., Essam, D., Kasmarik, K.: A novel design of differential evolution for solving discrete traveling salesman problems. Swarm Evol. Comput. 52, 100607 (2020)
3. Applegate, D., Bixby, R., Chvatal, V., Cook, W.: Concorde tsp solver (2006), http://www.tsp.gatech.edu/concorde
4. Dasari, K.V., Pandiri, V., Singh, A.: Multi-start heuristics for the profitable tour problem. Swarm Evol. Comput. 64, 100897 (2021)
5. Deb, K., Agrawal, S., et al.: Understanding interactions among genetic algorithm parameters. Found. Genetic Alg. 5(5), 265–286 (1999)