����Эͬ���������򹫽�ʱ�̱�����ģ���о�

编制出能够最大限度地减少乘客在不同线路交叉点处换乘等待时间的公交时刻表是实现公交调度区域化的关键任务之一，而协同发车是实现这一目标的有效手段。本文将以乘客换乘时间最少为目标的区域公交时刻表的编制问题归结为一类特殊的带有协同系数且无容量约束的0-1背包问题，并定义了协同系数，建立了相应的数学模型，给出了基于嵌套式的禁忌搜索算法的模型解法。实验计算结果表明，用本文设计的算法求解这类特殊的0-1背包问题可以取得良好的结算结果，该算法是可行的，也是有效的。     

A parallel algorithm for train rescheduling

One of the crucial factors in achieving a high punctuality in railway traffic systems, is the ability to effectively reschedule the trains when disturbances occur. The railway traffic rescheduling problem is a complex task to solve both from a practical and a computational perspective. Problems of practically relevant sizes have typically a very large search space, making them time-consuming to solve even for state-of-the-art optimization solvers. Though competitive algorithmic approaches are a widespread topic of research, not much research has been done to explore the opportunities and challenges in parallelizing them. This paper presents a parallel algorithm to efficiently solve the real-time railway rescheduling problem on a multi-core parallel architecture. We devised (1) an effective way to represent the solution space as a binary tree and (2) a novel sequential heuristic algorithm based on a depth-first search (DFS) strategy that quickly traverses the tree. Based on that, we designed a parallel algorithm for a multi-core architecture, which proved to be 10.5 times faster than the sequential algorithm even when run on a single processing core. When executed on a parallel machine with 8 cores, the speed further increased by a factor of 4.68 and every disturbance scenario in the considered case study was solved within 6 s. We conclude that for the problem under consideration, though a sequential DFS approach is fast in several disturbance scenarios, it is notably slower in many other disturbance scenarios. The parallel DFS approach that combines a DFS with simultaneous breadth-wise tree exploration, while being much faster on an average, is also consistently fast across all scenarios.     

面向城市轨道交通的启发式疫情密接人群追溯方法

在复杂轨道交通网络中，某些乘客的出行行程是确定的。这些乘客可以作为启发式的“证人”，为其他乘客证明某个行程的可能性，从而在保证查全率的前提下，准确地找出潜在的密接乘客。本文的目的是开发一套适用于城市轨道交通的疫情密接人群追溯方法，利用有限的确定行程乘客作为虚拟的目击者，采用启发式的树搜索生成目标乘客可能的出行链，通过验证目标出行链与感染者行程是否有交集，判断目标乘客是否为密接乘客。以北京城市轨道交通为例，招募志愿者在特定线路乘车，并假定感染者乘车信息，通过提取有关自动售检票(Automatic Fare Collection, AFC)数据识别密接乘客，以验证方法的有效性。在实验场景下，本文提出的方法对密接乘客的识别查全率达到100%，查准率达到92.7%，表明方法具备一定的可行性。识别结果有助于有关部门针对性采取措施，更高效率地防范疫情蔓延和传播。     

铁路集装箱中心站多轨道吊柔性协同调度优化

针对铁路集装箱中心站轨道吊协同装卸调度(RMGCS)问题，考虑多轨道吊间的作业干涉和安全距离约束，建立目标函数为最小化集装箱完工时间的混合整数规划数学模型。结合 RMGCS问题特性，提出一种考虑多轨道吊柔性协同作业的改进麻雀搜索算法(ISSA)，首先，提出能够解决多轨道吊间作业冲突的任务分配策略和干涉判断方法；其次，设计自适应非线性动态安全值，平衡全局和局部搜索；再次，改进加入者更新移动方式，使其在全维度上靠近最优解；最后， 引入LOV(largest-order-value)规则，将个体从实数向量映射到集装箱整数序列。为了验证问题和算法的有效性，分别利用ISSA与其他算法求解不同样本规模的算例，结果表明：ISSA在不同样本 规模的RMGCS问题求解上，均具有更好的寻优效果。此外，所提出的柔性协同调度模式相比现有的固定范围顺序装卸调度模式，使样本量为45的装卸作业总完工时间缩短了15.5%。     

Heuristic search for the coupled runway sequencing and taxiway routing problem

This paper presents the first local search heuristic for the coupled runway sequencing (arrival & departure) and taxiway routing problems, based on the receding horizon (RH) scheme that takes into account the dynamic nature of the problem. As test case, we use Manchester Airport, the third busiest airport in the UK. From the ground movement perspective, the airport layout requires that departing aircraft taxi across the arrivals runway. This makes it impossible to separate arrival from departure sequencing in practice. Operationally, interactions between aircraft on the taxiways could prevent aircraft from taking off from, or landing on, runways during the slots assigned to them by an algorithm optimizing runway use alone. We thus consider the interactions between arrival and departure aircraft on the airport surface. Compared to sequentially optimized solutions, the results obtained with our approach indicate a significant decrease in the taxiway routing delay, with generally no loss in performance in terms of the sequencing delay for a regular day of operations. Another benefit of such a simultaneous optimization approach is the possibility of holding aircraft at the stands for longer, without the engines running. This significantly reduces the fuel burn, as well as bottlenecks and traffic congestion during peak hours that are often the cause of flight delays due to the limited amount of airport surface space available. Given that the maximum computing time per horizon is around 95 s, real-time operation might be practical with increased computing power.     

基于捕食搜索策略的粒子群算法求解高铁闭塞分区划分问题

高铁闭塞分区的合理划分可以保证列车的运行安全、提高运输效率和减少投资成本。为了更好地解决这个问题,利用基于捕食搜索策略的粒子群算法求解优化准移动闭塞条件下的闭塞分区划分模型。捕食搜索策略可以平衡粒子的局域搜索和全局搜索,从而避免陷入局部最优,提高算法精度。通过算例仿真,比较基于捕食搜索策略的粒子群算法和标准粒子群算法对模型优化的结果,验证基于捕食搜索策略的粒子算法对模型的求解是有效的,而且得到的解更精确,运算速度更快。     

我国海上搜救人员的心理危机干预需求分析

为探明我国海上搜救人员对心理危机干预的需求及心理危机干预在海上搜救人员中的应用特征,本研究对21个海上搜救中心和3个救助局的搜救人员进行问卷调查,回收有效问卷336份。结果表明,海上搜救人员对心理危机干预了解不深但需求度较高,对海上搜救人员开展的心理危机干预正向效果明显。国家海上搜救有关部门应加快推进心理危机干预的实践。     

水下无人搜探系统任务载荷使用模式分析

研究水下静止目标探测任务载荷的功能和性能，分析给出基于任务载荷的航行器态势感知自主水平。按照任务载荷是否同时使用、任务载荷探测距离、目标类型和属性、使用人员对航行器（含任务载荷）干预程度，以及人员干预程度和任务组合等几个方面，提出水下无人搜探系统任务载荷使用模式。     

Model and algorithm for container ship stowage planning based on bin-packing problem

In a general case, container ship serves many different ports on each voyage. A stowage planning for container ship made at one port must take account of the influence on subsequent ports. So the complexity of stowage planning problem increases due to its multi-ports nature. This problem is NP-hard problem. In order to reduce the computational complexity, the problem is decomposed into two sub-problems in this paper. First, container ship stowage problem （CSSP） is regarded as “packing problem”, ship-bays on the board of vessel are regarded as bins, the number of slots at each bay are taken as capacities of bins, and containers with different characteristics （homogeneous containers group） are treated as items packed. At this stage, there are two objective functions, one is to minimize the number of bays packed by containers and the other is to minimize the number of overstows. Secondly, containers assigned to each bays at first stage are allocate to special slot, the objective functions are to minimize the metacentric height, heel and overstows. The taboo search heuristics algorithm are used to solve the subproblem. The main focus of this paper is on the first subproblem. A case certifies the feasibility of the model and algorithm.     

面向自组织平衡的共享电动汽车调度优化方法

针对共享电动汽车运营中出现的站点车辆供需不平衡及人工调度成本过高等问题，提出面向自组织平衡的共享电动汽车调度优化方法.利用共享电动汽车站点选择行为数据，构建用户取车站点选择MNL(Multinominal Logit)模型，分析用户的站点选择行为；构建面向各站点车辆供需自组织平衡的站点间车辆调度优化方法，即通过车辆动态折扣策略引导用户改变默认的最近取还车站点，在运营结束后以运营企业的调度总成本最小为目标，建立人工调度优化模型并应用禁忌搜索算法求解；最后，选取北京市海淀区部分共享电动汽车站点进行算例分析.结果表明：本文提出的优化方法与无动态折扣策略相比，调度总成本降低了 4.5%，人工调度成本降低了21.1%，人工调度任务数减少了8.3%.