基于改进免疫遗传机理的动态路径诱导算法研究

针对传统算法存在的不足,提出基于改进的免疫遗传机理的动态路径诱导算法。通过引入单点交叉算子配合控制策略的改进思想,在宏观上控制交叉过程以及构造优化简单的目标函数,较好地弥补了传统遗传算法早熟收敛、陷入局部最优解、运算效率较低等问题。最后采用此算法进行路网实例计算,结果表明该算法能较大程度地提高路网利用率,减少交通拥堵。     

随机条件下固定公交线路服务频率优化模型

在考虑客流需求波动及车辆运行时间随机变动的情况下,建立了以乘客候车期望和公交车辆利用率总体最优为目标的公交线路服务频率优化模型.利用蒙特卡罗方法随机模拟一条高频线路的公交服务,计算得到了给定线路参数下的最优服务频率.算例表明该模型可用来确定高频服务公交线路的发车时间间隔.     

交通信息对驾驶员逐日路径选择行为影响研究

在无信息、发布历史信息和发布预测信息3种信息条件下,分别建立了驾驶员的路径理解行程时间期望值的更新模型.通过建立一个含有2条平行路径的简单路网,对3种交通信息条件下驾驶员逐日路径选择进行了仿真,结果表明:交通信息对驾驶员的作用与驾驶员路径选择的随机程度和对信息依赖程度有关;在3种交通信息条件下,路网均不能达到用户均衡平衡状态;交通信息的预测方法不同,预测信息对驾驶员路径选择的影响有差异.     

基于地质条件下的公路选线设计探讨

公路选线要受自然条件、技术标准、国家政策、社会环境、道路美学、民族风俗习惯等因素的制约,其中自然条件主要表现为地形、地质等.公路选线时应进行深入调查研究,查明特殊地区和不良地质地段的分布范围、类型、规模及发生、发展的原因和规律,灵活运用选线原则和掌握选线要点.     

A theoretical foundation for the relationship between generalized origin–destination matrix and flow matrix based on ordinal graph trajectories

This paper shows the relationship between flow, generalized origin–destination (OD), and alternative route flow from a set of ordinal graph trajectories. In contrast to traffic assignment methods that employ OD matrix to produce flow matrix, we use ordinal trajectory on a network graph as input and produce both the generalized OD matrix and the flow matrix, with the alternative and substitute route flow matrices as additional outputs. By using linear algebra‐like operations on matrix sets, the relationship between network utilization (in terms of flow, generalized OD, alternative route flow, and desire line) and network structure (in terms of distance matrix and adjacency matrix) are derived. Copyright © 2012 John Wiley & Sons, Ltd.     

Incorporating Driver Behaviors in Network Design Problems: Challenges and Opportunities

The goal of a network design problem (NDP) is to make optimal decisions to achieve a certain objective such as minimizing total travel time or maximizing tolls collected in the network. A critical component to NDP is how travelers make their route choices. Researchers in transportation have adopted human decision theories to describe more accurate route choice behaviors. In this paper, we review the NDP with various route choice models: the random utility model (RUM), random regret-minimization (RRM) model, bounded rationality (BR), cumulative prospect theory (CPT), the fuzzy logic model (FLM) and dynamic learning models. Moreover, we identify challenges in applying behavioral route choice models to NDP and opportunities for future research.     

浅析城市道路设计中路线方案的比选——以兰州市南环路(西客站段)联通工程方案为例

城市道路建设过程中,存在各种不确定因素。当道路沿线构筑物较多、周边环境较为复杂时,需进行多方案的比选,在兼顾经济指标与技术指标的前提下确定切实可行的路线方案。结合兰州市南环路(西客站段)联通工程方案,总结了城市建设中路线方案比选的几点思考,供道路专业人员参考。     

Adapt-Traf: An adaptive multiagent road traffic management system based on hybrid ant-hierarchical fuzzy model

Usually, road networks are characterized by their great dynamics including different entities in interactions. This leads to more complex road traffic management. This paper proposes an adaptive multiagent system based on the ant colony behavior and the hierarchical fuzzy model. This system allows adjusting efficiently the road traffic according to the real-time changes in road networks by the integration of an adaptive vehicle route guidance system. The proposed system is implemented and simulated under a multiagent platform in order to discuss the improvement of the global road traffic quality in terms of time, fluidity and adaptivity.     

铁路旅客旅行换乘方案优选算法

为给铁路旅客选择合理的旅行方案提供参考,以旅行目标值与换乘目标值之和最小作为目标函数值,考虑旅客从起点站出发、最终到达终到站、在中转站进出平衡的约束条件,建立旅客旅行换乘方案选择问题的数学模型。分别给出旅行时间、换乘次数、票价、距离、到发时刻和综合指数6种目标权值的确定方法,提出最短路法和列车匹配法2种求解方法。最短路法是通过构造并简化旅客运输网络,求出网络上若干条次短路,再根据各条次短路上列车的接续,构造列车换乘方案网络图,根据该网络的目标权值确定最短路,得到最优换乘方案。列车匹配法是根据列车运行图信息直接搜索发、到站的接续列车集合,求其两列车对应的重合停车站,根据重合停车站集合的情况选择迭代步数,剔除显然不利方案,构成换乘方案,根据方案的权值进行比选,得到最优换乘方案。对2种算法均用C#编程实现,并用现有的全路客票数据进行检算。计算结果表明:2种算法均能得到最优换乘方案;列车匹配法所用计算时间比最短路法少160 ms。     

站场形数据结构设计研究

站场形数据结构是微机联锁软件系统的重要组成部分。文中介绍了站场形数据结构的各组成要素，举例说明其设计原理，最后指出了构造站场形数据结构所必须遵循的原则。