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...

Full description

Bibliographic Details

Published in:	IEEE transactions on evolutionary computation Vol. 29; no. 4; pp. 1298 - 1312
Main Authors:	Xu, Chen-Hao, Lu, Zhi-Gang, Du, Er-Shun, Zhang, Jiang-Feng, Guo, Xiao-Qiang, Li, Xue-Ping, Kong, Xiang-Xing, Li, Yan-Lin
Format:	Journal Article
Language:	English
Published:	IEEE 01.08.2025
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!