A Discrete Artificial Bee Colony Algorithm for TSP Problem
暂无分享,去创建一个
Ben Niu | Lijing Tan | Li Li | Yurong Cheng | B. Niu | Li Li | Lijing Tan | Yurong Cheng
[1] Dervis Karaboga,et al. A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm , 2007, J. Glob. Optim..
[2] Dervis Karaboga,et al. AN IDEA BASED ON HONEY BEE SWARM FOR NUMERICAL OPTIMIZATION , 2005 .
[3] Tiranee Achalakul,et al. ABC-GSX: A hybrid method for solving the Traveling Salesman Problem , 2010, 2010 Second World Congress on Nature and Biologically Inspired Computing (NaBIC).
[4] Chunguang Zhou,et al. Particle swarm optimization for traveling salesman problem , 2003, Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693).
[5] Klaus Meer,et al. Simulated Annealing versus Metropolis for a TSP instance , 2007, Inf. Process. Lett..
[6] Cheng-Fa Tsai,et al. A new hybrid heuristic approach for solving large traveling salesman problem , 2004, Inf. Sci..
[7] D. Karaboga,et al. On the performance of artificial bee colony (ABC) algorithm , 2008, Appl. Soft Comput..
[8] Heinrich Braun,et al. On Solving Travelling Salesman Problems by Genetic Algorithms , 1990, PPSN.
[9] Leandro Nunes de Castro,et al. A self-organizing neural network using ideas from the immune system to solve the traveling salesman problem , 2009, Inf. Sci..
[10] Yanchun Liang,et al. Solving traveling salesman problems by genetic algorithms , 2003 .
[11] Georgios Dounias,et al. A hybrid particle swarm optimization algorithm for the vehicle routing problem , 2010, Eng. Appl. Artif. Intell..