Chaotic multi-swarm particle swarm approach for solving numerical optimization problems

  • Authors

    • Asmaa Hussein Alwan Department of computer center, Ibn Rushd, University of Baghdad, Baghdad, Iraq
    • Abdullah Hasan Ali Supervision & Scientific Evaluation, Ministry of Higher Education and Scientific Research, Baghdad, Iraq
    2018-12-17
    https://doi.org/10.14419/ijet.v7i4.19991
  • Optimization, Operational Research, Numerical Problems, Chaotic Maps, Meeting Room Approach.

  • Different fields of study are faced with several optimization problems which can either be discrete, nonlinear, linear, continuous, non-smooth, or non-convex in nature. The continuously differentiable problems can be handled using several conventional methods such as the gradient-based methods, but such methods may not be ideal for the complex problems such as the non-convex or non- differentiable prob-lems. Despite the existing number of methods for solving complex optimization problems, achieving optimal results is still difficult without much computational effort and cost input. The Particle Swarm Optimization (PSO) algorithm is a common optimization algorithm which is still suffering from an unbalanced local search (exploitation) and global search (exploration). The Meeting Room Approach (MRA) was recently developed as a multi-swarm model which for enhancing the exploration and exploitation in the PSO algorithm. In proposed Multi-swarm approach, the algorithm starts from a uniformly generated positions, which may start from not good positions. In other words, the algorithm may have a slow convergence due to the initial positions. In this paper, a Logistic map was used to initiate a multi-swarm PSO to enable it to start from better positions. The performance of the proposed algorithm was evaluated on several numerical optimization problems and its convergence was found to be faster compared to the original model.

     

     

     

     

  • References

    1. [1] S. Koziel, X.S. Yang, Computational optimization, methods and algorithms, 2011. https://doi.org/10.1007/978-3-642-20859-1.

      [2] T. Weise, M. Zapf, R. Chiong, A.J. Nebro, Why Is Optimization Difficult? In: R. Chiong (Ed.), Nature-Inspired Algorithms Optim. Springer Berlin Heidelberg, Berlin, Heidelberg, 2009: pp. 1–50. https://doi.org/10.1007/978-3-642-00267-0_1.

      [3] S. Mirjalili, SCA: A Sine Cosine Algorithm for solving optimization problems, Knowledge-Based Syst. 96 (2016) 120–133. https://doi.org/10.1016/j.knosys.2015.12.022.

      [4] C. Arango, P. Cortes, L. Onieva, A. Escudero, Simulation-optimization models for the dynamic berth allocation problem, Comput. Civ. Infrastruct. Eng. 28 (2013) 769–779 https://doi.org/10.1111/mice.12049.

      [5] J.Y.J. Chow, Activity-based travel scenario analysis with routing problem reoptimization, Comput. Civ. Infrastruct. Eng. 29 (2014) 91–106. https://doi.org/10.1111/mice.12023.

      [6] X. Chen, L. Zhang, X. He, C. Xiong, Z. Li, Surrogate-Based Optimization of Expensive-to-Evaluate Objective for Optimal Highway Toll Charges in Transportation Network, Comput. Civ. Infrastruct. Eng. 29 (2014) 359–381. https://doi.org/10.1111/mice.12058.

      [7] L. Jia, Y. Wang, L. Fan, Multiobjective bilevel optimization for production-distribution planning problems using hybrid genetic algorithm, Integr. Comput. Aided. Eng. 21 (2014) 77–90. https://doi.org/10.3233/ICA-130452.

      [8] R. Faturechi, E. Miller-Hooks, a Mathematical Framework for Quantifying and Optimizing Protective Actions for Civil Infrastructure Systems, Comput. Civ. Infrastruct. Eng. 29 (2014) 572–589. https://doi.org/10.1111/mice.12027.

      [9] M. Aldwaik, H. Adeli, Advances in optimization of highrise building structures, Struct. Multidiscip. Optim.50 (2014) 899–919. https://doi.org/10.1007/s00158-014-1148-1.

      [10] H. Adeli, O. Kamal, Efficient optimization of space trusses, Comput. Struct.24 (1986) 501–511. https://doi.org/10.1016/0045-7949(86)90327-5.

      [11] R. Smith, E. Ferrebee, Y. Ouyang, J. Roesler, Optimal Staging Area Locations and Material Recycling Strategies for Sustainable Highway Reconstruction, Comput. Civ. Infrastruct. Eng. 29 (2014) 559–571. https://doi.org/10.1111/mice.12089.

      [12] F. Peng, Y. Ouyang, Optimal clustering of railroad track maintenance jobs, Comput. Civ. Infrastruct. Eng. 29 (2014) 235–247. https://doi.org/10.1111/mice.12036.

      [13] H. Adeli, K.C. Sarma, Cost Optimization of Structures: Fuzzy Logic, Genetic Algorithms, and Parallel Computing, 2006. https://doi.org/10.1002/0470867353.

      [14] S. Boyd, L. Vandenberghe, M. Grant, Advances in Convex Optimization, in 2006 Chinese Control Conf., 2006: p. PL-40-PL-40. https://doi.org/10.1109/CHICC.2006.280567.

      [15] D. Luo, Z. Ibrahim, Z. Ismail, B. Xu, Optimization of the geometries of biconical tapered fiber sensors for monitoring the early-age curing temperatures of concrete specimens, Comput. Civ. Infrastruct. Eng. 28 (2013) 531–541. https://doi.org/10.1111/mice.12022.

      [16] X.S. Yang, Nature-Inspired Metaheuristic Algorithms, 2010. https://doi.org/10.1016/B978-0-12-416743-8.00005-1.

      [17] R. Eberhart, J. Kennedy, A new optimizer using particle swarm theory, MHS’95. Proc. Sixth Int. Symp. Micro Mach. Hum. Sci. (1995) 39–43. https://doi.org/10.1109/MHS.1995.494215.

      [18] R. Eberhart, J. Kennedy, A new optimizer using particle swarm theory, in: Micro Mach. Hum. Sci. 1995. MHS’95. Proc. Sixth Int. Symp., 1995: pp. 39–43. https://doi.org/10.1109/MHS.1995.494215.

      [19] S.Q. Salih, A.A. Alsewari, Solving large-scale problems using multi-swarm particle swarm approach, Int. J. Eng. Technol. 7 (2018) 1725–1729.

      [20] S.Q. Salih, A.A. Alsewari, B. Al-Khateeb, M.F. Zolkipli, And Novel Multi-Swarm Approach for Balancing Exploration and Exploitation in Particle Swarm Optimization, in: 3rd Int. Conf. Reliab. Inf. Commun. Technol. 2018 (IRICT 2018), Springer, 2018.

      [21] S.Q. Salih, A.A. Alsewari, B. Al-Khateeb, M.F. Zolkipli, Novel Multi-swarm Approach for Balancing Exploration and Exploitation in Particle Swarm Optimization, in: Recent Trends Data Sci. Soft Comput Springer International Publishing, Cham, 2019: pp. 196–206. https://doi.org/10.1007/978-3-319-99007-1_19.

      [22] M. Jamil, X.S. Yang, H.J.D. Zepernick, Test Functions for Global Optimization: A Comprehensive Survey, in: Swarm Intell. Bio-Inspired Comput. 2013: pp. 193–222. https://doi.org/10.1016/B978-0-12-405163-8.00008-9.

      [23] M. Clerc, Standard PSO 2011 (SPSO), Part. Swarm Cent. (2011). https://www.particleswarm.info/Programs.html.

      [24] B. Niu, Y. Zhu, X. He, H. Wu, MCPSO: A multi-swarm cooperative particle swarm optimizer, Appl. Math. Comput.185 (2007) 1050–1062. https://doi.org/10.1016/j.amc.2006.07.026.

  • Downloads

  • How to Cite

    Hussein Alwan, A., & Hasan Ali, A. (2018). Chaotic multi-swarm particle swarm approach for solving numerical optimization problems. International Journal of Engineering & Technology, 7(4), 4146-4150. https://doi.org/10.14419/ijet.v7i4.19991