九州通线下药店选址优化问题研究  

Research on Location Problem of Jiontown Offline Drugstores

作　　者：李珍萍[1] 赵雨薇 LI Zhen-ping, ZHAO Yu-wei(School of Information, Beijing Wuzi University, Beijing 101149, Chin)

机构地区：[1]北京物资学院信息学院

出　　处：《数学的实践与认识》2018年第17期178-186,共9页Mathematics in Practice and Theory

基　　金：国家自然科学基金(71771028);北京市属高校高水平创新团队建设计划项目(IDHT20180510);北京市智能物流系统协同创新中心

摘　　要：针对九州通的020业务销售模式,研究了基于多枢纽站多分派网络的实体药店选址优化问题.以现有药店为备选点,每天的药店运行成本和物流成本之和极小化为目标,建立了实体药店选址优化问题的混合整数规划模型,利用Lingo软件编程求解得到优化以后的实体药店选址方案.通过与现有的实体药店选址方案对比发现,在不改变实体药店覆盖半径的前提下,优化后实体药店的数量从9家减少为4家,每天的药店运行成本和药品配送成本之和大约降低14万元,占药品物流总成本的32%.研究结果为九州通医药公司优化线下药店的配送网络提供了理论依据.Under the 020 sales pattern of Jiontown medicine company, the optimization location problem of offline drugstores is studied based on multiple hubs and assignment network. Let the existing drugstores be candidate locations, a mix integer programming model is formulated to optimize the location of offiine drugstores. The objective function is to minimize the sum of daily operation costs and logistics costs. This model is solved by Lingo software to obtain the optimal location of offiine drugstores. Comparing with the existing location of drugstores, the number of optimal drugstores decreased from 9 to 4 without changing the radius of drugstore＇ s coverage. The total costs of daily operation and distribution decreased by about RMB 140,000, which accounting for 32% of the total cost. The results of this paper provide a theoretical basis for Jiontown medicine company to optimize their distribution network of offiine drugstores.

关 键 词：九州通 药店选址 轴辐式网络 混合整数规划模型 

分 类 号：R95[医药卫生—药学] O221.4[理学—运筹学与控制论]