The shape of MaaS: The potential for MaaS Lite

Mobility as a Service (MaaS) is about improving mobility for people. Since Gothenburg piloted the first multi-modal Mobility as a Service (MaaS) scheme from 2012, there have been many further attempts at introducing connected and bundled services globally, invariably provided as a mobile app and a single, simple ticketing interface. As in any emerging paradigm, the varying flavour, or ‘shapes’ of MaaS that are piloted reflect the search for a sustainable business model and connectivity between transport operators at varying levels that includes risk reallocation and data sharing. The varying levels of success of MaaS and Mobility on Demand (MOD) lead the authors to propose MaaS Lite, which reflects an incremental approach to MaaS based on a simpler organisational arrangement that does not depend upon the introduction of a Mobility Operator as a new player. MaaS Lite also recognises that most trips are not complex at all, often based on one or two connected mechanised modes that meets highly local needs, including FMLM service connectivity.Overall, MaaS is not a ‘one size fits all’ solution for all regions but the benefits of the highly targeted MaaS Lite could realise early public benefits as a first step in the development of a multi-phased ‘services road map’ that evolves towards the implementation of multi-modal, region-wide operationally integrated MaaS. Case studies in Hong Kong and Brisbane demonstrate the merits of MaaS Lite in these two contrasting environments having different regulatory regimes, population densities and levels of private car ownership.     

250km/h客专及城际线路GSM-R系统服务质量指标的研究

根据250km/h及以下等级客专线路和城际线路的GSM-R系统的需求,分析影响GSM-R网络电路域服务质量指标的因素、单网结构对GSM-R网络服务质量指标的影响,在对已开通客专测试数据进行统计的基础上,得出原有GSM-R电路域服务质量指标仍然适用的结论,并给出单网情况下指标达标的建议。     

模糊评价法在TDM方案决策中的应用

对近期提出的北京市交通需求管理(TDM)措施进行不同实施力度的组合,得出了若干组合方案;建立了交通需求管理政策方案评价指标体系,运用模糊统计法实现对非定量指标隶属度的确定,按效益型指标和成本型指标对定量指标分别确定其隶属度;通过专家调查法确定了各评价指标和评价准则的权重向量;最后利用多级模糊评价综合方法进行方案比选,得出最佳方案。本文所使用的方法和结果可以为交通需求管理政策评价、决策提供参考。     

Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots

Dial-a-ride problems are concerned with the design of efficient vehicle routes for transporting individual persons from specific origin to specific destination locations. In real-life this operational planning problem is often complicated by several factors. Users may have special requirements (e.g. to be transported in a wheelchair) while service providers operate a heterogeneous fleet of vehicles from multiple depots in their service area. In this paper, a general dial-a-ride problem in which these three real-life aspects may simultaneously be taken into account is introduced: the Multi-Depot Heterogeneous Dial-A-Ride Problem (MD-H-DARP). Both a three- and two-index formulation are discussed. A branch-and-cut algorithm for the standard dial-a-ride problem is adapted to exactly solve small problem instances of the MD-H-DARP. To be able to solve larger problem instances, a new deterministic annealing meta-heuristic is proposed. Extensive numerical experiments are presented on different sets of benchmark instances for the homogeneous and the heterogeneous single depot dial-a-ride problem. Instances for the MD-H-DARP are introduced as well. The branch-and-cut algorithm provides considerably better results than an existing algorithm which uses a less compact formulation. All seven previously unsolved benchmark instances for the heterogeneous dial-a-ride problem could be solved to optimality within a matter of seconds. While computation times of the exact algorithm increase drastically with problem size, the proposed meta-heuristic algorithm provides near-optimal solutions within limited computation time for all instances. Several best known solutions for unsolved instances are improved and the algorithm clearly outperforms current state-of-the-art heuristics for the homogeneous and heterogeneous dial-a-ride problem, both in terms of solution quality and computation time.     

大型国际活动交通组织规划方法综述

探讨夏季奥运会采用的交通组织规划方法,同时总结世界上最大规模的特殊活动——沙特阿拉伯麦加朝觐/副朝交通组织规划经验。每年一度的麦加朝觐已经延续几个世纪,在最近几十年人数持续增长,朝圣者已增至600万人,包括朝觐一周内300万人和斋月期间100万人。目前,这项活动是历史上规模最大且定期举行的特殊活动,其规模预计还将大幅增长。奥运会是世界上第二大特殊活动,每4年举办一次,在主办城市持续2周。通常奥运会主办城市自身的交通压力已经非常巨大,在奥运会期间同时还要额外满足4万名奥运官员和运动员以及800万名观众的出行需求。因此,奥运会交通组织规划对于保障赛事顺利开展至关重要。通过描述这两项活动的背景和交通供需特征,概述已有交通组织规划方法,旨在分析和总结大型活动交通组织规划的经验教训,探讨可供选择的规划策略。