检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:陈建华[1,2] 吕群英 曹菁菁[1,2] CHEN Jianhua;LV Qunying;CAO Jingjing(School of Logistics Engineering,WUT,Wuhan 430063,China)
机构地区:[1]武汉理工大学物流工程学院,湖北武汉430063 [2]武汉理工大学港口物流技术与装备教育部工程研究中心,湖北武汉430063
出 处:《武汉理工大学学报(信息与管理工程版)》2019年第5期497-502,共6页Journal of Wuhan University of Technology:Information & Management Engineering
基 金:国家自然科学基金项目(61502360)
摘 要:针对电商物流系统中由多供应商、多配送中心、多客户构成的三级供应链,考虑多产品、多周期和不确定需求等因素,构建了库存配送联合决策优化模型,并设计了启发式改进蚁群算法求解该NP难问题。该算法将原模型拆分为库存优化和配送优化两个子模型,通过对每个子模型的求解得到原问题的近似最优解,结合算例进一步验证了模型及算法的有效性。研究结果表明,通过平台的整合协调作用,存在使得供应链运作成本最低的最佳定期订货策略及最优取货与配送路径;而且,单位产品单位时间库存成本、配送车辆行驶路径总长度对产品订货周期具有正向影响,车辆装载能力对产品最大库存水平具有正向影响。Considering a three-stage supply chain consisting of multi-supplier,multi-distribution center and multi-customer in e-commerce logistics system,a mathematical model of joint decision-making optimization of inventory and distribution was established under condition of multi-product,multi-period and demand uncertainty.Then,a heuristic improved ant colony algorithm was designed to solve the NP-hard problem.The algorithm divided the original model into two sub-models:inventory optimization and distribution optimization.By solving each sub-model,we can get the approximate optimal solution of the original problem.The validity of the model and the algorithm was further verified by a numerical study.The results also showed that,through the integration and coordination of platforms,there exists the optimal periodic ordering strategy and the optimal pick-up and distribution routing which can minimize the supply chain operation cost.In addition,unit time inventory cost per unit product and total length of vehicle routing have a positive impact on product ordering cycle,vehicle loading capacity also has a positive impact on the maximum inventory level of products.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.119.0.35