default search action
Swarm and Evolutionary Computation, Volume 81
Volume 81, August 2023
- Zhun Fan, Zhaojun Wang, Wenji Li, Xiaomin Zhu, Bingliang Hu, An-Min Zou, Weidong Bao, Minqiang Gu, Zhifeng Hao, Yaochu Jin:
Automated pattern generation for swarm robots using constrained multi-objective genetic programming. 101337 - Jingyu Luo, Mario Vanhoucke, José Coelho:
Automated design of priority rules for resource-constrained project scheduling problem using surrogate-assisted genetic programming. 101339 - Raktim Biswas, Deepak Sharma:
Chaos control assisted single-loop multi-objective reliability-based design optimization using differential evolution. 101340 - Dan Zhou, Jiqing Du, Sachiyo Arai:
Efficient search of decision makers' region of interest by using preference directions in multi-objective coevolutionary algorithm. 101349 - Saúl Zapotecas Martínez, Carlos A. Coello Coello, Hernán E. Aguirre, Kiyoshi Tanaka:
Challenging test problems for multi- and many-objective optimization. 101350 - Lei Peng, Zhuoming Yuan, Guangming Dai, Maocai Wang, Zhe Tang:
Reinforcement learning-based hybrid differential evolution for global optimization of interplanetary trajectory design. 101351 - Guoqing Li, Mengyan Sun, Yirui Wang, Wanliang Wang, Weiwei Zhang, Caitong Yue, Guodao Zhang:
A ring-hierarchy-based evolutionary algorithm for multimodal multi-objective optimization. 101352 - Sanyan Chen, Xuewu Wang, Ye Wang, Xingsheng Gu:
A modified adaptive switching-based many-objective evolutionary algorithm for distributed heterogeneous flowshop scheduling with lot-streaming. 101353 - Fuqing Zhao, Zesong Xu, Xiaotong Hu, Tianpeng Xu, Ningning Zhu, Jonrinaldi:
An improved iterative greedy athm for energy-efficient distributed assembly no-wait flow-shop scheduling problem. 101355
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.