摘要
供应链中的物流过程可以作为一个调度问题进行研究,物流过程的调度是一个组合优化问题。首先对物流过程进行分析,建立一个生灭过程模型,然后比较几种经典的调度算法,最后提出了基于自适应蚁群优化的物件调度算法,实现了供应链物流过程中物件的动态分配。使用自适应蚁群优化策略测试不同的订单组合,得到一个优化解决方案,该方案能使尽可能多的定单按时交付,同时也能将订单的延迟减小。
This paper is that a logistic process of a supply chain described as a scheduling problem carry on a research. The schedul- ing of logistic process is a combinational optimization problem. First, this paper analyses the logistic process and builds the modeling the logistic process as a birth-and-death process, then compares the difference on kinds of classic scheduling algorithm, finally pro- poses a distributed algorithm based on adaptive ant colonies to optimize the dynamic assignment of components to orders. The strategy of adaptive ant colonies can be used to test different order combination, and grained an optimization solved scheme that can be delivery more possible orders, while can reduce the time delay of orders.
出处
《微计算机信息》
北大核心
2007年第30期226-227,74,共3页
Control & Automation
基金
江苏省自然科学基金资助项目(20003017)
关键词
供应链
物流过程
调度
蚁群算法
自适应
Supply chain, Logistic process, Scheduling, Ant colony algorithm. Adaptive
