两种响应型船舶运动模型的对比及适用性分析

船舶运动模型作为自动舵性能检测平台的基础与核心，对于自动舵的研发、调试及船舶运动控制算法的设计都有非常重要的意义。现有的航迹航向自动舵检测平台普遍使用简化的一阶线性KT方程。由于忽略船舶回转运动中的纵向速度变化以及首摇角与横向速度之间的耦合，在实际使用中具有一定的局限性。本文引用国际电工委员会制定的航迹自动舵标准（ IEC62065）中提出的船舶运动模型，并对其进行仿真，将仿真结果与一阶线性KT方程的仿真结果进行对比分析，讨论一阶线性KT方程的适用范围。同时介绍改进的一阶非线性KT方程的形式并进行仿真试验，结果表明其与 IEC62065中非线性模型相似度较好，且减少了计算量。     

Including congestion effects in urban road traffic CO2 emissions modelling: Do Local Government Authorities have the right options?

Tailpipe emissions from vehicles on urban road networks have damaging impacts, with the problem exacerbated by the common occurrence of congestion. This article focuses on carbon dioxide because it is the largest constituent of road traffic greenhouse gas emissions. Local Government Authorities (LGAs) are typically responsible for facilitating mitigation of these emissions, and critical to this task is the ability to assess the impact of transport interventions on road traffic emissions for a whole network.This article presents a contemporary review of literature concerning road traffic data and its use by LGAs in emissions models (EMs). Emphasis on the practicalities of using data readily available to LGAs to estimate network level emissions and inform effective policy is a relatively new research area, and this article summarises achievements so far. Results of the literature review indicate that readily available data are aggregated at traffic level rather than disaggregated at individual vehicle level. Hence, a hypothesis is put forward that optimal EM complexity is one using traffic variables as inputs, allowing LGAs to capture the influence of congestion whilst avoiding the complexity of detailed EMs that estimate emissions at vehicle level.Existing methodologies for estimating network emissions based on traffic variables typically have limitations. Conclusions are that LGAs do not necessarily have the right options, and that more research in this domain is required, both to quantify accuracy and to further develop EMs that explicitly include congestion, whilst remaining within LGA resource constraints.     

Data dependent input control for origin–destination demand estimation using observability analysis

In this paper, we address the observability issue of static O–D estimation based on link counts. Unlike most classic observability analyses that relied only on network topological relationships, our analysis incorporates the actual values of input parameters, thus including network operational relations as well. We first analyze possible mathematical properties of an O–D estimation problem with different data input. We then propose a modeling approach based on mixed-integer program for selecting model input that ensures observability and estimation quality. Through establishing a stronger connection between observability analysis and the corresponding estimation problem, the proposed method aims to improve estimation quality while reducing reliance on erroneous data.     

Strain prediction for critical positions of FPSO under different loading of stored oil using GAIFOA-BP neural network

FPSO (floating, production, storage and offloading) units are widely used in the offshore oil and gas industry. Generally, FPSOs have excellent oil storage capacity owing to their huge oil cargo holds. The volume and distribution of stored oil in the cargo holds influence the strain level of hull girder, especially at critical positions of FPSO. However, strain prediction using structural analysis tools is computationally expensive and time consuming. In this study, a prediction tool based on back-propagation (BP) neural network called GAIFOA-BP is proposed to predict the strain values of concerned positions of an FPSO model under different oil storage conditions. The GAIFOA-BP combines BP model and GAIFOA which is a combination of genetic algorithm (GA) and an improved fruit fly optimization algorithm (IFOA). Results from three benchmark tests show that the GAIFOA-BP model has a remarkable performance. Subsequently, a total of 81 sets of training data and 25 sets of testing data are obtained from experiment using fiber Bragg grating (FBG) sensors installed on the surface of an FPSO model. The numerical results show that the GAIFOA-BP is capable of predicting the strain values with higher accuracy as compared with other BP models. Finally, the reserved GAIFOA-BP model is utilized to predict the strain values under the inputs of a 10-day time series of volume and distribution of stored oil. The predicted strain results are further used to calculate the fatigue consumption of measurement points.     

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

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

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

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

Modeling the impacts of mandatory and discretionary lane-changing maneuvers

In this paper, a novel mesoscopic multilane model is proposed to enable simultaneous simulation of mandatory and discretionary lane-changing behaviors to realistically capture multilane traffic dynamics. The model considers lane specific fundamental diagrams to simulate dynamic heterogeneous lane flow distributions on expressways. Moreover, different priority levels are identified according to different lane-changing motivations and the corresponding levels of urgency. Then, an algorithm is proposed to estimate the dynamic mandatory and discretionary lane-changing demands. Finally, the lane flow propagation is defined by the reaction law of the demand–supply functions, which can be regarded as an extension of the Incremental-Transfer and/or Priority Incremental-Transfer principles. The proposed mesoscopic multilane cell transmission model is calibrated and validated on a complex weaving section of the State Route 241 freeway in Orange County, California, showing both the positive and negative impact of lane changing maneuvers, e.g., balancing effect and capacity drop, respectively. Moreover, the empirical study verifies that the model requires no additional data other than the cell transmission model does. Thus, the proposed model can be deployed as a simple simulation tool for accessing dynamic mesoscopic multilane traffic state from data available to most management centers, and also the potential application in predicting the impact of traffic incident or lane control strategy.     

Path-constrained traffic assignment: A trip chain analysis under range anxiety

This paper proposes and analyzes a distance-constrained traffic assignment problem with trip chains embedded in equilibrium network flows. The purpose of studying this problem is to develop an appropriate modeling tool for characterizing traffic flow patterns in emerging transportation networks that serve a massive adoption of plug-in electric vehicles. This need arises from the facts that electric vehicles suffer from the “range anxiety” issue caused by the unavailability or insufficiency of public electricity-charging infrastructures and the far-below-expectation battery capacity. It is suggested that if range anxiety makes any impact on travel behaviors, it more likely occurs on the trip chain level rather than the trip level, where a trip chain here is defined as a series of trips between two possible charging opportunities (Tamor et al., 2013). The focus of this paper is thus given to the development of the modeling and solution methods for the proposed traffic assignment problem. In this modeling paradigm, given that trip chains are the basic modeling unit for individual decision making, any traveler’s combined travel route and activity location choices under the distance limit results in a distance-constrained, node-sequenced shortest path problem. A cascading labeling algorithm is developed for this shortest path problem and embedded into a linear approximation framework for equilibrium network solutions. The numerical result derived from an illustrative example clearly shows the mechanism and magnitude of the distance limit and trip chain settings in reshaping network flows from the simple case characterized merely by user equilibrium.     

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.