车辆溜放运动中风阻力影响研究

车辆溜放运动方程是驼峰自动化建模的基础理论,长期以来工程应用中一直按匀变速运动简化处理,不够精确。本文从研究车辆溜放风阻力着手,建立风阻力与溜放速度间的二次方程,通过数学推导获得溜放车辆的非匀变速运动方程,较匀变速运动方程能够更加精确地反映驼峰车辆溜放的运动规律。该方程已作为数学模型成功应用于驼峰自动化系统车辆溜放速度的精确控制与分析,收效甚好。该方程可供驼峰设计方法改进、车辆溜放阻力精确测量和驼峰溜放仿真时借鉴。     

LED综合节能照明装置在地铁工程中的应用

以深圳地铁2号线工程为例,讨论发光二极管(LED)综合节能照明装置的使用范围、类型参数、技术要求、控制方式,分析异型LED照明装置的布置情况,并对其节能效果进行评估。结果表明,单套LED综合节能装置能接收欧洲安装总线(EIB)控制系统的带有数字可寻址灯光照明接口(DALI)的调光信号,单灯具备可连续调光功能,可使整个车站根据不同模式及运营需求进行整体调光,具有明显的节能优势,且不会降低使用要求。     

进气管长度可变系统的研究

分析了进气管长度可变系统的构成、主要技术参数和工作原理,指出了此系统的优点、发展趋势和故障检查方法。     

异形变截面多室曲线箱梁桥的试验研究及三维有限元分析

在对某异形变截面多室曲线箱梁桥试验研究的基础上,构造可以综合考虑拉压、弯扭、畸变、剪力滞及其耦合作用的三维虚拟层合单元法,并对该异形桥梁进行空间有限元分析。理论分析和试验研究表明,利用此法对这种复杂的异形桥梁结构进行空间分析,具有模型单元少、计算效率和精度高的特点,完全可以满足实际工程的需要,是一种简单方便的实用计算方法。最后,综合考虑在一期恒载和纵向预应力筋作用下其应力的空间分布情况。研究成果可供工程设计和施工参考。     

动态OD反推理论中的关键问题研究

针对ITS研究中动态OD矩阵难以获得的问题,回顾动态OD反推理论的发展历程,在此基础上明确了该领域研究中的四个关键问题:状态变量的选择、系统方程的确定、OD量与路段流量的关系和OD矩阵动态特性的体现,在对其进行分析的基础上提出每个关键问题的解决方法,为动态OD反推理论的进一步研究垫定基础。     

分段线性变参数控制在数字式自动找平控制系统中的应用

为了验证分段线性变参数控制在自动找平控制系统中的应用前景,对自动找平控制系统的结构、控制方式进行了介绍;分析了分段线性控制方式的工作原理及特点,在实验室建立了沥青混凝土摊铺机数字式自动找平控制系统试验台,设计了3套试验方案,即普通电磁阀方案、高速开关阀方案和分段线性控制方案;对这3种控制方案进行了试验比较,得出了在阶跃干扰作用下,3种控制方案的响应速度及产生超调时的超调量。结果表明:分段线性控制方案具有较快的响应速度,但在系统产生超调时,其超调量相对较大。     

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.     

变邻域搜索求解公共交通乘务调度问题

公共交通乘务调度问题是一个将车辆工作切分为一组合法班次的过程,它是NP难问题,许多求解方法的效率都与班次评价密不可分,本文通过裁剪TOPSIS方法(Technique for Order Preference by Similarity to an Ideal Solution)设计了TOPSIS班次评价方法.此外,通过裁剪变邻域搜索算法使之适合求解乘务调度问题,提出了基于变邻域搜索的乘务调度方法(Crew Scheduling Approach Based on Variable Neighbourhood Search,VNS),其中,并入了TOPSIS班次评价方法在调度过程中进行班次评价,设计了两种带概率的复合邻域结构以增加搜索的多样性,帮助跳出局部最优,在VNS中利用模拟退火算法进行局部搜索.利用中国公共交通中的11组实例进行了测试,测试结果表明,VNS优于两种新近提出的乘务调度方法,且其结果关于班次数接近于下界.     

兰州地铁地温分布特性及其演化规律

以兰州地铁所在地区为研究对象,实测地铁隧道开挖前的地温(简称为初始地温),根据实测数据,提出地铁初始地温预测模型公式。采用非稳态传热的数值模型,分析运营条件下地铁隧道围岩温度的演化规律。结果表明:兰州地铁初始地温随环境气温和埋深的变化而变化;年变温层位于自地表至埋深12m处;年恒温层位于埋深12m及其以下,温度为15℃左右;年变温层中,1年内初始地温变化规律与环境气温变化规律相似,近似呈正弦曲线状分布,但存在相位滞后的现象;1年中初始地温的振幅随埋深的增大呈指数下降趋势。在隧道内空气与围岩之间热交换中,兰州地铁隧道围岩的温度及其梯度、热透厚度(未达到极限时)均与隧道内环境温度、热交换时间成正相关关系,但与距隧道内壁的距离成负相关关系。     

The load-dependent vehicle routing problem and its pick-up and delivery extension

The present paper examines a Vehicle Routing Problem (VRP) of major practical importance which is referred to as the Load-Dependent VRP (LDVRP). LDVRP is applicable for transportation activities where the weight of the transported cargo accounts for a significant part of the vehicle gross weight. Contrary to the basic VRP which calls for the minimization of the distance travelled, the LDVRP objective is aimed at minimizing the total product of the distance travelled and the gross weight carried along this distance. Thus, it is capable of producing sensible routing plans which take into account the variation of the cargo weight along the vehicle trips. The LDVRP objective is closely related to the total energy requirements of the vehicle fleet, making it a credible alternative when the environmental aspects of transportation activities are examined and optimized. A novel LDVRP extension which considers simultaneous pick-up and delivery service is introduced, formulated and solved for the first time. To deal with large-scale instances of the examined problems, we propose a local-search algorithm. Towards an efficient implementation, the local-search algorithm employs a computational scheme which calculates the complex weighted-distance objective changes in constant time. Solution results are presented for both problems on a variety of well-known test cases demonstrating the effectiveness of the proposed solution approach. The structure of the obtained LDVRP and VRP solutions is compared in pursuit of interesting conclusions on the relative suitability of the two routing models, when the decision maker must deal with the weighted distance objective. In addition, results of a branch-and-cut procedure for small-scale instances of the LDVRP with simultaneous pick-ups and deliveries are reported. Finally, extensive computational experiments have been performed to explore the managerial implications of three key problem characteristics, namely the deviation of customer demands, the cargo to tare weight ratio, as well as the size of the available vehicle fleet.