File Download
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/j.tre.2025.104155
- Scopus: eid_2-s2.0-105007475427
- Find via

Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Article: Repositioning in bike sharing systems with broken bikes considering on-site repairs
| Title | Repositioning in bike sharing systems with broken bikes considering on-site repairs |
|---|---|
| Authors | |
| Keywords | Bike repositioning problem Broken bike repositioning On-site repair routing Station budget constrained heuristic Time-indexed formulation |
| Issue Date | 1-Sep-2025 |
| Publisher | Elsevier |
| Citation | Transportation Research Part E: Logistics and Transportation Review, 2025, v. 201 How to Cite? |
| Abstract | On-site repairs by repairers can handle broken bikes in a bike-sharing system and simultaneously satisfy usable bike demand without requiring vehicle repositioning for off-site repairs. However, this option has not been jointly considered with vehicle-based repositioning for both usable and broken bikes in the literature to improve repositioning performance. This paper presents a mixed-integer linear programming model for a static bike repositioning problem that combines vehicle-based bike delivery/collection with labor-based on-site repairs, aiming to minimize the total cost of user dissatisfaction and carbon emissions within a time budget. A hybrid algorithm, consisting of hybrid genetic search with adaptive diversity control and a station budget constrained heuristic, is proposed to solve the problem. This method introduces a station budget concept to limit the time spent at each station by considering the benefit-cost ratio function of each station along the route. The proposed algorithm is evaluated on networks of various sizes and configurations of the number of trucks and repairers. The results demonstrate that the algorithm can obtain optimal solutions on small instances and can outperform a commercial solver on larger networks in achieving superior solutions within a fraction of the computational time. Moreover, we investigated the cost-effectiveness of introducing repairers, revealing that long repair times and a low percentage of broken bikes diminish the effectiveness of introducing them. |
| Persistent Identifier | http://hdl.handle.net/10722/362052 |
| ISSN | 2023 Impact Factor: 8.3 2023 SCImago Journal Rankings: 2.884 |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Hu, Runqiu | - |
| dc.contributor.author | Szeto, W. Y. | - |
| dc.contributor.author | Ho, Sin C. | - |
| dc.date.accessioned | 2025-09-19T00:31:19Z | - |
| dc.date.available | 2025-09-19T00:31:19Z | - |
| dc.date.issued | 2025-09-01 | - |
| dc.identifier.citation | Transportation Research Part E: Logistics and Transportation Review, 2025, v. 201 | - |
| dc.identifier.issn | 1366-5545 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/362052 | - |
| dc.description.abstract | <p>On-site repairs by repairers can handle broken bikes in a bike-sharing system and simultaneously satisfy usable bike demand without requiring vehicle repositioning for off-site repairs. However, this option has not been jointly considered with vehicle-based repositioning for both usable and broken bikes in the literature to improve repositioning performance. This paper presents a mixed-integer linear programming model for a static bike repositioning problem that combines vehicle-based bike delivery/collection with labor-based on-site repairs, aiming to minimize the total cost of user dissatisfaction and carbon emissions within a time budget. A hybrid algorithm, consisting of hybrid genetic search with adaptive diversity control and a station budget constrained heuristic, is proposed to solve the problem. This method introduces a station budget concept to limit the time spent at each station by considering the benefit-cost ratio function of each station along the route. The proposed algorithm is evaluated on networks of various sizes and configurations of the number of trucks and repairers. The results demonstrate that the algorithm can obtain optimal solutions on small instances and can outperform a commercial solver on larger networks in achieving superior solutions within a fraction of the computational time. Moreover, we investigated the cost-effectiveness of introducing repairers, revealing that long repair times and a low percentage of broken bikes diminish the effectiveness of introducing them.</p> | - |
| dc.language | eng | - |
| dc.publisher | Elsevier | - |
| dc.relation.ispartof | Transportation Research Part E: Logistics and Transportation Review | - |
| dc.rights | This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License. | - |
| dc.subject | Bike repositioning problem | - |
| dc.subject | Broken bike repositioning | - |
| dc.subject | On-site repair routing | - |
| dc.subject | Station budget constrained heuristic | - |
| dc.subject | Time-indexed formulation | - |
| dc.title | Repositioning in bike sharing systems with broken bikes considering on-site repairs | - |
| dc.type | Article | - |
| dc.description.nature | published_or_final_version | - |
| dc.identifier.doi | 10.1016/j.tre.2025.104155 | - |
| dc.identifier.scopus | eid_2-s2.0-105007475427 | - |
| dc.identifier.volume | 201 | - |
| dc.identifier.eissn | 1878-5794 | - |
| dc.identifier.issnl | 1366-5545 | - |
