航班快速恢复建模与仿真研究

随着民用航空的发展与竞争,航班延误不仅影响航空飞行的安全与正常,更与航空公司的运营效率、运营成本及乘客利益息息相关。针对某一恶劣天气影响,对某公司受影响航班进行重新调配,考虑到航班的备降、盘旋等待、延误、取消等多种状态,以总成本最小为目标函数,建立航班快速恢复模型,通过MATLAB运用遗传算法设计航班恢复算法进行求解,得出最经济的航班恢复方案。     

高速铁路枢纽站技术作业计划与动车所调车作业计划协同编制研究

分析高速铁路枢纽站技术作业计划与动车所调车作业计划的协同编制过程,提出了将两个计划一体化编制的思想。以需安排作业效益最大化为优化目标,构建基于动车组车底的高速铁路枢纽站与动车所作业计划协同编制模型。针对模型特点,提出瓶颈工序、启发式分配规则及粗粒度主从进程模式的并行禁忌搜索策略(PTS)相结合的混合优化算法,首先确定作业安排瓶颈工序,然后启动主进程和若干从进程,主进程运用启发式分配规则快速生成初始解分配给从进程,从进程运用与瓶颈工序相关的禁忌算法搜索优化解,并反馈给主进程,主进程记录全局最优解并根据交叉策略生成新的初始解,重新分配给从进程进行TS搜索。最后,用实例验证了模型和算法的有效性。     

斜腿刚构桥几何布局的优化设计

采用数学规划的方法从静力和动力两方面对斜腿刚构桥的几何布局进行优化设计。静力优化设计的优化目标是截面截面应力平方均值最小，动力优化设计的优化目标是结构自振周期平方和最小。采用了直接搜索法寻优。通过算例可知，这两种优化设计方法均可行，且均为刚性设计。     

提速干线编组站出发子系统内部匹配与协调关系

分析提速干线编组站货物列车到发时刻不均衡运营特征,根据编组站作业特点和要求,运用排队论和随机过程理论,对出发子系统转场和接车可靠性、临界密集出发时间进行计算分析。认为出发子系统允许的接车延误概率应控制在0.12以内;当区间通过能力利用率在繁忙时间达0.85以上时,出发场的到发线应在10股以上。提高出发子系统转场和接车可靠性的措施包括:提高无调比、适当增加出发场到发线数量、降低编组调车机车的作业负荷、减小出发时间间隔不均衡系数。给出一定出发强度下的临界密集发车时间计算式,便于指导运输组织工作。改善出发子系统匹配与协调关系的有效途径包括:合理配置列检组数、转线接车延误率控制在10%以内、密集到发期间区段通过能力利用率不能超过90%、降低衔接区间发车时间间隔变异系数、连续高密集发车时间不能超过临界发车时间、适当增加分类线及到发线数量、优化列车运行计划、平衡双向系统作业负荷、加强管理、优化运输组织。     

基于红外搜索系统的被动测距技术研究

红外搜索系统是一种被动探测系统，量测数据中无目标的距离量；而评判来袭目标的威胁程度离不开其距离量。介绍了基于红外搜索系统的被动测距技术测量目标距离的算法、原理框图以及仿真试验与结果。     

基于排序二叉树的摘挂列车编组钩计划自动编制方法

根据摘挂列车编组调车作业原理,将摘挂列车下落问题抽象为排序问题,提出一种基于排序二叉树的编组钩计划自动编制方法.根据待编列车序列构造排序二叉树;利用排序二叉树的有序性快速搜索出有序车组序列,将其作为下落方案的可选集.考虑邻组、暂合列内收编固定组组别和空闲组别、端组等因素,从可选集中筛选出较优的下落方案.通过定义收编固定组简化列车收编过程,实现列车收编过程的计算机自动编制.通过实例验证,采用该方法降低了选择下落方案的复杂性,减少了列车编组钩计划的调车钩数,而且可根据实际调车线数灵活调整方案.     

Implementation and application of a stochastic aircraft boarding model

The aircraft turnaround processes is mainly controlled by the ground handling, airport or airline staff, except the aircraft boarding, which is driven by the passengers’ experience and willingness or ability to follow the proposed boarding procedures. The paper uses a prior developed, calibrated, stochastic aircraft boarding model, which is applied to different boarding strategies (chronological order of passenger arrival, hand luggage handling), group constellations and innovative infrastructural changes (Flying Carpet, Side-Slip Seat, Foldable Passenger Seat). In this context, passenger boarding is assumed to be a stochastic, agent-based, forward-directed, one-dimensional and discrete process. The stochastic model covers individual passenger behavior as well as operational constraints and deviations. A comprehensive assessment using one model allows for efficient comparison of current research approaches and innovative operational solutions for efficient passenger boarding.     

A stochastic model of traffic flow: Theoretical foundations

In a variety of applications of traffic flow, including traffic simulation, real-time estimation and prediction, one requires a probabilistic model of traffic flow. The usual approach to constructing such models involves the addition of random noise terms to deterministic equations, which could lead to negative traffic densities and mean dynamics that are inconsistent with the original deterministic dynamics. This paper offers a new stochastic model of traffic flow that addresses these issues. The source of randomness in the proposed model is the uncertainty inherent in driver gap choice, which is represented by random state dependent vehicle time headways. A wide range of time headway distributions is allowed. From the random time headways, counting processes are defined, which represent cumulative flows across cell boundaries in a discrete space and continuous time conservation framework. We show that our construction implicitly ensures non-negativity of traffic densities and that the fluid limit of the stochastic model is consistent with cell transmission model (CTM) based deterministic dynamics.     

Can ports increase traffic while reducing inputs? Technical efficiency of Spanish Port Authorities using a directional distance function approach

The focus of this paper is on the productive efficiency of ports. We estimate a directional technology distance function using parametric techniques to analyze the production technology and technical efficiency of a set of Spanish Port Authorities observed over the period 1993–2012. Technical inefficiency is conceived as the ability of ports to simultaneously expand a given output and contract variable inputs while maintaining quasi-fixed inputs and other outputs constant. Thus, for containerized cargo we address the following question: Given the amount of quasi-fixed inputs used by the firm and given the volume of the other outputs (liquids, solids, non-containerized cargo and passenger traffic), could ports increase their containerized merchandise while simultaneously reducing their variable inputs? Similar questions are asked for solid bulk and non-containerized general cargo. Our results show evidence of technical inefficiency among the ports in our sample. In particular, if the ports operated efficiently, we find that containerized cargo could be expanded by an average of over 6.4%, with an equivalent reduction in variable inputs. Solid bulk cargo and general non-containerized cargo could be increased by 4.1% and 6.1% respectively, with corresponding reductions in variable inputs. An implication of our results is that there is ample scope for specialization on the part of ports with no increase in infrastructure costs. Given that large investments in infrastructure have been made in Spanish port over the last decade, this opens the possibility of moving towards a management model based on taking advantage of existing capacity rather than new investments.     

Free-floating bike sharing: Solving real-life large-scale static rebalancing problems

Free-floating bike sharing (FFBS) is an innovative bike sharing model. FFBS saves on start-up cost, in comparison to station-based bike sharing (SBBS), by avoiding construction of expensive docking stations and kiosk machines. FFBS prevents bike theft and offers significant opportunities for smart management by tracking bikes in real-time with built-in GPS. However, like SBBS, the success of FFBS depends on the efficiency of its rebalancing operations to serve the maximal demand as possible.Bicycle rebalancing refers to the reestablishment of the number of bikes at sites to desired quantities by using a fleet of vehicles transporting the bicycles. Static rebalancing for SBBS is a challenging combinatorial optimization problem. FFBS takes it a step further, with an increase in the scale of the problem. This article is the first effort in a series of studies of FFBS planning and management, tackling static rebalancing with single and multiple vehicles. We present a Novel Mixed Integer Linear Program for solving the Static Complete Rebalancing Problem. The proposed formulation, can not only handle single as well as multiple vehicles, but also allows for multiple visits to a node by the same vehicle. We present a hybrid nested large neighborhood search with variable neighborhood descent algorithm, which is both effective and efficient in solving static complete rebalancing problems for large-scale bike sharing programs.Computational experiments were carried out on the 1 Commodity Pickup and Delivery Traveling Salesman Problem (1-PDTSP) instances used previously in the literature and on three new sets of instances, two (one real-life and one general) based on Share-A-Bull Bikes (SABB) FFBS program recently launched at the Tampa campus of University of South Florida and the other based on Divvy SBBS in Chicago. Computational experiments on the 1-PDTSP instances demonstrate that the proposed algorithm outperforms a tabu search algorithm and is highly competitive with exact algorithms previously reported in the literature for solving static rebalancing problems in SBSS. Computational experiments on the SABB and Divvy instances, demonstrate that the proposed algorithm is able to deal with the increase in scale of the static rebalancing problem pertaining to both FFBS and SBBS, while deriving high-quality solutions in a reasonable amount of CPU time.