| 一类带时间和容量约束的截流选址问题 |
| |
| 引用本文： | 马云峰,刘勇,杨超.一类带时间和容量约束的截流选址问题[J].武汉科技大学学报(自然科学版),2007,30(2):217-219. |
| |
| 作者姓名： | 马云峰 刘勇 杨超 |
| |
| 作者单位： | 1. 武汉科技大学管理学院,湖北,武汉,430081
2. 华中科技大学管理学院,湖北,武汉,430074 |
| |
| 基金项目： | 国家自然科学基金;武汉科技大学校科研和教改项目 |
| |
| 摘 要： | 讨论一类在交通网络中设立服务站的最优选址问题。在给定的网络G（V，A）中有r对O-D用户流。在总建站费用最小的目标下考虑3个因素：每对用户流都能得到服务；每对用户流的时间满意度不低于某一给定值；每个服务站的服务能力是有限制的。通过分析这类问题的特征后，形成一个线性混合整数规划模型，并给出了求解实例。
|
| 关 键 词： | 网络选址 截流 时间满意 |
| 文章编号： | 1672-3090(2007)02-0217-03 |
| 修稿时间： | 2006-07-16 |
A flow interception location problem constrained by time satisfaction and capacity |
| |
| Ma Yunfeng,Liu Yong,Yang Chao.A flow interception location problem constrained by time satisfaction and capacity[J].Journal of Wuhan University of Science and Technology(Natural Science Edition),2007,30(2):217-219. |
| |
| Authors: | Ma Yunfeng Liu Yong Yang Chao |
| |
| Institution: | 1. College of Management, Wuhan University of Science and Technology, Wuhan 430081, China; 2. School of Management, Huazhong University of Science and Technology, Wuhan 430074, China |
| |
| Abstract: | 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. |
| |
| Keywords: | network location flow interception time satisfaction |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
