IDEAS home Printed from https://ideas.repec.org/a/eee/matcom/v179y2021icp194-212.html
   My bibliography  Save this article

GEPSO: A new generalized particle swarm optimization algorithm

Author

Listed:
  • Sedighizadeh, Davoud
  • Masehian, Ellips
  • Sedighizadeh, Mostafa
  • Akbaripour, Hossein

Abstract

Particle Swarm Optimization (PSO) algorithm is a nature-inspired meta-heuristic that has been utilized as a powerful optimization tool in a wide range of applications since its inception in 1995. Due to the flexibility of its parameters and concepts, PSO has appeared in many variants, probably more than any other meta-heuristic algorithm. This paper introduces the Generalized Particle Swarm Optimization (GEPSO) algorithm as a new version of the PSO algorithm for continuous space optimization, which enriches the original PSO by incorporating two new terms into the velocity updating equation. These terms aim to deepen the interrelations of particles and their knowledge sharing, increase variety in the swarm, and provide a better search in unexplored areas of the search space. Moreover, a novel procedure is utilized for dynamic updating of the particles’ inertia weights, which controls the convergence of the swarm towards a solution. Also, since parameters of heuristic and meta-heuristic algorithms have a significant influence on their performance, a comprehensive guideline for parameter tuning of the GEPSO is developed. The computational results of solving numerous well-known benchmark functions by the GEPSO, original PSO, Repulsive PSO (REPSO), PSO with Passive Congregation (PSOPC), Negative PSO (NPSO), Deterministic PSO (DPSO), and Line Search-Based Derivative-Free PSO (LS-DF-PSO) approaches showed that the GEPSO outperformed the compared methods in terms of mean and standard deviation of fitness function values and runtimes.

Suggested Citation

  • Sedighizadeh, Davoud & Masehian, Ellips & Sedighizadeh, Mostafa & Akbaripour, Hossein, 2021. "GEPSO: A new generalized particle swarm optimization algorithm," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 179(C), pages 194-212.
    • Handle: RePEc:eee:matcom:v:179:y:2021:i:c:p:194-212
    DOI: 10.1016/j.matcom.2020.08.013
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378475420302743
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.matcom.2020.08.013?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Luan, Jing & Yao, Zhong & Zhao, Futao & Song, Xin, 2019. "A novel method to solve supplier selection problem: Hybrid algorithm of genetic algorithm and ant colony optimization," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 156(C), pages 294-309.
    2. Chuanwen, Jiang & Bompard, Etorre, 2005. "A hybrid method of chaotic particle swarm optimization and linear interior for reactive power optimisation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 68(1), pages 57-65.
    3. Ong, Seng-Huat & Lee, Wen-Jau & Low, Yeh-Ching, 2020. "A general method of computing mixed Poisson probabilities by Monte Carlo sampling," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 170(C), pages 98-106.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Kezong Tang & Xiong-Fei Wei & Yuan-Hao Jiang & Zi-Wei Chen & Lihua Yang, 2023. "An Adaptive Ant Colony Optimization for Solving Large-Scale Traveling Salesman Problem," Mathematics, MDPI, vol. 11(21), pages 1-26, October.
    2. Martín Montes Rivera & Carlos Guerrero-Mendez & Daniela Lopez-Betancur & Tonatiuh Saucedo-Anaya, 2023. "Dynamical Sphere Regrouping Particle Swarm Optimization: A Proposed Algorithm for Dealing with PSO Premature Convergence in Large-Scale Global Optimization," Mathematics, MDPI, vol. 11(20), pages 1-40, October.
    3. Yang, Xu & Li, Hongru, 2023. "Multi-sample learning particle swarm optimization with adaptive crossover operation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 208(C), pages 246-282.
    4. Abd-Elhaleem, Sameh & Shoeib, Walaa & Sobaih, Abdel Azim, 2023. "A new power management strategy for plug-in hybrid electric vehicles based on an intelligent controller integrated with CIGPSO algorithm," Energy, Elsevier, vol. 265(C).

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Zhang, Hong & Nguyen, Hoang & Bui, Xuan-Nam & Pradhan, Biswajeet & Mai, Ngoc-Luan & Vu, Diep-Anh, 2021. "Proposing two novel hybrid intelligence models for forecasting copper price based on extreme learning machine and meta-heuristic algorithms," Resources Policy, Elsevier, vol. 73(C).
    2. Changchun Cai & Bing Jiang & Lihua Deng, 2015. "General Dynamic Equivalent Modeling of Microgrid Based on Physical Background," Energies, MDPI, vol. 8(11), pages 1-20, November.
    3. Xiaxia Ma & Wenliang Bian & Wenchao Wei & Fei Wei, 2022. "Customer-Centric, Two-Product Split Delivery Vehicle Routing Problem under Consideration of Weighted Customer Waiting Time in Power Industry," Energies, MDPI, vol. 15(10), pages 1-23, May.
    4. Jadoon, Ihtesham & Raja, Muhammad Asif Zahoor & Junaid, Muhammad & Ahmed, Ashfaq & Rehman, Ata ur & Shoaib, Muhammad, 2021. "Design of evolutionary optimized finite difference based numerical computing for dust density model of nonlinear Van-der Pol Mathieu’s oscillatory systems," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 181(C), pages 444-470.
    5. Qin, Rui & Liu, Yan-Kui, 2010. "Modeling data envelopment analysis by chance method in hybrid uncertain environments," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 80(5), pages 922-950.
    6. Dinesh Karunanidy & Subramanian Ramalingam & Ankur Dumka & Rajesh Singh & Mamoon Rashid & Anita Gehlot & Sultan S. Alshamrani & Ahmed Saeed AlGhamdi, 2022. "JMA: Nature-Inspired Java Macaque Algorithm for Optimization Problem," Mathematics, MDPI, vol. 10(5), pages 1-28, February.
    7. Pannee Suanpang & Pitchaya Jamjuntr & Kittisak Jermsittiparsert & Phuripoj Kaewyong, 2022. "Tourism Service Scheduling in Smart City Based on Hybrid Genetic Algorithm Simulated Annealing Algorithm," Sustainability, MDPI, vol. 14(23), pages 1-21, December.
    8. Martinez-Rojas, Marcela & Sumper, Andreas & Gomis-Bellmunt, Oriol & Sudrià-Andreu, Antoni, 2011. "Reactive power dispatch in wind farms using particle swarm optimization technique and feasible solutions search," Applied Energy, Elsevier, vol. 88(12), pages 4678-4686.
    9. Tatsumi, Keiji & Ibuki, Takeru & Tanino, Tetsuzo, 2015. "Particle swarm optimization with stochastic selection of perturbation-based chaotic updating system," Applied Mathematics and Computation, Elsevier, vol. 269(C), pages 904-929.
    10. Yang, Xu & Li, Hongru, 2023. "Multi-sample learning particle swarm optimization with adaptive crossover operation," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 208(C), pages 246-282.
    11. Ren-Jie Mao & Jian-Xin You & Chun-Yan Duan & Lu-Ning Shao, 2019. "A Heterogeneous MCDM Framework for Sustainable Supplier Evaluation and Selection Based on the IVIF-TODIM Method," Sustainability, MDPI, vol. 11(18), pages 1-16, September.
    12. Zahir Sahli & Abdellatif Hamouda & Abdelghani Bekrar & Damien Trentesaux, 2018. "Reactive Power Dispatch Optimization with Voltage Profile Improvement Using an Efficient Hybrid Algorithm †," Energies, MDPI, vol. 11(8), pages 1-21, August.
    13. Faten Aljalaud & Heba Kurdi & Kamal Youcef-Toumi, 2023. "Bio-Inspired Multi-UAV Path Planning Heuristics: A Review," Mathematics, MDPI, vol. 11(10), pages 1-35, May.
    14. Giuseppe Guido & Sina Shaffiee Haghshenas & Sami Shaffiee Haghshenas & Alessandro Vitale & Vittorio Astarita & Ashkan Shafiee Haghshenas, 2020. "Feasibility of Stochastic Models for Evaluation of Potential Factors for Safety: A Case Study in Southern Italy," Sustainability, MDPI, vol. 12(18), pages 1-24, September.
    15. Peng-Sheng You & Ming-Hsiang Chen & Ching-Hui (Joan) Su, 2021. "Travel agent’s tour selection and sightseeing bus schedule for group package tour planning," Tourism Economics, , vol. 27(1), pages 220-242, February.
    16. Marwa F. Mohamed & Mohamed Meselhy Eltoukhy & Khalil Al Ruqeishi & Ahmad Salah, 2023. "An Adapted Multi-Objective Genetic Algorithm for Healthcare Supplier Selection Decision," Mathematics, MDPI, vol. 11(6), pages 1-14, March.
    17. Abrar Yaqoob & Rabia Musheer Aziz & Navneet Kumar Verma & Praveen Lalwani & Akshara Makrariya & Pavan Kumar, 2023. "A Review on Nature-Inspired Algorithms for Cancer Disease Prediction and Classification," Mathematics, MDPI, vol. 11(5), pages 1-32, February.
    18. Tatsumi, Keiji & Obita, Yoshinori & Tanino, Tetsuzo, 2009. "Chaos generator exploiting a gradient model with sinusoidal perturbations for global optimization," Chaos, Solitons & Fractals, Elsevier, vol. 42(3), pages 1705-1723.
    19. Acharjee, P. & Mallick, S. & Thakur, S.S. & Ghoshal, S.P., 2011. "Detection of maximum loadability limits and weak buses using Chaotic PSO considering security constraints," Chaos, Solitons & Fractals, Elsevier, vol. 44(8), pages 600-612.
    20. Rukiye Kaya & Said Salhi & Virginia Spiegler, 2023. "A novel integration of MCDM methods and Bayesian networks: the case of incomplete expert knowledge," Annals of Operations Research, Springer, vol. 320(1), pages 205-234, January.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:179:y:2021:i:c:p:194-212. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.