基于蚁群优化的物流调度算法研究  

Study of Logistic Scheduling Algorithm Based on Ant Colonies Optimization

作　　者：唐亮贵[1] 程代杰[1] 

机构地区：[1]重庆大学计算机学院

出　　处：《计算机工程》2006年第7期177-179,194,共4页Computer Engineering

基　　金：重庆市重点科技攻关计划基金资助项目(7200-B-12)

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

关 键 词：供应链 蚁群 物流过程 调度 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]