3.8 Proceedings Paper

Short-term strategies for stochastic inventory routing in bike sharing systems

期刊

出版社

ELSEVIER SCIENCE BV
DOI: 10.1016/j.trpro.2015.09.086

关键词

inventory routing; vehicle routing; stochastic dynamic programming; shared mobility; bike sharing

向作者/读者索取更多资源

Bike sharing systems (BSS) provide individual and eco-friendly urban mobility and are implemented in a growing number of cities. In BSS, customers can rent and return bikes spontaneously at stations and at every time of the day. To allow a reliable usage, system operators have to enable a sufficient number of bikes and empty bike racks at each station. Therefore, system operators use a set of vehicles to relocates bikes between stations. The according routing can be derived solving an inventory routing problem (IRP). For planning, operators can draw on expected customer trips generally following specific daytime patterns. Nevertheless, a significant amount of rentals and returns occur unpredictably and spontaneously forcing immediate adaptions of the routes. In this paper, we define the stochastic IRP for BSS and present a short-term relocation strategy (STR). A STR defines priority stations regarding their urgency that have to be rebalanced. In a real world case study, we compare STR to a long-term relocation strategy (LTR) using given target fill levels. STR outperforms LTR significantly leading to suitable service levels. (C) 2015 The Authors. Published by Elsevier B.V.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

3.8
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据