Author:
Chen Meng-Hui,Chen Shih-Hsin,Chang Pei-Chann
Publisher
Springer Science and Business Media LLC
Subject
Geometry and Topology,Theoretical Computer Science,Software
Reference31 articles.
1. Affenzeller M, Wanger S (2003) A self-adaptive model for selective pressure handling within the theory of genetic algorithms. Lect Notes Comput Sci 2809(1):384–393
2. 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
3. Bianchi L, Knowles J, Bowler J (2005) Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms. Eur J Oper Res 162(1):206–219
4. Bonyadi RM, Rahimi Azghadi SM, Shah-Hosseini H (2007) Solving travelingsalesman problem using combinational evolutionary algorithm. In: Boukis C, Pnevmatikakis L, Polymenakos L (eds) IFIP international federation for information processing. Artificial intelligence and innovations 2007: from theory to applications, vol 247, Springer, Boston, pp 37–44
5. Budinich M (1996) A self-organizing neural network for the traveling salesman problem that is competitive with simulated annealing. Neural Comput 8:416–424
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献