面向汽车运行工况数据采集的道路等级K核划分方法（英文）
|
摘要
为解决需采集大量汽车工况数据以保证试验数据的代表性以致试验成本显著增加的问题,研究了路网的等级特性,提出了一种基于K核和最优分割理论的城市道路等级划分方法。K核算法通过同时考虑道路流量和道路位置,使得Ks值相近的道路具有相似的速度和加速度概率分布;并可以根据不同道路的Ks值,采用最优分割理论将整个道路网络分为若干等级;伪F统计量被用来确定路网划分的合理等级个数。根据长春2辆出租车1年的行驶数据和通化1辆出租车半年的行驶数据,将长春和通化的路网分为3个等级。结果表明:同一等级下道路的速度、加速度概率分布具有很高的相似度,尤其是占城市绝大部分流量的前两等级,其样本相似系数αab高达70%以上,因此在进行汽车运行工况数据采集的过程中,只需采集每种等级中很少的几条道路就可以代表整个路网的特征;利用路网的等级特性研究的K核分级方法,可以在保证数据代表性的前提下,减少汽车运行工况数据采集的时间和数据量。
In order to solve the problem of significant increase of experiment cost in acquiring massive vehicle driving cycle data so as to ensure the representativeness of experimental data,the hierarchical properties of urban road network were investigated and an urban road hierarchy method based on K-core algorithm and optimal partitioning theory was proposed.By simultaneously taking the location and traffic flow of roads into account,the K-core algorithm made roads which had close Ksvalue own similar velocity probability distribution and acceleration probability distribution.Furthermore,based on the Ksvalue of each road,the whole road network was divided into several hierarchies by the optimal partitioning method.The pseudo-statistic was employed to obtain the reasonable number of partition.According to the one year driving data of two Changchun taxis and half a month driving data of one Tonghua taxi,the road networks of Changchun and Tonghua were divided into three parts.The results show that roads in the same level have high similarity in velocity and acceleration probability distribution,especially for roads in the first two levels which occupy most traffic flow of the cities with sample similarity coefficient of above70%.Thus,in the process of vehicle driving cycle data collection,driving data from several roads which come from each hierarchy could represent the characteristics of the whole road network.This method can reduce the collection time and the amount of data in the vehicle driving cycle data collection procedure on the premise of good representativeness of the driving data.
In order to solve the problem of significant increase of experiment cost in acquiring massive vehicle driving cycle data so as to ensure the representativeness of experimental data,the hierarchical properties of urban road network were investigated and an urban road hierarchy method based on K-core algorithm and optimal partitioning theory was proposed.By simultaneously taking the location and traffic flow of roads into account,the K-core algorithm made roads which had close Ksvalue own similar velocity probability distribution and acceleration probability distribution.Furthermore,based on the Ksvalue of each road,the whole road network was divided into several hierarchies by the optimal partitioning method.The pseudo-statistic was employed to obtain the reasonable number of partition.According to the one year driving data of two Changchun taxis and half a month driving data of one Tonghua taxi,the road networks of Changchun and Tonghua were divided into three parts.The results show that roads in the same level have high similarity in velocity and acceleration probability distribution,especially for roads in the first two levels which occupy most traffic flow of the cities with sample similarity coefficient of above70%.Thus,in the process of vehicle driving cycle data collection,driving data from several roads which come from each hierarchy could represent the characteristics of the whole road network.This method can reduce the collection time and the amount of data in the vehicle driving cycle data collection procedure on the premise of good representativeness of the driving data.
引文
[1]XU Hong-guo.Fundation of Vehicle Operation[M].Beijing:Tsinghua University Press,2004.
[2]SHI Shu-ming,LIN Nan,ZHANG Yan,et al.Research on Markov Property Analysis of Driving Cycle[C]//IEEE.Proceedings of Vehicle Power and Propulsion Conference,2013.New York:IEEE,2013:1-5.
[3]TONG H,HUNG W,CHEUNG C.Development of a Driving Cycle for Hong Kong[J].Atmospheric Environment,1999,33(15):2323-2335.
[4]ESTEVES-BOOTH A,MUMTEER T,KIRBY H,et al.The Measurement of Vehicular Driving Cycle Within the City of Edinburgh[J].Transportation Research Part D,2001,6(3):209-220.
[5]CHIANG H Z,HUANG P H,LAI Y M,et al.Comparison of the Regulated Air Pollutant Emission Characteristics of Real-world Driving Cycle and ECECycle for Motorcycles[J].Atmospheric Environment,2014,87:1-9.
[6]ANDRE M,JOUMARD R,VIDON R,et al.Realworld European Driving Cycles for Measuring Pollutant Emissions from High-and Low-powered Cars[J].Atmospheric Environment,2006,40(31):5944-5953.
[7]ASHTARI A,BIBEAU E,SHAHIDINEJAD S.Using Large Driving Record Samples and a Stochastic Approach for Real-world Driving Cycle Construction:Winnipeg Driving Cycle[J].Transportation Science,2012,48(2):170-183.
[8]HAN D S,CHOI N W,CHO S L,et al.Characterization of Driving Patterns and Development of a Driving Cycle in a Military Area[J].Transportation Research Part D,2012,17(7):519-524.
[9]MALLOUH M A,SURGENOR B,ABDELHAFEZE,et al.Development of a Driving Cycle for Amman City with Performance Evaluation for ICE Vehicle[C]//ASME.Proceedings of 2014 12th Biennial Conference on Engineering Systems Design and Analysis.New York:ASME,2014:1-5.
[10]SCHWARZER V,GHORBANI R.Drive Cycle Generation for Design Optimization of Electric Vehicles[J].IEEE Transactions on Vehicular Technology,2013,62(1):89-97.
[11]LIN J,NIEMEIER D A.An Exploratory Analysis Comparing a Stochastic Driving Cycle to California's Regulatory Cycle[J].Atmospheric Environment,2002,36(38):5759-5770.
[12]HO S H,WONG Y D,CHANG V W.Developing Singapore Driving Cycle for Passenger Cars to Estimate Fuel Consumption and Vehicular Emissions[J].Atmospheric Environment,2014,97:353-362.
[13]TZENG G H,CHEN J J.Developing a Taipei Motorcycle Driving Cycle for Emissions and Fuel Economy[J].Transportation Research Part D,1998,3(1):19-27.
[14]WANG Qi-dong,HUO Hong,HE Ke-bin,et al.Characterization of Vehicle Driving Patterns and Development of Driving Cycles in Chinese Cities[J].Transportation Research Part D,2008,13(5):289-297.
[15]JIANG Bin.Street Hierarchies:A Minority of Streets Account for a Majority of Traffic Flow[J].International Journal of Geographical Information Science,2009,23(8):1033-1048.
[16]LUAN Xue-chen,YANG Bi-sheng,ZHANG Yun-fei.Structural Hierarchy Analysis of Stress Based on Complex Network Theory[J].Geomatics and Information Science of Wuhan University,2012,37(6):728-732.
[17]WU Di.Research on the Computational Method Based on Markov Chain for Road Weight of Traffic Network[D].Changchun:Jilin University,2011.
[18]NEWMAN M E J.The Structure of Scientific Collaboration Networks[J].Proceedings of the National Academy of Sciences,2001,98(2):404-409.
[19]SHIBATA N,KAJIKAWA Y,TAKEDA Y,et al.Detecting Emerging Research Fronts Based on Topological Measures in Citation Networks of Scientific Publications[J].Technovation,2008,28(11):758-775.
[20]NEWMAN M E J.Analysis of Weighted Networks[J].Physical Review E,2004,70(5):1-9.
[21]WU Jian-jun.The Complexity of Traffic Systems:Methods and Applications of Complex Networks[M].Beijing:Science Press,2010.
[22]PORTA S,CRUCITTI P,LATORA V.The Network Analysis of Urban Streets:A Dual Approach[J].Physica A,2006,369(2):853-866.
[23]CHAN S H Y,DONNER R V,LAMMER S.Urban Road Networks-Spatial Networks with Universal Geometric Features?[J].The European Physical Journal B,2011,84(4):563-577.
[24]JIANG Bin,JIA Tao.Zipf's Law for All the Natural Cities in the United States:A Geospatial Perspective[J].International Journal of Geographical Information Science,2011,25(8):1269-1281.
[25]GARAS A,SCHWEITZER F,HAVLIN S.A K-shell Decomposition Method for Weighted Networks[J].New Journal of Physics,2012,14(8):1-14.
[26]ALVAREZ-HAMELIN J I,DALL'ASTAL L,BAR-RAT A,et al.K-core Decomposition of Internet Graphs:Hierarchies,Self-similarity and Measurement Biases[J].Networks&Heterogeneous Media,2005,3(2):371-393.
[27]WANG Pei,TIAN Chen-geng,LU Juan-an.Identifying Influential Spreaders in Artificial Complex Networks[J].Journal of Systems Science and Complexity,2014,27(4):650-665.
[28]ZHANG Sheng-rui,SHAO Chun-fu,ZHOU Wei.Theories and Methods of Traffic Flow[M].Beijing:China Railway Press,2010.
[29]LATTIN J M,CARROLL J D,GREEN P E.Analyzing Multivariate Data[M].Toronto:Thomson Brooks,2003.
[30]SONG Li-xin,WANG Da-hui.Test for the Equality of the Probability Distribution of Two Populations with Nominal Scales[J].Acta Scientiarum Naturalium Universitatis Jilinensis,1997(3):14-16.
[2]SHI Shu-ming,LIN Nan,ZHANG Yan,et al.Research on Markov Property Analysis of Driving Cycle[C]//IEEE.Proceedings of Vehicle Power and Propulsion Conference,2013.New York:IEEE,2013:1-5.
[3]TONG H,HUNG W,CHEUNG C.Development of a Driving Cycle for Hong Kong[J].Atmospheric Environment,1999,33(15):2323-2335.
[4]ESTEVES-BOOTH A,MUMTEER T,KIRBY H,et al.The Measurement of Vehicular Driving Cycle Within the City of Edinburgh[J].Transportation Research Part D,2001,6(3):209-220.
[5]CHIANG H Z,HUANG P H,LAI Y M,et al.Comparison of the Regulated Air Pollutant Emission Characteristics of Real-world Driving Cycle and ECECycle for Motorcycles[J].Atmospheric Environment,2014,87:1-9.
[6]ANDRE M,JOUMARD R,VIDON R,et al.Realworld European Driving Cycles for Measuring Pollutant Emissions from High-and Low-powered Cars[J].Atmospheric Environment,2006,40(31):5944-5953.
[7]ASHTARI A,BIBEAU E,SHAHIDINEJAD S.Using Large Driving Record Samples and a Stochastic Approach for Real-world Driving Cycle Construction:Winnipeg Driving Cycle[J].Transportation Science,2012,48(2):170-183.
[8]HAN D S,CHOI N W,CHO S L,et al.Characterization of Driving Patterns and Development of a Driving Cycle in a Military Area[J].Transportation Research Part D,2012,17(7):519-524.
[9]MALLOUH M A,SURGENOR B,ABDELHAFEZE,et al.Development of a Driving Cycle for Amman City with Performance Evaluation for ICE Vehicle[C]//ASME.Proceedings of 2014 12th Biennial Conference on Engineering Systems Design and Analysis.New York:ASME,2014:1-5.
[10]SCHWARZER V,GHORBANI R.Drive Cycle Generation for Design Optimization of Electric Vehicles[J].IEEE Transactions on Vehicular Technology,2013,62(1):89-97.
[11]LIN J,NIEMEIER D A.An Exploratory Analysis Comparing a Stochastic Driving Cycle to California's Regulatory Cycle[J].Atmospheric Environment,2002,36(38):5759-5770.
[12]HO S H,WONG Y D,CHANG V W.Developing Singapore Driving Cycle for Passenger Cars to Estimate Fuel Consumption and Vehicular Emissions[J].Atmospheric Environment,2014,97:353-362.
[13]TZENG G H,CHEN J J.Developing a Taipei Motorcycle Driving Cycle for Emissions and Fuel Economy[J].Transportation Research Part D,1998,3(1):19-27.
[14]WANG Qi-dong,HUO Hong,HE Ke-bin,et al.Characterization of Vehicle Driving Patterns and Development of Driving Cycles in Chinese Cities[J].Transportation Research Part D,2008,13(5):289-297.
[15]JIANG Bin.Street Hierarchies:A Minority of Streets Account for a Majority of Traffic Flow[J].International Journal of Geographical Information Science,2009,23(8):1033-1048.
[16]LUAN Xue-chen,YANG Bi-sheng,ZHANG Yun-fei.Structural Hierarchy Analysis of Stress Based on Complex Network Theory[J].Geomatics and Information Science of Wuhan University,2012,37(6):728-732.
[17]WU Di.Research on the Computational Method Based on Markov Chain for Road Weight of Traffic Network[D].Changchun:Jilin University,2011.
[18]NEWMAN M E J.The Structure of Scientific Collaboration Networks[J].Proceedings of the National Academy of Sciences,2001,98(2):404-409.
[19]SHIBATA N,KAJIKAWA Y,TAKEDA Y,et al.Detecting Emerging Research Fronts Based on Topological Measures in Citation Networks of Scientific Publications[J].Technovation,2008,28(11):758-775.
[20]NEWMAN M E J.Analysis of Weighted Networks[J].Physical Review E,2004,70(5):1-9.
[21]WU Jian-jun.The Complexity of Traffic Systems:Methods and Applications of Complex Networks[M].Beijing:Science Press,2010.
[22]PORTA S,CRUCITTI P,LATORA V.The Network Analysis of Urban Streets:A Dual Approach[J].Physica A,2006,369(2):853-866.
[23]CHAN S H Y,DONNER R V,LAMMER S.Urban Road Networks-Spatial Networks with Universal Geometric Features?[J].The European Physical Journal B,2011,84(4):563-577.
[24]JIANG Bin,JIA Tao.Zipf's Law for All the Natural Cities in the United States:A Geospatial Perspective[J].International Journal of Geographical Information Science,2011,25(8):1269-1281.
[25]GARAS A,SCHWEITZER F,HAVLIN S.A K-shell Decomposition Method for Weighted Networks[J].New Journal of Physics,2012,14(8):1-14.
[26]ALVAREZ-HAMELIN J I,DALL'ASTAL L,BAR-RAT A,et al.K-core Decomposition of Internet Graphs:Hierarchies,Self-similarity and Measurement Biases[J].Networks&Heterogeneous Media,2005,3(2):371-393.
[27]WANG Pei,TIAN Chen-geng,LU Juan-an.Identifying Influential Spreaders in Artificial Complex Networks[J].Journal of Systems Science and Complexity,2014,27(4):650-665.
[28]ZHANG Sheng-rui,SHAO Chun-fu,ZHOU Wei.Theories and Methods of Traffic Flow[M].Beijing:China Railway Press,2010.
[29]LATTIN J M,CARROLL J D,GREEN P E.Analyzing Multivariate Data[M].Toronto:Thomson Brooks,2003.
[30]SONG Li-xin,WANG Da-hui.Test for the Equality of the Probability Distribution of Two Populations with Nominal Scales[J].Acta Scientiarum Naturalium Universitatis Jilinensis,1997(3):14-16.