新建北京至霸州铁路速度目标值分析

结合线路的路网功能定位,从时间目标值需求、工程技术、工程投资等方面综合比选确定京霸铁路的速度目标值,以期为在上述因素方面与该线具有类似特点的城际铁路的速度目标值选择提供一定的参考。研究结论:(1)根据本线的路网功能定位、时间目标值的要求,并结合客运网各线建设标准,京霸铁路北京至北京新机场段速度目标值宜为200~350 km/h之间,北京新机场至霸州段速度目标值宜为250~350 km/h之间;(2)通过技术经济比较,京霸铁路北京至北京新机场段新建线暂推荐250 km/h速度目标值方案;北京新机场至霸州段推荐350 km/h速度目标值方案。     

SDH传输网元脱管浅析

介绍SDH光传输系统的网络结构、网络管理、ECC路由、网元登录、网元脱管,分析传输网管网元脱管出现的典型问题,对相关传输网络管理、运行、维护具有一定的借鉴意义。     

模糊理论在网络优化中的应用

随着网络应用范围的拓宽,应用中使用了大量的模糊语言,比如"费用高"、"距离远"和"代价低"等等,对于这类问题难以建立精确的数学模型.提出了运用模糊理论来解决网络优化中遇到的这类不确定的、模糊的问题,并结合一个具有模糊性的网络优化问题实例,建立数学模型,编写Java程序实现求解过程.最后通过对建模结果的验证,说明方法是有效的和可行的.     

城市公路网交通信息平台规划研究

为了更好地管理和利用城市公路管理部门的信息资源，本文提出建设城市公路网交通信息平台。以总体框架为指导，设计了信息平台的逻辑结构和拓扑结构。根据用户主体的不同，将信息服务分为共享服务和增值服务两种类型，明确了信息平台的主要数据信息流。以面向企事业单位和社会公众提供信息增值服务为重点，进行了信息要素分析和服务方式分析，规划了公路网交通信息服务系统的发展模式。     

动态交通流量预测方法研究

随着智能运输系统的广泛应用,实时交通流量预测的重要性也日益显著。本文介绍了预测模型发展过程中比较重要的几个模型,并由此引出人工神经网络。介绍误差逆传播(BP)模型的相关理论。指出传统BP神经网络的缺陷,并提出提高预测精度的措施引进高阶神经网络。建立普通BP神经网络的预测模型,利用误差反传播算法实现这些影响因素到输出变量的复杂映射,再用高阶神经网络构建另一预测模型。利用交叉口实测数据进行预测,并用实际数据进行比较验证。     

基于BP神经网络的旅游交通安全评价分析研究

阐述了BP神经网络的基本理论、算法、缺陷及改进方法，通过实例对旅癖交通安全进行研究。选择合适的学习样本及参数进行训练，并获得较好的评价结果。为游客的旅游安全及相关部门的管理者提供了理论依据。     

水运网络构画与城市经济空间传统布局思想研究

水资源条件是影响经济空间和经济区位的重要因素,经济空间概念涉及居住形态和经济发展的区位问题,区位理论是关于人类经济活动的空间分布及空间相互关系的学说,对全国范围的水路运输网络系统的整体构想是古代水运网络思想的重要内容,水路网络的延伸与畅达在一定程度上影响着古代城市经济空间的布局特征。     

Network Decomposition and Maximum Independent Set Part Ⅱ：Application Research

According to the researches on theoretic basis in part I of the paper，the spanning tree algorithms solving the maximum independent set both in even network and in odd network have been developed in this part，part Ⅱ of the paper．The algorithms trans form first the general network into the pair sets network，and then decompose the pair sets network into a series of pair subsets by use of the characteristic of maximum flow passing through the pair sets network．As for the even network，the algorithm requires only one time of trans formation and decomposition，the maximum independent set can be gained without any iteration processes，and the time complexity of the algorithm is within the bound of O(｜V｜^3)．However，as for the odd network，the algorithm consists of two stages．In the first stage，the general odd network is transformed and decomposed into the pseudo-negative envelope graphs and generalized reverse pseudo-negative envelope graphs alternately distributed at first；then the algorithm turns to the second stage，searching for the negative envelope graphs within the pseudo-negative envelope graphs only．Each time as a negative envelope graphhas been found．renew the pair sets network by iteration at once．and then tum back to the first stage．So both stages form a circulation process up to the optimum．Two available methods，the adjusting search and the picking-off search are specially developed to deal with the problems resulted from the odd network．Both of them link up with each other harmoniously and are embedded together in the algorithm．Analysis and study indicate that the time complexity of this algorithm is within the bound of O(｜V｜^5)．     

基于运量的国民经济效益网络计算法

通过对现行国民经济效益计算方法的研究．运用交通分配理论论证了现行计算方法中运量分析存在的问题。依据交通分配理论和消费者剩余理论，将交通建设项目吸引区内整个路网作为研究对象，建立了基于运量的国民经济效益网络计算法。实例计算表明该方法的有效性。     

A network optimization-based approach for crowd management in large public gatherings

Effective crowd management during large public gatherings is necessary to enable pedestrians' access to and from the venue and to ensure their safety. This paper proposes a network optimization-based methodology to support such efficient crowd movement during large events. Specifically, a bi-level integer program is presented that, at the upper-level, seeks a reconfiguration of the physical layout that will minimize total travel time incurred by system users (e.g. evacuees) given utility maximizing route decisions that are taken by individuals in response to physical offerings in terms of infrastructure at the lower-level. The lower-level formulation seeks a pure-strategy Nash equilibrium that respects collective behavior in crowds. A Multi-start Tabu Search with Sequential Quadratic Programming procedure is proposed for its solution. Numerical experiments on a hypothetical network were conducted to illustrate the proposed solution methodology and the insights it provides.