Abstract Ant Colony Optimization (ACO) is a metaheuristic that is inspired by the pheromone trail laying and following behavior of some ant species. Artificial ants in ACO are stochastic …
Z Sun, M Wei, Z Zhang, G Qu - Applied Soft Computing, 2019 - Elsevier
To solve the problem of achieving the maximum network security goal with lower energy consumption in wireless sensor networks, this paper proposes a Secure Routing Protocol …
D Zouache, YO Arby, F Nouioua… - Computers & Industrial …, 2019 - Elsevier
In this paper, we extend the chicken swarm optimization (CSO) to solve multi-objective optimization problems. Our extention aims to balance between diversity and convergence …
Z Jia, Y Wang, C Wu, Y Yang, X Zhang… - Computers & Industrial …, 2019 - Elsevier
Abstracted from industrial manufacturing process, scheduling on batch processing machines (BPMs) is known to be an NP-hard discrete optimization problem. Therefore, researchers …
X Chen, Y Liu, X Li, Z Wang, S Wang, C Gao - Ieee Access, 2019 - ieeexplore.ieee.org
The traveling salesman problem (TSP) is one of the most classical NP-hard problems in the combinatorial optimization, as many practical problems, such as scheduling problems and …
X Cai, M Hu, D Gong, Y Guo, Y Zhang, Z Fan… - Swarm and Evolutionary …, 2019 - Elsevier
Multiobjective evolutionary algorithm based on decomposition (MOEA/D) divides a multiobjective optimization problem into a number of single-objective subproblems and …
В книге рассматривается современное состояние и проблемы развития биоэвристик, биографический и меметический алгоритмы, вопросы поиска оптимальных решений …
The multiobjective multidimensional knapsack problem (MOMKP) is an extension of the multiobjective knapsack problem that consists in selecting a subset of items in order to …
This paper presents a new approach called MOEA/NSM (multi-objective evolutionary algorithm integrating NSGA-II, SPEA2 and MOEA/D features). This paper combines the main …