Include-Exclude Optimization: A New Metaheuristic and Its Application to Handle Optimization Problems in Electrical and Mechanical Engineering

被引:0
|
作者
Kusuma, Purba Daru [1 ]
机构
[1] Telkom Univ, Comp Engn, Jakarta, Indonesia
关键词
optimization; metaheuristic; economic load dispatch problem; gear train problem; ALGORITHM;
D O I
暂无
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
There are two challenges in the development of new metaheuristics. The first challenge is the utilization of the improving status of agents. The second challenge is the employment of stagnation avoidance strategies. This work introduces a new metaheuristic called include-exclude optimization (IEO). It provides a novel approach by combining both the quality and improving statuses of agents to construct the reference and determine the direction of the guided search or movement. IEO also proposes a new technique to avoid stagnation by accepting the best solution candidate when stagnation occurs after the agent performs three guided searches. Then, IEO is challenged to solve three use cases. The first use case is the 23 traditional functions. The second use case is ELD problem representing practical problem in electrical engineering field. The third use case is gear train design problem representing practical problem in mechanical engineering field. In this assessment, IEO is benchmarked with five new metaheuristics: golden search optimization (GSO), total interaction algorithm (TIA), dollmaker optimization algorithm (DOA), carpet weaver optimization (CWO), and hiking optimization (HO). The result shows that IEO is superior to these five metaheuristics in handling 23 traditional functions and performs the best in handling ELD problem and gear train design problem.
引用
收藏
页码:104 / 113
页数:10
相关论文
共 50 条
  • [31] Development and application of a new optimization method to problems in engineering design
    Putcha, C.S.
    International Journal of Modelling and Simulation, 2009, 29 (04): : 394 - 397
  • [32] Water cycle algorithm - A novel metaheuristic optimization method for solving constrained engineering optimization problems
    Eskandar, Hadi
    Sadollah, Ali
    Bahreininejad, Ardeshir
    Hamdi, Mohd
    COMPUTERS & STRUCTURES, 2012, 110 : 151 - 166
  • [33] Optical microscope algorithm: A new metaheuristic inspired by microscope magnification for solving engineering optimization problems
    Cheng, Min-Yuan
    Sholeh, Moh Nur
    KNOWLEDGE-BASED SYSTEMS, 2023, 279
  • [34] APPLICATION OF ANT COLONY OPTIMIZATION METAHEURISTIC ON SET COVERING PROBLEMS
    Buhat, Christian Alvin H.
    Villamin, Jerson Ken L.
    Cuaresma, Genaro A.
    MATHEMATICS IN APPLIED SCIENCES AND ENGINEERING, 2022, 3 (01): : 12 - 23
  • [35] Recent metaheuristic algorithms for solving some civil engineering optimization problems
    Houssein, Essam H.
    Gafar, Mohamed Hossam Abdel
    Fawzy, Naglaa
    Sayed, Ahmed Y.
    SCIENTIFIC REPORTS, 2025, 15 (01):
  • [36] Material Generation Algorithm: A Novel Metaheuristic Algorithm for Optimization of Engineering Problems
    Talatahari, Siamak
    Azizi, Mahdi
    Gandomi, Amir H.
    PROCESSES, 2021, 9 (05)
  • [37] Shape optimization for fatigue problems in mechanical engineering
    Grunwald, J
    Schnack, E
    ENGINEERING OPTIMIZATION, 1997, 29 (1-4) : 235 - 258
  • [38] Cooperation search algorithm: A novel metaheuristic evolutionary intelligence algorithm for numerical optimization and engineering optimization problems
    Feng, Zhong-kai
    Niu, Wen-jing
    Liu, Shuai
    APPLIED SOFT COMPUTING, 2021, 98
  • [39] Developments on metaheuristic-based optimization for numerical and engineering optimization problems: Analysis, design, validation, and applications
    Abdel-Basset, Mohamed
    Mohamed, Reda
    Jasser, Muhammed Basheer
    Hezam, Ibrahim M.
    Sallam, Karam M.
    Mohamed, Ali Wagdy
    ALEXANDRIA ENGINEERING JOURNAL, 2023, 78 (175-212) : 175 - 212
  • [40] A new metaheuristic and its application to the Steiner Problems in Graphs
    Urrutia, S
    Loiseau, I
    SCCC 2001: XXI INTERNATIONAL CONFERENCE OF THE CHILEAN COMPUTER SCIENCE SOCIETY, PROCEEDINGS, 2001, : 273 - 281