基于模拟退火算法的易逝品库存路径问题  

Inventory routing problem with perishable item based on SA

作　　者：秦磊 QIN Lei(Ningbo Logistics Planning and Research Institute, Ningbo 315042, China)

机构地区：[1]宁波市现代物流规划研究院,浙江宁波315042

出　　处：《计算机工程与设计》2017年第2期424-429,共6页Computer Engineering and Design

摘　　要：为减少变质品数量,提高易逝品的仓储效率,进一步降低企业运营成本,在库存路径问题的基础上,研究易逝品库存路径问题。为合理安排各客户点的配送时间、配送量以及配送路径,在对该问题做若干假设的基础上,以库存、车辆等为约束条件,以系统总成本最优为目标,建立数学模型,在扫描算法的基础上运用模拟退火算法,对问题进行求解。模拟算例结果表明,该算法有效可行,结合实例分析了单位缺货成本、单位变质成本以及产品变质率对供应链系统总成本的影响。To decrease the quantity of deteriorating items?improve the efficiency of storage,and further reduce the operating cost of enterprises?IRP with perishable was studied.With the aim of finding the right deliver times?quantity,and routes?the model was established based on a set of assumptions.And the objective was to minimize the total cost of the system,while con-straints of the system were satisfied.Based on scanning algorithm,the model was solved using simulated annealing algorithm(EA).An simulation example was presented to verify the feasibility and validity of the proposed method,and changes of each cost when conditions of the given perishable item vary were analyzed.

关 键 词：库存路径(IRP) 模拟退火(SA) 易逝品 供应链 最优化 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]