主管:中国科学院
主办:中国优选法统筹法与经济数学研究会
   中国科学院科技战略咨询研究院

中国管理科学 ›› 2018, Vol. 26 ›› Issue (4): 97-107.doi: 10.16381/j.cnki.issn1003-207x.2018.04.011

• 论文 • 上一篇    下一篇

时间窗口约束下基于改进蚁群算法的协同制造调度研究

唐亮1,2, 何杰2, 靖可3, 靳志宏1   

  1. 1. 大连海事大学交通运输工程学院, 辽宁 大连 116026;
    2. 东南大学交通学院, 江苏 南京 210096;
    3. 大连海事大学航运经济与管理学院, 辽宁 大连 116026
  • 收稿日期:2015-05-05 修回日期:2016-03-10 出版日期:2018-04-20 发布日期:2018-06-22
  • 通讯作者: 唐亮(1980-),男(汉族),江苏宜兴人,大连海事大学交通运输工程学院,副教授,研究方向:供应链优化、生产调度、网络化制造、复杂网络,E-mail:erictangliang@163.com E-mail:erictangliang@163.com
  • 基金资助:

    国家自然科学基金资助项目(71301108,71201106);中国博士后特别资助项目(2014T70462);中国博士后面上项目(2013M530228)

Collaborative Manufacturing Scheduling based on Improved Ant Colony Optimization Algorithm with Time Window Constraint

TANG Liang1,2, HE Jie2, JING Ke3, JIN Zhi-hong1   

  1. 1. Transportation Engineering College, Dalian Maritime University, Dalian 116026, China;
    2. School of Transportation, Southeast University, Nanjing 210096, China;
    3. School of Shipping Economic and Management, Dalian Maritime University, Dalian 116026, China
  • Received:2015-05-05 Revised:2016-03-10 Online:2018-04-20 Published:2018-06-22

摘要: 与传统调度模式不同,协同制造模式下企业之间的调度模式极其复杂。协同企业间的加工工序路线并不固定,且不同类型产品具有不同的加工路线网络。为此本文针对平衡型、瓶颈型、跳跃型、混合型四类具有典型特点的协同制造网络Gp进行分析和设计;考虑制造企业同类产品合并加工策略,构建基于连续加工量的分段生产成本函数;通过设计合理的订单最早交货时间和最晚交货时间,对订单交货进行时间窗口约束,并在此基础上构建了由制造商生产成本Wcm、订单等待WskQkT'k)和提前完工库存成本WskQkTk)、延期惩罚成本构成WlkQkT'″k)的目标函数。为求解该模型,创新性将蒙特卡洛思想引入蚁群算法,提高蚂蚁选择合理性,避免局部最优;同时,采用移动窗口[min, max]奖励机制,并且对信息素奖励乘以平衡系数kN)提高奖励可信度,加快搜索速度并提高求解性能。仿真结果表明,本文构建调度模型合理,可以获得优化的调度结果;同时,本文提出的蚁群改进寻优算法具有良好的求解速度和收敛性,算法具有较好的稳定性。

关键词: 协同制造网络, 协同调度优化, 改进蚁群算法, 蒙特卡洛算法, 供应链调度

Abstract: Since the collaborative and cooperative manufacturing mode is gaining popularity, which has the merit of utilizing superior resources in collaborative factories to improve production efficiency, thus it becomes important to do the study on scheduling in collaborative manufacturing mode. In a collaborative manufacturing mode, there are multiple processing paths that forming the collaborative manufacturing networks, and thus the corresponding networks are dynamic and changable. Additionally, different type products belong to different type collaborative manufacturing networks and this makes our model more complex. In light of that, four general types of collaborative manufacturing networks Gp are constructed and discussed, including balance type network, bottleneck type network, jump type network, and hybrid type network. Some pramaters of scheduling model are also designed to make problem more reasable, i.e., production cost function, earliest delivery time tfk and latest delivery time tlk. An objective function composed of processing costs Wcm, inventory costs Wsk(Qk, T'k), and the two penalty costs of early completion costs Wsk(Qk, Tk) and tardiness costs Wlk(Qk, T'″k) is then constructed. In order to solve our model, an improved ant colony optimization algorithm is presented, into which the Monte Carlo algorithm is incorporated. In particular, the upper confidence bound zi is used to guide the ant selection. Meanwhile, a moving window award mechanism[min, max] is also designed to improve award criteria. Given that the expectation window moves frequently with the increase of simulation, and thus the credible level of expectation window increases. In view of this, the fixed pheromone concentration should multiply a balance coefficient k(N) as the award value to improve the rewards credibility. The simulation results show that our designed model is reasonable and practical. Meanwhile, our proposed algorithm has fast solving speed, good convergence and stability. Our research work is benefit for enterprise scheduling in collaborative manufacturing mode.

Key words: collaborative manufacturing network, collaborative scheduling optimization, improved ant colony optimization algorithm, Monte Carlo method, supply chain scheduling

中图分类号: