{"title":"A Real-World Benchmark Problem for Global Optimization","authors":"Romasevych Yuriy, Loveikin Viatcheslav, Bakay Borys","doi":"10.2478/cait-2023-0022","DOIUrl":null,"url":null,"abstract":"Abstract The paper presents the statement of the problem of dynamical system „crane-load” optimal control. The acceleration period is under consideration and control must meet the minimum duration condition as well as load oscillations elimination. The objective function, which ensures the final condition satisfaction, is developed and analyzed in terms of its topology features. It includes three arguments and their searching is the essence of the benchmark problem. Two variants of the problem are proposed with varied objective function parameters. Twelve agent-based optimization algorithms have been applied to find solutions to a bunch of problems. A brief analysis of the performance of the algorithms reveals their weaknesses and advantages. Thus, the proposed real-world problem may be exploited to estimate the optimization algorithms’ search performance.","PeriodicalId":45562,"journal":{"name":"Cybernetics and Information Technologies","volume":null,"pages":null},"PeriodicalIF":1.2000,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Cybernetics and Information Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2478/cait-2023-0022","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0
Abstract
Abstract The paper presents the statement of the problem of dynamical system „crane-load” optimal control. The acceleration period is under consideration and control must meet the minimum duration condition as well as load oscillations elimination. The objective function, which ensures the final condition satisfaction, is developed and analyzed in terms of its topology features. It includes three arguments and their searching is the essence of the benchmark problem. Two variants of the problem are proposed with varied objective function parameters. Twelve agent-based optimization algorithms have been applied to find solutions to a bunch of problems. A brief analysis of the performance of the algorithms reveals their weaknesses and advantages. Thus, the proposed real-world problem may be exploited to estimate the optimization algorithms’ search performance.