多优先级多车种动态应急交通网络反流策略研究

危化品爆炸泄漏和火灾爆炸等局部突发事件下,疏散车辆与救援车辆在路网上通行的优先级具有差异性。为研究多优先级多车种动态应急交通网络协调优化问题,本文根据多车种的优先级差异性,松弛路段传输模型,模拟疏散和救援交通在路网上的动态加载过程,引入交叉口冲突转向消除与道路反流约束;考虑到优先通行车辆的反流策略会占用低优先级车辆的道路通行能力,设置救援交通的逆行路段数限制。设计分阶段优化方法求解多优先级多车种动态应急交通网络协调优化的多目标混合整数线性规划模型(MPCDETN-MMILP)。最后,以 NguyenDupuis路网为例,分析优先通行车辆使用的逆行路段数对疏散和救援交通的影响。算例结果表明：救援交通逆行路段数和对救援车辆迅速到达受灾区域的提升存在上限,且这种提升趋势是逐渐变缓的,而对疏散车辆迅速到达安全区域的抑制呈现波动式的增加趋势;救援交通逆行路段数对救援优先的疏散和救援交通运行优化效果有较大协调作用;连接受灾区域和外部救援场站,且可构成最短径路的路段更会被选择为救援交通逆行路段。     

考虑行驶时间不确定性的合乘路径鲁棒优化方法

为应对实际合乘过程中时间不确定性带来的负面影响,本文研究不确定行驶时间下的合乘问题。采用预算不确定集合描述时间变量,引入不确定性水平可调节的预算系数,构建以车辆总里程最短和车辆数最少为目标的合乘路径鲁棒优化模型。并设计两阶段算法求解,第1阶段以两乘客间的可行合乘路径为基础,从车辆总里程节省率和乘客时间窗匹配灵活性两方面设计公式量化合乘匹配机会,以匹配机会为权重构建乘客图网络并聚类乘客需求;第2阶段设计以顺序插入启发式方法构造初始解的禁忌搜索算法求解。案例数据实验结果表明：本文聚类方法能保证优化质量并提高85%以上的计算效率,同时能缩减乘客等车时间和绕行距离;增大预算系数时解的鲁棒性逐渐提高,但会增加10%~40%的车辆数并降低1%~10%的里程节省率;大规模乘客案例和窄时间窗案例的合乘路径对不确定时间的敏感性更高,宽时间窗案例无需增加过多额外车辆和总里程就能达到较高水平的路径鲁棒性。     

城市轨道交通小交路计划与客流控制协同优化策略

高峰时段的大客流需求易造成城市轨道站台乘客大量聚集,从而给城市轨道交通系统带来安全隐患,降低乘客乘车的舒适度;同时,客流空间分布的不均衡性导致供需能力不匹配,降低 了列车资源的利用率。针对该现象,本文结合大小交路开行方案与客流控制策略研究城市轨道交通列车时刻表协同优化问题。考虑到城市轨道交通客流的不确定性,将乘客到达率设置为不确定变量,而后基于客流演化与列车运行的动态关系,建立以最小化滞留乘客数、客流控制人数、 列车运行时间,以及最大化列车资源利用率衡量值为目标的优化模型,并设计一种基于机会约束 的随机场景优化算法进行模型求解。以北京市某轨道线路为例进行数值实验验证模型的有效性。结果表明,相较于常规运营策略,本文提出的协同优化策略在期望滞留人数和列车运行时间方面有了较大改善,更好地实现了乘客成本和企业运营成本之间的均衡。     

气垫船用复合材料空气导管结构布局和优化设计

根据空气导管的结构特点,考虑复合材料设计和制造一体化的特性,结合复合材料结构力学基本原理,提出一种可行的气垫船（Air-Cushion Vessel,ACV）用复合材料空气导管结构布局和优化设计方案。基于多约束目标优化对空气导管、内部加强结构的构型及尺寸等进行总体布局设计和优化,并利用有限元分析方法对导管结构进行极限过载的等效分析。计算结果表明,该复合材料空气导管结构在极限过载工况条件下可保持正常运行,满足结构整体的强度和刚度要求。     

基于路网可达性的城市交通离散网络设计模型及算法

根据城市交通路网分区理论,把分成的子区看成一个节点,考虑所有节点的可达性,以此度量整个路网的可达性,设计了基于路网可达性最大为目标的城市交通离散网络设计模型。采用粒子群算法,并给出一个简单的算例,算例表明,合理的添加路段,能使城市路网可达性达到最大。     

客车车架有限元分析及尺寸优化

以某客车车架为对象,利用HyperWorks建立了车架的有限元模型并对其进行了刚度和模态分析,在此基础上,以质量最小为目标,在不降低刚度和模态性能的前提下,对车架进行了尺寸优化。     

Multi-objective re-synchronizing of bus timetable: Model,complexity and solution

This work is originally motived by the re-planning of a bus network timetable. The existing timetable with even headways for the network is generated using line by line timetabling approach without considering the interactions between lines. Decision-makers (i.e., schedulers) intend to synchronize vehicle timetable of lines at transfer nodes to facilitate passenger transfers while being concerned with the impacts of re-designed timetable on the regularity of existing timetable and the accustomed trip plans of passengers. Regarding this situation, we investigate a multi-objective re-synchronizing of bus timetable (MSBT) problem, which is characterized by headway-sensitive passenger demand, uneven headways, service regularity, flexible synchronization and involvement of existing bus timetable. A multi-objective optimization model for the MSBT is proposed to make a trade-off between the total number of passengers benefited by smooth transfers and the maximal deviation from the departure times of the existing timetable. By clarifying the mathematical properties and solution space of the model, we prove that the MSBT problem is NP-hard, and its Pareto-optimal front is non-convex. Therefore, we design a non-dominated sorting genetic (NSGA-II) based algorithm to solve this problem. Numerical experiments show that the designed algorithm, compared with enumeration method, can generate high-quality Pareto solutions within reasonable times. We also find that the timetable allowing larger flexibility of headways can obtain more and better Pareto-optimal solutions, which can provide decision-makers more choice.     

A bi-objective optimization framework for three-dimensional road alignment design

Optimization of three-dimensional road alignments is a nonlinear non-convex optimization problem. The development of models that fully optimize a three-dimensional road alignment problem is challenging due to numerous factors involved and complexities in the geometric specification of the alignment. In this study, we developed a novel bi-objective optimization approach to solve a three dimensional road alignment problem where the horizontal and vertical alignments are optimized simultaneously. Two conflicting cost objective functions, earthwork cost and the utility cost, are cast in a bi-objective optimization problem. We numerically compare several multi-objective optimization solvers, and find that it is possible to determine the Pareto front in a reasonable time.     

大型客运站调机运用优化模型及算法

对铁路客运站调机运用进行科学合理的优化分析,对于提高客运站工作效率及保证旅客列车正点到发具有非常重要的意义。通过对客运站调机作业分析,建立客运站调机作业运用优化决策模型,将调机作业顺序模型转化为车辆数固定的、带时间窗口的车辆路径问题。采用模拟退火算法,实现调机运用的合理优化,并对模型和算法进行验证,得出优化效果明显的结论。