Publisher
Springer Science and Business Media LLC
Subject
Geometry and Topology,Theoretical Computer Science,Software
Reference68 articles.
1. Alipour MM, Razavi SN, Feizi DMR, Balafar MA (2018) A hybrid algorithm using a genetic algorithm and multiagent reinforcement learning heuristic to solve the traveling salesman problem. Neural Comput Appl 30(9):2935–2951. https://doi.org/10.1007/s00521-017-2880-4
2. Applegate DL, Bixby RE, Chvatal V, Cook WJ (2006) The traveling salesman problem: A computational study. Princeton University Press, Princeton
3. Bang J, Ryu J, Lee C, Yoo S, Lim J, Lee J (2012) A quantum heuristic algorithm for the traveling salesman problem. J Korean Phys Soc 61(12):1944–1949. https://doi.org/10.3938/jkps.61.1944
4. Bullnheimer B, Hartl R, Strauss C (1999) A New Rank-based Version of the Ant System: a Computational Study. Cent Eur J Oper Res 7:25–38
5. Chen SM, Chien CY (2011) Solving the traveling salesman problem based on the genetic simulated annealing ant colony system with particle swarm optimization techniques. Expert Syst Appl 38(12):14439–14450. https://doi.org/10.1016/j.eswa.2011.04.163
Cited by
29 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献