Author
Listed:
- Chen, Qingxin
- Ma, Shoufeng
- Fu, Chenyi
- Zhu, Ning
- He, Qiao-Chu
Abstract
Diverse subscription policies have been employed to cater to the commuting needs of users in bike-sharing systems. Frequent riders choose to purchase subscriptions to reduce their commuting costs. Thus, operators should improve their service level to maintain the market share. In addition, a small proportion of non-subscribers (e.g, tourists) use the system occasionally but contribute to the operational profits. Thus, providers are willing to fulfill more non-subscriber demand to ensure high profitability. However, jointly optimizing these objectives for the heterogeneous users in bike-sharing systems is challenging, especially under demand uncertainty. To tackle these concerns, this study presents a robust satisficing framework focusing on both service level and profit under demand uncertainty, which frees the decision-makers from formulating the demand ambiguity. This study further defines a novel risk measure, which is formulated according to the ϕ-divergence probability distance. The proposed risk measure aims to minimize the violation risk of the service level and profit targets. To avoid overconservation of solutions, side information like weather and weekends is integrated into the model. A tailored local search algorithm is proposed to address large-scale problems, which is capable of integrating rebalancing routes and addressing decentralized demand dynamics. Extensive numerical experiments show that the proposed model achieves higher robustness, lower violation probability and degree, and higher average-case out-of-sample performance than other benchmarks. Managerial insights are also concluded for the operators.
Suggested Citation
Chen, Qingxin & Ma, Shoufeng & Fu, Chenyi & Zhu, Ning & He, Qiao-Chu, 2025.
"A robust satisficing multi-objective optimization approach for bike-sharing systems with heterogeneous user types,"
Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 202(C).
Handle:
RePEc:eee:transe:v:202:y:2025:i:c:s1366554525003060
DOI: 10.1016/j.tre.2025.104265
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:202:y:2025:i:c:s1366554525003060. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.