東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Linked to FindBook

Google Book

Amazon

博客來

Many-Objective Evolutionary Algorithms: Objective Reduction, Decomposition and Multi-Modality.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Many-Objective Evolutionary Algorithms: Objective Reduction, Decomposition and Multi-Modality./
Author:	Pal, Monalisa.
Published:	Ann Arbor : ProQuest Dissertations & Theses, : 2021,
Description:	258 p.
Notes:	Source: Dissertations Abstracts International, Volume: 83-06, Section: B.
Contained By:	Dissertations Abstracts International83-06B.
Subject:	Elitism. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28843868
ISBN:	9798496588607

Many-Objective Evolutionary Algorithms: Objective Reduction, Decomposition and Multi-Modality.
Pal, Monalisa.

Many-Objective Evolutionary Algorithms: Objective Reduction, Decomposition and Multi-Modality. - Ann Arbor : ProQuest Dissertations & Theses, 2021 - 258 p.

Source: Dissertations Abstracts International, Volume: 83-06, Section: B.

Thesis (Ph.D.)--Indian Statistical Institute - Kolkata, 2021.

This item must not be sold to any third party vendors.

Evolutionary Algorithms (EAs) for Many-Objective Optimization (MaOO) problems are challenging in nature due to the requirement of large population size, difficulty in maintaining the selection pressure towards global optima and inability of accurate visualization of high-dimensional Pareto-optimal Set (in decision space) and Pareto-Front (in objective space). The quality of the estimated set of Pareto-optimal solutions, resulting from the EAs for MaOO problems, is assessed in terms of proximity to the true surface (convergence) and uniformity and coverage of the estimated set over the true surface (diversity). With more number of objectives, the challenges become more profound. Thus, better strategies have to be devised to formulate novel evolutionary frameworks for ensuring good performance across a wide range of problem characteristics.In this thesis, the first work adopts the strategy of objective reduction to present the framework of DECOR, which handles MaOO problems through correlation-based clustering by eliminating the less conflicting objectives. While DECOR demonstrates an enhanced convergence, it reveals the necessity of better solution diversity for resembling the true surface. In the second work, ESOEA is presented, which decomposes the objective space for the collaborative optimization of multiple sub-populations. It also adaptively feedbacks the sub-population size to redistribute the solutions for the effective exploration of difficult regions in the fitness landscape. While ESOEA demonstrates enormous improvement in performance over a variety of MaOO problems, lack of theoretical foundations hinders the analysis of its properties. In the third work, the neighborhood property arising out of sub-space formation (in objective space) is recognized and used to present the framework of NAEMO. It not only demonstrates improved performance but also guarantees monotonically improving diversity, theoretically. While such reference vector assisted decomposition-based approaches are useful for good performance in the objective space, it innately neglects the solution distribution in the decision space. This behavior is disadvantageous for multi-modal problems (multiple alternative subsets within the Pareto-optimal Set independently mapping to the entire Pareto-Front). Hence, in the fourth work, the decomposition in objective space is amalgamated with graph Laplacian based clustering in the decision space to present the framework of LORD. Finally, to establish the efficacy on a real-world problem, NAEMO and LORD are customized to address the multi-modal many-objective building energy management problem. Moreover, four decision-making strategies are presented to select one of the Pareto-optimal solutions as the most relevant solution for implementation.

ISBN: 9798496588607Subjects--Topical Terms:

3686755
Elitism.

Many-Objective Evolutionary Algorithms: Objective Reduction, Decomposition and Multi-Modality.
LDR:03988nmm a2200373 4500 001 2349641
005 20230509091135.5
006 m o d
007 cr#unu||||||||
008 241004s2021 ||||||||||||||||| ||eng d
020 $a 9798496588607
035 $a (MiAaPQ)AAI28843868
035 $a (MiAaPQ)ISIKolkata7113
035 $a AAI28843868
040 $a MiAaPQ $c MiAaPQ
100 1 $a Pal, Monalisa. $3 3689053
245 1 0 $a Many-Objective Evolutionary Algorithms: Objective Reduction, Decomposition and Multi-Modality.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2021
300 $a 258 p.
500 $a Source: Dissertations Abstracts International, Volume: 83-06, Section: B.
500 $a Advisor: Bandyopadhyay, Sanghamitra.
502 $a Thesis (Ph.D.)--Indian Statistical Institute - Kolkata, 2021.
506 $a This item must not be sold to any third party vendors.
520 $a Evolutionary Algorithms (EAs) for Many-Objective Optimization (MaOO) problems are challenging in nature due to the requirement of large population size, difficulty in maintaining the selection pressure towards global optima and inability of accurate visualization of high-dimensional Pareto-optimal Set (in decision space) and Pareto-Front (in objective space). The quality of the estimated set of Pareto-optimal solutions, resulting from the EAs for MaOO problems, is assessed in terms of proximity to the true surface (convergence) and uniformity and coverage of the estimated set over the true surface (diversity). With more number of objectives, the challenges become more profound. Thus, better strategies have to be devised to formulate novel evolutionary frameworks for ensuring good performance across a wide range of problem characteristics.In this thesis, the first work adopts the strategy of objective reduction to present the framework of DECOR, which handles MaOO problems through correlation-based clustering by eliminating the less conflicting objectives. While DECOR demonstrates an enhanced convergence, it reveals the necessity of better solution diversity for resembling the true surface. In the second work, ESOEA is presented, which decomposes the objective space for the collaborative optimization of multiple sub-populations. It also adaptively feedbacks the sub-population size to redistribute the solutions for the effective exploration of difficult regions in the fitness landscape. While ESOEA demonstrates enormous improvement in performance over a variety of MaOO problems, lack of theoretical foundations hinders the analysis of its properties. In the third work, the neighborhood property arising out of sub-space formation (in objective space) is recognized and used to present the framework of NAEMO. It not only demonstrates improved performance but also guarantees monotonically improving diversity, theoretically. While such reference vector assisted decomposition-based approaches are useful for good performance in the objective space, it innately neglects the solution distribution in the decision space. This behavior is disadvantageous for multi-modal problems (multiple alternative subsets within the Pareto-optimal Set independently mapping to the entire Pareto-Front). Hence, in the fourth work, the decomposition in objective space is amalgamated with graph Laplacian based clustering in the decision space to present the framework of LORD. Finally, to establish the efficacy on a real-world problem, NAEMO and LORD are customized to address the multi-modal many-objective building energy management problem. Moreover, four decision-making strategies are presented to select one of the Pareto-optimal solutions as the most relevant solution for implementation.
590 $a School code: 2784.
650 4 $a Elitism. $3 3686755
650 4 $a Decomposition. $3 3561186
650 4 $a Clustering. $3 3559215
650 4 $a Neighborhoods. $3 993475
650 4 $a Optimization algorithms. $3 3683616
650 4 $a Mutation. $3 837917
650 4 $a Genetic algorithms. $3 533907
650 4 $a Decision making. $3 517204
650 4 $a Energy management. $3 3680718
650 4 $a Artificial intelligence. $3 516317
650 4 $a Computer science. $3 523869
650 4 $a Energy. $3 876794
650 4 $a Statistics. $3 517247
690 $a 0800
690 $a 0984
690 $a 0791
690 $a 0454
690 $a 0463
710 2 $a Indian Statistical Institute - Kolkata. $3 3687310
773 0 $t Dissertations Abstracts International $g 83-06B.
790 $a 2784
791 $a Ph.D.
792 $a 2021
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28843868