IDEAS home Printed from https://ideas.repec.org/a/spr/snopef/v2y2021i3d10.1007_s43069-021-00068-x.html
   My bibliography  Save this article

Review on Nature-Inspired Algorithms

Author

Listed:
  • Wael Korani

    (University of Regina)

  • Malek Mouhoub

    (University of Regina)

Abstract

Optimization and its related solving methods are becoming increasingly important in most academic and industrial fields. The goal of the optimization process is to make a system or a design as effective and functional as possible. This is achieved by optimizing a set of objectives while meeting the system requirements. Optimization techniques are classified into exact and approximate algorithms. Nature-inspired (NI) methods, a sub-class of approximate techniques, are widely recognized for providing efficient approaches for solving a wide variety of real-world optimization problems. In this paper, we discuss many scenarios where we can or cannot use different NI methods in tackling real-world optimization problems. We also enrich our survey with many studies for the reader to prove the efficiency and efficacy of using NI methods to tackle many real-world applications. Therefore, NI methods should be considered as alternative reliable approaches in the absence of exact methods to provide satisfactory solutions.

Suggested Citation

  • Wael Korani & Malek Mouhoub, 2021. "Review on Nature-Inspired Algorithms," SN Operations Research Forum, Springer, vol. 2(3), pages 1-26, September.
  • Handle: RePEc:spr:snopef:v:2:y:2021:i:3:d:10.1007_s43069-021-00068-x
    DOI: 10.1007/s43069-021-00068-x
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s43069-021-00068-x
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s43069-021-00068-x?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Yudong Zhang & Shuihua Wang & Genlin Ji, 2015. "A Comprehensive Survey on Particle Swarm Optimization Algorithm and Its Applications," Mathematical Problems in Engineering, Hindawi, vol. 2015, pages 1-38, October.
    2. Xue Ji & Qi Gao & Fupeng Yin & Hengdong Guo, 2016. "An Efficient Imperialist Competitive Algorithm for Solving the QFD Decision Problem," Mathematical Problems in Engineering, Hindawi, vol. 2016, pages 1-13, November.
    3. Daniel Delahaye & Supatcha Chaimatanan & Marcel Mongeau, 2019. "Simulated Annealing: From Basics to Applications," International Series in Operations Research & Management Science, in: Michel Gendreau & Jean-Yves Potvin (ed.), Handbook of Metaheuristics, edition 3, chapter 0, pages 1-35, Springer.
    4. Yu Shi & Zizhao Zhang & Weng Kee Wong, 2019. "Particle swarm based algorithms for finding locally and Bayesian D-optimal designs," Journal of Statistical Distributions and Applications, Springer, vol. 6(1), pages 1-17, December.
    5. Peter J. M. van Laarhoven & Emile H. L. Aarts & Jan Karel Lenstra, 1992. "Job Shop Scheduling by Simulated Annealing," Operations Research, INFORMS, vol. 40(1), pages 113-125, February.
    6. Tsallis, Constantino & Stariolo, Daniel A., 1996. "Generalized simulated annealing," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 233(1), pages 395-406.
    7. Pengzhen Lu & Shengyong Chen & Yujun Zheng, 2012. "Artificial Intelligence in Civil Engineering," Mathematical Problems in Engineering, Hindawi, vol. 2012, pages 1-22, December.
    8. Hanning Chen & Yunlong Zhu & Kunyuan Hu, 2011. "Adaptive Bacterial Foraging Optimization," Abstract and Applied Analysis, Hindawi, vol. 2011, pages 1-27, March.
    9. Zhou, Yanting & Wang, Yanan & Wang, Kai & Kang, Le & Peng, Fei & Wang, Licheng & Pang, Jinbo, 2020. "Hybrid genetic algorithm method for efficient and robust evaluation of remaining useful life of supercapacitors," Applied Energy, Elsevier, vol. 260(C).
    10. García-Ródenas, Ricardo & García-García, José Carlos & López-Fidalgo, Jesús & Martín-Baos, José Ángel & Wong, Weng Kee, 2020. "A comparison of general-purpose optimization algorithms for finding optimal approximate experimental designs," Computational Statistics & Data Analysis, Elsevier, vol. 144(C).
    11. Connolly, David T., 1990. "An improved annealing scheme for the QAP," European Journal of Operational Research, Elsevier, vol. 46(1), pages 93-100, May.
    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. Marinos Aristotelous & Andreas C. Nearchou, 2024. "An Empirical Analysis of a Set of Hybrid Heuristics for the Solution of the Resource Leveling Problem," SN Operations Research Forum, Springer, vol. 5(1), pages 1-29, March.
    2. Chen, Ping-Yang & Chen, Ray-Bing & Chen, Yu-Shi & Wong, Weng Kee, 2023. "Numerical Methods for Finding A-optimal Designs Analytically," Econometrics and Statistics, Elsevier, vol. 28(C), pages 155-162.
    3. Adil Korchi & Fayçal Messaoudi & Ahmed Abatal & Youness Manzali, 2023. "Machine Learning and Deep Learning-Based Students’ Grade Prediction," SN Operations Research Forum, Springer, vol. 4(4), pages 1-21, December.

    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. Moriguchi, Kai & Ueki, Tatsuhito & Saito, Masashi, 2020. "Establishing optimal forest harvesting regulation with continuous approximation," Operations Research Perspectives, Elsevier, vol. 7(C).
    2. Fernando Garza-Santisteban & Jorge Mario Cruz-Duarte & Ivan Amaya & José Carlos Ortiz-Bayliss & Santiago Enrique Conant-Pablos & Hugo Terashima-Marín, 2025. "Selection hyper-heuristics and job shop scheduling problems: How does instance size influence performance?," Journal of Scheduling, Springer, vol. 28(1), pages 85-99, February.
    3. Ravi Kumar & Surya Prakash Singh, 2018. "Simulated Annealing-Based Embedded Meta-Heuristic Approach to Solve Bi-objective Robust Stochastic Sustainable Cellular Layout," Global Journal of Flexible Systems Management, Springer;Global Institute of Flexible Systems Management, vol. 19(1), pages 69-93, March.
    4. Jorge M. Cruz-Duarte & José C. Ortiz-Bayliss & Iván Amaya & Yong Shi & Hugo Terashima-Marín & Nelishia Pillay, 2020. "Towards a Generalised Metaheuristic Model for Continuous Optimisation Problems," Mathematics, MDPI, vol. 8(11), pages 1-23, November.
    5. Zeinal Hamadani, Ali & Abouei Ardakan, Mostafa & Rezvan, Taghi & Honarmandian, Mohammad Mehran, 2013. "Location-allocation problem for intra-transportation system in a big company by using meta-heuristic algorithm," Socio-Economic Planning Sciences, Elsevier, vol. 47(4), pages 309-317.
    6. Rubenthaler, Sylvain & Rydén, Tobias & Wiktorsson, Magnus, 2009. "Fast simulated annealing in with an application to maximum likelihood estimation in state-space models," Stochastic Processes and their Applications, Elsevier, vol. 119(6), pages 1912-1931, June.
    7. Bolte, Andreas & Thonemann, Ulrich Wilhelm, 1996. "Optimizing simulated annealing schedules with genetic programming," European Journal of Operational Research, Elsevier, vol. 92(2), pages 402-416, July.
    8. Jianjun Jiao & Lansun Chen, 2007. "Global Attractivity And Permanence Of A Stage-Structured Pest Managementsimodel With Time Delay And Diseased Pests Impulsive Transmission," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 10(04), pages 479-494.
    9. Luca Maria Gambardella & Marco Dorigo, 2000. "An Ant Colony System Hybridized with a New Local Search for the Sequential Ordering Problem," INFORMS Journal on Computing, INFORMS, vol. 12(3), pages 237-255, August.
    10. Mustufa Haider Abidi & Usama Umer & Muneer Khan Mohammed & Mohamed K. Aboudaif & Hisham Alkhalefah, 2020. "Automated Maintenance Data Classification Using Recurrent Neural Network: Enhancement by Spotted Hyena-Based Whale Optimization," Mathematics, MDPI, vol. 8(11), pages 1-33, November.
    11. Haris, Muhammad & Hasan, Muhammad Noman & Qin, Shiyin, 2021. "Early and robust remaining useful life prediction of supercapacitors using BOHB optimized Deep Belief Network," Applied Energy, Elsevier, vol. 286(C).
    12. Akshita Bassi & Aditya Manchanda & Rajwinder Singh & Mahesh Patel, 2023. "A comparative study of machine learning algorithms for the prediction of compressive strength of rice husk ash-based concrete," Natural Hazards: Journal of the International Society for the Prevention and Mitigation of Natural Hazards, Springer;International Society for the Prevention and Mitigation of Natural Hazards, vol. 118(1), pages 209-238, August.
    13. Karen Aardal & Cor Hurkens & Jan Karel Lenstra & Sergey Tiourine, 2002. "Algorithms for Radio Link Frequency Assignment: The Calma Project," Operations Research, INFORMS, vol. 50(6), pages 968-980, December.
    14. Wang, Jiong & Mingshen, Jiang & Zhang, Pin & Liu, Qunsheng & Zhang, Shuqing & Wang, Ke & Li, Chong & Cai, Junmeng, 2024. "Elucidating kinetic mechanisms of lignin and biomass pyrolysis by distributed activation energy model with genetic algorithm," Energy, Elsevier, vol. 312(C).
    15. Chang-Yong Lee & Dongju Lee, 2014. "Determination of initial temperature in fast simulated annealing," Computational Optimization and Applications, Springer, vol. 58(2), pages 503-522, June.
    16. Mariusz Korzeń & Maciej Kruszyna, 2023. "Modified Ant Colony Optimization as a Means for Evaluating the Variants of the City Railway Underground Section," IJERPH, MDPI, vol. 20(6), pages 1-15, March.
    17. Philippe Lacomme & Aziz Moukrim & Alain Quilliot & Marina Vinot, 2019. "Integration of routing into a resource-constrained project scheduling problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 7(4), pages 421-464, December.
    18. Jinyu Zhang & Kang Gao & Yong Li & Qiaosen Zhang, 2022. "Maximum Likelihood Estimation Methods for Copula Models," Computational Economics, Springer;Society for Computational Economics, vol. 60(1), pages 99-124, June.
    19. Edzard Weber & Anselm Tiefenbacher & Norbert Gronau, 2019. "Need for Standardization and Systematization of Test Data for Job-Shop Scheduling," Data, MDPI, vol. 4(1), pages 1-21, February.
    20. Selcuk Goren & Ihsan Sabuncuoglu & Utku Koc, 2012. "Optimization of schedule stability and efficiency under processing time variability and random machine breakdowns in a job shop environment," Naval Research Logistics (NRL), John Wiley & Sons, vol. 59(1), pages 26-38, February.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:spr:snopef:v:2:y:2021:i:3:d:10.1007_s43069-021-00068-x. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.