Multi-spatial information joint guidance evolutionary algorithm for dynamic multi-objective optimization with a changing number of objectives

Existing research on dynamic multi-objective optimization problems involving changes in the number of objectives has received little attention, but it is widespread in practical applications. This problem would cause the expansion or contraction of the manifold in the objective space. If it is accom...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Neural computing & applications Ročník 35; číslo 20; s. 15167 - 15199
Hlavní autoři: Ma, Xuemin, Sun, Hao, Hu, Ziyu, Wei, Lixin, Yang, Jingming
Médium: Journal Article
Jazyk:angličtina
Vydáno: London Springer London 01.07.2023
Springer Nature B.V
Témata:
Artificial Intelligence
Computational Biology/Bioinformatics
Computational Science and Engineering
Computer Science
Data Mining and Knowledge Discovery
Dynamic response
Evolutionary algorithms
Genetic algorithms
Image Processing and Computer Vision
Multiple objective analysis
Original Article
Pareto optimization
Probability and Statistics in Computer Science
Spatial data
Multi-objective optimization
Dynamic multi-objective optimization
Evolutionary algorithm
Changing objectives
ISSN:0941-0643, 1433-3058
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Existing research on dynamic multi-objective optimization problems involving changes in the number of objectives has received little attention, but it is widespread in practical applications. This problem would cause the expansion or contraction of the manifold in the objective space. If it is accompanied by changes in Pareto set/front (PS/PF), the problem becomes more complex. However, several dynamic response techniques have been developed to handling this kind of dynamics. Faced with these issues, a multi-spatial information joint guidance evolutionary algorithm is proposed. To more accurately identify the optimal solutions after the change, a space adaptive transfer strategy is introduced, which adopts the geodesic flow kernel method to extract spatial information at different times. Afterwards it adaptively transfers the space via different changes to generate new individuals. In order to improve the diversity after the change, a dual space multi-dimensional joint sampling strategy is proposed. It fully combines the individual information in the objective and the decision space. Then the promising solutions are sampled in multiple dimensions near the representative individuals. Comprehensive experiments are conducted on 15 benchmark functions with a varying number of objectives and PS/PF. Simulation results verify the capability of the proposed algorithm.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0941-0643
1433-3058
DOI:10.1007/s00521-023-08369-4