面向最短路径的工业包装生产线时间成本研究  

Time Cost of the Shortest Path-oriented Industrial Packaging Production Line

作　　者：方景芳[1] 叶波 刘军[1] FANG Jing-fang;YE Bo;LIU Jun(School of Mechanical and Electrical Engineering, Lanzhou University of Technology, Lanzhou 730050 China)

机构地区：[1]兰州理工大学机电工程学院,兰州730050

出　　处：《包装工程》2019年第9期120-126,共7页Packaging Engineering

基　　金：国家自然科学基金(71861025)

摘　　要：目的研究在时间成本条件下,面向最短路径的工业包装生产线物料配送选择的方式。方法首先对该公司工业包装生产线物料配送过程中存在的资源浪费、路线重复等问题进行研究,给出该工业包装生产制造车间物料配送布局图,建立起适用于该工业包装生产线物料配送的优化模型,使用仿水流算法对该模型进行求解,同时将该方法与常规方法进行对比分析。结果从利用计算机求得的数据可以看出,仿水流算法不但使迭代的次数减少,而且与其他类似的蚁群算法相比,也明显缩短了计算机的运算时间。结论通过实例验证对比分析得出,所列出的模型和算法具有较好的优越性和有效性,可以在企业实际生产中利用计算机自动生成该装、卸货路径配送的模式,节约了人工指导的成本。The work aims to study the material distribution mode of the shortest path-oriented industrial packaging production line under the condition of time cost. Firstly, the problems of waste of resources and duplication of routes in material distribution of industrial packaging production line of the company were studied. The layout chart of material distribution in industrial packaging production workshop was given, and an optimization model for material distribution in industrial packaging production line was established. The model was solved by simulated flow algorithm. At the same time, the method was compared to the conventional method for analysis. The data obtained by computer showed that the simulated flow algorithm not only reduced the number of iterations, but also significantly shortened the computing time compared with other similar ant colony algorithm. The superiority and validity of the model and algorithm are obtained by comparing and analyzing the examples. The distribution mode of loading and unloading route can be automatically generated by computer in the actual production of enterprises to save the cost of manual guidance.

关 键 词：物料配送 路径优化 工业包装 仿水流算法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]