Honey bees mating optimization algorithm for the Euclidean traveling salesman problem

Information Sciences

Volumn 181, Issue 20, 2011, Pages 4684-4698

  Marinakis, Yannis ^a   Marinaki, Magdalene ^a   Dounias, Georgios ^b  

^a TECHNICAL UNIVERSITY OF CRETE   (Greece)

^b UNIVERSITY OF THE AEGEAN   (Greece)

Author keywords

Honey bees mating optimization; Metaheuristics; Traveling salesman problem

Indexed keywords

ADAPTIVE SEARCH; CROSSOVER OPERATOR; EUCLIDEAN; HONEY BEE; HONEY BEES MATING OPTIMIZATION; META HEURISTICS; NEIGHBORHOOD SEARCH; OPTIMIZATION ALGORITHMS;

COMPUTATIONAL EFFICIENCY; FOOD PRODUCTS; HEURISTIC ALGORITHMS; MATHEMATICAL OPERATORS; PROBLEM SOLVING;

TRAVELING SALESMAN PROBLEM;

EID: 79957458881     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2010.06.032     Document Type: Article

References (85)

1. H.A. Abbass, A monogenous MBO approach to satisfiability Proceeding of the International Conference on Computational Intelligence for Modelling
2. H.A. Abbass, Marriage in honey-bee optimization (MBO): a haplometrosis polygynous swarming approach, in: The Congress on Evolutionary Computation (CEC2001), Seoul, Korea, May 2001, 2001, pp. 207-214. (Pubitemid 32806339)
3. A. Afshar, O. Bozog Haddad, M.A. Marino, and B.J. Adams Honey-bee mating optimization (HBMO) algorithm for optimal reservoir operation Journal of the Franklin Institute 344 2007 452 462 (Pubitemid 46764340)
4. N. Ansari, and E. Hou Computational Intelligence for Optimization first ed. 1997 Kluwer Academic Publishers Boston
5. D. Applegate, R. Bixby, V. Chvatal, and W. Cook Chained Lin-Kernighan for large traveling salesman problems Informs Journal on Computing 15 2003 82 92 (Pubitemid 39042734)
6. A. Badr, and A. Fahmy A proof of convergence for ant algorithms Information Sciences 160 2004 267 279
7. Y. Bai, W. Zhang, and Z. Jin An new self-organizing maps strategy for solving the traveling salesman problem Chaos, Solitons and Fractals 28 4 2006 1082 1089 (Pubitemid 41607610)
8. R. Baralia, J.I. Hildago, and R. Perego A hybrid heuristic for the traveling salesman problem IEEE Transactions on Evolutionary Computation 5 6 2001 1 41
9. A. Baykasoglu, L. Ozbakor, and P. Tapkan Artificial bee colony algorithm and its application to generalized assignment problem F.T.S. Chan, M.K. Tiwari, Swarm Intelligence Focus on Ant and Particle Swarm Optimization 2007 I-Tech Education and Publishing 113 144
10. J.L. Bentley Fast algorithms for geometric traveling salesman problems ORSA Journal on Computing 4 1992 387 411
11. Y. Chen, and P. Zhang Optimized annealing of traveling salesman problem from the nth-nearest-neighbor distribution Physica A: Statistical and Theoretical Physics 371 2 2006 627 632 (Pubitemid 44397335)
12. S.C. Chu, J.F. Roddick, and J.S. Pan Ant colony system with communication strategies Information Sciences 167 1-4 2004 63 76
13. G. Clarke, and J.W. Wright Scheduling of vehicles from a central depot to a number of delivery points Operations Research 12 1964 568 581
14. D. Dasgupta Artificial Immune Systems and Their Application 1998 Springer Heidelberg
15. L.D. De Castro, and J. Timmis Artificial Immune Systems: A New Computational Intelligence Approach 2002 Springer Heidelberg
16. M. Dorigo, and L.M. Gambardella Ant colony system: a cooperative learning approach to the traveling salesman problem IEEE Transactions on Evolutionary Computation 1 1 1997 53 66 (Pubitemid 127771018)
17. M. Dorigo, and L.M. Gambardella Ant colonies for the traveling salesman problem Biosystems 43 1997 73 81 (Pubitemid 27332279)
18. M. Dorigo, and T. Stutzle Ant Colony Optimization A Bradford Book 2004 The MIT Press Cambridge Massachusetts, London, England
19. H. Drias, S. Sadeg, S. Yahi, Cooperative bees swarm for solving the maximum weighted satisfiability problem, in: IWAAN International Work Conference on Artificial and Natural Neural Networks, LNCS, vol. 3512, 2005, pp. 318-325. (Pubitemid 41342995)
20. I. Ellabib, P. Calamai, and O. Basir Exchange strategies for multiple ant colony system Information Sciences 177 2007 1248 1264 (Pubitemid 44908295)
21. M. Fathian, B. Amiri, and A. Maroosi Application of honey bee mating optimization algorithm on clustering Applied Mathematics and Computation 190 2007 1502 1513 (Pubitemid 46935891)
22. T.A. Feo, and M.G.C. Resende Greedy randomized adaptive search procedure Journal of Global Optimization 6 1995 109 133
23. R. Garfinkel, and G. Nemhauser Integer Programming 1972 Wiley and Sons
24. M. Gendreau, A. Hertz, and G. Laporte New insertion and post optimization procedures for the traveling salesman problem Operations Research 40 1992 1086 1094
25. F. Glover Future paths for integer programming and links to artificial intelligence Computers and Operations Research 13 1986 533 549 (Pubitemid 17480188)
26. F. Glover Tabu search I ORSA Journal on Computing 1 3 1989 190 206
27. F. Glover Tabu search II ORSA Journal on Computing 2 1 1990 4 32
28. Glover, F., 1990. Tabu search: A tutorial, Center for Applied Artificial Intelligence, University of Colorado, 1-47.
29. F. Glover, and G. Konchenberger Handbook of Metaheuristics 2003 Kluwer Academic Publishers Dordrecht
30. F. Glover, and M. Laguna Tabu search P.M. Pardalos, M.G.C. Resende, Handbook of Applied Optimization 2002 Oxford University Press 194 209
31. E.F.G. Goldbarg, G.R. Souza, M.C. Goldbarg, Particle swarm optimization for the traveling salesman problem, in: EVOCOP 2006, LNCS, vol. 3906, 2006, pp. 99-110. (Pubitemid 44019277)
32. G. Gutin, and A. Punnen The Traveling Salesman Problem and its Variations 2002 Kluwer Academic Publishers Dordrecht
33. O.B. Haddad, A. Afshar, and M.A. Marino Honey-bees mating optimization (HBMO) algorithm: a new heuristic approach for water resources optimization Water Resources Management 20 2006 661 680 (Pubitemid 44263967)
34. P. Hansen, and N. Mladenovic Variable neighborhood search: principles and applications European Journal of Operational Research 130 2001 449 467 (Pubitemid 32875304)
35. K. Helsgaum An effective implementation of the Lin-Kernighan traveling salesman heuristic European Journal of Operational Research 126 2000 106 130
36. D.S. Johnson, and C.H. Papadimitriou Computational complexity E.L. Lawer, J.K. Lenstra, A.H.D. Rinnoy Kan, D.B. Shmoys, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization 1985 Wiley and Sons 37 85
37. D.S. Johnson, and L.A. McGeoch The traveling salesman problem: a case study E. Aarts, J.K. Lenstra, Local Search in Combinatorial Optimization 1997 Wiley and Sons 215 310
38. D.S. Johnson, and L.A. McGeoch Experimental analysis of heuristics for the STSP G. Gutin, A. Punnen, The Traveling Salesman Problem and its Variations 2002 Kluwer Academic Publishers Dordrecht 369 444
39. D.S. Johnson, G. Gutin, L.A. McGeoch, A. Yeo, W. Zhang, and A. Zverovitch Experimental analysis of heuristics for the ATSP G. Gutin, A. Punnen, The Traveling Salesman Problem and its Variations 2002 Kluwer Academic Publishers Dordrecht 445 487
40. D. Karaboga, and B. Basturk A powerful and efficient algorithm for numerical function optimization: artificial bee colony (ABC) algorithm Journal of Global Optimization 39 2007 459 471 (Pubitemid 47551831)
41. D. Karaboga, and B. Basturk On the performance of artificial bee colony (ABC) algorithm Applied Soft Computing 8 2008 687 697 (Pubitemid 47374599)
42. J. Kennedy, R. Eberhart, Particle swarm optimization, in: Proceedings of 1995 IEEE International Conference on Neural Networks, vol. 4, 1995, pp. 1942-1948.
43. S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi Optimization by simulated annealing Science 220 1982 671 680
44. G. Laporte The traveling salesman problem: an overview of exact and approximate algorithms European Journal of Operational Research 59 1992 231 247 (Pubitemid 23565197)
45. E.L. Lawer, J.K. Lenstra, A.H.G. Rinnoy Kan, and D.B. Shmoys The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization 1985 Wiley and Sons
46. F.X. Le Louarn, M. Gendreau, and J.Y. Potvin GENI ants for the traveling salesman problem Annals of Operations Research 131 2004 187 201 (Pubitemid 39187379)
47. X. Li, P. Tian, J. Hua, N. Zhong, A hybrid discrete particle swarm optimization for the traveling salesman problem, in: SEAL 2006, LNCS, vol. 4247, 2006, pp. 181-188. (Pubitemid 44812337)
48. S. Lin Computer solutions of the traveling salesman problem Bell Systems Technical Journal 44 1965 2245 2269
49. S. Lin, and B.W. Kernighan An effective heuristic algorithm for the traveling salesman problem Operation Research 21 1973 498 516
50. A. Liu, Z. Deng, S. Shan, Mean contribution ant system: an improved version of ant colony optimization for traveling salesman problem, in: SEAL 2006, LNCS, vol. 4247, 2006, pp. 489-496.
51. S.J. Louis, and G. Li Case injected genetic algorithms for traveling salesman problems Information Sciences 122 2000 201 225 (Pubitemid 30550572)
52. T. Machado, and H. Lopez A hybrid particle swarm optimization model for the traveling salesman problem Adaptive and Natural Computing Algorithm 2005 255 258
53. M. Manfrin, M. Birattari, T. Stutzle, M. Dorigo, Parallel ant colony optimization for the traveling salesman problem, in: ANTS 2006, LNCS, vol. 4150, 2006, pp. 224-234. (Pubitemid 44811951)
54. Y. Marinakis, A. Migdalas, and P.M. Pardalos Expanding neighborhood GRASP for the traveling salesman problem Computational Optimization and Applications 32 2005 231 257 (Pubitemid 41406908)
55. Y. Marinakis, A. Migdalas, and P.M. Pardalos A hybrid Genetic-GRASP algorithm using Lagrangean relaxation for the traveling salesman problem Journal of Combinatorial Optimization 10 2005 311 326 (Pubitemid 41660713)
56. Y. Marinakis, A. Migdalas, and P.M. Pardalos Multiple phase neighborhood search GRASP based on Lagrangean relaxation and random backtracking Lin-Kernighan for the traveling salesman problem Journal of Combinatorial Optimization 17 2009 134 156
57. T.A.S. Masutti, and L.N. de Castro A self-organizing neural network using ideas from the immune system to solve the traveling salesman problem Information Sciences 179 2009 1454 1468
58. N. Mladenovic, and P. Hansen Variable neighborhood search Computers and Operations Research 24 1997 1097 1100
59. A. Modares, S. Somhom, and T. Enkawa A self-organizing neural network approach for multiple traveling salesman and vehicle routing problems International Transactions in Operational Research 6 6 1999 591 606
60. D.M. Neto, Efficient cluster compensation for Lin-Kernighan heuristics, Ph.D. Thesis, Computer Science University of Toronto, Canada, 1999.
61. H.D. Nguyen, I. Yoshihara, K. Yamamori, and M. Yasunaga Implementation of an effective hybrid GA for large-scale traveling salesman problems IEEE Transactions on Systems, Man, and Cybernetics Part B: Cybernetic 37 2007 92 99 (Pubitemid 46358484)
62. M. Ninio, and J.J. Schneider Weight annealing Physica A: Statistical and Theoretical Physics 349 3-4 2005 649 666 (Pubitemid 40206398)
63. D.T. Pham, E. Kog, A. Ghanbarzadeh, S. Otri, S. Rahim, and M. Zaidi The bees algorithm - A novel tool for complex optimization problems IPROMS 2006 Proceedings of Second International Virtual Conference on Intelligent Production Machines and Systems 2006 Oxford, Elsevier
64. J.Y. Potvin Genetic algorithms for the traveling salesman problem. Metaheuristics in combinatorial optimization Annals of Operations Research 63 1996 339 370
65. L. Qu, and R. Sun A synergetic approach to genetic algorithms for solving traveling salesman problem Information Sciences 117 1999 267 283 (Pubitemid 30524463)
66. C. Rego, and F. Glover Local search and metaheuristics G. Gutin, A. Punnen, The Traveling Salesman Problem and its Variations 2002 Kluwer Academic Publishers Dordrecht 309 367
67. G. Reinelt The Traveling Salesman, Computational Solutions for TSP Applications 1994 Springer-Verlag Berlin
68. J.F. Rennard, Handbook of research on nature inspired computing for economics and management, Idea Group Reference, Hershey-PA, USA, 2006.
69. M.G.C. Resende, and C.C. Ribeiro Greedy randomized adaptive search procedures F. Glover, G.A. Kochenberger, Handbook of Metaheuristics 2003 Kluwer Academic Publishers Boston 219 249
70. Y. Rochat, and E.D. Taillard Probabilistic diversification and intensification in local search for vehicle routing Journal of Heuristics 1 1995 147 167
71. S. Ronald Routing and scheduling problems L. Chambers, Practical handbook of genetic algorithms - Applications 1995 CRC Press New York 367 430
72. D.J. Rosenkratz, R.E. Stearns, and P.M. Lewis An analysis of several heuristics for the traveling salesman problem SIAM Journal on Computing 6 1977 563 581
73. X.H. Shi, Y.C. Liang, H.P. Lee, C. Lu, and Q.X. Wang Particle swarm optimization-based algorithms for TSP and generalized TSP Information Processing Letters 103 2007 169 176 (Pubitemid 46898376)
74. P.H. Siqueira, M. Teresinha, A. Steiner, and S. Scheer A new approach to solve the traveling salesman problem Neurocomputing 70 4-6 2007 1013 1021 (Pubitemid 46043953)
75. E.D. Taillard Ant systems P.M. Pardalos, M.G.C. Resende, Handbook of Applied Optimization 2002 Oxford University Press 130 138
76. J. Teo, and H.A. Abbass A true annealing approach to the marriage in honey bees optimization algorithm International Journal of Computational Intelligence and Applications 3 2 2003 199 211
77. D. Teodorovic, and M. Dell'Orco Bee colony optimization - A cooperative learning approach to complex transportation problems Advanced OR and AI Methods in Transportation 2005 51 60
78. C.K. Ting, S.T. Li, and C. Lee On the harmonious mating strategy through tabu search Information Sciences 156 2003 189 214
79. C.F. Tsai, C.W. Tsai, and C.C. Tseng A new hybrid heuristic approach for solving large traveling salesman problem Information Sciences 166 2004 6781
80. H.K. Tsai, J.M. Yang, Y.F. Tsai, and C.Y. Kao An evolutionary algorithm for large traveling salesman problems IEEE Transactions on Systems, Man, and Cybernetics - Part B: Cybernetics 34 2004 1718 1729
81. A. Ugur Path planning on a cuboid using genetic algorithms Information Sciences 178 2008 3275 3287
82. Y. Wang, X.Y. Feng, Y.X. Huang, D.B. Pu, W.G. Zhou, Y.C. Liang, and C.G. Zhou A novel quantum swarm evolutionary algorithm and its applications Neurocomputing 70 4-6 2007 633 640 (Pubitemid 46043961)
83. H.F. Wedde, M. Farooq, and Y. Zhang BeeHive: an efficient fault-tolerant routing algorithm inspired by honey bee behavior M. Dorigo, Ant Colony Optimization and Swarm Intelligence LNCS vol. 3172 2004 Springer Berlin 83 94 (Pubitemid 39210704)
84. X.S. Yang Engineering optimizations via nature-inspired virtual bee algorithms J.M. Yang, J.R. Alvarez, IWINAC LNCS vol. 3562 2005 Springer-Verlag Berlin Heidelberg 317 323
85. M. Zachariasen, and M. Dam Tabu search on the geometric traveling salesman problem I.H. Osman, J.P. Kelly, Meta-Heuristics: Theory and Applications 1996 Kluwer Academic Publishers Boston 571 587