基于后悔理论的拼车决策问题研究

本文针对瓶颈路段,研究了出行者在单独驾车和拼车这两种出行模式下的早高峰出行行为。首先根据瓶颈模型的均衡条件,分别推导了收费和不收费机制下单独出行和拼车出行的出行时间及广义出行成本。为进一步研究出行者的出行方式选择,本文建立了基于后悔理论的随机Logit模型,并提出了相应的迭代平均算法。研究表明,在不收费机制下单独驾车和拼车出行者混合出发,而最优收费机制则实现了交通流的分离,其中拼车出行者在瓶颈的高峰时段出行而单独驾车者在瓶颈的颈部出行。算例结果表明,后悔厌恶水平是影响出行者出行方式选择行为的重要参数,其中,选择最低成本的出行者随着后悔厌恶水平的增加而增加。     

ATIS和道路收费下混合SUE相对于SSO的效率损失

在ATIS和道路收费共同作用的异质性交通网络中,基于用户在信息接受程度与时间价值上的异质性,对用户进行合理分类,所有用户均按照随机方式进行择路.构建了多用户混合随机均衡等价的变分不等式模型,以及多用户随机社会最优模型.以用户感知的总出行成本作为系统性能评价的指标,当收费作为系统总成本的一部分时,分别在时间准则与费用准则下研究了多用户混合随机均衡相对于随机社会最优的绝对效率损失问题.研究结果表明,时间准则下的绝对效率损失上界与路段出行时间函数和混合随机均衡时系统的实际总出行时间有关,费用准则下的绝对效率损失上界还与出行者的社会经济特性和随机社会最优时系统的实际总出行时间有关.     

ATIS下多用户混合均衡相对于随机社会最优的效率损失

在ATIS与道路收费共同作用的交通网络中,用户不仅在接受的交通信息上具有异质性,同时在时间价值上也具有异质性.文章基于这两类异质性,将用户分为安装ATIS并遵从信息、安装但不遵从、不安装的三类用户,所有用户均按照随机用户均衡的方式进行择路.文章构建了多用户随机均衡模型及其等价的变分不等式,并以用户感知总成本作为系统性能指标,分别建立了时间准则与费用准则下多用户随机社会最优模型.当收费不作为总成本的一部分时,研究了多用户均衡相对于随机社会最优的绝对效率损失问题.研究结论表明,无论采用何种度量准则,绝对效率损失上界与路段特性函数、出行者的社会经济特性、道路收费以及两准则下多用户均衡与随机社会最优时系统实际总出行成本均有关.     

收费机制下利己-利他混合交通均衡分配的效率损失

运用解析推导方法对收费机制下利己-利他混合交通均衡分配问题的效率损失进行研究.首先,构建了收费机制下利己-利他混合交通均衡分配问题的等价变分不等式模型;然后,通过解析推导方法得到了收费不作为系统总出行时间成本一部分时的效率损失上界;最后,给出了路段出行时间成本函数为多项式函数时的上界表达式.研究结果表明,效率损失上界与路段出行时间成本函数类、利他系数以及出行需求划分系数相关,结论以现有文献有关结论为特例.     

基于瓶颈模型的交通拥堵收费与补贴模式研究

为了既保证交通拥堵收费的效率又降低个人出行者的出行成本,使得社会和个人利益能有效统一并提高公众对拥堵收费的接受度,基于双通道瓶颈模型设立了拥堵收费与补贴相混合的模式,将收费路段的收费收入全部或部分补贴到免费路段上.进而我们对该模式的参数和效果进行算例分析,发现该模式可以有效地减缓交通拥堵.同时模式与一般动态单通道收费相比在社会成本缩减方面仅有微小劣势,但却使得小汽车出行者的成本大幅缩小,公平度有显著提升.最后根据算例分析结果的比较,给出了方法最适用的情况     

收费机制下一类随机需求混合交通均衡分配的非合作代价

运用算法博弈论探讨一类随机需求混合交通均衡分配在收费机制下的非合作代价.首先,构建了收费机制下随机需求UE-CN混合交通均衡分配的变分不等式模型.其次,运用解析推导法分别得到单项式出行成本函数下是否将收费作为系统总成本一部分时,该类混合交通均衡分配的非合作代价上界表达式.在此基础上,探讨了出行需求服从对数正态分布时的非合作代价上界表达式.并以数值算例验证所得结论.     

基于出行者属性差异的拥挤收费政策分析

运用经典瓶颈模型,引入出行者属性差异,分析了实行拥挤收费政策前后不同出行方式的出行分布,给出了收费政策影响下出行者行为策略的选择.进一步,分析了基于政府拥挤收费政策下,小汽车和公交车共用同一路线时,道路使用成本、政府调控目标及费率的关系.研究结果表明,政府可以通过设置恰当的收费费率,调节不同出行方式间的出行分布,缓解交通拥挤,优化交通管理现状.属性差异系数的引入使模型更符合实际,改进了已有研究.     

基于双层规划的高速公路收费费率优化模型

在全国联网收费的背景下,从动态收费的角度考虑,建立了双层规划模型,上层规划中将路网管理者作为领导者,以高速公路收费效益最大化为目标函数,同时考虑道路运营管理方的合理收益和养护成本支出情况,下层规划则以用户出行效用最大化为目标,充分考虑了道路使用者的道路选择差异性及道路拥堵对交通分布的影响,建立随机用户均衡模型.最后结合某地区AB地高速公路实际情况进行分析,采用了遗传模拟退火算法验证了模型的实用性,并与其他的算法对比,验证了算法的有效性。研究表明:优化模型可以有效提高高速公路的收费效益和用户的出行效用,可以分散高峰时的交通压力,提升高速公路的通行效率.     

城市晚高峰地铁多方式出行均衡分析

随着我国城市化进程的加快,不仅一线城市地铁线路扩充至卫星城,一些二线大中型城市也将地铁建设纳入城市发展规划当中.地铁交通高峰出行具有准时及经济的特点,同时通勤人群选择地铁出行可有效地缓解地面交通拥堵.基于二线城市及一线城市卫星城的地铁交通线路未能完整覆盖从工作地到居住地的线路需要,本论文设计了城市晚高峰多方式出行均衡模型,研究晚高峰依托地铁多方式出行的交通特点并进行分析.对城市晚高峰人群可选择自行车地铁换乘、地铁出租车换乘等多方式达到晚高峰出行均衡,给出了参考性意见.     

ATIS和道路收费下的混合随机用户均衡的效率损失

在ATIS作用下的交通网络中,用户在交通信息的接受程度上是异质的;考虑到装有ATIS的用户并不总是遵循ATIS的建议,因此,引入信息遵从率这一参数,将所有用户分为三类:安装并遵从信息、安装但不遵从信息和不安装的用户;均按照随机用户均衡的方式进行择路,但对出行时间有不同的感知。同时考虑存在道路收费的情形下,用户在时间价值上是异质的。综合考虑交通信息与道路收费的影响,基于用户两方面的异质性,对其进行合理分类,构建了多用户多准则的混合随机均衡模型及其等价的变分不等式;当收费不作为系统总成本的一部分时,建立了时间准则与费用准则下的系统最优模型;在此基础之上,分别研究了两种准则下混合均衡相对于系统最优的效率损失,给出了效率损失上界,并进一步分析了效率损失上界与各参数间的关系;交通管理者可以从道路收费策略的实施、信息诱导系统的完善等角度进行路网的改造和优化设计。     

Spatial distribution complexities of traffic congestion and bottlenecks in different network topologies

Recently, urban traffic congestion has become a popular social problem. The generation and the propagation of congestion has close relation with the network topology, the traffic flow, etc. In this study, based on the traffic flow propagation method, we investigate the time and space distribution characteristics of the traffic congestion and bottlenecks in different network topologies (e.g., small world, random and regular network). The simulation results show that the random network is an optimal traffic structure, in which the traffic congestion is smaller than others. Moreover, the regular network is the worst topology which is prone to be congested. Additionally, we also prove the effects of network with community structure on the traffic system and congestion bottlenecks including its generation, propagation and time–space complexities. Results indicate that the strong community structure can improve the network performance and is effective to resist the propagation of the traffic congestion.     

基于SD-GM理论的城市交通拥堵收费模型研究

随着中国城市化建设步伐的不断加快,交通拥堵在不断地加剧。同时,因机动车污染物的排放,每年将产生大量的NO_x,从而又会引起严重的大气污染(如“雾霾”污染)。针对这些问题,本文从环境和社会的角度出发,采用系统动力学与灰色系统相结合的方法(SD-GM),构建了城市交通拥堵收费模型,并对模型中主要变量进行动态仿真和决策分析,以此来寻找缓解交通拥堵和减少机动车尾气排放的可行策略。通过现实性测试和敏感性测试,得到拥堵收费的范围不超过100元/天*辆。通过进一步的仿真和结果分析可得到以下结论:(1)在区间[25,40] 内,随着拥堵收费的提高,NO_x存量,机动车出行吸引度和交通拥堵程度都呈下降趋势,而车均道路面积呈上升趋势。(2)但并非拥堵收费越高越好, 超过40 元/天*辆,会产生相反的效果。最后,通过比较分析,得到NO_x存量,机动车出行量,机动车出行吸引度和交通拥堵程度分别下降了约33.76%,39.64%,43.26%,82.25%,而车均道路面积提高了大约65.68%,进而验证了模型的有效性和实用性。     

电动公交枢纽直流快速充电模式及充电设施最优配置

发展电动公交能减少燃油消耗和城市污染物排放,对改善城市环境具有十分重要的意义.提出一种能显著减少电动公交运营成本的直流快速充电方式及相应的充电设施的建设模式.对公交枢纽直流快速充电模式下电动公交充电服务排队模型、高峰和平峰期充电设施最优配置模型进行了研究,并通过算例验证了这些模型的有效性.研究成果对我国电动公交的充电设施建设具有借鉴意义.     

基于两阶段求解策略的动态电动车辆路径优化研究

由于政府对新能源汽车的补贴政策和市区对燃油车限行政策的实时,越来越多的物流公司在城市配送中广泛采用电动汽车。然而,电动车续航里程受限,需要在途充电或者换电,同时客户需求的动态性以及充/换电设施的排队等现实因素也应该被考虑。为此,提出了分阶段策略求解动态电动车辆路径优化问题,并建立了两阶段的EVRP模型。其中第一阶段针对静态客户建立了静态EVRP模型,第二阶段在设计了换电站及动态客户插入策略的基础上,建立了动态EVRP模型以路径更新策略。最后,设计改进的CW-TS混合启发式算法来求解静态模型,设计贪婪算法求解动态模型。实验结果表明,模型与算法具有较好的适用性和有效性。     

Integrating link-based discrete credit charging scheme into discrete network design problem

In this paper, we present an optimization model for integrating link-based discrete credit charging scheme into the discrete network design problem, to improve the transport performance from the perspectives of both transport network planning and travel demand management. The proposed model is a mixed-integer nonlinear bilevel programming problem, which includes an upper level problem for the transport authority and a lower level problem for the network users. The lower level sub-model is the traffic network user equilibrium (UE) formulation for a given network design strategy determined by the upper level problem. The network user at the lower level tries to minimize his/her own generalized travel cost (including both the travel time and the value of the credit charged for using the link) by choosing his/her route. While the transport authority at the upper level tries to find the optimal number of lanes and credit charging level with their locations to minimize the total system travel time (or maximize the transportation system performance). A genetic algorithm is used to solve the proposed mixed-integer nonlinear bilevel programming problem. Numerical experiments show the efficiency of the proposed model for traffic congestion mitigation, reveal that interaction effects across the tradable credit scheme and the discrete network design problem which amplify their individual effects. Moreover, the integrated model can achieve better performance than the sequential decision problems.     

Dynamic system optimal performances of shared autonomous and human vehicle system for heterogeneous travellers

ABSTRACT

Autonomous vehicles (AV) can solve vehicle relocation problems faced by traditional one-way vehicle-sharing systems. This paper explores the deterministic time-dependent system optimum of mixed shared AVs (SAV) and human vehicles (SHV) system to provide the benchmark for the situation of mixed vehicle flows. In such a system, the system planner determines vehicle-traveller assignment and optimal vehicle routing in transportation networks to serve predetermined travel demand of heterogeneous travellers. Due to large number of vehicles involved, travel time is considered endogenous with congestion. Using link transmission model (LTM) as a traffic flow model, the deterministic time-dependent system optimum is formulated as linear programming (LP) model to minimize the comprehensive cost including travellers’ travel time cost, waiting time cost and empty vehicle repositioning time cost. Numerical examples are conducted to show system performances and model effectiveness.     

考虑码头内外堆场竞争的集装箱堆存定价模型

针对由于集装箱吞吐量增加造成翻箱成本增加与码头堆场拥堵,考虑内外堆场竞争,构建集装箱堆存定价模型,研究内外堆场竞争下的堆存定价决策和货主移箱决策,分析码头堆场操作成本、场外堆场运输成本、货主需求参数和码头堆场收益的内在关系。算例结果表明:一旦过了免费期立即移箱到场外堆场,货主成本最小。随着场外堆场运输成本的增加,码头堆场的堆存定价和箱量增加,提高码头堆场收益。随着码头堆场操作成本降低,码头堆场堆存价格随之下降,但码头堆存箱量增加,提高码头堆场收益。此外降低堆场定价对货主需求的影响参数以及提高运输成本对货主需求的影响系数,有利于提高码头堆场收益。     

Finding a minimum cost path between a pair of nodes in a time-varying road network with a congestion charge

The minimum cost path problem in a time-varying road network is a complicated problem. The paper proposes two heuristic methods to solve the minimum cost path problem between a pair of nodes with a time-varying road network and a congestion charge. The heuristic methods are compared with an alternative exact method using real traffic information. Also, the heuristic methods are tested in a benchmark dataset and a London road network dataset. The heuristic methods can achieve good solutions in a reasonable running time.     

Does battery management matter? Performance evaluation and operating policies in a self-climbing robotic warehouse

Our research is motivated by battery management in a new self-climbing robotic (SCR) system. The SCR system fully depends on battery-powered robots for tote movements. Therefore, battery management plays an important role and considerably impacts the system performance. This paper investigates the decision of battery charging technology (fast charging versus slow charging) taking into account the battery degradation, the battery charging policy (priority charging policy and dedicated charging policy), and the optimal number of chargers in the system. The paper also optimizes battery management in the SCR system by establishing semi-open queuing networks (SOQNs). The analytical models are solved by the approximate mean value analysis and are validated by simulation models. We find several interesting managerial insights: (1) In the operational policies, although fast charging can decrease the throughput time, we find a new condition when slow charging outperforms fast charging in robotic warehouses. (2) The priority charging policy is more cost-effective than the dedicated charging policy. (3) We also find a decision tool to determine the optimal number of chargers to satisfy the maximum allowed throughput time with the minimum cost.     

Setting expediting repair policy in a multi-echelon repairable-item inventory system with limited repair capacity

Inventory systems with limited repair capacity are affected by congestion externalities, caused by use of a shared service. There is incompatibility between individual and system optimisation in considering congestion externalities. Three models are described that investigate the congestion effect in a multi-echelon inventory system which has two modes of repair, each with a limited repair capacity. An expanding repair policy employed by the bases in order to choose which repair mode to use is described and compared with different expediting policies related to congestion externalities. The expanding repair policy that considers congestion externalities was found to lead to better system performance measurement than an expanding policy with no congestion. The results of the numerical experiment indicate that the model that ignores congestion externalities—that is, the model that measures each base as an individual—leads to poorer performance measurement for every expediting repair policy, and particularly for the optimal expediting repair policy.