Decomposition-Based Multiobjective Optimization with Invasive Weed Colonies

6Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In order to solve the multiobjective optimization problems efficiently, this paper presents a hybrid multiobjective optimization algorithm which originates from invasive weed optimization (IWO) and multiobjective evolutionary algorithm based on decomposition (MOEA/D), a popular framework for multiobjective optimization. IWO is a simple but powerful numerical stochastic optimization method inspired from colonizing weeds; it is very robust and well adapted to changes in the environment. Based on the smart and distinct features of IWO and MOEA/D, we introduce multiobjective invasive weed optimization algorithm based on decomposition, abbreviated as MOEA/D-IWO, and try to combine their excellent features in this hybrid algorithm. The efficiency of the algorithm both in convergence speed and optimality of results are compared with MOEA/D and some other popular multiobjective optimization algorithms through a big set of experiments on benchmark functions. Experimental results show the competitive performance of MOEA/D-IWO in solving these complicated multiobjective optimization problems.

Cite

CITATION STYLE

APA

Tan, Y., Lu, X., Liu, Y., Wang, Q., & Zhang, H. (2019). Decomposition-Based Multiobjective Optimization with Invasive Weed Colonies. Mathematical Problems in Engineering, 2019. https://doi.org/10.1155/2019/6943921

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free