A bee colony optimization algorithm for traveling salesman problem

Proceedings - 2nd Asia International Conference on Modelling and Simulation, AMS 2008

Volumn , Issue , 2008, Pages 818-823

  Wong, Li Pei ^a   Low, Malcolm Yoke Hean ^a   Chong, Chin Soon ^b  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b SINGAPORE INSTITUTE OF MANUFACTURING TECHNOLOGY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ALPHA PARTICLE SPECTROMETERS; ASSET MANAGEMENT; OPTIMIZATION; PARTICLE SPECTROMETERS;

BENCH-MARK PROBLEMS; COLLECTIVE INTELLIGENCE; COLONY OPTIMIZATION; INTERNATIONAL CONFERENCES; MODELLING AND SIMULATION; TRAVELING SALESMAN; TRAVELING SALESMAN PROBLEM (TSP);

TRAVELING SALESMAN PROBLEM;

EID: 50249161577     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/AMS.2008.27     Document Type: Conference Paper

References (23)

1. S. Nakrani and C. Tovey, "On honey bees and dynamic server allocation in Internet hosting centers," Adaptive Behavior, vol. 12, no. 3-4, pp. 223-240, 2004.
2. G. Laporte, "The traveling salesman problem: An overview of exact and approximate algorithms," European Journal of Operational Research, vol. 59, no. 2, pp. 231-247, 1992.
3. D. J. Rosenkrantz, R. E. Stearns, and P. M. Lewis, "An analysis of several heuristics for the traveling salesman problem," SIAM Journal on Computing, vol. 6, no. 3, pp. 563-581, 1977.
4. A. M. Frieze, "An extension of Christofides heuristic to the k-person travelling salesman problem," Discrete Applied Mathematics, vol. 6, no. 1, pp. 79-83, 1983.
5. B. Chandra, H. Karloff, and C. Tovey, "New results on the old k-opt algorithm for the traveling salesman problem," SIAM Journal on Computing, vol. 28, no. 6, pp. 1998-2029, 1999.
6. S. Lin and B. W. Kerninghan, "An effective heuristic algorithm for the traveling salesman problem," Operations Research, vol. 21, no. 2, pp. 498-516, 1973.
7. K. Helsgaun, "An effective implementation of the LinKernighan traveling salesman heuristic," European Journal of Operational Research, vol. 126, no. 1, pp. 106-130, 2000.
8. E. H. L. Aarts, J. H. M. Korst, and P. J. M. Vanlaarhoven, "A quantitative analysis of the simulated annealing algorithm - A case study for the traveling salesman problem," Journal of Statistical Physics, vol. 50, no. 1-2, pp. 187-206, 1988.
9. J. Knox, "Tabu search performance on the symmetric traveling salesman problem," Computers & Operations Research, vol. 21, no. 8, pp. 867-876, 1994.
10. B. Freisleben and P. Merz, "A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems," in Proceedings of International Conference on Evolutionary Computation, 1996. pp. 616-621.
11. P. Merz and B. Freisleben, "Genetic local search for the TSP: New results," in Proceedings of the 1997 IEEE International Conference on Evolutionary Computation, 1997. pp. 159-164.
12. C. M. White and G. G. Yen, "A hybrid evolutionary algorithm for traveling salesman problem," in Proceedings of Congress on Evolutionary Computation, 2004, CEC2004., 2004. pp. 1473-1478.
13. L. M. Gambardella and M. Dorigo, "Solving symmetric and asymmetric TSPs by ant colonies," in Proceedings of IEEE International Conference on Evolutionary Computation, 1996. 1996. pp. 622-627.
14. T. Stützle and H. Hoos, "MAX-MIN ant system and local search for the traveling salesman problem," in Proceedings of ICEC'97 - 1997 IEEE 4th International Conference on Evolutionary Computation, 1997. pp. 308-313.
15. P. Lucic and D. Teodorovic, "Computing with Bees: Attacking Complex Transportation Engineering Problems," International Journal on Artificial Intelligence Tools, vol. 12, no. 3, pp. 375-394, 2003.
16. K. von Frisch, "Decoding the language of the bee," Science, vol. 185, no. 4152, pp. 663-668, 1974.
17. F. C. Dyer, "The biology of the dance language," Annual Review of Entomology, vol. 47, pp. 917-949, 2002.
18. J. C. Biesmeijer and T. D. Seeley, "The use of waggle dance information by honey bees throughout their foraging careers," Behavioral Ecology and Sociobiology, vol. 59, no. 1, pp. 133-142, 2005.
19. D. Karaboga and B. Basturk, "A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm," Journal of Global Optimization, vol. 39, no. 3, pp. 459-471, 2007.
20. J. V. Rijswijck, "Are bees better than fruitflies? Experiments with a hex playing program." in Proceeding of 13th Biennial Conference of the Canadian Society for Computational Studies of Intelligence, AI 2000, Montreal, Quebec, Canada, May 2000. Advances in Artificial Intelligence, vol. 1822/2000, Berlin / Heidelberg: Springer, 2007. pp. 13-25.
21. C. S. Chong, Y. H. Malcolm Low, A. I. Sivakumar, and K. L. Gay, "A bee colony optimization algorithm to job shop scheduling," in Proceedings of the 2006 Winter Simulation Conference, 2006. pp. 1954-1961.
22. st European Conference on Modeling and Simulation (ECMS 2007), 2007.
23. K. Helsgaun, "An effective implementation of the Lin-Kernighan traveling salesman heuristic," Roskilde University, 81, 1998.