首页 | 本学科首页   官方微博 | 高级检索  
     

适于估计OD矩阵的交通检测点的最优分布
引用本文:周晶, 盛昭瀚, 何建敏, 杨海, 王长君. 适于估计OD矩阵的交通检测点的最优分布. 自动化学报, 2000, 26(3): 303-309.
作者姓名:周晶  盛昭瀚  何建敏  杨海  王长君
作者单位:1.东南大学经济管理学院,南京;;;2.香港科技大学土木工程系,香港;;;3.公安部交通管理科学研究所,无锡
基金项目:国家九五科技攻关项目!( 96 -A1 5 -0 2 -0 3)
摘    要:讨论了适于估计起迄点出行分布矩阵(OD矩阵)的交通检测点的合理分布问题.根据检测点应当满足的规则,建立了关于检测点分布的非线性规划模型.在已知极点问转移概率的前提下,将检测点的分布问题描述成一个平均报酬Markov决策过程,并通过转化为一个等价的整数线性规划问题来求解.最后实例结果表明该模型是有效的、合理的.

关 键 词:起迄点出行分布矩阵   交通检测点   平均报酬马尔可夫决策过程   整数线性规划
收稿时间:1997-07-15
修稿时间:1997-07-15

OPTIMAL LOCATION OF TRAFFIC COUNTING POINTS FOR ESTIMATING OD TRIP MATRIX
Zhou Jing, Sheng Zhaohan, He Jianmin, Yang Hai, Wang Changjun. Optimal Location of Traffic Counting Points for Estimating OD Trip Matrix. ACTA AUTOMATICA SINICA, 2000, 26(3): 303-309.
Authors:ZHOU Jing  SHENG Zhaohan  HE Jianmin  YANG Hai  WANG Changjun
Affiliation:1. School of Economics and Management,Southeast University,Nanjing;Dept.of Crvil&Structural Engineering,the Hong Kong University of Science&Technology,Hong Kong;Traffic Management Research Insitute,Wuxi
Abstract:This paper discusses how to determinethe optimal number and locations of traffic counting points in a road network forestimating the origin-destination trip matrix. Based on location rules, a nonlinearprogramming model for determining the optimal locations of traffic counting points isaddressed under a given OD distribution pattern. Such problem can also be described as anaverage reward Markov decision process (MDP) with additional constraints, which can beequivalent to an integer linear programming problem. The computational example shows thatthe results obtained are satisfactory.
Keywords:Origin destination trip matrix   traffic counting points   average reward Markov decision process   integer linear programming.
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《自动化学报》浏览原始摘要信息
点击此处可从《自动化学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号