摘要： 物流过程的调度是一个组合优化问题。通过对几种经典物件分配算法的比较分析，提出了基于蚁群的物件优化调度算法，实现物流过程中物件的动态分配。蚁群共同测试不同的组合，并选择一个优化的解决方案，采用该方案能够按时交付更多的订单，同时也使订单的延迟变化很小。比较了蚁群算法与其它几种调度方法的效率，结果表明蚁群算法在物流过程中具有良好的性能。

关键词: 1. 重庆大学计算机学院，重庆 400044；2. 重庆工商大学计算机学院，重庆 400067

Abstract: The scheduling of logistic processes is a combinatorial optimization problem. This paper proposes a distributed algorithm based on ant colonies to optimize the dynamic assignment of components to orders. The ant-agents jointly test several different combinations and choose the solution that is able to deliver more orders at the correct delivery date, while keeping the delay variance small for the orders that are not delivered at the desired date. Moreover, it compares ant colonies algorithm with three other scheduling methods. Results show the effectiveness of the proposed algorithm.

Key words: Supply chain; Ant colonies; Logistic processes; Scheduling