Tradable network permits: A new scheme for the most efficient use of network capacity

Akamatsu et al. (2006) proposed a new transportation demand management scheme called “tradable bottleneck permits” (TBP), and proved its efficiency properties for a single bottleneck model. This paper explores the properties of a TBP system for general networks. An equilibrium model is first constructed to describe the states under the TBP system with a single OD pair. It is proved that equilibrium resource allocation is efficient in the sense that the total transportation cost in a network is minimized. It is also shown that the “self-financing principle” holds for the TBP system. Furthermore, theoretical relationships between TBP and congestion pricing (CP) are discussed. It is demonstrated that TBP has definite advantages over CP when demand information is not perfect, whereas both TBP and CP are equivalent for the perfect information case. Finally, it is shown that the efficiency result also holds for more general demand conditions.     

公路建设项目征地拆迁补偿费用确定与控制方法研究

文中以广东省公路建设项目征地拆迁费用的确定为例,以现行实施的征地拆迁补偿相关规定为基础,探讨征地数量和标准的计量、计算方法,建立征地拆迁标准动态数据库,以期对征地拆迁费用的确定和控制提供思路和实际操作指导。     

考虑横向漂移的船舶路径跟踪自抗扰控制

针对船舶运动系统中内部动态不确定和外部干扰等问题,进行了欠驱动船舶路径跟踪的自抗扰方法研究。利用Backstepping设计参考航向角,并通过线性扩张状态观测器对流干扰和横向运动引起的横向漂移进行估计。其次,根据自抗扰算法对航向进行控制,采用线性扩张状态观测器对外界干扰及内部不确定项进行估计。最后仿真结果表明,在风流干扰下所设计的控制器仍能使船准确地跟踪上参考路径,验证了所提控制方案的有效性。     

基于多旅行商问题的应急设施服务区划分模型

基于多旅行商问题，增设集散中心需求及应急服务设施资源容量约束条件，以最小化遍历区域内全部集散中心的综合旅行时间成本为优化目标，构建一种应急设施服务区划分模型，确定各应急设施的服务区范围.设计一种复合算法求解模型，首先基于P-中值选址模型的优化理念，形成初始方案；继而加入禁忌搜索算法，结合LKH求解器对模型进行迭代优化求得最优解.基于宁波市北仑区实际拓扑网络进行案例分析，验证了模型和求解方法的有效性.     

车辆隔热壁K值计算中空气层的处理方法

对轨道交通车辆多层复合结构的隔热壁进行隔热性能理论计算与仿真计算的对比,对隔热壁内部空气层的隔热性能进行分析。结论为:在车辆多层复合结构的隔热壁K值计算中,当空气层厚度大于一定厚度时,流体自然对流对隔热壁的隔热性能影响较大。利用多项式密度(Polynomial Denisity)和Boussinesq模型两种算法,对所得结论进行了验证。     

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.     

Locating emergency vehicles with an approximate queuing model and a meta-heuristic solution approach

In this paper, the location of emergency service (ES) vehicles is studied on fully connected networks. Queuing theory is utilized to obtain the performance metrics of the system. An approximate queuing model the (AQM) is proposed. For the AQM, different service rate formulations are constructed. These formulations are tested with a simulation study for different approximation levels. A mathematical model is proposed to minimize the mean response time of ES systems based on AQM. In the model, multiple vehicles are allowed at a single location. The objective function of the model has no closed form expression. A genetic algorithm is constructed to solve the model. With the help of the genetic algorithm, the effect of assigning multiple vehicles on the mean response time is reported.     

A generic data assimilation framework for vehicle trajectory reconstruction on signalized urban arterials using particle filters

With trajectory data, a complete microscopic and macroscopic picture of traffic flow operations can be obtained. However, trajectory data are difficult to observe over large spatiotemporal regions—particularly in urban contexts—due to practical, technical and financial constraints. The next best thing is to estimate plausible trajectories from whatever data are available. This paper presents a generic data assimilation framework to reconstruct such plausible trajectories on signalized urban arterials using microscopic traffic flow models and data from loops (individual vehicle passages and thus vehicle counts); traffic control data; and (sparse) travel time measurements from whatever source available. The key problem we address is that loops suffer from miss- and over-counts, which result in unbounded errors in vehicle accumulations, rendering trajectory reconstruction highly problematic. Our framework solves this problem in two ways. First, we correct the systematic error in vehicle accumulation by fusing the counts with sparsely available travel times. Second, the proposed framework uses particle filtering and an innovative hierarchical resampling scheme, which effectively integrates over the remaining error distribution, resulting in plausible trajectories. The proposed data assimilation framework is tested and validated using simulated data. Experiments and an extensive sensitivity analysis show that the proposed method is robust to errors both in the model and in the measurements, and provides good estimations for vehicle accumulation and vehicle trajectories with moderate sensor quality. The framework does not impose restrictions on the type of microscopic models used and can be naturally extended to include and estimate additional trajectory attributes such as destination and path, given data are available for assimilation.     

可持续交通——各方观点和长期挑战

从交通研究者和实践者的角度出发,以可持续交通这一概念为中心展开讨论。可持续交通宽泛地反映了可持续发展在交通领域的原则。随着可持续性这一概念的外延逐渐扩大,在它的定义、应用和价值取向上出现了不同观点。着重讨论可持续交通,以及如何理解和运用可持续交通,包括:1)将可持续性或者可持续发展作为一个整体的概念,包括关于可持续性的不同方法和定义之间的冲突;2)对可持续交通以及交通领域对其理解的探索;3)使用指标来实现可持续性的应用。然后识别了通往可持续交通之路的若干挑战,包括缺乏清晰定义、可持续性的固有冲突、可持续发展的跨领域本质、各种工作框架和指标体系、可持续发展的政治因素和交通领域实践中的不同观点。基于在该课题上的研究积累,总结解决这些问题的工作框架,提出因地制宜、注重结果、整体的方法来解决可持续交通中的挑战。