带形城市轨道交通TOD模式研究

带形城市由于其特殊的自然地理环境,城市空间布局及发展受限,城市用地与交通之间的矛盾尖锐,市区交通拥堵问题严重,成为城市发展的瓶颈。为解决当前带形城市交通发展难题,应当在带形城市规划建设中引入以城市轨道交通引导的TOD发展模式,制定城市发展主轴,以城轨站点为中心开发周边土地,建设良好市区环境,有效拓展城市规模。城轨交通TOD模式能以自身优势破除城市交通发展难题,改善城市结构布局,为调整市区土地结构提供机遇,是带形城市轨道交通可持续发展的有效途径。以兰州市轨道交通2号线为例,结合TOD理论,提出规划意见和建议。     

时变耦合对含相位阻尼J-C模型线性熵的影响

在腔场为相干态场,原子处于等概率叠加态的初始条件下,采用色散近似方法,研究了存在相位耗散且含与时间成正比变化的场-原子耦合的Jaynes-Cummings模型的线性熵演化特征.数值计算结果表明,与常系数耦合相比较,时变耦合不改变原子和腔场复合系统的线性熵的时间演化,但破坏原子线性熵及场线性熵的振荡周期性.在系统演化初期,时变耦合抑制并延迟原子和场相干性的丢失.耦合系数突变会显著提高子系统线性熵的振荡频率.     

直线电机地铁车辆如何降低制动磨耗

由于直线电机车辆的固有特性及某轨道交通线路的运营特点,实施电制动时,导致空气制动被迫频繁补充,造成制动磨耗件消耗较快。介绍了改造前、后制动闸片、制动盘及制动施加情况,并进行了经济分析。通过改善空气制动施加逻辑及更换新型号的闸片,制动磨耗量明显降低,可大幅降低运营成本。     

学院教职工付酬方案的最优化控制系统

利用线性优化理论和教学建模方法，对学院教职工最优化付酬方案进行了研究了最优化分配教职工报酬的控制模型，为主管部门提供了强有力的参考。     

Energy savings in transport

A decade of increasing Federal attention to urban transportation needs has culminated in the 1970 Urban Mass Transportation Assistance Act. This Act is intended to provide 10 thousand million dollars over the next 12 years in Federal assistance money to urban public transportation systems. This paper examines the needs of selected U.S. cities as a basis for (1) understanding the vast, various and complex transportation needs of urban areas throughout the country, and (2) assessing the sufficiency of these funds. The sample cities have been placed into three broad categories based on the state of development of their transportation systems. In Category I cities, the essential need is to ensure the survival of bus systems for the use of non‐drivers, or to provide some other viable alternative to the automobile; in Category II cities, the primary needs are to relieve auto congestion and to improve public transportation components, while in Category III cities, the primary need is massive investment to improve and to extend public transportation facilities. It is concluded that the presently intended Federal funding level for transportation will not meet the financial requirements of the Category III cities.     

Korovkin定理之推广

关于线性正算子收敛性方面的Ｋｏｒｏｖｋｉｎ定理是函数逼近论的著名定理，推广了一种连续函数和周期连续函数一致收敛的Ｋｏｒｏｖｋｉｎ定理，得到了更便于验证的判别条件。     

Non-fragile multi-objective static output feedback control of vehicle active suspension with time-delay

This paper presents an approach to design a delay-dependent non-fragile H_∞/L₂–L_∞ static output feedback (SOF) controller for active suspension with input time-delay. The control problem of quarter-car active suspension with actuator time-delay is formulated to a H_∞/L₂–L_∞ control problem. By employing a delay-dependent Lyapunov function, new existence conditions of delay-dependent non-fragile SOF H_∞ controller and L₂–L_∞ controller are derived, respectively, in terms of the feasibility of bilinear matrix inequalities (BMIs). Then, a procedure based on linear matrix inequality optimisation and a hybrid algorithm of the particle swarm optimisation and differential evolution is used to solve an optimisation problem with BMI constraints. Design and simulation results of non-fragile H_∞/L₂–L_∞ controller for active suspension show that the designed controller not only can achieve the optimal performance and stability of the closed-loop system in spite of the existence of the actuator time-delay, but also has significantly improved the non-fragility characteristics over controller perturbations.     

Mathematical properties and constraints representation for bottom-up approaches to the evaluation of GHG mitigation policies

Bottom-up models, including MARKAL, MESSAGE and AIM, are widely used when analyzing the effect of greenhouse gas (GHG) abatement policies. These bottom-up models are mostly formulated as a linear programming (LP) optimization model to find both the minimal cost combination of abatement technologies and energy flows while satisfying demands. It is not unusual that the bottom-up modeling involves a great number of technical, industrial, socioeconomic and environmental constraints. Investigating representative constraints needed for analyzing GHG abatement policies, this study proposes how to implement these constraints in bottom-up modeling.     

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.