Fast multiobjective immune optimization approach solving multiobjective interval number programming

As an uncertain programming model with multiple conflicting performance indices and bounded uncertain parameter(s), multiobjective interval number programming is a daunting topic in the fields of mathematics and intelligent optimization. Despite its comprehensive engineering application background,...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Swarm and evolutionary computation Jg. 51; S. 100578
1. Verfasser:	Zhang, Zhuhong
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.12.2019
Schlagworte:	Multiobjective immune optimization Multiobjective interval number programming Natural interval extension programming Nondominated sorting Optimal-value vector solution Natural interval extension programming Nondominated sorting Multiobjective interval number programming Optimal-value vector solution Multiobjective immune optimization
ISSN:	2210-6502
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	As an uncertain programming model with multiple conflicting performance indices and bounded uncertain parameter(s), multiobjective interval number programming is a daunting topic in the fields of mathematics and intelligent optimization. Despite its comprehensive engineering application background, it is still open, and further studies are needed on basic theory, model transformation and intelligent optimizers. Therein, this work not only gropes a new shortcut to tackling one such model, but also proposes a novel multiobjective interval number immune optimization algorithm. The intrinsic solution relation between the model and a related natural interval extension one is discovered in terms of the new concept of optimal-value vector solution, by which a fast interval nondominated sorting approach is acquired. The algorithm mainly consists of population division, proliferation, evolution, selection and memory update, in which a co-evolutionary mechanism is designed to promote the current population to move quickly towards the Pareto front with the assistance of the sorting approach and an external archive set. The algorithm's resource consumption depends mainly on the archive's size. Comparative experiments have validated that the optimizer can effectively perform well over the compared approaches and is significantly superior to them with regard to efficiency.
ISSN:	2210-6502
DOI:	10.1016/j.swevo.2019.100578