Abstract

Optimization is more and more significant due to its application in the real engineering problems. The recently proposed imperialist competitive algorithm (ICA) is a successful method in mono-objective optimization. Nevertheless, ICA cannot handle simultaneously the conflicting objectives in multi-objective design problem. In addition, the ICA has the drawback of trapping in local optimum solutions when used for high-dimensional or complex multimodal functions. In order to deal with these situations, in this work, an improved ICA, named modified multi-objective imperialist competitive algorithm (MOMICA) is proposed. In MOMICA, an attraction and repulsion (AR) concept is implemented in the assimilation phase to improve the performances of the algorithm to reach the global optimal position. Moreover, in contrast to ICA, the proposed algorithm integrates the sorting non-dominated strategy (SND) to store the Pareto optimal solutions of multiple conflicting functions. Three performance metrics are used to evaluate the performance of the proposed algorithm: (a) convergence to the true Pareto-optimal set, (b) solutions diversity and (c) robustness, characterized by the variance over 10 runs. The results presented in this paper show that the MOMICA algorithm outperforms the other popular techniques in terms of convergence characteristics and global search ability, for both benchmark functions optimization and multi-objective engineering optimization problems.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.