IDEAS home Printed from https://ideas.repec.org/a/gam/jeners/v13y2020i19p5097-d421955.html
   My bibliography  Save this article

Metaheuristic Optimization of Power and Energy Systems: Underlying Principles and Main Issues of the ‘Rush to Heuristics’

Author

Listed:
  • Gianfranco Chicco

    (Dipartimento Energia “Galileo Ferraris”, Politecnico di Torino, 10129 Torino, Italy)

  • Andrea Mazza

    (Dipartimento Energia “Galileo Ferraris”, Politecnico di Torino, 10129 Torino, Italy)

Abstract

In the power and energy systems area, a progressive increase of literature contributions that contain applications of metaheuristic algorithms is occurring. In many cases, these applications are merely aimed at proposing the testing of an existing metaheuristic algorithm on a specific problem, claiming that the proposed method is better than other methods that are based on weak comparisons. This ‘rush to heuristics’ does not happen in the evolutionary computation domain, where the rules for setting up rigorous comparisons are stricter but are typical of the domains of application of the metaheuristics. This paper considers the applications to power and energy systems and aims at providing a comprehensive view of the main issues that concern the use of metaheuristics for global optimization problems. A set of underlying principles that characterize the metaheuristic algorithms is presented. The customization of metaheuristic algorithms to fit the constraints of specific problems is discussed. Some weaknesses and pitfalls that are found in literature contributions are identified, and specific guidelines are provided regarding how to prepare sound contributions on the application of metaheuristic algorithms to specific problems.

Suggested Citation

  • Gianfranco Chicco & Andrea Mazza, 2020. "Metaheuristic Optimization of Power and Energy Systems: Underlying Principles and Main Issues of the ‘Rush to Heuristics’," Energies, MDPI, vol. 13(19), pages 1-38, September.
    • Handle: RePEc:gam:jeners:v:13:y:2020:i:19:p:5097-:d:421955
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1996-1073/13/19/5097/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1996-1073/13/19/5097/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Taillard, Eric D. & Gambardella, Luca M. & Gendreau, Michel & Potvin, Jean-Yves, 2001. "Adaptive memory programming: A unified view of metaheuristics," European Journal of Operational Research, Elsevier, vol. 135(1), pages 1-16, November.
    2. Strantzali, Eleni & Aravossis, Konstantinos, 2016. "Decision making in renewable energy investments: A review," Renewable and Sustainable Energy Reviews, Elsevier, vol. 55(C), pages 885-898.
    3. Fred Glover, 1989. "Tabu Search---Part I," INFORMS Journal on Computing, INFORMS, vol. 1(3), pages 190-206, August.
    4. Julian Garcia-Guarin & Diego Rodriguez & David Alvarez & Sergio Rivera & Camilo Cortes & Alejandra Guzman & Arturo Bretas & Julio Romero Aguero & Newton Bretas, 2019. "Smart Microgrids Operation Considering a Variable Neighborhood Search: The Differential Evolutionary Particle Swarm Optimization Algorithm," Energies, MDPI, vol. 12(16), pages 1-13, August.
    5. Mishra, Dillip Kumar & Ghadi, Mojtaba Jabbari & Azizivahed, Ali & Li, Li & Zhang, Jiangfeng, 2021. "A review on resilience studies in active distribution systems," Renewable and Sustainable Energy Reviews, Elsevier, vol. 135(C).
    6. Hadar, Josef & Russell, William R., 1971. "Stochastic dominance and diversification," Journal of Economic Theory, Elsevier, vol. 3(3), pages 288-305, September.
    7. Mario Villalobos-Arias & Carlos Coello & Onésimo Hernández-Lerma, 2006. "Asymptotic convergence of a simulated annealing algorithm for multiobjective optimization problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 64(2), pages 353-362, October.
    8. Hu, Yuan & Bie, Zhaohong & Ding, Tao & Lin, Yanling, 2016. "An NSGA-II based multi-objective optimization for combined gas and electricity network expansion planning," Applied Energy, Elsevier, vol. 167(C), pages 280-293.
    9. Li, Song & Goel, Lalit & Wang, Peng, 2016. "An ensemble approach for short-term load forecasting by extreme learning machine," Applied Energy, Elsevier, vol. 170(C), pages 22-29.
    10. Saaty, Thomas L., 1990. "How to make a decision: The analytic hierarchy process," European Journal of Operational Research, Elsevier, vol. 48(1), pages 9-26, September.
    11. Edmund K. Burke & Matthew Hyde & Graham Kendall & Gabriela Ochoa & Ender Özcan & John R. Woodward, 2010. "A Classification of Hyper-heuristic Approaches," International Series in Operations Research & Management Science, in: Michel Gendreau & Jean-Yves Potvin (ed.), Handbook of Metaheuristics, chapter 0, pages 449-468, Springer.
    12. Jadidoleslam, Morteza & Ebrahimi, Akbar & Latify, Mohammad Amin, 2017. "Probabilistic transmission expansion planning to maximize the integration of wind power," Renewable Energy, Elsevier, vol. 114(PB), pages 866-878.
    13. Froger, Aurélien & Gendreau, Michel & Mendoza, Jorge E. & Pinson, Éric & Rousseau, Louis-Martin, 2016. "Maintenance scheduling in the electricity industry: A literature review," European Journal of Operational Research, Elsevier, vol. 251(3), pages 695-706.
    14. Bogdan Tomoiagă & Mircea Chindriş & Andreas Sumper & Antoni Sudria-Andreu & Roberto Villafafila-Robles, 2013. "Pareto Optimal Reconfiguration of Power Distribution Systems Using a Genetic Algorithm Based on NSGA-II," Energies, MDPI, vol. 6(3), pages 1-17, March.
    15. Drake, John H. & Kheiri, Ahmed & Özcan, Ender & Burke, Edmund K., 2020. "Recent advances in selection hyper-heuristics," European Journal of Operational Research, Elsevier, vol. 285(2), pages 405-428.
    16. Bruno Contini, 1968. "A Stochastic Approach to Goal Programming," Operations Research, INFORMS, vol. 16(3), pages 576-586, June.
    17. Alexander Mitsos & Jaromił Najman & Ioannis G. Kevrekidis, 2018. "Optimal deterministic algorithm generation," Journal of Global Optimization, Springer, vol. 71(4), pages 891-913, August.
    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. Ishan Srivastava & Sunil Bhat & B. V. Surya Vardhan & Neeraj Dhanraj Bokde, 2022. "Fault Detection, Isolation and Service Restoration in Modern Power Distribution Systems: A Review," Energies, MDPI, vol. 15(19), pages 1-26, October.
    2. Carmine Cancro & Camelia Delcea & Salvatore Fabozzi & Gabriella Ferruzzi & Giorgio Graditi & Valeria Palladino & Maria Valenti, 2022. "A Profitability Analysis for an Aggregator in the Ancillary Services Market: An Italian Case Study," Energies, MDPI, vol. 15(9), pages 1-26, April.
    3. Chang, Miguel & Lund, Henrik & Thellufsen, Jakob Zinck & Østergaard, Poul Alberg, 2023. "Perspectives on purpose-driven coupling of energy system models," Energy, Elsevier, vol. 265(C).
    4. Hegazy Rezk & A. G. Olabi & Enas Taha Sayed & Tabbi Wilberforce, 2023. "Role of Metaheuristics in Optimizing Microgrids Operating and Management Issues: A Comprehensive Review," Sustainability, MDPI, vol. 15(6), pages 1-27, March.
    5. Ahmed M. Nassef & Mohammad Ali Abdelkareem & Hussein M. Maghrabie & Ahmad Baroutaji, 2023. "Review of Metaheuristic Optimization Algorithms for Power Systems Problems," Sustainability, MDPI, vol. 15(12), pages 1-27, June.

    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. Chiara Gruden & Irena Ištoka Otković & Matjaž Šraml, 2020. "Neural Networks Applied to Microsimulation: A Prediction Model for Pedestrian Crossing Time," Sustainability, MDPI, vol. 12(13), pages 1-22, July.
    2. Gahm, Christian & Uzunoglu, Aykut & Wahl, Stefan & Ganschinietz, Chantal & Tuma, Axel, 2022. "Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning," European Journal of Operational Research, Elsevier, vol. 296(3), pages 819-836.
    3. Сластников С.А., 2014. "Применение Метаэвристических Алгоритмов Для Задачи Маршрутизации Транспорта," Журнал Экономика и математические методы (ЭММ), Центральный Экономико-Математический Институт (ЦЭМИ), vol. 50(1), pages 117-126, январь.
    4. Nair, D.J. & Grzybowska, H. & Fu, Y. & Dixit, V.V., 2018. "Scheduling and routing models for food rescue and delivery operations," Socio-Economic Planning Sciences, Elsevier, vol. 63(C), pages 18-32.
    5. Cazzaro, Davide & Fischetti, Martina & Fischetti, Matteo, 2020. "Heuristic algorithms for the Wind Farm Cable Routing problem," Applied Energy, Elsevier, vol. 278(C).
    6. Kadri Sylejmani & Jürgen Dorn & Nysret Musliu, 2017. "Planning the trip itinerary for tourist groups," Information Technology & Tourism, Springer, vol. 17(3), pages 275-314, September.
    7. Huang, Yeran & Yang, Lixing & Tang, Tao & Gao, Ziyou & Cao, Fang, 2017. "Joint train scheduling optimization with service quality and energy efficiency in urban rail transit networks," Energy, Elsevier, vol. 138(C), pages 1124-1147.
    8. B Dengiz & C Alabas-Uslu & O Dengiz, 2009. "Optimization of manufacturing systems using a neural network metamodel with a new training approach," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 60(9), pages 1191-1197, September.
    9. S-W Lin & K-C Ying, 2008. "A hybrid approach for single-machine tardiness problems with sequence-dependent setup times," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(8), pages 1109-1119, August.
    10. Joseph B. Mazzola & Robert H. Schantz, 1997. "Multiple‐facility loading under capacity‐based economies of scope," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(3), pages 229-256, April.
    11. Kadri Sylejmani & Jürgen Dorn & Nysret Musliu, 0. "Planning the trip itinerary for tourist groups," Information Technology & Tourism, Springer, vol. 0, pages 1-40.
    12. Abdmouleh, Zeineb & Gastli, Adel & Ben-Brahim, Lazhar & Haouari, Mohamed & Al-Emadi, Nasser Ahmed, 2017. "Review of optimization techniques applied for the integration of distributed generation from renewable energy sources," Renewable Energy, Elsevier, vol. 113(C), pages 266-280.
    13. Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.
    14. Chris S. K. Leung & Henry Y. K. Lau, 2018. "Multiobjective Simulation-Based Optimization Based on Artificial Immune Systems for a Distribution Center," Journal of Optimization, Hindawi, vol. 2018, pages 1-15, May.
    15. Ilfat Ghamlouche & Teodor Gabriel Crainic & Michel Gendreau, 2003. "Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design," Operations Research, INFORMS, vol. 51(4), pages 655-667, August.
    16. Olli Bräysy & Michel Gendreau, 2005. "Vehicle Routing Problem with Time Windows, Part II: Metaheuristics," Transportation Science, INFORMS, vol. 39(1), pages 119-139, February.
    17. Rudimar Caricimi & Géremi Gilson Dranka & Dalmarino Setti & Paula Ferreira, 2022. "Reframing the Selection of Hydraulic Turbines Integrating Analytical Hierarchy Process (AHP) and Fuzzy VIKOR Multi-Criteria Methods," Energies, MDPI, vol. 15(19), pages 1-26, October.
    18. Andaryan, Abdullah Zareh & Mousighichi, Kasra & Ghaffarinasab, Nader, 2024. "A heuristic approach to the stochastic capacitated single allocation hub location problem with Bernoulli demands," European Journal of Operational Research, Elsevier, vol. 312(3), pages 954-968.
    19. L Tang & X Wang, 2008. "An iterated local search heuristic for the capacitated prize-collecting travelling salesman problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(5), pages 590-599, May.
    20. Gintaras Palubeckis & Dalius Rubliauskas, 2012. "A branch-and-bound algorithm for the minimum cut linear arrangement problem," Journal of Combinatorial Optimization, Springer, vol. 24(4), pages 540-563, November.

    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:gam:jeners:v:13:y:2020:i:19:p:5097-:d:421955. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.