Abstract
Over the past few decades, metaheuristics have been emerged to combine basic heuristic techniques in higher level frameworks to explore a search space in an efficient and an effective way. Particle swarm optimization (PSO) is one of the most important method in meta- heuristics methods, which is used for solving unconstrained global optimization prblems. In this paper, a new hybrid PSO algorithm is combined with variable neighborhood search (VNS) algorithm in order to search for the global optimal solutions for unconstrained global optimization problems. The proposed algorithm is called a hybrid particle swarm optimization with a variable neighborhood search algorithm (HPSOVNS). HPSOVNS aims to combine the PSO algorithm with its capability of making wide exploration and deep exploitation and the VNS algorithm as a local search algorithm to refine the overall best solution found so far in each iteration. In order to evaluate the performance of HPSOVNS, we compare its performance on nine different kinds of test benchmark functions with four particle swarm optimization based algorithms with different varieties. The results show that HPSOVNS algorithm achieves better performance and faster than the other algorithms.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Birru, H.K., Chellapilla, K., Rao, S.S.: Local search operators in fast evolutionary programming. In: Proc. of the 1999 Congr. on Evol. Comput., vol. 2, pp. 1506–1513 (1999)
Dorigo, M.: Optimization, Learning and Natural Algorithms. Ph.D. Thesis, Politecnico di Milano, Italy (1992)
Glover, F.: A template for scatter search and path relinking. In: Hao, J.-K., Lutton, E., Ronald, E., Schoenauer, M., Snyers, D. (eds.) AE 1997. LNCS, vol. 1363, pp. 13–54. Springer, Heidelberg (1998)
Glover, F.: Future paths for integer programming and links to artificialintelligence. Computers and Operations Research 13, 533–549 (1986)
Gong, M., Jiao, L., Zhang, L.: Baldwinian learning in clonal selection algorithm for optimization. Information Sciences 180, 1218–1236 (2010)
Hedar, A., Ali, A.F.: Tabu search with multi-level neighborhood structures for high dimensional problems. Appl. Intell. 37, 189–206 (2012)
Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)
Kennedy, J., Eberhart, R.: Particle Swarm Optimization. In: Proceedings of the IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948 (1995)
Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing. Science 220, 671–680 (1983)
KoroS̃ec, P., S̃ilc, J., Filipic, B.: The differential ant-stigmergy algorithm. Information Sciences 192, 82–97 (2012)
Krasnogor, N., Smith, J.E.: A tutorial for competent memetic algorithms: model, taxonomy, and design issue. IEEE Trans. Evol. Comput. 9(5), 474–488 (2005)
Lee, C.Y., Yao, X.: Evolutionary programming using mutations based on the Lvy probability distribution. IEEE Transactions on Evolutionary Computation 8, 1–13 (2004)
Liu, B., Wang, L., Jin, Y.H.: An effective PSO-based memetic algorithm for flow shop scheduling. IEEE Trans. Syst. Man Cybern. 37(1), 18–27 (2007)
Mladenovic, N.: Avariable neighborhood algorithm a new metaheuristic for combinatorial optimization. Abstracts of Papers Presented at Optimization Days, Montral, Canada, p. 112 (1995)
Mladenovic, M., Hansen, P.: Variable neighborhood search. Computers and Operations Research 24, 1097–1100 (1997)
Molina, D., Lozano, M., Herrera, F.: Memetic algorithm with local search chaining for large scale continuous optimization problems. In: Proceedings of the 2009 IEEE Congress on Evolutionary Computation, Trondheim, Norway, pp. 830–837 (2009)
Neri, F., Tirronen, V.: Scale factor local search in differential evolution. Memetic Comput. J. 1(2), 153–171 (2009)
Petalas, Y.G., Parsopoulos, K.E., Vrahatis, M.N.: Memetic particle swarm optimization. Ann. Oper. Res. 156, 99–127 (2007)
Storn, R., Price, K.: Differential evolutiona simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization 11, 341–359 (1997)
Sttzle, T.: Local Search Algorithms for Combinatorial Problems: Analysis, Improvements, and New Applications. Ph.D. Thesis, Darmstadt University of Technology (1998)
Tirronen, V., Neri, F., Karkkainen, T., Majava, K., Rossi, T.: An enhanced memetic differential evolution in filter design for defect detection in paper production. Evol. Comput. J. 16(4), 529–555 (2008)
Trelea, I.C.: The particle swarm optimization algorithm. Convergence analysis and parameter selection. Information Processing Letters 85, 317–325 (2003)
Wang, Y.X., Zhao, Z.D., Ren, R.: Hybrid particle swarm optimizer with tabu strategy for global numerical optimization. In: Proc. of the 2007 Congr. on Evol. Comput., pp. 2310–2316 (2007)
Yang, Z., Tang, K., Yao, X.: Large scale evolutionary optimization using cooperative coevolution. Information Sciences 178, 2985–2999 (2008)
Zhong, W., Liu, J., Xue, M., Jiao, L.: A multiagent genetic algorithm for global numerical optimization. IEEE Transactions on Systems, Man, and Cybernetics-Part B 34(2), 1128–1141 (2004)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Ali, A.F., Hassanien, A.E., Snášel, V., Tolba, M.F. (2014). A New Hybrid Particle Swarm Optimization with Variable Neighborhood Search for Solving Unconstrained Global Optimization Problems. In: Kömer, P., Abraham, A., Snášel, V. (eds) Proceedings of the Fifth International Conference on Innovations in Bio-Inspired Computing and Applications IBICA 2014. Advances in Intelligent Systems and Computing, vol 303. Springer, Cham. https://doi.org/10.1007/978-3-319-08156-4_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-08156-4_16
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-08155-7
Online ISBN: 978-3-319-08156-4
eBook Packages: EngineeringEngineering (R0)