×
Jan 5, 2021 · This article develops a new metaheuristic algorithm, called adaptive coordination ant colony optimization (ACO).
The exper- imental results show that the proposed adaptive coordination. ACO significantly outperforms the state-of-the-art methods in terms of both ...
Multipoint dynamic aggregation is a meaningful optimization problem due to its important real-world applications, such as post-disaster relief, ...
As a typical heuristic method for the NP-hard problem, ant colony optimization (ACO) is widely used to solve various scheduling problems [44], [45]. For example ...
Adaptive coordination ant colony optimization for multipoint dynamic aggregation. G Gao, Y Mei, YH Jia, WN Browne, B Xin. IEEE Transactions on Cybernetics 52 (8) ...
People also ask
This study focuses on crowdsourcing multi-depot vehicle routing problem with time windows (MDVRPTW) problem, permitting one crowdsourcing driver to deliver ...
Jul 24, 2023 · In this paper, we propose a new algorithm, called adaptive PSO with local search to solve MPDA effectively and efficiently.
To effectively solve the problem, this article develops a new metaheuristic algorithm, called adaptive coordination ant colony optimization (ACO). We develop a ...
Adaptive Coordination Ant Colony Optimization for Multipoint Dynamic Aggregation · Engineering, Computer Science. IEEE Transactions on Cybernetics · 2022.
Adaptive Coordination Ant Colony Optimization for Multipoint Dynamic Aggregation. IEEE Transactions on Cybernetics. 2022-08 | Journal article. DOI: 10.1109 ...