摘要
分析一类在交通网络中设立服务站的最优选址问题。在给定的网络G(V,A)中有r对O-D用户流,我们在总的建站费用最小的目标下考虑下面三个因素:1每对用户流都能得到服务;2每对用户流所走的总路程不超过某一给定的距离;3每个服务站的服务能力是有限制的。在分析这类问题的特征后,我们形成了一个线性混合整数规划模型,并给出求解实例。
This article investigates a kind of service facilities optimal location problem in traffic network. Given a network G(V,A) with r known origin-destination pairs with customer flows, we consider the following three constraints under the goal of minimizing the total cost of facilities construction: (i) each customer must be served once during the journey; (ii) the distance of trip for each O-D pair flow from origin to destination is supposed to not greater than a given length; (iii) the service capacity of each facility is limited. We formulate this problem as a linear mixed integer programming and give an example to explain how to solve the problem after discussing the characteristics of this kind of problems.
出处
《系统工程》
CSCD
北大核心
2004年第1期19-23,共5页
Systems Engineering
基金
国家自然科学基金资助项目(70271027)
