基于多旅行商问题的应急设施服务区划分模型

基于多旅行商问题，增设集散中心需求及应急服务设施资源容量约束条件，以最小化遍历区域内全部集散中心的综合旅行时间成本为优化目标，构建一种应急设施服务区划分模型，确定各应急设施的服务区范围.设计一种复合算法求解模型，首先基于P-中值选址模型的优化理念，形成初始方案；继而加入禁忌搜索算法，结合LKH求解器对模型进行迭代优化求得最优解.基于宁波市北仑区实际拓扑网络进行案例分析，验证了模型和求解方法的有效性.     

Solving the gate assignment problem through the Fuzzy Bee Colony Optimization

In the field of Swarm Intelligence, the Bee Colony Optimization (BCO) has proven to be capable of solving high-level combinatorial problems, like the Flight-Gate Assignment Problem (FGAP), with fast convergence performances. However, given that the FGAP can be often affected by uncertainty or approximation in data, in this paper we develop a new metaheuristic algorithm, based on the Fuzzy Bee Colony Optimization (FBCO), which integrates the concepts of BCO with a Fuzzy Inference System. The proposed method assigns, through the multicriteria analysis, airport gates to scheduled flights based on both passengers’ total walking distance and use of remote gates, to find an optimal flight-to-gate assignment for a given schedule. Comparison of the results with the schedules of real airports has allowed us to show the characteristics of the proposed concepts and, at the same time, it stressed the effectiveness of the proposed method.     

An optimal data-splitting algorithm for aircraft scheduling on a single runway to maximize throughput

In this research, we present a data-splitting algorithm to optimally solve the aircraft sequencing problem (ASP) on a single runway under both segregated and mixed-mode of operation. This problem is formulated as a 0–1 mixed-integer program (MIP), taking into account several realistic constraints, including safety separation standards, wide time-windows, and constrained position shifting, with the objective of maximizing the total throughput. Varied scenarios of large scale realistic instances of this problem, which is NP-hard in general, are computationally difficult to solve with the direct use of commercial solver as well as existing state-of-the-art dynamic programming method. The design of the algorithm is based on a recently introduced data-splitting algorithm which uses the divide-and-conquer paradigm, wherein the given set of flights is divided into several disjoint subsets, each of which is optimized using 0–1 MIP while ensuring the optimality of the entire set. Computational results show that the difficult instances can be solved in real-time and the solution is efficient in comparison to the commercial solver and dynamic programming, using both sequential, as well as parallel, implementation of this pleasingly parallel algorithm.     

谈港口国船舶污染物接收设施问题报告的处置

文中探讨了一起国际航行船舶关于港口国船舶污染物接收设施问题报告的调查情况,介绍了此次船舶污染物接收设施问题报告的原因分析及采取的措施,并向接收设施的提供者和使用者给出了优化建议,明确了各有关部门在港口国船舶污染物接收设施履约工作上的重点。     

Traffic modelling in system boundary expansion of road pavement life cycle assessment

This paper uses a case study of a UK inter-urban road, to explore the impact of extending the system boundary of road pavement life cycle assessment (LCA) to include increased traffic emissions due to delays during maintenance. Some previous studies have attempted this but have been limited to hypothetical scenarios or simplified traffic modelling, with no validation or sensitivity analysis. In this study, micro-simulation modelling of traffic was used to estimate emissions caused by delays at road works, for several traffic management options. The emissions were compared to those created by the maintenance operation, estimated using an LCA model. In this case study, the extra traffic emissions caused by delays at road works are relatively small, compared to those from the maintenance process, except for hydrocarbon emissions. However, they are generally close to, or above, the materiality threshold recommended in PAS2050 for estimating carbon footprints, and reach 5–10% when traffic flow levels are increased (hypothetically) or when traffic management is imposed outside times of lowest traffic flow. It is recommended, therefore, that emissions due to traffic disruption at road works should be included within the system boundary of road pavement LCA and carbon footprint studies and should be considered in developing guidelines for environmental product declarations of road pavement maintenance products and services.     

导管式推进器非定常性能数值计算方法研究

基于滑移网格方法，采用SST k-ω湍流模型研究不同网格划分方式对带前置定子导管式推进器非定常性能的研究。首先基于相对参考坐标系法及滑移网格方法分别对推进器在定常与非定常下的性能进行数值预报，并与试验结果相比验证计算方法的可靠性。基于该方法研究整体网格划分方式与周期性网格对推力系数、扭矩系数与推进器各个方向上的非定常脉动力的影响。研究结果为进一步研究推进器非定常性能提供了参考。     

考虑移步需求的无桩型共享单车动态调度研究

共享单车系统自发的不均衡性导致单车数量分布与用户需求分布之间产生偏移，降低了系统服务能力，需要调度实现再平衡. 现有动态调度算法缺乏考虑起点车辆供给不足，用户在出行过程中“再次”取车的移步需求，难以准确识别用户真实的出行需求分布，降低了调度效果. 本文提出以用户出行选择行为为下层，以调度车辆路径规划为上层的双层规划模型框架，设计结合仿真系统的启发式求解算法. 算例场景基于上海市虹口、杨浦区共享单车历史出行数据搭建，并进行网格化处理. 算例结果表明，模型能有效识别移步需求，提高共享单车的供需匹配能力. 针对各类调度资源配置情况，共享单车的供需匹配率提升18.07%~ 19.89%，提高了共享单车系统的管理效率.     

共享自动驾驶汽车经营策略优化分析

研究共享自动驾驶汽车(SAV)与普通汽车共存背景下，SAV公司如何根据运营目标优化经营策略并影响通勤者出行方式选择. 假设高速公路上存在一定数量的独驾通勤者，无车通勤者在SAV和地铁之间进行权衡. 分析固定需求和弹性需求下，SAV公司追求系统总成本最小或系统净收益最大和利润最大时的最优经营策略，即SAV票价和容量，进而得到均衡时模式划分情况，SAV最优发车数，系统总成本或系统净收益，以及公司利润等指标. 算例对均衡结果进一步验证发现，SAV公司垄断经营会收取较高的票价，提供容量较小的车型. 在系统最优情形下，SAV公司无法获得正利润，需要政府补贴运营.     

Integrating capacity analysis with high-speed railway timetabling: A minimum cycle time calculation model with flexible overtaking constraints and intelligent enumeration

Compared with most optimization methods for capacity evaluation, integrating capacity analysis with timetabling can reveal the types of train line plans and operating rules that have a positive influence on improving capacity utilization as well as yielding more accurate analyses. For most capacity analyses and cyclic timetabling methods, the cycle time is a constant (e.g., one or two hours). In this paper, we propose a minimum cycle time calculation (MCTC) model based on the periodic event scheduling problem (PESP) for a given train line plan, which is promising for macroscopic train timetabling and capacity analysis. In accordance with train operating rules, a non-collision constraint and a series of flexible overtaking constraints (FOCs) are constructed based on variations of the original binary variables in the PESP. Because of the complexity of the PESP, an iterative approximation (IA) method for integration with the CPLEX solver is proposed. Finally, two hypothetical cases are considered to analyze railway capacity, and several influencing factors are studied, including train regularity, train speed, line plan specifications (train stops), overtaking and train heterogeneity. The MCTC model and IA method are used to test a real-world case involving the timetable of the Beijing–Shanghai high-speed railway in China.     

Robust weekly aircraft maintenance routing problem and the extension to the tail assignment problem

In this paper, we study two closely related airline planning problems: the robust weekly aircraft maintenance routing problem (RWAMRP) and the tail assignment problem (TAP). In real life operations, the RWAMRP solution is used in tactical planning whereas the TAP solution is implemented in operational planning. The main objective of these two problems is to minimize the total expected propagated delay (EPD) of the aircraft routes. To formulate the RWAMRP, we propose a novel weekly line-of-flights (LOF) network model that can handle complex and nonlinear cost functions of EPD. Because the number of LOFs grows exponentially with the number of flights to be scheduled, we propose a two-stage column generation approach to efficiently solve large-scale real-life RWAMRPs. Because the EPD of an LOF is highly nonlinear and can be very time-consuming to accurately compute, we propose three lower bounds on the EPD to solve the pricing subproblem of the column generation. Our approach is tested on eight real-life test instances. The computational results show that the proposed approach provides very tight LP relaxation (within 0.6% of optimal solutions) and solves the test case with more than 6000 flights per week in less than three hours. We also investigate the solutions obtained by our approach over 500 simulated realizations. The simulation results demonstrate that, in all eight test instances, our solutions result in less EPDs than those obtained from traditional methods. We then extend our model and solution approach to solve realistically simulated TAP instances.