Application of multi-core parallel ant colony optimization in target assignment problem

作者：Dongdong Gao, Gong Guanghong, Liang Han, Ni Li · 年份：2010 · DOI：10.1109/iccasm.2010.5620672 · 被引用次数：13 · 研究领域：Data Management and Algorithms、Simulation and Modeling Applications、Vehicle Routing Optimization Methods

Ant colony optimization(ACO) provides an effective way to solve combinatorial optimization problem. However, with the complexity of the problem increasing, the ACO algorithm needs considerable computational time and resources to improve the good quality of solution, and this rarely satisfies the requirement of real-time computing in M&S (Modeling and Simulation) area. Parallel implementation of ACO can reduce the computational time obviously for the large scale combinatorial optimization problem, and much of the previous work in this field focuses on parallel implementation using MPI which is executed on clusters. Meanwhile, great emphasis is placed on multi-core computing technology with the development of multi-processor architecture and multi-core architecture. A new parallel ant colony optimization (PACO) algorithm is proposed, which applies two kinds of typical multi-core computing technologies, the well-known OpenMP and the recently introduced TBB (Threading Building Blocks) library by Intel Corporation, to solve target assignment problem(TAP). Effectiveness and efficiency of proposed algorithm is validated by studying the convergence speed, problem size scalability and thread size scalability of it.