一类带服务半径的服务站截流选址分配问题.pdfVIP

　2006 年 1 月 系统工程理论与实践 第 1 期 　 ( ) 文章编号 2006 一类带服务半径的服务站截流选址分配问题 杨 　　 ,张 　敏 ,陈　新 (华中科技大学管理学院 ,湖北 武汉 430074) ( ) 摘要 : 　主要研究一类带服务半径的服务站截流选址分配问题 FCLM . 首先提出了考虑服务半径 d 的 FCLM 模型 ,并给出了相应的启发式算法. 然而对于很多服务站接受服务的客户分为产生于网络结点的 固定需求量和产生于网络路径的过路需求量两大类. 因此 ,随后提出了考虑固定需求量的服务半径 D 和 过路需求量的服务半径 d 的混合 FCLM 问题的01 整数规划模型 ,给出了启发式算法. 关键词 : 　服务半径 ;截流 ;选址 ;贪婪算法 中图分类号 : 　N94 ;O22 　　　　　　　　文献标识码 : 　A 　　　 A Class of the Flow Capturing LocationAllocation Model with Service Radius YAN GJun , ZHAN G Min , CHEN Xin ( School of Management , Huazhong University of Science Technology , Wuhan 430074 , China) Abstract : 　This article considers a class of the flow capturing locationallocation model (FCLM) with service radius. With the assumption that the customer flows at most be serviced for one time , the decision obj ective for service providers is to find the optimal locations for such service facilities to maximize the number of customers “captured ”. This sort of problem is called FCLM. Actually the customer flows on the path can go to the facility with a deviation distance , which can be endured. This paper proposes the FCLM with service radius and gives an heuristic greedy algorithm. For many kinds of facilities , their customers can be divided into two parts : dedicatedtrip demand from the nodes and bypassing flow demand form the paths. Hence , a hybrid FCLM with dedicatedtrip demand service radius