Adjust weight vectors in MOEA/D for bi-objective optimization problems with discontinuous Pareto fronts
- 405 Downloads
Multi-objective evolutionary algorithm based on decomposition (MOEA/D) is a recently proposed algorithm which is a research focus in the field of multi-objective evolutionary optimization. It decomposes a multi-objective problem into subproblems by mathematic programming methods and applies evolutionary algorithms to optimize the subproblems simultaneously. MOEA/D is good at finding Pareto solutions which are evenly distributed. However, it can be improved for problems with discontinuous Pareto fronts (PF). Many solutions will assemble in breakpoints in this situation. A method for adjusting weight vectors for bi-objective optimization problems with discontinuous PF is proposed. Firstly, this method detects the weight vectors which need to be adjusted using a property of MOEA/D. Secondly, the reserved vectors are divided into several subsets. Thirdly, after calculating the ideal number of vectors in each subset, vectors are adjusted evenly. Lastly, the corresponding solutions are updated by a linear interpolation. Numerical experiment shows the proposed method obtains good diversity and convergence on approached PF.
KeywordsMOEA/D Adjust weight vector Multi-objective evolutionary algorithm (MOEA) Discontinuous Pareto fronts
This research work is supported by the National Key Technology Support Program under Grant No. 2015BAF01B04, and the National Natural Science Foundation of China (NSFC) under Grant Nos. 51421062 and 61232008, and China Scholarship Council (CSC).
Compliance with ethical standards
Conflict of interest
All author declares that they have no conflict of interest.
This article does not contain any studies with human participants or animals performed by any of the authors.
- Deb K, Pratap A, Meyarivan T (2001) Constrained test problems for multi-objective evolutionary optimization. Paper presented at the evolutionary multi-criterion optimizationGoogle Scholar
- Gu F-Q, Liu H-L (2010) A novel weight design in multi-objective evolutionary algorithm. Paper presented at the 2010 international conference on computational intelligence and security (CIS)Google Scholar
- Horn J, Nafpliotis N, Goldberg DE (1994) A niched Pareto genetic algorithm for multiobjective optimization. Paper presented at proceedings of the first IEEE conference on evolutionary computation, 1994. IEEE world congress on computational intelligence. Orlando, FLGoogle Scholar
- Jiang S, Cai Z, Zhang J, Ong Y-S (2011) Multiobjective optimization by decomposition with Pareto-adaptive weight vectors. Paper presented at 2011 seventh international conference on natural computation (ICNC)Google Scholar
- Kukkonen S, Deb K (2006) A fast and effective method for pruning of non-dominated solutions in many-objective problems Parallel Problem Solving from Nature-PPSN IX. Springer, Berlin, pp 553–562Google Scholar
- Ma X, Liu F, Qi Y, Li L, Jiao L, Deng X et al. (2015) MOEA/D with biased weight adjustment inspired by user preference and its application on multi-objective reservoir flood control problem. Soft Comput. doi: 10.1007/s00500-015-1789-z
- Phan DH, Suzuki J (2013) R2-IBEA: R2 indicator based evolutionary algorithm for multiobjective optimization. Paper presented at 2013 IEEE congress on evolutionary computation (CEC)Google Scholar
- Schaffer JD (1985) Some experiments in machine learning using vector evaluated genetic algorithms. Vanderbilt University, NashvilleGoogle Scholar
- Takahama T, Sakai S (2006) Constrained optimization by the \(\varepsilon \) constrained differential evolution with gradient-based mutation and feasible elites. Paper presented at the 2006 IEEE congress on evolutionary computation (CEC), Vancouver, BCGoogle Scholar
- Zhang CJ, Lin Q, Gao L (2015) A novel adaptive \(\varepsilon \)-constrained method for constrained problem. Paper presented at the proceedings of the 18th Asia Pacific symposium on intelligent and evolutionary systems, vol 1. SingaporeGoogle Scholar
- Zhang Q, Liu W, Li H (2009) The performance of a new version of MOEA/D on CEC09 unconstrained MOP test instances. Paper presented at the IEEE congress on evolutionary computation, TrondheimGoogle Scholar
- Zhang Q, Zhou A, Zhao S, Suganthan PN, Liu W, Tiwari S (2008) Multiobjective optimization test instances for the CEC 2009 special session and competition. technical report. University of Essex, Colchester, UK and Nanyang technological University, Singapore Google Scholar
- Zitzler E, Künzli S (2004) Indicator-based selection in multiobjective search. Paper presented at the parallel problem solving from nature-PPSN VIIIGoogle Scholar
- Zitzler E, Laumanns M, Thiele L (2001) SPEA2: Improving the strength Pareto evolutionary algorithm. Technical Report. Zürich, Switzerland: Eidgenössische Technische Hochschule Zürich (ETH), Institut für Technische Informatik und Kommunikationsnetze (TIK)Google Scholar
- Zitzler E, Thiele L (1998a) An evolutionary algorithm for multiobjective optimization: The strength pareto approach. Zürich, Switzerland: Technical Report 43, Eidgenössische Technische Hochschule Zürich (ETH), Institut für Technische Informatik und Kommunikationsnetze (TIK)Google Scholar
- Zitzler E, Thiele L (1998b) Multiobjective optimization using evolutionary algorithms—a comparative case study. Paper presented at the international conference on parallel problem solving from natureGoogle Scholar