Material Generation Algorithm Combined with Epsilon Constraint Handling Scheme for Engineering Optimization

Publisher:
Springer Nature
Publication Type:
Chapter
Citation:
Handbook of Nature-Inspired Optimization Algorithms: The State of the Art, 2022, 213, pp. 165-187
Issue Date:
2022-09-04
Filename Description Size
978-3-031-07516-2_9.pdfPublished version572.55 kB
Adobe PDF
Full metadata record
Metaheuristic optimization algorithms have been progressively introduced for optimization objectives in recent years, with each displaying varying degrees of aptitude for resolving various sorts of optimization problems. Hence, providing a unified judgment call for these sorts of novel techniques has been a chief challenge over the past few years. Regarding this, the recent Competitions on Evolutionary Computation (CEC) have provided some great sets of design examples of different kinds to provide acceptable levels of unbiased judgment calls regarding new and improved and hybridized optimization techniques. This book chapter implements a new constraint handling methodology to the Material Generation Algorithm (MGA) as a recently developed metaheuristic algorithm. The advanced principles of material chemistry regarding the configuration of chemical reactions and chemical compounds in generating novel materials are in perspective. The epsilon constraint handling approach as a well-known handling scheme is applied to MGA, which has been investigated for the first time as a handling approach for this algorithm. For numerical investigations, 8 of the well-known engineering design problems which have been benchmarked by the CEC are utilized. The results of different metaheuristic algorithms are given based on the literature, while the statistical results, such as the mean, worst, and standard deviation, are also calculated. The results proved that the MGA combined with epsilon constraint handling approach (εMGA) could provide better results than the MGA with penalty scheme and the other metaheuristics from the literature.
Please use this identifier to cite or link to this item: