A set-based genetic algorithm for solving the many-objective optimization problem
| LEADER | caa a22 4500 | ||
|---|---|---|---|
| 001 | 605468494 | ||
| 003 | CHVBK | ||
| 005 | 20210128100317.0 | ||
| 007 | cr unu---uuuuu | ||
| 008 | 210128e20150601xx s 000 0 eng | ||
| 024 | 7 | 0 | |a 10.1007/s00500-014-1284-y |2 doi |
| 035 | |a (NATIONALLICENCE)springer-10.1007/s00500-014-1284-y | ||
| 245 | 0 | 2 | |a A set-based genetic algorithm for solving the many-objective optimization problem |h [Elektronische Daten] |c [Dunwei Gong, Gengxing Wang, Xiaoyan Sun, Yuyan Han] |
| 520 | 3 | |a Many-objective optimization problems are very common and important in real-world applications, and there exist few methods suitable for them. Therefore, many-objective optimization problems are focused on in this study, and a set-based genetic algorithm is presented to effectively solve them. First, each objective of the original optimization problem is transformed into a desirability function according to the preferred region defined by the decision-maker. Thereafter, the transformed problem is further converted to a bi-objective optimization one by taking hyper-volume and the decision-maker's satisfaction as the new objectives, and a set of solutions of the original optimization problem as the new decision variable. To tackle the converted bi-objective optimization problem using genetic algorithms, the crossover operator inside a set is designed based on the simplex method using solutions of the original optimization problem, and the crossover operator between sets is developed using the entropy of sets. In addition, the mutation operator of a set is presented to obey the Gaussian distribution and changes along with the decision-maker's preferences. The proposed method is tested on five benchmark many-objective optimization problems and compared with other six methods. The experimental results empirically demonstrate its effectiveness. | |
| 540 | |a Springer-Verlag Berlin Heidelberg, 2014 | ||
| 690 | 7 | |a Many-objective optimization |2 nationallicence | |
| 690 | 7 | |a Genetic algorithm |2 nationallicence | |
| 690 | 7 | |a Set |2 nationallicence | |
| 690 | 7 | |a Desirability function |2 nationallicence | |
| 690 | 7 | |a Simplex method |2 nationallicence | |
| 690 | 7 | |a Gaussian mutation |2 nationallicence | |
| 700 | 1 | |a Gong |D Dunwei |u China University of Mining and Technology, Xuzhou, China |4 aut | |
| 700 | 1 | |a Wang |D Gengxing |u China University of Mining and Technology, Xuzhou, China |4 aut | |
| 700 | 1 | |a Sun |D Xiaoyan |u China University of Mining and Technology, Xuzhou, China |4 aut | |
| 700 | 1 | |a Han |D Yuyan |u China University of Mining and Technology, Xuzhou, China |4 aut | |
| 773 | 0 | |t Soft Computing |d Springer Berlin Heidelberg |g 19/6(2015-06-01), 1477-1495 |x 1432-7643 |q 19:6<1477 |1 2015 |2 19 |o 500 | |
| 856 | 4 | 0 | |u https://doi.org/10.1007/s00500-014-1284-y |q text/html |z Onlinezugriff via DOI |
| 898 | |a BK010053 |b XK010053 |c XK010000 | ||
| 900 | 7 | |a Metadata rights reserved |b Springer special CC-BY-NC licence |2 nationallicence | |
| 908 | |D 1 |a research-article |2 jats | ||
| 949 | |B NATIONALLICENCE |F NATIONALLICENCE |b NL-springer | ||
| 950 | |B NATIONALLICENCE |P 856 |E 40 |u https://doi.org/10.1007/s00500-014-1284-y |q text/html |z Onlinezugriff via DOI | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Gong |D Dunwei |u China University of Mining and Technology, Xuzhou, China |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Wang |D Gengxing |u China University of Mining and Technology, Xuzhou, China |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Sun |D Xiaoyan |u China University of Mining and Technology, Xuzhou, China |4 aut | ||
| 950 | |B NATIONALLICENCE |P 700 |E 1- |a Han |D Yuyan |u China University of Mining and Technology, Xuzhou, China |4 aut | ||
| 950 | |B NATIONALLICENCE |P 773 |E 0- |t Soft Computing |d Springer Berlin Heidelberg |g 19/6(2015-06-01), 1477-1495 |x 1432-7643 |q 19:6<1477 |1 2015 |2 19 |o 500 | ||