大型商业建设项目交通影响范围确定方法研究

交通影响范围的确定是交通影响分析中的基础性工作之一。本文在深入分析了大型商业建设项目交通影响特点的基础上，考虑到背景交通的影响，从面向应用的角度出发，提出了一种基于商业区位的大型商业建设项目交通影响范围确定方法，对于指导不同城市的交通影响分析工作具有重要的理论意义及应用价值。     

一种前方车辆后轮接地点检测算法

现有车辆定位算法通常通过检测车辆底部阴影来定位车辆,该算法受阴影形状大小变化的影响较大,定位精度较低。该文提出了一种通过检测前方车辆后轮接地点来精确定位车辆的方法。首先通过垂直边缘和对称性测度实现路面车辆的初定位;然后利用车辆垂直边缘和后部水平边缘显著性的特点获得后车轮可能存在的感兴趣区(ROI);最后在该ROI中通过Tamura纹理特征的粗糙度对车轮和地面进行区分,精确地得到车轮接地点位置。     

新建铁路客车上水站点布设规划的原则

现行的新建改建铁路的客车上水站点布设的原则通常是依照《铁路给水排水设计规范》按间距确定,合理性有所欠缺.本文从分析影响新建铁路客车上水站点布设的各种因素着手,研究并提出了列车途中用水供需平衡模式,按运行时间和运行距离结合的原则,通过理论计算确定新建改建铁路客车上水站点的布设规划.     

实现道路驾驶技能考试自动化的技术基础

实现驾驶人实际道路考试的自动化,需要采集驾驶人、考车及周边静态物体、动态物体的各种参数,仅使用传统的传感检测技术难以满足要求.载波相位实时动态差分(RTK)GPS定位技术、超声波动态测距技术和驾驶人视线方向视频检测技术是三种新的检测技术,可大大提高实际道路考试的自动化检测率,提高整个实际道路考试系统的自动化考试程度,且能保证考试要求的检测精度和实时性要求.     

A generalized sensor location model for the estimation of network origin–destination matrices

This study examined the network sensor location problem by using heterogeneous sensor information to estimate link-based network origin–destination (O–D) demands. The proposed generalized sensor location model enables different sensors’ traffic monitoring capabilities to be used efficiently and the optimal number and deployment locations of both passive- and active-type sensors to be determined simultaneously without path enumeration. The proposed sensor location model was applied to solve the network O–D demand estimation problem. One unique aspect of the proposed model and solution algorithms is that they provide satisfactory network O–D demand estimates without requiring unreasonable assumptions of known prior information on O–D demands, turning proportions, or route choice probabilities. Therefore, the proposed model and solution algorithms can be practically used in numerous offline transportation planning and online traffic operation applications.     

Dynamic location: an iconic model to synchronize temporal and spatial transportation data

This paper describes a model to synchronize the management and query of temporal and spatially referenced transportation data in geographic information systems (GIS). The model employs a method referred to as dynamic location, which facilitates spatial intersect queries from geographic shapes without the use of topological relationships. This is the inverse of how dynamic segmentation works in GIS. In contrast to dynamic segmentation, dynamic location stores geometry as an object within a single database field. This is an efficient, precise iconic model superseding the need for data decomposition into a complex set of tables. As an object model, the dynamic location process lends itself to high performance in an Internet, data-intensive, enterprise environment. Linear events are stored as {x, y} features, and not referenced to any route system. Route systems are built from {x, y, m} values (m for measure) and serve as number lines for mathematical operations. Any {x, y} object can then be referenced to either the Cartesian grid or any selected number line. This method offers the benefits of linear referencing, while making full use of a stable geodetic datum. Combinations of any {x, y} events may be placed over any {x, y, m} number line (route) and an intersect determined by looking through stacked {x, y, m} vertices of the coincident shapes. Since both geometry and shape reside in the same record, the use of “begin” and “end” dates facilitates full spatial and temporal version control. From a business process perspective, this creates a spatially enabled database, pulling GIS business functions back into the information technology mainstream.     

The design of single allocation incomplete hub networks

The hub location problem deals with finding the location of hub facilities and allocating the demand nodes to these hub facilities so as to effectively route the demand between any origin–destination pair. In the extensive literature on this challenging network design problem, it has widely been assumed that the subgraph induced by the hub nodes is complete. Relaxation of this basic assumption constitutes the starting point of the present work. In this study, we provide a uniform modeling treatment to all the single allocation variants of the existing hub location problems, under the incomplete hub network design. No network structure other than connectivity is imposed on the induced hub network. Within this context, the single allocation incomplete p-hub median, the incomplete hub location with fixed costs, the incomplete hub covering, and the incomplete p-hub center network design problems are defined, and efficient mathematical formulations for these problems with O(n³) variables are introduced. Computational analyses with these formulations are presented on the various instances of the CAB data set and on the Turkish network.     

跨境供应链网络海外仓的鲁棒性选址模型及算法

新经济形态下，全球政治、经济形势瞬息万变，多种人为和自然因素导致商业供应链的生存环境日益严峻. 跨境供应链网络作为典型的时效性和运营环境等都具有极大不确定性的复杂网络，研究其鲁棒性问题具有一定的理论意义和实际应用场景. 首先阐明了跨境供应链网络的内涵，认为海外仓的选址优化是控制网络鲁棒性的重要手段；随后基于最小最大后悔值构建了海外仓的鲁棒性选址模型，利用情景松弛算法对模型进行求解. 算例分析结果证明，所构建的海外仓鲁棒性选址模型及算法适用于跨境供应链网络情景.     

施工便道用漫水桥结构设计

为保证某漫水桥的正常通行,在考虑施工现场条件的基础上,设计了一种施工便道用漫水桥结构。介绍该漫水桥的结构设计,对其结构安全进行检算,并从桥位、桥面高程、桥型、桥台和行车道等方面总结设计思路。结果表明,该施工便道用漫水桥结构设计总体上安全可靠,将该漫水桥应用于现场施工,使用期间漫水桥结构稳定,效果良好。     

An equilibrium analysis of commuter parking in the era of autonomous vehicles

This study is the first in the literature to model the joint equilibrium of departure time and parking location choices when commuters travel with autonomous vehicles (AVs). With AVs, walking from parking spaces to the work location is not needed. Instead, AVs will drop off the commuters at the workplace and then drive themselves to the parking spaces. In this context, the equilibrium departure/arrival profile is different from the literature with non-autonomous vehicles (non-AVs). Besides modeling the commuting equilibrium, this study further develops the first-best time-dependent congestion tolling scheme to achieve the system optimum. Also, a location-dependent parking pricing scheme is developed to replace the tolling scheme. Furthermore, this study discusses the optimal parking supply to minimize the total system cost (including both the travel cost and the social cost of parking supply) under either user equilibrium or system optimum traffic flow pattern. It is found that the optimal planning of parking can be different from the non-AV situation, since the vehicles can drive themselves to parking spaces that are further away from the city center and walking of commuters is avoided. This paper sheds light on future parking supply planning and traffic management.