基于改进Dijkstra算法的路径优化仿真研究

文章针对传统Dijkstra算法在路径优化过程中存在的不足,从路网拓扑关系存储和快速搜索技术两方面对其进行了改进,得到了一种改进的Dijkstra算法,并通过实例仿真分析,验证了该算法的有效性。     

道路勘测中使用GPS技术的方法

着重介绍了在道路勘测中关于GPS技术高程系统的转换、GPS控制网的布设及控制网平差三个方面内容.     

跨平台船用JLR-7700MK2型GPS仿真系统

由于大部分航海院校及培训机构采用真机设备进行船用GPS设备的教学培训,而采用真机培训成本较高,受场地因素制约,偏离航向和动态航行信息显示等功能无法在实验室环境内完成。基于大圆航线算法实现了仿真设备的航线设计和绘制功能,仿真结果更符合航海实践。采用CSS技术对GPS仿真系统界面进行布局,实现了仿真界面的自动适配功能。基于HTML5技术进行系统的跨平台开发,实现了PC端和移动端JLR-7700MK2型GPS设备的仿真。该系统实现了GPS真机的主要功能的基础上,有效的弥补了真机受场地约束的缺陷,并能够跨平台使用,可满足航海院校及培训机构学生的实操培训需求。     

如何避免GSM-R无线通信系统对机场电磁干扰

以拟建合湛高速铁路经过遂溪机场的线路方案为例,对Longley-Rice不规则地形信道模型进行了简要介绍,仿真分析了该模型在不同传输距离和置信区间下信号的衰落情况。现场实测数据验证了Longley-Rice信道模型的准确性和合理性。结合仿真和实测结果,提出了GSM-R无线覆盖的解决方案,并且为铁路选线方案的优化提供了技术支撑。     

Experimental Study of Effects of Travel Time Distribution Information on Dynamic Route Choice Behavior

This study focuses on the possibility that providing travelers with information on travel time distribution, along with the existing travel time information, might affect their decision making and enhance traffic control. As an initial step to confirm the effectiveness of travel time distribution information, we use a laboratory experiment to obtain panel data of route choices when information is provided. The rationality of the behavior of the respondents and the characteristics of the route choice are first analyzed by aggregation analysis and then statistically examined by specifying a mixed logit route choice model. As a result, it is revealed that both travel time information and maximum travel time information significantly affect route choice behavior when a penalty is imposed for late arrival.     

Route swapping in dynamic traffic networks

A dynamic traffic assignment (DTA) model typically consists of a traffic performance model and a route choice model. The traffic performance model describes how traffic propagates (over time) along routes connecting origin-destination (OD) pairs, examples being the cell transmission model, the vertical queueing model and the travel time model. This is implemented in a dynamic network loading (DNL) algorithm, which uses the given route inflows to compute the link inflows (and hence link costs), which are then used to compute the route travel times (and hence route costs). A route swap process specifies the route inflows for tomorrow (at the next iteration) based on the route inflows today (at the current iteration). A dynamic user equilibrium (DUE), where each traveller on the network cannot reduce his or her cost of travel by switching to another route, can be sought by iterating between the DNL algorithm and the route swap process. The route swap process itself takes up very little computational time (although route set generation can be very computationally intensive for large networks). However, the choice of route swap process dramatically affects convergence and the speed of convergence. The paper details several route swap processes and considers whether they lead to a convergent system, assuming that the route cost vector is a monotone function of the route inflow vector.     

Cognitive cost in route choice with real-time information: An exploratory analysis

Real-time traffic information is increasingly available to support route choice decisions by reducing the travel time uncertainty. However it is likely that a traveler cannot assess all available information on all alternative routes due to time constraints and limited cognitive capacity. This paper presents a model that is consistent with a general network topology and can potentially be estimated based on revealed preference data. It explicitly takes into account the information acquisition and the subsequent path choice. The decision to acquire information is assumed to be based on the cognitive cost involved in the search and the expected benefit defined as the expected increase in utility after the search. A latent class model is proposed, where the decision to search or not to search and the depth of the search are latent and only the final path choices are observed. A synthetic data set is used for the purpose of validation and ease of illustration. The data are generated from the postulated cognitive-cost model, and estimation results show that the true values of the parameters can be recovered with enough variability in the data. Two other models with simplifying assumptions of no information and full information are also estimated with the same set of data with significantly biased path choice utility parameters. Prediction results show that a smaller cognitive cost encourages information search on risky and fast routes and thus higher shares on those routes. As a result, the expected average travel time decreases and the variability increases. The no-information and full-information models are extreme cases of the more general cognitive-cost model in some cases, but not generally so, and thus the increasing ease of information acquisition does not necessarily warrant a full-information model.     

Modeling absolute and relative cost differences in stochastic user equilibrium problem

This paper aims to develop a hybrid closed-form route choice model and the corresponding stochastic user equilibrium (SUE) to alleviate the drawbacks of both Logit and Weibit models by simultaneously considering absolute cost difference and relative cost difference in travelers’ route choice decisions. The model development is based on an observation that the issues of absolute and relative cost differences are analogous to the negative exponential and power impedance functions of the trip distribution gravity model. Some theoretical properties of the hybrid model are also examined, such as the probability relationship among the three models, independence from irrelevant alternatives, and direct and indirect elasticities. To consider the congestion effect, we provide a unified modeling framework to formulate the Logit, Weibit and hybrid SUE models with the same entropy maximization objective but with different total cost constraint specifications representing the modelers’ knowledge of the system. With this, there are two ways to interpret the dual variable associated with the cost constraint: shadow price representing the marginal change in the entropy level to a marginal change in the total cost, and dispersion/shape parameter representing the travelers’ perceptions of travel costs. To further consider the route overlapping effect, a path-size factor is incorporated into the hybrid SUE model. Numerical examples are also provided to illustrate the capability of the hybrid model in handling both absolute and relative cost differences as well as the route overlapping problem in travelers’ route choice decisions.     

Quantifying the environmental and economic benefits of cooperation: A case study in temperature-controlled food logistics

Inefficient road transportation causes unnecessary costs and polluting emissions. This problem is even more severe in refrigerated transportation, in which temperature control is used to guarantee the quality of the products. Organizing logistics cooperatively can help decrease both the environmental and the economic impacts. In Joint Route Planning (JRP) cooperation, suppliers and customers jointly optimize routing decisions so that cost and emissions are minimized. Vendor Managed Inventory (VMI) cooperation extends JRP cooperation by optimizing routing and inventory planning decisions simultaneously. However, in addition to their economic advantages, VMI and JRP may also yield environmental benefits. To test this assertion, we perform a case study on cooperation between a number of supermarket chains in the Netherlands. The data of this case study are analyzed to quantify both the economic and environmental benefits of implementing cooperation via JRP and VMI, using vehicle routing and an inventory routing models. We found that JRP cooperation can substantially reduce cost and emissions compared with uncooperative routing. In addition, VMI cooperation can further reduce cost and emissions, but minimizing cost and minimizing emissions no longer result in the same solution and there is a trade-off to be made.