Large-scale evacuation network optimization: a bi-level control method with uncertain arterial demand

To improve the efficiency of large-scale evacuations, a network aggregation method and a bi-level optimization control method are proposed in this paper. The network aggregation method indicates the uncertain evacuation demand on the arterial sub-network and balances accuracy and efficiency by refining local road sub-networks. The bi-level optimization control method is developed to reconfigure the aggregated network from both supply and demand sides with contraflow and conflict elimination. The main purpose of this control method is to make the arterial sub-network to be served without congestion and interruption. Then, a corresponding bi-objective network flow model is presented in a static manner for an oversaturated network, and a Genetic Algorithm-based solution method is used to solve the evacuation problem. The numerical results from optimizing a city-scale evacuation network for a super typhoon justify the validity and usefulness of the network aggregation and optimization control methods.     

基于遗传算法的舰船航速模糊控制研究

研究并建立了舰船航速控制系统的数学模型,并将模糊控制理论应用到该系统,提出了一种基于遗传算法的舰船航速模糊控制新方法。该方法较常规的模糊控制具有更优的控制性能,仿真实验结果表明该方法可行、有效。     

Sampling of alternatives for route choice modeling

This paper presents a new paradigm for choice set generation in the context of route choice model estimation. We assume that the choice sets contain all paths connecting each origin–destination pair. Although this is behaviorally questionable, we make this assumption in order to avoid bias in the econometric model. These sets are in general impossible to generate explicitly. Therefore, we propose an importance sampling approach to generate subsets of paths suitable for model estimation. Using only a subset of alternatives requires the path utilities to be corrected according to the sampling protocol in order to obtain unbiased parameter estimates. We derive such a sampling correction for the proposed algorithm.Estimating models based on samples of alternatives is straightforward for some types of models, in particular the multinomial logit (MNL) model. In order to apply MNL for route choice, the utilities should also be corrected to account for the correlation using, for instance, a path size (PS) formulation. We argue that the PS attribute should be computed based on the full choice set. Again, this is not feasible in general, and we propose a new version of the PS attribute derived from the sampling protocol, called Expanded PS.Numerical results based on synthetic data show that models including a sampling correction are remarkably better than the ones that do not. Moreover, the Expanded PS shows good results and outperforms models with the original PS formulation.     

基于改进A*算法的智能车路径规划研究

针对智能车使用A*路径规划算法存在转折点和冗余点的问题,提出一种考虑智能车静态特性的改进A*路径规划算法。在已知静态环境信息的栅格地图上,考虑到智能车自身存在实际宽度,对障碍物进行膨胀扩展;其次根据路径上前后节点相对方向的改变提取必要的转折点,并依次连结前后转折点,若转折点连线不经过障碍物,删除连结转折点之间冗余的转折点;重复上述操作,直至所有冗余点被删除,保留关键转折点。仿真结果表明,该方法可以实现车辆安全无碰撞地到达目标终点。     

Assessing the cost of transfer inconvenience in public transport systems: A case study of the London Underground

Few studies have adequately assessed the cost of transfers² in public transport systems, or provided useful guidance on transfer improvements, such as where to invest (which facility), how to invest (which aspect), and how much to invest (quantitative justification of the investment). This paper proposes a new method based on path choice,³ taking into account both the operator’s service supply and the customers’ subjective perceptions to assess transfer cost and to identify ways to reduce it. This method evaluates different transfer components (e.g., transfer walking, waiting, and penalty) with distinct policy solutions and differentiates between transfer stations and movements.The method is applied to one of the largest and most complex public transport systems in the world, the London Underground (LUL), with a focus on 17 major transfer stations and 303 transfer movements. This study confirms that transfers pose a significant cost to LUL, and that cost is distributed unevenly across stations and across platforms at a station. Transfer stations are perceived very differently by passengers in terms of their overall cost and composition. The case study suggests that a better understanding of transfer behavior and improvements to the transfer experience could significantly benefit public transport systems.     

Trip generation and distribution: the inconsistency problem and a possible remedy

There are many shortcomings commonly associated with the conventional urban transportation modeling process. This paper focuses on one of the more important problems — the inconsistency between trip generation and distribution components — and suggests a possible way of alleviating it. The suggested approach involves sorting out the independent effects on tripmaking of origin, destination and travel cost characteristics, and introducing accessibility measures explicitly into the modeling process. The resulting modeling framework can be used to obtain consistent estimates of trip generation and distribution quantities which are responsive to changes in the transportation and spatial systems.     

基于最小有向距离算法的刀具轨迹计算

本文针对复杂曲面加工中存在的刀具轨迹计算和干涉判断复杂的问题,将最小有向距离算法应用于复杂曲面的加工中。通过对曲面加工原理分析,将求刀触点的问题转化为数学规划问题。实验证明该方法有对曲面适应范围广,计算量小、计算速度快等特点,适用于复杂曲面的加工。     

Path flow estimator for planning applications in small communities

This paper presents an alternative planning framework to model and forecast network traffic for planning applications in small communities, where limited resources debilitate the development and applications of the conventional four-step travel demand forecasting model. The core idea is to use the Path Flow Estimator (PFE) to estimate current and forecast future traffic demand while taking into account of various field and planning data as modeling constraints. Specifically, two versions of PFE are developed: a base year PFE for estimating the current network traffic conditions using field data and planning data, if available, and a future year PFE for predicting future network traffic conditions using forecast planning data and the estimated base year origin–destination trip table as constraints. In the absence of travel survey data, the proposed method uses similar data (traffic counts and land use data) as a four-step model for model development and calibration. Since the Institute of Transportation Engineers (ITE) trip generation rates and Highway Capacity Manual (HCM) are both utilized in the modeling process, the analysis scope and results are consistent with those of common traffic impact studies and other short-range, localized transportation improvement programs. Solution algorithms are also developed to solve the two PFE models and integrated into a GIS-based software called Visual PFE. For proof of concept, two case studies in northern California are performed to demonstrate how the tool can be used in practice. The first case study is a small community of St. Helena, where the city’s planning department has neither an existing travel demand model nor the budget for developing a full four-step model. The second case study is in the city of Eureka, where there is a four-step model developed for the Humboldt County that can be used for comparison. The results show that the proposed approach is applicable for small communities with limited resources.     

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

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

潜水器多学科设计中的多目标协同优化方法

针对潜水器设计中涉及多个学科的耦合以及数据信息量大、数据关系复杂的问题,文章介绍了一种新的多目标协同优化算法.该方法将Pareto遗传算法(PGA)引入协同优化框架,二者的有机结合充分发挥各自的优势,该方法利用协同方法的分解协调机制将复杂系统的设计问题分解为一个系统级优化问题和几个学科级优化问题.采用PGA作为系统级优化器,不仅可以得到能够反映多目标优化问题实质的、客观的Pareto解集,而且,由于PGA是无需梯度信息的直接搜索算法,从而从根本上消除了协同优化由系统层一致性约束条件引起的收敛困难问题.在PGA与协同优化框架结合的过程中,采用目标函数的归一化处理、分级罚函数法、浮点数编码、群体分级和Paveto解集过滤器等技术提高算法的计算效率和可靠性,并通过一个数学算例和一个载人潜水器的例子证明了多目标协同优化算法的有效性.