检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:朱海明 郑海星 芮晓丽 何枫鸣 Zhu Haiming;Zheng Haixing;Rui Xiaoli;He Fengming(U-LANE Integrated Transportation Solutions,Tianjin 300201,China;Tianjin Urban Planning&Design Institute Co.,Ltd.,Tianjin 300201,China)
机构地区:[1]曜琅智慧科技产业(天津)有限公司,天津300201 [2]天津市城市规划设计研究总院有限公司,天津300201
出 处:《城市交通》2021年第3期94-102,共9页Urban Transport of China
摘 要:居民出行调查数据具有个体属性清晰、交通含义明确、针对性强等特点,在城市交通规划与交通需求模型构建方面具有不可替代的重要作用。为保障抽样调查数据准确反映总体的真实特征,在综合考虑效率与精度基础上,提出一种多源数据融合、家庭户及人口特征双重约束、牛顿迭代法相结合的居民出行调查数据完整扩样处理方法与流程。以天津滨海新区第一次综合交通调查数据为例,论述了算法和流程的应用情况。结果表明,该方法能有效获取家庭户及人口的总体规模及其分布,并考虑家庭户及其人口特征对扩样系数的双重影响,具有效率高、精度高、易于推广等特点。Resident travel survey data can clearly identify individual features,provide well-defined travel characteristics and well-targeted pertinence information,which plays an irreplaceable important role in urban transportation planning and traffic demand model development.In order to ensure that the sample survey data can accurately reflect the true characteristics of the population with balanced survey efficiency and data accuracy,this paper proposes a method for the comprehensive expansion of resident travel survey data,which combines multi-dimensional data fusion,dual-constraint on family households and demographic characteristics,and Newton iteration method.Taking the first comprehensive transportation survey data of Tianjin Binhai New Area as an example,the paper reviews the application of algorithms and processes.The results show that the method can effectively obtain the overall size and distribution of family households and population while taking into account the dual-influence of family households and their demographic characteristics on the expansion coefficient,with the characteristics of high efficiency,high precision,and easy application.
分 类 号:U491.12[交通运输工程—交通运输规划与管理]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49