基于非等覆盖半径的前置仓选址  

Location selection of front warehouses based on unequal coverage radius

作　　者：赵琨[1] 赵刚 赵永健 梁晨[1] ZHAO Kun;ZHAO Gang;ZHAO Yongjian;LIANG Chen(School of Logistics, Beijing Wuzi University, Beijing 101149, China)

机构地区：[1]北京物资学院物流学院,北京101149

出　　处：《上海海事大学学报》2022年第2期66-73,共8页Journal of Shanghai Maritime University

基　　金：北京市社会科学基金(17GLB020)。

摘　　要：为解决城市物流配送中心出现的配送效率低的问题,研究配送中心前置仓选址问题。基于非等覆盖半径思想,结合前置仓选址特性,建立以企业总成本最低和客户满意度最高为目标的前置仓选址优化模型。结合第二代非支配排序遗传算法(non-dominated sorting genetic algorithmⅡ,NSGA-Ⅱ)与差分进化(differential evolution,DE)算法对模型进行求解。利用Python进行算例分析,得出企业总成本与客户满意度之间的Pareto解集,给出Pareto解集在二维空间的分布。该研究可为不同类型企业提出多种前置仓选址方案。In order to solve the problem of low distribution efficiency in urban logistics distribution centers,the location issue of distribution centers’front warehouses is studied.Based on the idea of the unequal coverage radius,combined with the characteristics of the front warehouse location,a front warehouse location selection optimization model with the goals to minimize the total cost of an enterprise and maximize the customer satisfaction is established.The model is solved combined with the non-dominated sorting genetic algorithmⅡ(NSGA-Ⅱ)and the differential evolution(DE)algorithm.Through the example analysis by Python,the Pareto solution set between the enterprise total cost and the customer satisfaction is obtained,and the distribution of the Pareto solution set in the two-dimension space is given.The research can propose a variety of front warehouse location selection solutions for different types of enterprises.

关 键 词：前置仓 非等覆盖半径 多目标遗传算法 客户满意度 

分 类 号：U113[交通运输工程] F272[经济管理—企业管理]