Inventory rebalancing and vehicle routing in bike sharing systems
详细信息 查看全文
- 作者：J. Schuijbroek ; a ; jasper.schuijbroek@gmail.com" class="auth_mail" title="E-mail the corresponding author ; R.C. Hampshire1 ; b ; hamp@umich.edu" class="auth_mail" title="E-mail the corresponding author ; W.-J. van Hoevec ; vanhoeve@andrew.cmu.edu" class="auth_mail" title="E-mail the corresponding author
- 关键词：Bike sharing ; Routing ; Inventory ; Integer programming ; Constraint programming ; Markov processes
- 刊名：European Journal of Operational Research
- 出版年：2017
- 出版时间：16 March 2017
- 年：2017
- 卷：257
- 期：3
- 页码：992-1004
- 全文大小：1118 K
文摘
- class="listitem" id="list_celist0004">
- class="label">•
We derive service level bounds by modeling inventory as a non-stationary Markov chain.
- class="label">•
Mixed-integer programming for multi-vehicle rebalancing is practically intractable.
- class="label">•
Our polynomial-size clustering heuristic maintains service level feasibility.
- class="label">•
We provide computational results on data from Boston, MA and Washington, DC.
- class="label">•
Our heuristic outperforms mixed-integer and constraint programming approaches.