带有再平衡功能的共享单车系统的两阶段随机编程模型

IF 2.1 Q2 OPERATIONS RESEARCH & MANAGEMENT SCIENCE
Rossana Cavagnini , Francesca Maggioni , Luca Bertazzi , Mike Hewitt
{"title":"带有再平衡功能的共享单车系统的两阶段随机编程模型","authors":"Rossana Cavagnini ,&nbsp;Francesca Maggioni ,&nbsp;Luca Bertazzi ,&nbsp;Mike Hewitt","doi":"10.1016/j.ejtl.2024.100140","DOIUrl":null,"url":null,"abstract":"<div><p>We study the problem of determining the target inventory level of stations in a bike-sharing system, when bikes can be rebalanced later during the day. We propose a two-stage stochastic programming formulation, where the target inventory decisions are made at the first stage, while the recourse decisions, related to rebalancing, are made at the second stage. In the literature, the problem of determining the target inventory levels is solved without taking into account the rebalancing problem, or these two problems are solved sequentially. We prove that more efficient bike-sharing systems can be obtained by integrating these two problems. Moreover, we show that our methodology provides better results than the deterministic formulation, and consider an effective matheuristic, based on the solution of the deterministic problem, to solve the stochastic program. Finally, we compare the solutions obtained by our approach with the actual allocation of bikes in the real bike-sharing system of the city of San Francisco. The results show the effectiveness of our approach also in a realistic setting.</p></div>","PeriodicalId":45871,"journal":{"name":"EURO Journal on Transportation and Logistics","volume":"13 ","pages":"Article 100140"},"PeriodicalIF":2.1000,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2192437624000153/pdfft?md5=2d853fa47dc629567d272625e907f0ca&pid=1-s2.0-S2192437624000153-main.pdf","citationCount":"0","resultStr":"{\"title\":\"A two-stage stochastic programming model for bike-sharing systems with rebalancing\",\"authors\":\"Rossana Cavagnini ,&nbsp;Francesca Maggioni ,&nbsp;Luca Bertazzi ,&nbsp;Mike Hewitt\",\"doi\":\"10.1016/j.ejtl.2024.100140\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>We study the problem of determining the target inventory level of stations in a bike-sharing system, when bikes can be rebalanced later during the day. We propose a two-stage stochastic programming formulation, where the target inventory decisions are made at the first stage, while the recourse decisions, related to rebalancing, are made at the second stage. In the literature, the problem of determining the target inventory levels is solved without taking into account the rebalancing problem, or these two problems are solved sequentially. We prove that more efficient bike-sharing systems can be obtained by integrating these two problems. Moreover, we show that our methodology provides better results than the deterministic formulation, and consider an effective matheuristic, based on the solution of the deterministic problem, to solve the stochastic program. Finally, we compare the solutions obtained by our approach with the actual allocation of bikes in the real bike-sharing system of the city of San Francisco. The results show the effectiveness of our approach also in a realistic setting.</p></div>\",\"PeriodicalId\":45871,\"journal\":{\"name\":\"EURO Journal on Transportation and Logistics\",\"volume\":\"13 \",\"pages\":\"Article 100140\"},\"PeriodicalIF\":2.1000,\"publicationDate\":\"2024-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S2192437624000153/pdfft?md5=2d853fa47dc629567d272625e907f0ca&pid=1-s2.0-S2192437624000153-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"EURO Journal on Transportation and Logistics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2192437624000153\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"OPERATIONS RESEARCH & MANAGEMENT SCIENCE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"EURO Journal on Transportation and Logistics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2192437624000153","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"OPERATIONS RESEARCH & MANAGEMENT SCIENCE","Score":null,"Total":0}
引用次数: 0

摘要

我们研究的问题是,在共享单车系统中,当单车可以在一天中的晚些时候重新平衡时,如何确定站点的目标库存水平。我们提出了一个两阶段随机编程公式,其中目标库存决策在第一阶段做出,而与重新平衡相关的求助决策则在第二阶段做出。在文献中,确定目标库存水平的问题是在不考虑再平衡问题的情况下解决的,或者这两个问题是顺序解决的。我们证明,通过整合这两个问题,可以获得更高效的共享单车系统。此外,我们还证明了我们的方法比确定性方法能提供更好的结果,并在确定性问题求解的基础上,考虑了一种有效的数学启发式来求解随机程序。最后,我们将我们的方法获得的解决方案与旧金山市实际共享单车系统中的实际单车分配情况进行了比较。结果表明,我们的方法在现实环境中也很有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A two-stage stochastic programming model for bike-sharing systems with rebalancing

We study the problem of determining the target inventory level of stations in a bike-sharing system, when bikes can be rebalanced later during the day. We propose a two-stage stochastic programming formulation, where the target inventory decisions are made at the first stage, while the recourse decisions, related to rebalancing, are made at the second stage. In the literature, the problem of determining the target inventory levels is solved without taking into account the rebalancing problem, or these two problems are solved sequentially. We prove that more efficient bike-sharing systems can be obtained by integrating these two problems. Moreover, we show that our methodology provides better results than the deterministic formulation, and consider an effective matheuristic, based on the solution of the deterministic problem, to solve the stochastic program. Finally, we compare the solutions obtained by our approach with the actual allocation of bikes in the real bike-sharing system of the city of San Francisco. The results show the effectiveness of our approach also in a realistic setting.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
4.60
自引率
0.00%
发文量
24
审稿时长
129 days
期刊介绍: The EURO Journal on Transportation and Logistics promotes the use of mathematics in general, and operations research in particular, in the context of transportation and logistics. It is a forum for the presentation of original mathematical models, methodologies and computational results, focussing on advanced applications in transportation and logistics. The journal publishes two types of document: (i) research articles and (ii) tutorials. A research article presents original methodological contributions to the field (e.g. new mathematical models, new algorithms, new simulation techniques). A tutorial provides an introduction to an advanced topic, designed to ease the use of the relevant methodology by researchers and practitioners.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信