A Feasible Solution for Rebalancing Large-Scale Bike Sharing Systems
| dc.contributor.author | Elhenawy, Mohammed | en |
| dc.contributor.author | Rakha, Hesham A. | en |
| dc.contributor.author | Bichiou, Youssef | en |
| dc.contributor.author | Masoud, Mahmoud | en |
| dc.contributor.author | Glaser, Sebastien | en |
| dc.contributor.author | Pinnow, Jack | en |
| dc.contributor.author | Stohy, Ahmed | en |
| dc.date.accessioned | 2021-12-09T20:00:00Z | en |
| dc.date.available | 2021-12-09T20:00:00Z | en |
| dc.date.issued | 2021-12-04 | en |
| dc.date.updated | 2021-12-09T14:32:38Z | en |
| dc.description.abstract | City bikes and bike-sharing systems (BSSs) are one solution to the last mile problem. BSSs guarantee equity by presenting affordable alternative transportation means for low-income households. These systems feature a multitude of bike stations scattered around a city. Numerous stations mean users can borrow a bike from one location and return it there or to a different location. However, this may create an unbalanced system, where some stations have excess bikes and others have limited bikes. In this paper, we propose a solution to balance BSS stations to satisfy the expected demand. Moreover, this paper represents a direct extension of the deferred acceptance algorithm-based heuristic previously proposed by the authors. We develop an algorithm that provides a delivery truck with a near-optimal route (i.e., finding the shortest Hamiltonian cycle) as an NP-hard problem. Results provide good solution quality and computational time performance, making the algorithm a viable candidate for real-time use by BSS operators. Our suggested approach is best suited for low-Q problems. Moreover, the mean running times for the largest instance are 143.6, 130.32, and 51.85 s for <i>Q</i> = 30, 20, and 10, respectively, which makes the proposed algorithm a real-time rebalancing algorithm. | en |
| dc.description.version | Published version | en |
| dc.format.mimetype | application/pdf | en |
| dc.identifier.citation | Elhenawy, M.; Rakha, H.A.; Bichiou, Y.; Masoud, M.; Glaser, S.; Pinnow, J.; Stohy, A. A Feasible Solution for Rebalancing Large-Scale Bike Sharing Systems. Sustainability 2021, 13, 13433. | en |
| dc.identifier.doi | https://doi.org/10.3390/su132313433 | en |
| dc.identifier.uri | http://hdl.handle.net/10919/106909 | en |
| dc.language.iso | en | en |
| dc.publisher | MDPI | en |
| dc.rights | Creative Commons Attribution 4.0 International | en |
| dc.rights.uri | http://creativecommons.org/licenses/by/4.0/ | en |
| dc.subject | bike-sharing system | en |
| dc.subject | black hole algorithm | en |
| dc.subject | game theory | en |
| dc.subject | heuristic algorithm | en |
| dc.subject | multiple trucks | en |
| dc.subject | static rebalancing | en |
| dc.title | A Feasible Solution for Rebalancing Large-Scale Bike Sharing Systems | en |
| dc.title.serial | Sustainability | en |
| dc.type | Article - Refereed | en |
| dc.type.dcmitype | Text | en |