论文标题
考虑多种替代运输模式,建模和解决车辆共享问题
Modeling and solving a vehicle-sharing problem considering multiple alternative modes of transport
论文作者
论文摘要
在移动性模式的变化中,我们提出了一种针对车辆共享问题的调度方法,考虑了几种替代性运输方式,从具有集中规划的公司角度来看。我们考虑在拥有一个或多个仓库和固定数量的用户(即员工)的公司中共享车辆共享。用户的约会位置固定,固定的开始和结束时间。车辆必须用于从仓库到仓库的用户全面旅行。我们旨在将车辆分配给用户旅行,以便与其他运输方式相比最大化节省。我们首先考虑使用一种类型的车辆,其次是可以使用多种车辆类型。对于第一种情况,我们表明可以将车辆分享问题提出为最低成本流量问题。其次,如果有多种类型的车辆可用,则可以将问题提出为多商品流问题。由于有效的解决方案方法,这些配方使该问题适用于日常操作。我们根据维也纳的人口,空间和经济数据为两种情况提供了全面的计算研究。我们表明,我们针对此问题的配方在几秒钟内解决了这些实例,这使它们在在线预订系统中可用。在分析中,我们讨论了不同的潜在环境。我们研究共享车队的最佳组成,受限的运输方式以及目标函数的变化。
Motivated by the change in mobility patterns, we present a scheduling approach for a vehicle-sharing problem, considering several alternative modes of transport, from a company viewpoint with centralized planning. We consider vehicle-sharing in a company having one or more depots and a fixed number of users, i.e. employees. The users have appointments with a fixed location and fixed start and end times. A vehicle must be used for a full trip of a user from depot to depot. We aim at assigning vehicles to user trips so as to maximize savings compared to other modes of transport. We first consider that only one type of vehicle is used, and second that multiple vehicle types can be used. For the first case, we show that the vehicle-sharing problem can be formulated as a minimum-cost flow problem. Secondly, if multiple types of vehicles are available the problem can be formulated as a multi-commodity flow problem. These formulations make the problem applicable in daily operations due to efficient solution methods. We provide a comprehensive computational study for both cases on instances based on demographic, spatial, and economic data of Vienna. We show that our formulations for this problem solve these instances in a few seconds, which makes them usable in an online booking system. In the analysis we discuss different potential settings. We study the optimal composition of a shared fleet, restricted sets of modes of transport, and variations of the objective function.