Multiobjective imperialist competitive algorithm for solving nonlinear constrained optimization problems

Simple item page
dc.contributor.authorLiu, Chun-an
dc.contributor.authorJia, Huamin
dc.date.accessioned2020-03-23T13:07:26Z
dc.date.available2020-03-23T13:07:26Z
dc.date.issued2019-12-27
dc.description.abstractNonlinear constrained optimization problem (NCOP) has been arisen in a diverse range of sciences such as portfolio, economic management, airspace engineering and intelligence system etc. In this paper, a new multiobjective imperialist competitive algorithm for solving NCOP is proposed. First, we review some existing excellent algorithms for solving NOCP; then, the nonlinear constrained optimization problem is transformed into a biobjective optimization problem. Second, in order to improve the diversity of evolution country swarm, and help the evolution country swarm to approach or land into the feasible region of the search space, three kinds of different methods of colony moving toward their relevant imperialist are given. Thirdly, the new operator for exchanging position of the imperialist and colony is given similar as a recombination operator in genetic algorithm to enrich the exploration and exploitation abilities of the proposed algorithm. Fourth, a local search method is also presented in order to accelerate the convergence speed. At last, the new approach is tested on thirteen well-known NP-hard nonlinear constrained optimization functions, and the experiment evidences suggest that the proposed method is robust, efficient, and generic when solving nonlinear constrained optimization problem. Compared with some other state-of-the-art algorithms, the proposed algorithm has remarkable advantages in terms of the best, mean, and worst objective function value and the standard deviations.en_UK
dc.identifier.citationLiu C, Jia H. (2019) Multiobjective imperialist competitive algorithm for solving nonlinear constrained optimization problems. Journal of Systems Science and Information, Volume 7, Issue 6, December 2019, pp. 532-549en_UK
dc.identifier.issn1478-9906
dc.identifier.urihttps://doi.org/10.21078/JSSI-2019-532-18
dc.identifier.urihttps://dspace.lib.cranfield.ac.uk/handle/1826/15317
dc.language.isoenen_UK
dc.publisherDe Gruyteren_UK
dc.rightsAttribution-NonCommercial 4.0 International*
dc.rights.urihttp://creativecommons.org/licenses/by-nc/4.0/*
dc.subjectmultiobjective optimizationen_UK
dc.subjectimperialist competitive algorithmen_UK
dc.subjectconstrained optimizationen_UK
dc.subjectlocal searchen_UK
dc.titleMultiobjective imperialist competitive algorithm for solving nonlinear constrained optimization problemsen_UK
dc.typeArticleen_UK

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Multiobjective_imperialist_competitive_algorithm_for_solving_nonlinear_constrained-2019.pdf
Size:
592.84 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.63 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Staff publications (SATM)