Table of Contents Author Guidelines Submit a Manuscript
The Scientific World Journal
Volume 2014 (2014), Article ID 563259, 17 pages
http://dx.doi.org/10.1155/2014/563259
Research Article

Focusing on the Golden Ball Metaheuristic: An Extended Study on a Wider Set of Problems

Deusto Institute of Technology (DeustoTech), University of Deusto, Avenida Universidades 24, 48007 Bilbao, Spain

Received 16 April 2014; Revised 6 June 2014; Accepted 8 June 2014; Published 3 August 2014

Academic Editor: Xin-She Yang

Copyright © 2014 E. Osaba et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. H. P. Schwefel, Numerical Optimization of Computer Models, John Wiley & Sons, 1981.
  2. D. Bertsimas and J. N. Tsitsiklis, Introduction to Linear Optimization, Athena Scientific, Belmont, Mass, USA, 1997.
  3. H. A. Eiselt, G. Pederzoli, and C. L. Sandblom, Continuous Optimization Models, Walter De Gruyter, Berlin, Germany, 1987. View at MathSciNet
  4. C. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Dover Publications, 1998. View at MathSciNet
  5. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, no. 4598, pp. 671–680, 1983. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. F. Glover, “Tabu search—part I,” ORSA Journal on Computing, vol. 1, no. 3, pp. 190–206, 1989. View at Publisher · View at Google Scholar
  7. D. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley Professional, 1989.
  8. K. de Jong, Analysis of the behavior of a class of genetic adaptive systems [Ph.D. thesis], University of Michigan, Michigan, Mich, USA, 1975.
  9. M. Dorigo and C. Blum, “Ant colony optimization theory: a survey,” Theoretical Computer Science, vol. 344, no. 2-3, pp. 243–278, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  10. J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of the IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948, Perth, Wash, USA, December 1995. View at Scopus
  11. H. Ahonen, A. G. de Alvarenga, and A. R. S. Amaral, “Simulated annealing and tabu search approaches for the Corridor Allocation Problem,” European Journal of Operational Research, vol. 232, no. 1, pp. 221–233, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. H. Dezani, R. D. Bassi, N. Marranghello, L. Gomes, F. Damiani, and I. Nunes da Silva, “Optimizing urban traffic flow using genetic algorithm with petri net analysis as fitness function,” Neurocomputing, vol. 124, pp. 162–167, 2014. View at Google Scholar
  13. T. Liao, T. Stützle, M. A. M. de Oca, and M. Dorigo, “A unified ant colony optimization algorithm for continuous optimization,” European Journal of Operational Research, vol. 234, no. 3, pp. 597–609, 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  14. P. C. Pendharkar, “A misclassification cost risk bound based on hybrid particle swarm optimization heuristic,” Expert Systems with Applications, vol. 41, no. 4, pp. 1483–1491, 2014. View at Google Scholar
  15. E. Atashpaz-Gargari and C. Lucas, “Imperialist competitive algorithm: an algorithm for optimization inspired by imperialistic competition,” in Proceedings of the IEEE Congress on Evolutionary Computation (CEC '07), pp. 4661–4667, September 2007. View at Publisher · View at Google Scholar · View at Scopus
  16. S. H. Mirhoseini, S. M. Hosseini, M. Ghanbari, and M. Ahmadi, “A new improved adaptive imperialist competitive algorithm to solve the reconfiguration problem of distribution systems for loss reduction and voltage profile improvement,” International Journal of Electrical Power & Energy Systems, vol. 55, pp. 128–143, 2014. View at Publisher · View at Google Scholar
  17. A. Yazdipour and M. R. Ghaderi, “Optimization of weld bead geometry in gtaw of cp titanium using imperialist competitive algorithm,” The International Journal of Advanced Manufacturing Technology, vol. 72, no. 5–8, pp. 619–625, 2014. View at Google Scholar
  18. D. Karaboga, “An idea based on honey bee swarm for numerical optimization,” Tech. Rep. tr06, Computer Engineering Department, Engineering Faculty, Erciyes University, 2005. View at Google Scholar
  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. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  20. Q.-K. Pan, L. Wang, J.-Q. Li, and J.-H. Duan, “A novel discrete artificial bee colony algorithm for the hybrid flowshop scheduling problem with makespan minimisation,” Omega, vol. 45, pp. 42–56, 2014. View at Publisher · View at Google Scholar
  21. M. K. Apalak, D. Karaboga, and B. Akay, “The artificial bee colony algorithm in layer optimization for the maximum fundamental frequency of symmetrical laminated composite plates,” Engineering Optimization, vol. 46, no. 3, pp. 420–437, 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  22. B. Li, L. G. Gong, and W. l. Yang, “An improved artificial bee colony algorithm based on balance-evolution strategy for unmanned combat aerial vehicle path planning,” The Scientific World Journal, vol. 2014, Article ID 232704, 10 pages, 2014. View at Publisher · View at Google Scholar
  23. Z. W. Geem, J. H. Kim, and G. V. Loganathan, “A new heuristic optimization algorithm: harmony search,” Simulation, vol. 76, no. 2, pp. 60–68, 2001. View at Publisher · View at Google Scholar · View at Scopus
  24. Z. W. Geem, C. Tseng, and J. C. Williams, “Harmony search algorithms for water and environmental systems,” Studies in Computational Intelligence, vol. 191, pp. 113–127, 2009. View at Publisher · View at Google Scholar · View at Scopus
  25. H. Ceylan, O. Baskan, C. Ozan, and G. Gulhan, “Determining on-street parking places in urban road networks using meta-heuristic harmony search algorithm,” in Computer-Based Modelling and Optimization in Transportation, pp. 163–174, Springer, 2014. View at Google Scholar
  26. J. Contreras, I. Amaya, and R. Correa, “An improved variant of the conventional harmony search algorithm,” Applied Mathematics and Computation, vol. 227, pp. 821–830, 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  27. X. S. Yang, “Harmony search as a metaheuristic algorithm,” in Music-Inspired Harmony Search Algorithm, pp. 1–14, Springer, New York, NY, USA, 2009. View at Google Scholar
  28. X. S. Yang, “A new metaheuristic bat-inspired algorithm,” in Nature Inspired Cooperative Strategies for Optimization (NICSO 2010), vol. 284 of Studies in Computational Intelligence, pp. 65–74, Springer, 2010. View at Google Scholar
  29. X. Yang, “Bat algorithm for multi-objective optimisation,” International Journal of Bio-Inspired Computation, vol. 3, no. 5, pp. 267–274, 2011. View at Publisher · View at Google Scholar · View at Scopus
  30. X. S. Yang and S. Deb, “Cuckoo search via Lévy flights,” in Proceedings of the World Congress on Nature and Biologically Inspired Computing (NABIC '09), pp. 210–214, IEEE, December 2009. View at Publisher · View at Google Scholar · View at Scopus
  31. X.-S. Yang and S. Deb, “Engineering optimisation by cuckoo search,” International Journal of Mathematical Modelling and Numerical Optimisation, vol. 1, no. 4, pp. 330–343, 2010. View at Publisher · View at Google Scholar · View at Scopus
  32. X. S. Yang, “Firefly algorithms for multimodal optimization,” in Stochastic Algorithms: Foundations and Applications, vol. 5792 of Lecture Notes in Computer Science, pp. 169–178, Springer, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  33. X. Yang, “Firefly algorithm, stochastic test functions and design optimization,” International Journal of Bio-Inspired Computation, vol. 2, no. 2, pp. 78–84, 2010. View at Publisher · View at Google Scholar · View at Scopus
  34. D. Rodrigues, L. A. Pereira, R. Y. Nakamura et al., “A wrapper approach for feature selection based on bat algorithm and optimum-path forest,” Expert Systems with Applications, vol. 41, no. 5, pp. 2250–2258, 2014. View at Publisher · View at Google Scholar
  35. B. Bahmani-Firouzi and R. Azizipanah-Abarghooee, “Optimal sizing of battery energy storage for micro-grid operation management using a new improved bat algorithm,” International Journal of Electrical Power & Energy Systems, vol. 56, pp. 42–54, 2014. View at Publisher · View at Google Scholar
  36. O. Hasançebi and S. Carbas, “Bat inspired algorithm for discrete size optimization of steel frames,” Advances in Engineering Software, vol. 67, pp. 173–185, 2014. View at Publisher · View at Google Scholar
  37. I. Fister, S. Fong, J. Brest, and I. Fister, “A novel hybrid self-adaptive bat algorithm,” The Scientific World Journal, vol. 2014, Article ID 709738, 12 pages, 2014. View at Publisher · View at Google Scholar
  38. X. Yang and S. Deb, “Cuckoo search: recent advances and applications,” Neural Computing and Applications, vol. 24, no. 1, pp. 169–174, 2014. View at Publisher · View at Google Scholar · View at Scopus
  39. M. Marichelvam, T. Prabaharan, and X. S. Yang, “Improved cuckoo search algorithm for hybrid flow shop scheduling problems to minimize makespan,” Applied Soft Computing, vol. 19, pp. 93–101, 2014. View at Publisher · View at Google Scholar
  40. J. H. Yi, W. H. Xu, and Y. T. Chen, “Novel back propagation optimization by cuckoo search algorithm,” The Scientific World Journal, vol. 2014, Article ID 878262, 8 pages, 2014. View at Publisher · View at Google Scholar
  41. I. Fister Jr., X. S. Yang, D. Fister, and I. Fister, “Cuckoo search: a brief literature review,” in Cuckoo Search and Firefly Algorithm, pp. 49–62, Springer, New York, NY, USA, 2014. View at Google Scholar
  42. I. Fister, X. S. Yang, D. Fister, and I. Fister Jr., “Firefly algorithm: a brief review of the expanding literature,” in Cuckoo Search and Firefly Algorithm, Studies in Computational Intelligence, pp. 347–360, Springer, 2014. View at Publisher · View at Google Scholar
  43. I. Fister, I. Fister Jr., X. S. Yang, and J. Brest, “A comprehensive review of firefly algorithms,” Swarm and Evolutionary Computation, vol. 13, pp. 34–46, 2013. View at Publisher · View at Google Scholar · View at Scopus
  44. J. C. Bansal, H. Sharma, S. S. Jadon, and M. Clerc, “Spider monkey optimization algorithm for numerical optimization,” Memetic Computing, vol. 6, no. 1, pp. 31–47, 2013. View at Google Scholar
  45. C. Dai, Y. Zhu, and W. Chen, “Seeker optimization algorithm,” in Computational Intelligence and Security, pp. 167–176, Springer, New York, NY, USA, 2007. View at Google Scholar
  46. J. K. Lenstra and A. H. G. R. Kan, “Complexity of vehicle routing and scheduling problems,” Networks, vol. 11, no. 2, pp. 221–227, 1981. View at Publisher · View at Google Scholar · View at Scopus
  47. C. Papadimitriou, “The new faces of combinatorial optimization,” in Combinatorial Optimization, vol. 7422 of Lecture Notes in Computer Science, pp. 19–23, Springer, New York, NY, USA, 2012. View at Publisher · View at Google Scholar
  48. G. Donets and I. Sergienko, “A method for modeling the structure of initial data and subclasses of solvable combinatorial optimization problems,” Cybernetics and Systems Analysis, vol. 50, no. 1, pp. 1–7, 2014. View at Publisher · View at Google Scholar
  49. E. Osaba, E. Onieva, R. Carballedo, F. Diaz, A. Perallos, and X. Zhang, “A multi-crossover and adaptive island based population algorithm for solving routing problems,” Journal of Zhejiang University Science C, vol. 14, no. 11, pp. 815–821, 2013. View at Google Scholar
  50. E. Osaba, F. Diaz, and E. Onieva, “A novel meta-heuristic based on soccer concepts to solve routing problems,” in Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation (GECCO '13), pp. 1743–1744, ACM, July 2013. View at Publisher · View at Google Scholar · View at Scopus
  51. E. Osaba, F. Diaz, and E. Onieva, “Golden ball: a novel meta-heuristic to solve combinatorial optimization problems based on soccer concepts,” Applied Intelligence, vol. 41, no. 1, pp. 145–166, 2014. View at Google Scholar
  52. E. Lawler, J. Lenstra, A. Kan, and D. Shmoys, The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, vol. 3, John Wiley & Sons, New York, NY, USA, 1985.
  53. G. Laporte, “The vehicle routing problem: an overview of exact and approximate algorithms,” European Journal of Operational Research, vol. 59, no. 3, pp. 345–358, 1992. View at Publisher · View at Google Scholar · View at Scopus
  54. E. Cantú-Paz, “A survey of parallel genetic algorithms,” Calculateurs Paralleles, Reseaux et Systems Repartis, vol. 10, no. 2, pp. 141–171, 1998. View at Google Scholar
  55. E. Alba and J. M. Troya, “A survey of parallel distributed genetic algorithms: a structured and extensive overview on an up-to-date search paradigm,” Complexity, vol. 4, no. 4, pp. 31–52, 1999. View at Publisher · View at Google Scholar · View at MathSciNet
  56. A. M. Frieze, G. Galbiati, and F. Maffioli, “On the worst-case performance of some algorithms for the asymmetric traveling salesman problem,” Networks, vol. 12, no. 1, pp. 23–39, 1982. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  57. B. Golden, E. Baker, J. Alfaro, and J. Schaffer, “The vehicle routing problem with backhauling: two approaches,” in Proceedings of the 21st Annual Meeting of SE TIMS, pp. 90–92, South Carolina, SC, USA, 1985.
  58. I. Rivin, I. Vardi, and P. Zimmermann, “The n-queens problem,” The American Mathematical Monthly, vol. 101, no. 7, pp. 629–639, 1994. View at Publisher · View at Google Scholar · View at MathSciNet
  59. S. Martello and P. Toth, Knapsack Problems: Algorithms and Computer Implementations, Wiley, New York, NY, USA, 1990.
  60. S. Lin, “Computer solutions of the traveling salesman problem,” The Bell System Technical Journal, vol. 44, pp. 2245–2269, 1965. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  61. L. Davis, “Applying adaptive algorithms to epistatic domains,” in Proceedings of the International Joint Conference on Artificial Intelligence, vol. 1, pp. 161–163, 1985.
  62. D. E. Goldberg and R. Lingle, “Alleles, loci, and the traveling salesman problem,” in Proceedings of the 1st International Conference on Genetic Algorithms and Their Applications, pp. 154–159, Lawrence Erlbaum Associates, 1985.
  63. J. LaRusic and A. P. Punnen, “The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis,” Computers & Operations Research, vol. 43, pp. 20–35, 2014. View at Google Scholar
  64. J. Bai, G. K. Yang, Y. W. Chen, L. S. Hu, and C. C. Pan, “A model induced max-min ant colony optimization for asymmetric traveling salesman problem,” Applied Soft Computing Journal, vol. 13, no. 3, pp. 1365–1375, 2013. View at Publisher · View at Google Scholar · View at Scopus
  65. P. Larrañaga, C. M. H. Kuijpers, R. H. Murga, I. Inza, and S. Dizdarevic, “Genetic algorithms for the travelling salesman problem: a review of representations and operators,” Artificial Intelligence Review, vol. 13, no. 2, pp. 129–170, 1999. View at Publisher · View at Google Scholar · View at Scopus
  66. S. Salhi, N. Wassan, and M. Hajarat, “The fleet size and mix vehicle routing problem with backhauls: formulation and set partitioning-based heuristics,” Transportation Research E: Logistics and Transportation Review, vol. 56, pp. 22–35, 2013. View at Publisher · View at Google Scholar · View at Scopus
  67. S. P. Anbuudayasankar, K. Ganesh, S. C. Lenny Koh, and Y. Ducq, “Modified savings heuristics and genetic algorithm for bi-objective vehicle routing problem with forced backhauls,” Expert Systems with Applications, vol. 39, no. 3, pp. 2296–2305, 2012. View at Publisher · View at Google Scholar · View at Scopus
  68. A. A. Juan, J. Faulin, E. Pérez-Bernabeu, and N. Jozefowiez, “Horizontal cooperation in vehicle routing problems with backhauling and environmental criteria,” Procedia-Social and Behavioral Sciences, vol. 111, pp. 1133–1141, 2014. View at Google Scholar
  69. P. Toth and D. Vigo, “Vrp with backhauls,” in The Vehicle Routing Problem, vol. 9 of SIAM Monographs on Discrete Mathematics and Applications, pp. 195–221, 2002. View at Google Scholar
  70. The vehicle routing problem, vol. 9 of SIAM Monographs on Discrete Mathematics and Applications, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 2002. View at Publisher · View at Google Scholar · View at MathSciNet
  71. J. Bell and B. Stevens, “A survey of known results and research areas for n-queens,” Discrete Mathematics, vol. 309, no. 1, pp. 1–31, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  72. M. Bezzel, “Proposal of 8-queens problem,” Berliner Schachzeitung, vol. 3, p. 363, 1848. View at Google Scholar
  73. X. Hu, R. C. Eberhart, and Y. Shi, “Swarm intelligence for permutation optimization: a case study of n-queens problem,” in Proceedings of the IEEE Swarm Intelligence Symposium (SIS '03), pp. 243–246, April 2003. View at Publisher · View at Google Scholar
  74. E. Masehian and H. a. . Akbaripour, “Landscape analysis and efficient metaheuristics for solving the n-queens problem,” Computational Optimization and Applications, vol. 56, no. 3, pp. 735–764, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  75. I. Martinjak and M. Golub, “Comparison of heuristic algorithms for the n-queen problem,” in Proceedings of the 29th International Conference on Information Technology Interfaces (ITI '07), pp. 759–764, Cavtat, Croatia, June 2007. View at Publisher · View at Google Scholar · View at Scopus
  76. K. Fleszar and C. Charalambous, “Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem,” European Journal of Operational Research, vol. 210, no. 2, pp. 176–184, 2011. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  77. K. Sim, E. Hart, and B. Paechter, “A hyper-heuristic classifier for one dimensional bin packing problems: Improving classification accuracy by attribute evolution,” in Proceeding of the 12th Conference on Parallel Problem Solving from Nature, pp. 348–357, Springer, 2012.
  78. K. Sim and E. Hart, “Generating single and multiple cooperative heuristics for the one dimensional bin packing problem using a single node genetic programming island model,” in Proceedings of the 15th Genetic and Evolutionary Computation Conference (GECCO '13), pp. 1549–1556, ACM, July 2013. View at Publisher · View at Google Scholar · View at Scopus
  79. M. Tomassini, “A survey of genetic algorithms,” Annual Reviews of Computational Physics, vol. 3, no. 2, pp. 87–118, 1995. View at Google Scholar
  80. D. B. Fogel, “Introduction to simulated evolutionary optimization,” IEEE Transactions on Neural Networks, vol. 5, no. 1, pp. 3–14, 1994. View at Publisher · View at Google Scholar · View at Scopus
  81. E. Osaba, R. Carballedo, F. Diaz, and A. Perallos, “Analysis of the suitability of using blind crossover operators in genetic algorithms for solving routing problems,” in Proceedings of the 8th IEEE International Symposium on Applied Computational Intelligence and Informatics (SACI '13), pp. 17–22, 2013.
  82. K. Rocki and R. Suda, “Accelerating 2-opt and 3-opt local search using GPU in the travelling salesman problem,” in Proceedings of the 10th Annual International Conference on High Performance Computing and Simulation (HPCS '12), pp. 489–495, Madrid, Spain, July 2012. View at Publisher · View at Google Scholar · View at Scopus
  83. H. Nagarajan, P. Wei, S. Rathinam, and D. Sun, “Heuristics for synthesizing robust networks with a diameter constraint,” Mathematical Problems in Engineering, vol. 2014, Article ID 326963, 11 pages, 2014. View at Publisher · View at Google Scholar · View at MathSciNet
  84. J.-F. Cordeau and G. Laporte, “A tabu search heuristic for the static multi-vehicle dial-a-ride problem,” Transportation Research B: Methodological, vol. 37, no. 6, pp. 579–594, 2003. View at Publisher · View at Google Scholar · View at Scopus
  85. E. Osaba, E. Onieva, R. Carballedo, F. Diaz, and A. Perallos, “An adaptive multi-crossover population algorithm for solving routing problems,” in Proceedings of the 6th International Workshop on Nature Inspired Cooperative Strategies for Optimization, pp. 113–124, Springer, New York, NY, USA, 2014.
  86. C. D. Tarantilis, “Solving the vehicle routing problem with adaptive memory programming methodology,” Computers and Operations Research, vol. 32, no. 9, pp. 2309–2327, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  87. M. Savelsbergh, “The vehicle routing problem with time windows: minimizing route duration,” ORSA Journal on Computing, vol. 4, no. 2, pp. 146–154, 1992. View at Publisher · View at Google Scholar · View at Scopus
  88. G. Reinelt, “TSPLIB: a traveling salesman problem library,” ORSA Journal on Computing, vol. 3, no. 4, pp. 376–384, 1991. View at Publisher · View at Google Scholar · View at Scopus