Parallel Ant Colony Algorithm for the Logistics Scheduling Problem

The logistics scheduling problem is the core problem of logistic management. In essence, the nature of ant colony algorithm is based on distributed collaborative optimization computing. Especially with the growing scale of the problem solving, parallel implementation of ant colony algorithm has great space to development. After comparing and analysing several classic logistic scheduling algorithms, this paper proposes a parallel logistic scheduling algorithm based on OpenMP and ant colony algorithm, digging the computer power of high performance computing, and optimizing the efficiency of dynamic assignment in the logistic procedure, also improving the scalability of logistic scheduling system.