城市交通仿真系统设计与开发

依托智能交通系统对交通规划过程提供技术和决策支持,是当前中国大城市ITS建设的一项重要任务.建设面向规划决策的交通信息平台的主要目的,是通过长期、全面的数据采集和信息提炼,实现交通规划建设决策的科学化.首先运用系统分析方法对面向规划决策系统的用户--管理决策者、交通技术人员、公众进行了需求分析,提出系统软件和硬件架构;对系统实现中的关键技术问题进行了详细探讨;最后,介绍了如何应用上述设计方法实现深圳市城市交通仿真系统.城市交通仿真系统的设计理念、系统构架、功能设计和关键技术,将成为提高交通部门决策水平和业务能力的新的途径与模式.     

跑道不停航施工组织的数学建模与求解

跑道不停航加铺工程要求在较短的施工周期内完成多项关键施工工序的实施,受到时间周期、资源利用、工序完整性等多方面的制约,因此,科学合理的施工组织方案对于确保工程质量意义重大。该文充分考虑了跑道不停航施工的各种制约因素,分析测算了各道工序的施工时间,基于最优化方法原理,通过施工组织网络图建立了不停航施工组织优化的数学模型。该模型能够灵活地根据所选决策变量定量求解出施工周期内的施工能力,根据时间和资源两方面的约束条件给出资源的合理配置,可为相似工程编制合理的施工组织方案提供参考。     

国土空间规划体系下地下空间规划编制研究

理解地下空间的内涵,指出地下空间是城市重要的战略资源。提出转变地下空间发展理念,突出规划的引领作用。以北京市为例,结合北京地下空间规划建设经验,探索构建“全市—分区—特定地区”的地下空间规划编制体系,落实“生态优先、底线约束、专项统筹、刚性管控”的国土空间规划要求,提出各级地下空间规划编制的重点内容和技术方法。指出加强地下空间体制机制建设应从建立地下空间综合管理机制、推进地下空间技术标准整合、健全完善地下空间立法体系、建立国土空间三维信息平台4方面着手,健全地下空间规划实施保障。认为： 地下空间规划作为国土空间规划中的专项规划,应建立与国土空间规划体系相衔接的地下空间规划编制体系;在规划层级上,逐步建立和完善“全市—分区—特定地区”的全域、全要素地下空间规划体系,推动各级地下空间规划编制;在规划内容上,地下空间作为重要的国土空间资源,应立足地下空间资源禀赋和环境承载能力,明确地下空间生态安全底线,科学判断地下空间生态适宜性分区和开发利用重点分区,有效协调各类地下功能设施布局关系;在规划实施方面,应健全地下空间的刚性管控传导机制,加强地下空间的体制机制建设,完善地下空间部门管理、技术标准、权属管理、信息管理等方面的相关法律规范,以科学指导地下空间资源的合理有序利用。     

A new generalized travel cost based connectivity metric applied to Scandinavian airports

This article proposes a new, generalized travel cost based method to operationalize network accessibility provided by airports. The approach is novel as it integrates features of network topology with multiple quality aspects of scheduled air transport services into one metric. The method estimates generalized travel costs for the full set of feasible travel paths between an airport and all network destinations. Rooftop modeling accounts for schedule delay and isolates the most cost-efficient travel paths per O-D relation. Respecting the assumed arrival time preference of passengers and adjusting for destination importance, connectivity scores are derived. The method is then applied to explore changes in the global connectivity pattern of Scandinavian airports from 2004 to 2018. The results suggest distinct spatial differences throughout the network, but less pronounced in size than suggested by popularly applied connectivity measures. Findings also highlight the importance of the geographical location as a determinate of an airport’s connectivity.     

中心城区路网优化策略研究 ——以沧州市为例

为解决中心城区道路拥堵问题,分析了城区交通拥堵形成的主要原因,并基于此提出中心城区路网优化策略。以沧州市中心城区为例,详细阐述了其路网优化设计的基本思路和路网布局,最终得出沧州市中心城区路网优化设计方案。     

基于体能消耗规律的游憩道路规划建设

随着当前社会经济的进步,我国旅游行业发展极为迅速,人们休闲意识的提升,旅游以及游憩活动在人们日常生活中逐步增多,而游憩作为人们旅游的重要组成内容,游憩道路必须结合人们体能消耗规律进行实时规划建设,虽然目前人类交通方式的多元化使得游憩活动空间障碍得以有效减少,但徒步游览仍是大部分观光型景区及游憩区的主要活动方式,这个过程中人们游憩道路过长,体能消耗所带来的疲劳感往往会导致其自身游览满意度降低,甚至对自身健康带来一定安全隐患,且老人和幼儿等特殊人群活动时间及活动方式有限,也使其对游憩道路要求更高。对基于体能消耗规律的游憩道路规划建设,进行分析探讨,并对其做相应整理和总结。     

武汉光谷国际网球中心与三环线衔接匝道研究

介绍了武汉市三环线武黄立交新增匝道的设计思路、方案调整及匝道车道数研究。通过分析新增匝道建设的主要受控因素,提出了三环线到达及驶离网球中心停车场不同路径的匝道方案,并从多方面对匝道方案进行综合比选。     

The Storage Space Allocation Problem at a Container Terminal

Due to the asymmetry between the time required to retrieve a container to vessel and the time required to register a container at the gate, the storage space allocation problem solves the best allocation policy of these containers that minimizes the potential number of gantry movements during the assigning process and the future retrieval process. A decision rule-based heuristic is proposed, and three properties are discovered in this research. Comprehensive numerical experiments show that the proposed heuristic can solve the real-sized instances within a second, making it possible to account for uncertainty because the re-optimization effort is negligible. Moreover, when applying the proposed heuristic to a container yard at the Port of Kaohsiung in Taiwan and considering the extreme cases, the heuristic performs even better when the number of containers increases and still requires less than 1 s to solve these extreme cases. Finally, the proposed heuristic can be applied to different layouts of storage space and various material handling machines.     

Genetics of traffic assignment models for strategic transport planning

This paper presents a review and classification of traffic assignment models for strategic transport planning purposes by using concepts analogous to genetics in biology. Traffic assignment models share the same theoretical framework (DNA), but differ in capability (genes). We argue that all traffic assignment models can be described by three genes. The first gene determines the spatial capability (unrestricted, capacity restrained, capacity constrained, and capacity and storage constrained) described by four spatial assumptions (shape of the fundamental diagram, capacity constraints, storage constraints, and turn flow restrictions). The second gene determines the temporal capability (static, semi-dynamic, and dynamic) described by three temporal assumptions (wave speeds, vehicle propagation speeds, and residual traffic transfer). The third gene determines the behavioural capability (all-or-nothing, one shot, and equilibrium) described by two behavioural assumptions (decision-making and travel time consideration). This classification provides a deeper understanding of the often implicit assumptions made in traffic assignment models described in the literature. It further allows for comparing different models in terms of functionality, and paves the way for developing novel traffic assignment models.     

Bike route choice modeling using GPS data without choice sets of paths

Concerned by the nuisances of motorized travel on urban life, policy makers are faced with the challenge of making cycling a more attractive alternative for everyday transportation. Route choice models can help achieve this objective by gaining insights into the trade-offs cyclists make when choosing their routes and by allowing the effect of infrastructure improvements to be analyzed. We estimate a link-based bike route choice model from a sample of GPS observations in the city of Eugene on a network comprising over 40,000 links. The so-called recursive logit (RL) model (Fosgerau et al., 2013) does not require to sample any choice set of paths. We show the advantages of this approach in the context of prediction by focusing on two applications of the model: link flows and accessibility measures. Compared to the path-based approach which requires to generate choice sets, the RL model proves to make significant gains in computational time and to avoid paradoxical accessibility measure results discussed in previous works, e.g. Nassir et al. (2014).