...
首页> 外文期刊>Transportation Research Procedia >User assignment in a smart vehicles’ network: dynamic modelling as an agent-based model
【24h】

User assignment in a smart vehicles’ network: dynamic modelling as an agent-based model

机译:智能车辆网络中的用户分配:动态建模作为基于代理的模型

获取原文
           

摘要

Demand-responsive transportation systems diversify local transport supply with providing flexibility of routing and scheduling as well as affordable price. The classical Dial-a-ride problem enables to assign users to vehicles by minimization of a cost function under constraints. However, the projected itinerary of the vehicles is calculated on a global approach considering automatically each new users independently and a dispatcher tests a match between the user and all available service vehicles. Thus, matching calculation time is restricting for the large operational services. The objective of this paper is a reformulation of the problem with more flexibility and an aggregated solution to optimize calculation time. This modelling is based on a mobility system of transit vehicles with their own dispatcher and station infrastructures. The vehicles are shared dynamically and make extra-stops to collect travelers with various destinations. In addition, the users of the service have not any transfer and are transported directly to their destination stations. We constructed an agent-based model which maximizes the utility of each vehicle while satisfying its own constraints. The minimum travel and waiting times of the users and maximum occupancy of vehicles are the default ones. We propose then a new formulation of the problem on the maximization of the vehicle utility. Passengers’ assignment to vehicles is controlled directly by the vehicle drivers on an aggregated level by origin destination pair. A case study illustrates the theoretical model and compares the efficiency of several service choices. A fleet of small vehicles seems to minimize the user waiting time.
机译:需求响应型交通系统通过提供灵活的路线安排和调度以及可承受的价格,使本地交通供应多样化。经典的转乘问题可以通过在约束下使成本函数最小化来将用户分配给车辆。但是,车辆的预计行程是根据全局方法计算的,其中会自动考虑每个新用户,并且调度员会测试用户与所有可用服务车辆之间的匹配情况。因此,对于大型运营服务而言,匹配计算时间受到限制。本文的目的是通过更灵活的方式对问题进行重新表述,并提供优化解决方案的综合解决方案。该模型基于具有自己的调度员和车站基础设施的过境车辆的出行系统。车辆是动态共享的,并且会加急停下来收集各个目的地的旅行者。另外,该服务的用户没有任何转移,而是被直接运输到其目的地站。我们构建了一个基于代理的模型,该模型可以在满足其自身约束的同时最大化每辆车的效用。用户的最小行驶和等待时间以及车辆的最大占用量是默认设置。然后,我们提出了关于车辆实用性最大化的问题的新表述。乘客对车辆的分配直接由车辆驾驶员按始发地目的地对进行汇总控制。案例研究说明了理论模型,并比较了几种服务选择的效率。一队小型车辆似乎可以最大程度地减少用户的等待时间。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号