A Real Adjacency Matrix-Coded Differential Evolution Algorithm for Traveling Salesman Problems
暂无分享,去创建一个
Hang Wei | Zhifeng Hao | Han Huang | Gang Li | Qinqun Chen
[1] Xun Wang,et al. Design of logic gates using spiking neural P systems with homogeneous neurons and astrocytes-like control , 2016, Inf. Sci..
[2] Madan Lal Mittal,et al. Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches , 2010 .
[3] Jun Zhang,et al. A Novel Set-Based Particle Swarm Optimization Method for Discrete Optimization Problems , 2010, IEEE Transactions on Evolutionary Computation.
[4] Luca Maria Gambardella,et al. Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..
[5] Qingfu Zhang,et al. A surrogate-assisted evolutionary algorithm for minimax optimization , 2010, IEEE Congress on Evolutionary Computation.
[6] P. N. Suganthan,et al. Differential Evolution: A Survey of the State-of-the-Art , 2011, IEEE Transactions on Evolutionary Computation.
[7] Xingyi Zhang,et al. Spiking Neural P Systems With White Hole Neurons , 2016, IEEE Transactions on NanoBioscience.
[8] Godfrey C. Onwubolu,et al. Differential Evolution: A Handbook for Global Permutation-Based Combinatorial Optimization , 2009 .
[9] Jun Zhang,et al. A Set-Based Discrete Differential Evolution Algorithm , 2013, 2013 IEEE International Conference on Systems, Man, and Cybernetics.
[10] Linqiang Pan,et al. Spiking neural P systems with request rules , 2016, Neurocomputing.