Author:
Bhasin Harsh,Behal Gitanshu,Aggarwal Nimish,Saini Raj Kumar,Choudhary Shivani
Publisher
Springer Science and Business Media LLC
Subject
Geometry and Topology,Theoretical Computer Science,Software
Reference14 articles.
1. Bhasin H, Singla N (2012a) Harnessing cellular automata and genetic algorithms to solve TSP. In: International conference on information, computing and telecommunications (ICICT’12), pp 72–77
2. Bhasin H, Singla N (2012b) Genetic based algorithm for N-puzzle problem. Int J Comput Appl 51(22):44–50
3. Bhasin H et al (2014) On the applicability of diploid genetic algorithms in dynamic environments. In: Proceedings of the international conference on soft computing and machine intelligence (ISCMI’14). IEEE Computer Society, Washington, DC, pp 94–97. doi: 10.1109/ISCMI.2014.27
4. Branke J (1999) Memory enhanced evolutionary algorithms for changing optimization problems. Proc 1999 Congr Evol Comput 3:1875–1882
5. Eyckelhof CJ, Snoek M (2002) Ant systems for a dynamic TSP. In: Proceedings of the 3rd international workshop on ant algorithms. Springer, New York, pp 88–99
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献