交通分配的粒子群优化算法

为了方便合理地分配交通量,提出了交通量多路径分配的粒子群优化算法。算法的求解方法是在粒子群算法中构造了路径条数维的粒子空间,每维对应一条可行性路线,其值为对应路径所分配的交通量;对粒子进行归一化处理,使交通量守恒,并进行交通量的多路径分配;根据目标函数评价与筛选粒子,直到满足终止条件。实例计算结果表明:利用粒子群算法得到的目标函数值最小,各路段分配的交通量没有超容量现象,模型求解过程具有方向性,对交通分配的网络规模无限制,因此,粒子群优化算法可行、合理。     

基于认知负荷理论的网络课程信息设计探析

在教学设计中，认知负荷理论有助于激励学习者的学习积极性，使之表现出良好的学习绩效。本文主要阐述了CLT、认知信息加工理论、双重编码理论等，归纳了认知负荷理论在多媒体学习中产生的效应，提出多媒体网络课程界面设计要素的设计方法，最后根据认知负荷产生的效应提出了一种新的设计模式。     

Collection, spillback, and dissipation in pedestrian evacuation: A network-based method

We present a method of predicting pedestrian route choice behavior and physical congestion during the evacuation of indoor areas with internal obstacles. Under the proposed method, a network is first constructed by discretizing the space into regular hexagonal cells and giving these cells potentials before a modified cell transmission model is employed to predict the evolution of pedestrian flow in the network over time and space. Several properties of this cell transmission model are explored. The method can be used to predict the evolution of pedestrian flow over time and space in indoor areas with internal obstacles and to investigate the collection, spillback, and dissipation behavior of pedestrians passing through a bottleneck. The cell transmission model is further extended to imitate the movements of multiple flows of pedestrians with different destinations. An algorithm based on generalized cell potential is also developed to assign the pedestrian flow.     

Improving maritime inventory routing: application to a Brazilian petroleum case

The crude oil offloading and supply problem (COSP) is a type of operation maritime inventory routing (MIR) problem encountered by petroleum companies. In COSP, the company not only is responsible for the ship scheduling to carry the crude oil from production sites to discharge ports but also must maintain inventory levels at both ports (production and consumption) between safety operational bounds to avoid disruptions in its crude oil production and/or refining processes. We show how to improve significantly the decision-making process in a Brazilian petroleum company using a mixed-integer linear programming (MILP) model to represent COSP. Comparison tests with a current ship-scheduling method adopted in the company indicated that the use of the MILP model increased the transportation efficiency and reduced costs by 20% on average. In addition to the quantitative gains, the use of a MILP model to solve COSP has succeeded when encountering real-life events, such as variation in production or consumption rates, berth unavailability, and changes in the storage capacities at ports.     

铁路数字通信传输网络优化浅谈

以宝成线数字通信传输网络的部分优化工程为例,说明数字通信传输网络的优化方案,以满足业务开通、安全等方面的需求。     

兰州北编组站视频监控系统应用研究

视频监控系统是编组站重要的安全监控系统,以兰州北编组站的视频监控系统为背景,详细阐述了编组站视频监控系统的功能需求与应用,并为今后的大型编组站视频监控系统建设提供参考.     

Optimization of transport investment and pricing policies: the role of transport pricing in network design

This paper investigates the role of transport pricing in network design and describes two facts about flow pattern in a transportation system. The first, illustrated by an example of Braess paradox, is that adding a new link to the network does not necessarily minimize the total travel time. The second is that introducing of appropriate toll pricing may reduce not only the total network time but also the travel time for each individual traveller. It follows with the investigations of different system objectives and different pricing policies (only toll pricing and distance‐based pricing are considered), and shows how they affect the system performance and flow pattern. Lastly, a systematic optimization process is proposed for integrated planning of transport network and pricing policies.     

A time‐staged multi‐objective network‐design model

A multi‐objective, time‐staged network‐design problem is formulated. Through transformation, the problem is decomposed into a set of single‐period, single‐objective problems. Lexicographic ordering is instrumental in effecting this transformation; it also allows a backward‐recursion algorithm to be applied using strong pruning criteria. Furthermore, monotonicity properties enable us to solve the problem using the familiar tree‐search algorithms. The solution method has several desirable properties — as shown by an example and a case study of Tripoli Province, Libya. First, the algorithm ensures continuity of project implementation over the multi time‐periods and provides optimality in later computational stages irrespective of the decision at an interim stage. Second, the algorithm tends to provide accessibility to unconnected regions in the study area at low user‐cost without employing weights to the two objective functions of accessibility and user‐cost efficiency. Such a property is deemed advantageous for suggesting transportation investments based purely on purchasing the greatest benefit for each dollar, with political neutrality strictly maintained.     

强关联性地铁车站的界定及设计要点分析

强关联性车站作为一种新出现的车站形式其被界定的时机对车站方案设计影响重大,在设计阶段需要特别注意,及早甄别。通过定义强关联性车站,从其界定的最佳时机、基本分类以及隐蔽性强关联性车站设计实例,介绍强关联性车站界定要点说明,指出强关联性车站内在关联性以及判别的外在切入点。     

基于GRNN的GSM-R场强覆盖预测算法

在比较Hata模型修正方法和GRNN算法场强覆盖预测效果的基础上,仿真分析了训练集构成和平滑因子选择对GRNN算法预测效果的影响,给出了训练集构成和平滑因子选择的方法;提出了电波传播环境相似系数来表征GRNN模型在不同环境下的适用性。仿真结果表明,两种传播环境的相似系数越大,由一种环境下测试数据确定的GRNN在另一环境下的预测精度越高。