首页 | 本学科首页   官方微博 | 高级检索  
     

基于bi-level迭代算法的物料循环配送研究
引用本文:朱晓莹,徐克林,朱孝松.基于bi-level迭代算法的物料循环配送研究[J].计算机应用研究,2012,29(11):4176-4179.
作者姓名:朱晓莹  徐克林  朱孝松
作者单位:1. 同济大学 机械工程学院,上海,201804
2. 北京科技大学 机械工程学院,北京,100083
摘    要:为解决车间物料配送费用高、配送效率低、灵活性差等问题,建立了基于bi-level(双层)规划的车间物料循环配送模型。针对模型设计了基于2-opt改进的最大最小蚁群算法和双层迭代算法,引入线旁库存的限制,求得需求点的配送周期、配送量和配送路径,使库存和运输整合费用最小。通过数值算例求解,说明了该算法是有效的,也说明了该模型的实用价值和有效性。

关 键 词:物料循环配送  双层规划  车辆路径问题  改进最大最小蚁群算法

Study on material cycling distribution based on bi-level programming
ZHU Xiao-ying,XU Ke-lin,ZHU Xiao-song.Study on material cycling distribution based on bi-level programming[J].Application Research of Computers,2012,29(11):4176-4179.
Authors:ZHU Xiao-ying  XU Ke-lin  ZHU Xiao-song
Affiliation:1. School of Mechanical Engineering, Tongji University, Shanghai 201804, China; 2. School of Mechanical Engineering, University of Beijing Technology, Beijing 100083, China
Abstract:To solve the high cost, low efficiency and poor flexibility of material distribution, this paper constructed a bi-level programming model of cycling material distribution. It used the model to minimize the inventory and transportation cost by finding the best distribution cycle strategy, distribution volume and distribution routing under the restriction of line besides inventory. In solving the model, it developed improved Max-min ASIMMAS based 2-opt, which were proved effective by solving numerical examples.
Keywords:cycling material distribution  bi-level programming  vehicle routing problem  IMMAS
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《计算机应用研究》浏览原始摘要信息
点击此处可从《计算机应用研究》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号