Abstract: Graph partitioning is a classical NP-hard problem widely applied in parallel computing, simulation, and network analysis. It aims to produce balanced partitions with minimal ...

Life may look like a paradise for beetles living in ant colonies. Plump, wriggling ant larvae and helpless eggs sit waiting to be devoured, while hundreds of thousands of ants stand at the ready to ...

Abstract: Traditional Ant Colony Optimization (T-ACO) algorithms often face challenges in dynamic environments, particularly the tendency to become trapped in local minima, resulting in suboptimal ...