一类带时间和容量约束的截流选址问题  

A flow interception location problem constrained by time satisfaction and capacity

作　　者：马云峰[1] 刘勇[1] 杨超[2] 

机构地区：[1]武汉科技大学管理学院,湖北武汉430081 [2]华中科技大学管理学院,湖北武汉430074

出　　处：《武汉科技大学学报》2007年第2期217-219,共3页Journal of Wuhan University of Science and Technology

基　　金：国家自然科学基金资助项目(70271027);武汉科技大学科学研究发展基金重点资助项目(2006XZ9)

摘　　要：讨论一类在交通网络中设立服务站的最优选址问题。在给定的网络G(V,A)中有r对O-D用户流。在总建站费用最小的目标下考虑3个因素:每对用户流都能得到服务;每对用户流的时间满意度不低于某一给定值;每个服务站的服务能力是有限制的。通过分析这类问题的特征后,形成一个线性混合整数规划模型,并给出了求解实例。This paper investigates a kind of service facilities optimal location problem in traffic network. Given a network with known origin destination pairs with customer flows, the following three constraints are considered under the goal of minimizing the total cost of facilities construction： each customer must be served once during the journey; the time satisfaction of trip for each O-D pair flow from origin to destination is supposed not to be smaller than a given value; the service capacity of each facility is limited. The problem is formulated as a linear mixed integer programming and an example is given to explain how to solve the problem after discussing the characteristics of this kind of problem.

关 键 词：网络选址 截流 时间满意 

分 类 号：O221[理学—运筹学与控制论] F270[理学—数学]