Bee colony optimization with local search for traveling salesman problem

International Journal on Artificial Intelligence Tools

Volumn 19, Issue 3, 2010, Pages 305-334

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

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

^b SCHOOL OF PHYSICS   (Malaysia)

^c SINGAPORE INSTITUTE OF MANUFACTURING TECHNOLOGY   (Singapore)

Author keywords

Bee colony optimization; combinatorial optimization; local search; metaheuristic; traveling salesman problem

Indexed keywords

ANT-COLONY OPTIMIZATION; BEE COLONY OPTIMIZATION; BENCH-MARK PROBLEMS; COLLECTIVE INTELLIGENCES; COLONY OPTIMIZATION; DRILLING PROBLEMS; HAMILTONIAN PATH; LOCAL OPTIMIZATIONS; LOCAL SEARCH; METAHEURISTIC; MINIMUM COST; OTHER ALGORITHMS; PRUNING STRATEGY; ROUTING PROBLEMS; SCAN CHAIN; SOLUTION QUALITY;

ALGORITHMS; BENCHMARKING; COMBINATORIAL OPTIMIZATION; HEURISTIC METHODS; INDUSTRIAL APPLICATIONS; INTEGRATED CIRCUIT TESTING; PARTICLE SWARM OPTIMIZATION (PSO); PROBLEM SOLVING;

TRAVELING SALESMAN PROBLEM;

EID: 77954322474     PISSN: 02182130     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0218213010000200     Document Type: Conference Paper

References (54)

1. K. von Frisch, Decoding the language of the bee, Science 185(4152) (1974) 663-668.
2. M. Dorigo and T. Stützle, The ant colony optimization metaheuristic: Algorithms, applications, and advances, in Handbook of Metaheuristics, International Series In Operations Research & Management Science (Springer, New York, 2002), pp. 250-285.
3. W. Kocay and D. L. Kreher, Hamilton cycles, in Graph, Algorithms and Optimization, Discrete Mathematics and Its Applications 9 (Chapman & Hall/CRC Press, New York, 2005), pp. 187-221.
4. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman Co., San Francisco, 1979).
5. G. Laporte, The traveling salesman problem: An overview of exact and approximate algorithms, European Journal of Operational Research 59(2) (1992) 231-247.
6. L. Tassiulas, Worst case length of nearest neighbor tours for the euclidean traveling salesman problem, Siam Journal on Discrete Mathematics 10(2) (1997) 171-179.
7. C. A. J. Hurkens and G. J. Woeginger, On the nearest neighbor rule for the traveling salesman problem, Operations Research Letters 32(1) (2004) 1-4.
8. D. J. Rosenkrantz, R. E. Stearns and P. M. Lewis, An analysis of several heuristics for the traveling salesman problem, SIAM Journal on Computing 6(3) (1977) 563-581.
9. A.M. Frieze, An extension of Christofides heuristic to the k-person travelling salesman problem, Discrete Applied Mathematics 6(1) (1983) 79-83.
10. B. Chandra, H. Karloff and C. Tovey, New results on the old k-opt algorithm for the traveling salesman problem, SIAM Journal on Computing 28(6) (1999) 1998-2029.
11. S. Lin and B. W. Kerninghan, An effective heuristic algorithm for the traveling salesman problem, Operations Research 21(2) (1973) 498-516.
12. K. Helsgaun, An effective implementation of the Lin-Kernighan traveling salesman heuristic, European Journal of Operational Research 126(1) (2000) 106-130.
13. 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 50(1-2) (1988) 187-206.
14. J. Knox, Tabu search performance on the symmetric traveling salesman problem, Computers & Operations Research 21(8) (1994) 867-876.
15. S. S. Ray, S. Bandyopadhyay and S. K. Pal, Genetic operators for combinatorial optimization in TSP and microarray gene ordering, Applied Intelligence 26(3) (2007) 183-195.
16. C. G.Wu, J. H. Yang, H. P. Lee and Y. C. Liang, Solving traveling salesman problems using generalized chromosome genetic algorithm, Progress in Natural Science 18(7) (2008) 887-892.
17. M. Saadatmand-Tarzjan, M. Khademi, T. Akbarzadeh and H. A. Moghaddam, A novel constructive-optimizer neural network for the traveling salesman problem, IEEE Transactions on Systems, Man and Cybernetics, Part B 37(4) (2007) 754-770.
18. P. H. Siqueira, M. T. A. Steiner and S. Scheer, A new approach to solve the traveling salesman problem, Neurocomputing 70(4-6) (2007) 1013-1021.
19. L. Huang, C. G. Zhou and K. P. Wang, Hybrid ant colony algorithm for traveling salesman problem, Progress in Natural Science 13(4) (2003) 295-299.
20. S. Al-Shihabi, Backtracking ant system for the traveling salesman problem, in Ant Colony, Optimization and Swarm Intelligence, eds. M. Dorigo, M. Birattari, C. Blum, L. M. Gambardella, F. Mondada and T. Stützle, Lecture Notes in Computer Science (Springer, Berlin/Heidelberg, 2004) pp. 318-325.
21. F. X. Le Louarn, M. Gendreau and J. Y. Potvin, GENI ants for the traveling salesman problem, Annals of Operations Research 131(1-4) (2004) 187-201.
22. E. F. G. Goldbarg, G. R. de Souza and M. C. Goldbarg, Particle swarm for the traveling salesman problem, in Evolutionary Computation in Combinatorial Optimiza-tion, eds. J. Gottlieb and Raidl.G.R, Lecture Notes in Computer Science (Springer, Berlin/Heidelberg, 2006), pp. 99-110.
23. X. Li, P. Tian, J. Hua and N. Zhong, A hybrid discrete particle swarm optimization for the traveling salesman problem, in Simulated Evolution and Learning, eds. T. D. Wang, X. Li, S. H. Chen, X. Wang, H. Abbass, H. Iba, G. Chen and X. Yao, Lecture Notes in Computer Science (Springer, Berlin/Heidelberg, 2006), pp. 181-188. (Pubitemid 44812337)
24. X. H. Shi, Y. C. Liang, H. P. Lee, C. Lu and Q. X.Wang, Particle swarm optimizationbased algorithms for TSP and generalized TSP, Information Processing Letters 103(5) (2007) 169-176.
25. P. Lučić and D. Teodorović, Transportation modeling: An artificial life approach, in Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence, 2002, pp. 216-223.
26. P. Lučić, Modeling transportation problems using concepts of swarm intelligence and soft computing, Ph.D. Thesis, Virginia Polytechnic Institute and State University2002.
27. P. Lučić and D. Teodorović, Computing with bees: Attacking complex transportation engineering problems, International Journal on Artificial Intelligence Tools 12(3) (2003) 375-394.
28. L. P. Wong, M. Y. H. Low and C. S. Chong, A bee colony optimization algorithm for traveling salesman problem, in Proceedings of the Second Asia International Confer-ence on Modelling & Simulation, (IEEE Computer Society, 2008), pp. 818-823.
29. L. M. Gambardella and M. Dorigo, Solving symmetric and asymmetric tsps by ant colonies, in Proceedings of the 1996 IEEE International Conference on Evolutionary Computation, 1996, pp. 622-627.
30. T. Stützle and H. H. Hoos, Improvements on the ant system: Introducing the MAXMIN ant system, in Proceedings the Third International Conference on Artificial Neu-ral Networks and Genetic Algorithms (ICANNGA 1997), (Springer Verlag, University of East Anglia, Norwich, UK, Wien, 1997).
31. T. Stützle and H. H. Hoos, The MAX-MIN ant system and local search for combinatorial optimization problems, in Proceedings of the 2nd Metaheuristics International Conference (MIC-97), 1997.
32. M. Gendreau, A. Hertz and G. Laporte, New insertion and postoptimization procedures for the traveling salesman problem, Operations Research 40(6) (1992) 1086-1094.
33. I. A. Couzin, J. Krause, R. James, G. D. Ruxton and N. R. Franks, Collective memory and spatial sorting in animal groups, Journal of Theoretical Biology 218(1) (2002) 1-11.
34. J. Kennedy and R. Eberhart, Particle swarm optimization, in Proceedings of 1995 IEEE International Conference on Neural Networks, 4 (1995), pp. 1942-1948.
35. J. Kennedy, Some issues and practices for particle swarms, in Proceedings of the IEEE Swarm Intelligence Symposium (SIS 2007), (IEEE, 2007), pp. 162-169.
36. A. Baykosoglu, L. Ozbakir and P. Tapkan, Artificial bee colony algorithm and its application to generalized assignment problem, in Swarm Intelligence: Focus on Ant and Particle Swarm Optimization, eds. T. S. Felix Chan and M. K. Tiwari, 5 (Itech Education and Publishing, Austria, 2007), pp. 532-564.
37. F. C. Dyer, The biology of the dance language, Annual Review of Entomology 47 (2002) 917-949.
38. J. C. Biesmeijer and T. D. Seeley, The use of waggle dance information by honey bees throughout their foraging careers, Behavioral Ecology and Sociobiology 59(1) (2005) 133-142.
39. S. Nakrani and C. Tovey, On honey bees and dynamic server allocation in Internet hosting centers, Adaptive Behavior 12(3-4) (2004) 223-240.
40. D. Karaboga and B. Basturk, On the performance of artificial bee colony (ABC) algorithm, Applied Soft Computing 8(1) (2008) 687-697.
41. F. H. Wedde, M. Farooq and Y. Zhang, Beehive: An efficient fault-tolerant routing algorithm inspired by honey bee behavior, in Ant Colony, Optimization and Swarm Intelligence, Lecture Notes in Computer Science (Springer, Berlin/Heidelberg, 2004), pp. 83-94.
42. C. S. Chong, M. Y. H. 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.
43. C. S. Chong, M. Y. H. Low, A. I. Sivakumar and K. L. Gay, Using a bee colony algorithm for neighborhood search in job shop scheduling problems, in Proceedings of the 21st European Conference on Modeling and Simulation (ECMS2007), 2007.
44. P. Lučić and D. Teodorović, Vehicle routing problem with uncertain demand at nodes: The bee system and fuzzy logic approach, in Fuzzy Sets in Optimization, ed. J. L. Verdegay (Springer-Verlag, Berlin/Heidelberg, 2003), pp. 67-82.
45. D. Teodorović and M. Dell'Orco, Bee colony optimization -A cooperative learning approach to complex transportation problems, in Proceedings of the 16th Mini EURO Conference and 10th Meeting of EWGT, 2005, pp. 51-60.
46. D. Teodorović, Swarm intelligence systems for transportation engineering: Principles and applications, Transportation Research Part C: Emerging Technologies 16(6) (2008) 651-657.
47. J. L. Bentley, Fast algorithms for geometric traveling salesman problems, ORSA Jour-nal on Computing 4(4) (1992) 387-441.
48. J. S. Gero and V. A. Kazakov, Evolving design genes in space layout planning problems, Artificial Intelligence in Engineering 12(3) (1998) 163-176.
49. J. S. Gero, V. A. Kazakov and T. Schnier, Genetic engineering and design problems, in Evolutionary Algorithms in Engineering Applications, eds. D. Dasgupta and Z. Michalewicz (Springer, Berlin, 1997), pp. 47-68.
50. A. S. Wu and R. K. Lindsay, A comparison of the fixed and floating building block representation in the genetic algorithm, Evolutionary Computation 4(2) (1996) 169-193.
51. N. Urquhart, P. Ross, B. Paechter and K. Chisholm, Improving street based routing using building block mutations, in Applications of Evolutionary Computing, eds. S. Cagnoni, J. Gottlieb, E. Hart, M. Middendorf and G. R. Raidl, Lecture Notes in Computer Science (Springer, Berlin/Heidelberg, 2002), pp. 334-341.
52. S. Gao, L. Zhang, F. Zhuang and C. Zhang, Solving traveling salesman problem by ant colony optimization algorithm with association rule, in Proceedings of the Third International Conference on Natural Computation, 2007 (ICNC 2007), 3(2007), pp. 693-698.
53. S. C. Greenway, Hormones in human metabolism and disease, in Functional Metabolism: Regulation and Adaptation, ed. K. B. Storey, 10 (John Wiley & Sons, 2005), pp. 271-294.
54. D. S. Johnson and L. A. McGeoch, Experimental analysis of heuristic for the STSP, in The Traveling Salesman Problem and Its Variations, eds. G. Gutin and A. P. Punnen (Kluwer Academic Publichers, 2002), pp. 369-443.