检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]大连海事大学交通运输管理学院,辽宁大连116026 [2]交通运输部科技司,北京100736 [3]大连海事大学综合交通运输协同创新中心,辽宁大连116026
出 处:《大连海事大学学报》2017年第2期53-59,共7页Journal of Dalian Maritime University
基 金:国家自然科学基金资助项目(71431001;71302044;71572023);辽宁省自然科学基金资助项目(2015020092);中央高校基本科研业务经费专项资金资助项目(20110116205;3132016301);欧盟玛丽居里国际科研人员交流计划(ENRICH-612546)
摘 要:对共同配送路径优化及成本分摊问题进行一体化分析,构建多配送中心、多货种条件下的共同配送作业模式双层规划数学模型.其中,上层模型用于优化配送路径,下层模型用于在联盟内实现配送成本的分摊.设计使用遗传算法对所提出的问题进行求解.采用基于扫描的算法产生初始种群;结合Shapley值法设计配送成本分摊机制;为避免陷入局部最优解,在进化过程中引入内部扰动与外部扰动过程.通过算例求解结果可以看到,在共同配送条件下,联盟总体成本及各配送中心成本均大幅下降,可为共同配送实践作业提供决策参考.An integration analysis of joint distribution path optimization and cost sharing was carried out, and the bi-level programming mathematical model of joint distribution operation mode under the condition of multi-distribution centers and multi-goods was established. Therein, the upper level model was used to optimize the delivery path, and the lower level model was used to share the cost delivery in the alliance. A genetic algorithm was designed to solve the proposed problem. The initial population was generated based on the sweep algorithm, and the cost sharing mechanism was designed by the Shapley value method. To avoid failing into the local optimal solution, the internal disturbance and the external disturbance process were introduced during the evolution progress. Results show that the total cost of the alliance and the cost of each distribution center are greatly reduced under the condition of joint distribution, which can provide decision reference for joint distribution practice.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.28