Publisher
Springer Nature Switzerland
Reference10 articles.
1. Abdoun, O., Abouchabaka, J., Tajani, C.: Analyzing the performance of mutation operators to solve the travelling salesman problem. arXiv:1203.3099 (2012)
2. Al-Betar, M.A.: $$\beta $$-Hill climbing: an exploratory local search. Neural Comput. Appl. 28(1), 153–168 (2016). https://doi.org/10.1007/s00521-016-2328-2
3. Gambardella, L.M., Dorigo, M.: Ant-Q: a reinforcement learning approach to the traveling salesman problem. In: Machine Learning Proceedings 1995, pp. 252–260. Elsevier (1995). https://doi.org/10.1016/B978-1-55860-377-6.50039-6
4. Hussain, A., Muhammad, Y.S., Nauman Sajid, M., Hussain, I., Mohamd Shoukry, A., Gani, S.: Genetic algorithm for traveling salesman problem with modified cycle crossover operator. Comput. Intell. Neurosci. 2017, 1–7 (2017). https://doi.org/10.1155/2017/7430125
5. Mazidi, A., Fakhrahmad, M., Sadreddini, M.: Meta-heuristic approach to cvrp problem: local search optimization based on ga and ant colony. J. Adv. Comput. Res. 7(1), 1–22 (2016)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献