...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>EURO journal of transportation and logistics >Static repositioning in a bike-sharing system: models and solution approaches
【24h】

Static repositioning in a bike-sharing system: models and solution approaches

机译：自行车共享系统中的静态重定位：模型和解决方案方法

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Bike-sharing systems allow people to rent a bicycle at one of many automatic rental stations scattered around the city, use them for a short journey and return them at any station in the city. A crucial factor for the success of a bike-sharing system is its ability to meet the fluctuating demand for bicycles and for vacant lockers at each station. This is achieved by means of a repositioning operation, which consists of removing bicycles from some stations and transferring them to other stations, using a dedicated fleet of trucks. Operating such a fleet in a large bike-sharing system is an intricate problem consisting of decisions regarding the routes that the vehicles should follow and the number of bicycles that should be removed or placed at each station on each visit of the vehicles. In this paper, we present our modeling approach to the problem that generalizes existing routing models in the literature. This is done by introducing a unique convex objective function as well as time-related considerations. We present two mixed integer linear program formulations, discuss the assumptions associated with each, strengthen them by several valid inequalities and dominance rules, and compare their performances through an extensive numerical study. The results indicate that one of the formulations is very effective in obtaining high quality solutions to real life instances of the problem consisting of up to 104 stations and two vehicles. Finally, we draw insights on the characteristics of good solutions.
机译：自行车共享系统使人们可以在分散在城市中的许多自动租车站之一租用自行车，将其用于短途旅行，然后将其归还到城市的任何车站。自行车共享系统成功的关键因素是其能够满足每个站点对自行车和空置储物柜不断变化的需求。这是通过重新定位操作来实现的，该操作包括使用专用的卡车车队从某些站点卸下自行车并将其转移到其他站点。在大型的自行车共享系统中操作这样的车队是一个复杂的问题，包括有关车辆应遵循的路线以及每次访问车辆时应在每个站点上卸下或放置的自行车数量的决定。在本文中，我们提出了针对问题的建模方法，该问题概括了文献中现有的路由模型。这是通过引入唯一的凸目标函数以及与时间有关的注意事项来完成的。我们提出两种混合的整数线性程序公式，讨论与它们相关的假设，通过几个有效的不等式和支配性规则对其进行强化，并通过广泛的数值研究比较它们的性能。结果表明，其中的一种配方非常有效地解决了现实生活中由多达104个站点和两辆车组成的问题的高质量解决方案。最后，我们对良好解决方案的特征进行了深入分析。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号