Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Linguistics and Language,Language and Linguistics
Reference57 articles.
1. Akhand MAH, Akter S, Sazzadur Rahman S, Hafizur Rahman MM (2012) Particle Swarm Optimization with partial search to solve Traveling Salesman Problem. In: 2012 International conference on computer and communication engineering, ICCCE, pp 118–121
2. Akhand MAH, Akter S, Rashid MA, Yaakob SB (2015) Velocity tentative PSO: an optimal velocity implementation based particle swarm optimization to solve traveling salesman problem. IAENG Int J Comput Sci 42(3):1–12
3. Aras N, Boyacı B, Koşucuoğlu D, Aksen D (2007) Karlı Gezgin Satıcı Problemi için Sezgisel Yöntemler, Industrial Engineering 27. National Congress, İzmir, Turkey (in the Turkish language)
4. Arora S (1998) Polynomial-time approximation schemes for Euclidean traveling salesman and other geometric problems. J ACM (JACM) 45(5):753–782
5. Atashpaz-Gargari E, Lucas C, (2007) Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition. In: IEEE congress on evolutionary computation, pp 4661–4667
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献