期刊文献+

城市道路交通可视化建模及仿真研究 被引量:4

Visual Modeling and Simulation in Urban Traffic
下载PDF
导出
摘要 交通仿真是对交通事件和交通管理策略进行分析和评估的有效手段之一。为保证仿真结果的准确性,必须对路网特征进行细致的描述。对于城市路网,其拓扑关系复杂,路口渠化设计多样。如果在仿真中引入调用OpenFlight API进行辅助建模技术,用户就能快速对路网进行创建和修改。文中介绍了OpenFlight格式以及OpenFlight API,并对基于三维视景仿真的城市交通仿真系统调用OpenFlight API进行辅助建模的关键技术进行了探讨。进行实例研究,取得了较好的效果。 Traffic simulation is an effective measure to analyze and evaluate traffic incident and traffic management strategy. In order to ensure the accuracy of simulation results, the network features must be described in detail. For urban network, its topology relationship is complex and drainage design is diverse. If the auxiliary modeling technology is used by transferring OpenFlight API in the simulation, the users can quickly create and edit the network. The OpenFlight form and OpenFlight API were introduced. The key technologies of auxiliary modeling transferring OpenFlight API in the urban traffic simulation system were discussed. Finally, some case studies were carried out, which achieved good results.
出处 《交通与计算机》 2008年第6期43-46,共4页 Computer and Communications
基金 北京市科委项目(批准号:D07020601400705)资助
关键词 OPENFLIGHT 交通仿真 可视化建模 OpenFlight traffic simulation visual modeling
  • 相关文献

参考文献11

  • 1CHEN C H, TING C J. A hybrid ant colony system for vehicle routing problem with time windows [J]. Journal of the Eastern Asia Society for Trans- portation Studies 2005, 6(10):2 822-2 836 被引量:1
  • 2Alvarenga G B, Mateus G R, Tomi G. A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows [J]. Computers & Operations Research 2007, 34(6):1 561- 1 584 被引量:1
  • 3Zhong Y J, Cole M H. A vehicle routing problem with backhauls and time windows: a guided local search solution [J]. Transportation Research Part E 2005, 41(1) :131-144 被引量:1
  • 4Dorigo M, Maniezzo V, Colorni A. Positive feed back as a search strategy [R]. Politecnico di Mila no, Dipartimento di Elettronica, Milan, Italy Tech, Rep. 1991 被引量:1
  • 5Colorni A, Dorigo M, Maniezzo V, Trubian M. Ant system for job-shop scheduling problem [J]. Belgian Journal of Operation Research, Statistics and Computer Science 1994, 34(1) :39-53 被引量:1
  • 6Gambardella L M, Taillard E, Dorigo M. Ant Colonies for QAP [R]. IDSIA, Lugano, Switzerland, TechlReplIDSIA, 1997 被引量:1
  • 7Chen C H, Ting C J. An improved ant colony system algorithm for the vehicle routing problem [J]. Journal of the Chinese Institute of Industrial Engi- neers 2006, 23(1) :115-126 被引量:1
  • 8Stutzle T, Hoos H. MAX-MIN Ant System[J]. Future Generation Computer Systems 2000, 16(8):889-914 被引量:1
  • 9Savelsbergh MWP with time windows:The vehicle ro route utirg problem duration [J]. INFORMS Journal on Computing 1992, 4(1) : 146-154 被引量:1
  • 10Potvin J Y, Rousseau J M. An exchange heuristic for routing problems with time windows [J].Journal of the Operational Research Society 1995, 46 (12):1 433-1 446 被引量:1

同被引文献21

引证文献4

二级引证文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部