基于改进蚁群算法的时间窗车辆配送路径优化研究  

Research on Vehicle Distribution Route Optimization with Time Window Based on Improved Ant Colony Algorithms

作　　者：吕再生 樊航 董宝力[1] 贾江鸣 LV Zaisheng;FAN Hang;DONG Baoli;JIA Jiangming(Faculty of Mechanical Engineering & Automation,Zhejiang Sci-Tech University,Hangzhou 310018,China)

机构地区：[1]浙江理工大学机械与自动控制学院,浙江杭州310018

出　　处：《成组技术与生产现代化》2018年第4期45-51,55,共8页Group Technology & Production Modernization

基　　金：浙江省自然科学基金资助项目(LY14G010007);浙江理工大学科研启动基金资助项目(0803815-Y)

摘　　要：为了实现线边零件消耗与零件配送的紧密衔接,利用条码、RFID和信息集成等技术建立了基于电子看板的配送模式,并对电子看板配送模式下零件信息的收集、拣配和配送业务流程进行了分析.针对配送资源优化问题,基于时间窗约束对零件配送路径进行优化,构建了以配送总成本最小为目标的数学模型,并通过改变蚁群算法信息素改进了蚁群算法.实例验证表明,与传统蚁群算法求解的汽车总装生产线配送路径成本相比,改进蚁群算法在每批次零件配送总成本上可以降低约156.6元.To better realize the goal of close connection between line-side parts consumption and parts distribution, a distribution model based on electronic kanban was established by using bar code, RFID and information integration technology, and the business process of parts information requirement collection, picking and distribution under electronic Kanban distribution model was analyzed.Window constrained parts distribution routing optimization, designed to minimize the total cost of distribution as the goal of the mathematical model, by changing the ant colony algorithm pheromone updating way to improve the ant colony algorithm model for example simulation.The results show that the improved ant colony algorithm can reduce the cost of distribution routing by 156.6 yuan compared with the traditional ant colony algorithm.

关 键 词：电子看板 改进蚁群算法 混流生产线 时间窗约束 

分 类 号：TS195.644[轻工技术与工程—纺织化学与染整工程]