A mathematical programming technique for matching time-stamped records in logistics and transportation systems

Time-stamped data for transportation and logistics are essential for estimating times on transportation legs and times between successive stages in logistic processes. Often these data are subject to recording errors and omissions. Matches must then be inferred from the time stamps alone because identifying keys are unavailable, suppressed to preserve confidentiality, or ambiguous because of missing observations. We present an integer programming (IP) model developed for matching successive events in such situations and illustrate its application in three problem settings involving (a) airline operations at an airport, (b) taxi service between an airport and a train station, and (c) taxi services from an airport. With data from the third setting (where a matching key was available), we illustrate the robustness of estimates for median and mean times between events under different random rates for “failure to record”, different screening criteria for outliers, and different target times used in the IP objective. The IP model proves to be a tractable and informative tool for data matching and data cleaning, with a wide range of potential applications.     

基于运行速度的公路几何线型优化设计探讨

首先阐述了运行速度的基本概念和运行速度的计算方法和评价准则。然后建立了运用遗传算法对公路几何线形进行优化的方法和步骤。最后提出了基于遗传优化算法的公路几何线形设计的方法和流程,为公路设计人员提供新的设计思路和方法。     

Scheduling of Intelligent and Autonomous Vehicles under pairing/unpairing collaboration strategy in container terminals

A new class of Intelligent and Autonomous Vehicles (IAVs) has been designed in the framework of Intelligent Transportation for Dynamic Environment (InTraDE) project funded by European Union. This type of vehicles is technologically superior to the existing Automated Guided Vehicles (AGVs), in many respects. They offer more flexibility and intelligence in maneuvering within confined spaces where the logistic operations take place. This includes the ability of pairing/unpairing enabling a pair of 1-TEU (20-foot Equivalent Unit) IAVs dynamically to join, transport containers of any size between 1-TEU and 1-FFE (40-foot Equivalent) and disjoin again. Deploying IAVs helps port operators to remain efficient in coping with the ever increasing volume of container traffic at ports and eliminate the need for deploying more 40-ft transporters in the very confined area of ports. In order to accommodate this new feature of IAVs, we review and extend one of the existing mixed integer programming models of AGV scheduling in order to minimize the makespan of operations for transporting a set of containers of different sizes between quay cranes and yard cranes. In particular, we study the case of Dublin Ferryport Terminal. In order to deal with the complexity of the scheduling model, we develop a Lagrangian relaxation-based decomposition approach equipped with a variable fixing procedure and a primal heuristics to obtain high-quality solution of instances of the problem.     

城市轨道交通高峰线路客流协同控制方法

在线路客流控制中，需同时考虑各个车站控流方案的可执行性与协同性. 采用 Fisher 最优分割法确定合理客流控制时段，基于此建立以乘客总等待时间最少和旅客周转量最大为目标的线路客流协同控制线性规划模型. 基于成都地铁2 号线AFC数据进行实验，针对协同控流与非协同控流方案，以及不同客流控制时段划分方案下的协同控流方案进行对比实验. 算例中：协同控流方案在旅客周转量下降约1.0%的情况下，乘客总等待时间减少约 56.7%；基于Fisher 最优分割法确定的时段划分方案中协同控流方案在乘客总等待时间方面最优，并具有很好的可执行性.     

灾后恢复阶段多期道路交通网络重建规划

灾后路网重建规划可分为应急阶段和全面恢复阶段。文中建立了灾后恢复阶段多期路网重建规划的双层模型，并采用灵敏度分析方法进行求解。上层模型考虑到建设资源的限制，以工程总效益最大为目标建立多期工程效益模型；下层模型是基于出行时间可靠性的用户均衡分配模型。最后结合实际路网进行了算例分析，证明模型和算法是有效的。     

一种基于改进的减缩模型修正方法

提出一种改进的模型修正方法,该方法采用多目标优化技术使得结构的减缩模型与实测结果相吻合。即首先建立一个多目标优化模型,其中包括一个关于单元修正系数的隐式非线性特征方程组,然后通过遗传算法来求解该多目标优化问题,来同时实现模型修正和损伤检测。文中通过对一个悬臂梁的数值仿真,表明本文所提出的方法的有效性,即在较大的测量噪声的情况下,同时具有模型修正和损伤检测两种功能,且较改进前的基于迭代的方法具有更好的噪声鲁棒性。     

一类运输工具带双重能力约束的LRP问题

分析了一类运输工具受双重能力约束的LRP问题，即在物流网络节点最大单批处理能力及运输工具总运输能力双重约束的情况下,如何进行物流中心选址和运输路线安排，使总的费用最小,模型假设网络系统满足如下条件：①节点的最大单批处理能力是逐层变化的，②货物只能用不同运输工具经过某一物流中心进行中转运输．文中建立了混合整数规划模型，提出了一种优化算法，并用优化算法对实例进行求解．     

高速动车组合理下线范围的决策模型及算法研究

随着我国铁路客运向高速化的全面迈进,高速铁路建设和运营的技术条件已经有了较大进步,因而高速动车组驶离高速线到既有线运行的模式逐渐成为运输组织模式研究的焦点,而高速动车组合理下线范围则是其中的关键问题之一。以此为背景,在分析多种铁路运输产品存在时旅客选择行为的基础上,将用户平衡理论应用于不同铁路运输产品间的客流分配问题中,同时考虑旅客和铁路客运部门两方面的利益,构造了一个双层规划模型来描述有多种铁路运输产品存在、且总客运需求变动情况下高速动车组的合理下线范围问题,并提出了基于灵敏度分析的求解算法。最后通过算例,分析在不同运价率条件下高速动车组合理下线范围的变化规律。     

基于遗传算法的集装箱单箱三维装载优化问题

研究应用改进遗传算法优化铁路集装箱单箱三维装箱问题,达到充分利用集装箱装载质量或装载容积的目的。改进遗传算法中考虑货物放置方向、装载容积、装载质量及装载重心等约束条件,并结合方向及顺序约束采用巧妙的个体编码方法,结合装载容积、装载质量及重心约束构造合理的适应值函数。以16件货物装入20英尺箱为实例,应用改进遗传算法进行计算,计算结果为集装箱装载容积利用率为63 18%,并且可以缩短计算时间一半以上。     

AutoLISP程序设计的若干问题

本文剖析了 AutoLISP 程序的结构特点,运行长大程序的措施和数据文件的组织等三个方面的问题.