多需求多类型自提点选址分配问题研究_李珍萍.pdfVIP

网络出版时间：2017-09-11 11:56:34 网络出版地址：/kcms/detail/11.5946.TP1156.026.html 1 多需求多类型自提点选址分配问题研究 李珍萍，毛小寸 (北京物资学院 信息学院，北京 101149) 摘要：研究了多需求多类型自提点选址分配问题，在考虑顾客满意度的基础上，建立了以总成 本最小为目标的混合整数规划模型，根据模型可以确定各类型自提点的建立位置、以及各个自提点 服务的需求点集合，进一步根据多需求多类型自提点选址分配问题的特征设计了求解模型的遗传算 法。利用具体算例进行了模拟计算，结果显示，本文设计的遗传算法能有效求解带容量约束及顾客 满意度约束的多需求多类型自提点选址分配问题。本文的研究成果为解决快递企业末端配送设施选 址分配问题提供了理论依据。 关键词：多需求；多类型自提点；选址分配问题；整数规划模型；遗传算法 中图分类号： O221.4 ； TP301.6 文献标识码：A Research on the Location and Assignment Problem of Pick-up Points under Multiple types of Demands LI Zhenping，MAO Xiaocun (School of Information, Beijing Wuzi University, Beijing 101149, China) Abstract：The location and assignment problem of pick-up points under multiple types of demands is investigated. Considering the customer satisfaction, a mixed integer programming model is formulated to minimize the total cost of pick-up points. According to the model, the location of each selected pick-up point can be determined, and the demand points served by each established pick-up point are determined. Furthermore, the genetic algorithm is designed to solve the model based on the feature of the problem. The simulation results show that the genetic algorithm designed in this paper can effectively solve the location and assignment problem of pick-up points under multiple types of demands with capacity constraints and customer satisfaction constraints. The results of this paper can provide a theoretical basis fo