.png){kind=icon}
.png){kind=icon}
Return
Optimisation of engineering system using a novel search algorithm: the Spacing Multi-Objective Genetic Algorithm
.png){kind=icon}
PRE
AI
DOI：10.1080/09540091.2018.1443319.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A large number of real-world issues are among difficult and multi-objective problems. Recently, it has been recognised that the evolutionary algorithms optimise well these types of problems. This paper proposes a novel multi-objective search algorithm that is called the Spacing Multi-Objective Genetic Algorithm (Spacing-MOGA). The innovation of the proposed Spacing-MOGA lies in a new survival selection algorithm called Spacing Distance. This research eliminates some of the disadvantages of other algorithms such as the Non-dominated Sorting Genetic Algorithm II (NSGAII). The proposed Spacing-MOGA is applied to five test benchmark functions and also to the design of I-Beam. Then, the results are compared with other algorithms such as NSGAII, Adaptive Weighted Particle Swarm Optimisation (AWPSO), and Non-dominated Sorting Particle Swarm Optimiser (NSPSO) based on the test metrics: Hypervolume, Spacing, Spread, and Generational Distance. Furthermore, for further demonstration of the ability of the proposed Spacing-MOGA, the experimental results are evaluated by the t-test.
Keywords:
Multi-objective problems
Non-dominated Sorting Genetic Algorithm II
Non-dominated Sorting Particle Swarm Optimiser
Adaptive Weighted Particle Swarm Optimisation
I-Beam
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.