基于Matlab油船意外泄油性能的程序设计

基于概率方法的意外泄油性能参数计算是2010年1月1日及以后新造船破舱稳性需要评估的性能之一,满足一定的衡准要求方可。根据油船的分舱分别进行船底破损概率和船侧破损概率的插值,然后按照一定的公式求出船底破损后与船侧破损后的泄油量的加权之和,即意外泄油性能参数。由于手工计算费时费力,文章基于Matlab平台,开发了意外泄油性能参数的自动计算程序模块。计算结果与文献结果相比较,证明了本程序的计算精度,具有较好的工程实用价值。     

Dynamic traffic metering in urban street networks: Formulation and solution algorithm

Traffic metering offers great potential to reduce congestion and enhance network performance in oversaturated urban street networks. This paper presents an optimization program for dynamic traffic metering in urban street networks based on the Cell Transmission Model (CTM). We have formulated the problem as a Mixed-Integer Linear Program (MILP) capable of metering traffic at network gates with given signal timing parameters at signalized intersections. Due to the complexities of the MILP model, we have developed a novel and efficient solution approach that solves the problem by converting the MILP to a linear program and several CTM simulation runs. The solution algorithm is applied to two case studies under different conditions. The proposed solution technique finds solutions that have a maximum gap of 1% of the true optimal solution and guarantee the maximum throughput by keeping some vehicles at network gates and only allowing enough vehicles to enter the network to prevent gridlocks. This is confirmed by comparing the case studies with and without traffic metering. The results in an adapted real-world case study network show that traffic metering can increase network throughput by 4.9–38.9% and enhance network performance.     

Nonlinear pricing in linear cities with elastic demands

Nonlinear road pricing charges each traveler based on his/her trip’s corresponding particular attribute level. In order to help authorities in designing road pricing systems at a strategic level, this paper attempts to address two fundamental questions: (i) what is the value of pricing’s nonlinearity for mitigating traffic congestion? (ii) if a nonlinear toll function is implemented, should it be convex, concave or other shape? Specifically, we consider distance-based pricing in linear cities. For linear monocentric cities with heterogeneous travelers, we show that the system optimal distance-based pricing indeed exhibits nonlinearity. It is proved that: (i) the cost-based system optimal toll function is monotonically increasing and concave with respect to the traveled distance; (ii) the time-based system optimal toll function always exists and is unique. If the initial proportion of each traveler group is invariant along a corridor and the demand function is of exponential type, then the time-based system optimal toll function enables the travelers, living further away from a city center, to face a lower toll level per unit distance. For a linear polycentric city, we demonstrate: (i) there always exists the system optimal differentiated (in terms of city centers) toll functions; (ii) it is highly possible that the system optimal non-differentiated toll function does not exist. Hence, we further propose an optimal toll design model, prove the Lipschitz continuity of its objective and adopt a global-optimization algorithm to solve it.     

Privacy-preserving MaaS fleet management

On-demand traffic fleet optimization requires operating Mobility as a Service (MaaS) companies such as Uber, Lyft to locally match the offer of available vehicles with their expected number of requests referred to as demand (as well as to take into account other constraints such as driver’s schedules and preferences). In the present article, we show that this problem can be encoded into a Constrained Integer Quadratic Program (CIQP) with block independent constraints that can then be relaxed in the form of a convex optimization program. We leverage this particular structure to yield a scalable distributed optimization algorithm corresponding to computing a gradient ascent in a dual space. This new framework does not require the drivers to share their availabilities with the operating company (as opposed to standard practice in today’s mobility as a service companies). The resulting parallel algorithm can run on a distributed smartphone based platform.     

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%，提高了共享单车系统的管理效率.     

横梁端部节点优化

通过有限元计算,对比几种常见的横梁端部连接方式,综合考虑结构整体强度、钢材使用量、舱室空间利用率、施工便利性等方面的影响因素,确定较优的连接过渡方式和过渡结构的参数尺寸,为船舶设计横梁端部节点形式的确定提供参考。     

智能网联车环境下高速匝道汇入车流轨迹优化模型

为了解决传统匝道控制车流汇入时车辆需要减速至停止，从而造成延误时间过长的问题，提出了一种智能网联车环境下的高速匝道汇入车辆轨迹优化的两阶段优化模型，其中，第1 阶段优化车辆进入匝道口的时序；第2 阶段基于第1 阶段的最优时序，优化车辆轨迹. 根据所构建的模型设计了一种启发式算法优化车辆通过匝道冲突区域的时序，然后结合 GPOPS工具优化车辆的轨迹.为了验证所提出方法的有效性，将所提出的方法应用到20 min 随机到达的车流，进行仿真实验.实验结果表明，与先进先出的方法相比，本文所提出的方法能够使总延误减少59.7%，总油耗减少10.5%，说明该方法能够实现车辆以较高的速度通过匝道冲突区域，有效地减少了车辆汇入延误，同时也节约了油耗.     

A real-time adaptive signal control in a connected vehicle environment

The state of the practice traffic signal control strategies mainly rely on infrastructure based vehicle detector data as the input for the control logic. The infrastructure based detectors are generally point detectors which cannot directly provide measurement of vehicle location and speed. With the advances in wireless communication technology, vehicles are able to communicate with each other and with the infrastructure in the emerging connected vehicle system. Data collected from connected vehicles provides a much more complete picture of the traffic states near an intersection and can be utilized for signal control. This paper presents a real-time adaptive signal phase allocation algorithm using connected vehicle data. The proposed algorithm optimizes the phase sequence and duration by solving a two-level optimization problem. Two objective functions are considered: minimization of total vehicle delay and minimization of queue length. Due to the low penetration rate of the connected vehicles, an algorithm that estimates the states of unequipped vehicle based on connected vehicle data is developed to construct a complete arrival table for the phase allocation algorithm. A real-world intersection is modeled in VISSIM to validate the algorithms. Results with a variety of connected vehicle market penetration rates and demand levels are compared to well-tuned fully actuated control. In general, the proposed control algorithm outperforms actuated control by reducing total delay by as much as 16.33% in a high penetration rate case and similar delay in a low penetration rate case. Different objective functions result in different behaviors of signal timing. The minimization of total vehicle delay usually generates lower total vehicle delay, while minimization of queue length serves all phases in a more balanced way.     

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.