A Fast Evaluation-Based Bacteria Colony Chemotaxis Algorithm for Dynamic Interval Multiobjective Optimization Problems

There are many real-world applications with uncertainties that can be modeled as the dynamic interval multiobjective optimization problems (DI-MOPs). However, it is challenging for the traditional algorithms to converge rapidly before time-varying parameters change to obtain optimal solutions under...

Celý popis

Podrobná bibliografia

Vydané v:	IEEE transactions on evolutionary computation Ročník 29; číslo 4; s. 1298 - 1312
Hlavní autori:	Xu, Chen-Hao, Lu, Zhi-Gang, Du, Er-Shun, Zhang, Jiang-Feng, Guo, Xiao-Qiang, Li, Xue-Ping, Kong, Xiang-Xing, Li, Yan-Lin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	IEEE 01.08.2025
Predmet:	Bacteria colony chemotaxis (BCC) dynamic interval Evolutionary computation Heuristic algorithms interval crowding distance Linear programming locality sensitive hash multiobjective optimization Optimization Programming Sensitivity Uncertainty
ISSN:	1089-778X, 1941-0026
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!