Open Access
ARTICLE
A Clustering-based Approach for Balancing and Scheduling Bicycle-sharing Systems
LCOMS EA 7306, Université de Lorraine, Metz, FRANCE
Email: {imed.kacem; ahmed-abdelmoumene.kadri; pierre.laroche}@univ-lorraine.fr
* Corresponding Author: Imed KACEM,
Intelligent Automation & Soft Computing 2018, 24(2), 421-430. https://doi.org/10.31209/2018.100000016
Abstract
This paper addresses an inventory regulation problem in bicycle sharingsystems. The problem is to balance a network consisting of a set of stations by using a single vehicle, with the aim of minimizing the weighted sum of the waiting times during which some stations remain imbalanced. Motivated by the complexity of this problem, we propose a two-stage procedure based on decomposition. First, the network is divided into multiple zones by using two different clustering strategies. Then, the balancing problem is solved in each zone. Finally, the order in which the zones must be visited is defined. To solve these problems, different algorithms based on approximate, greedy and exact methods are developed. The numerical results show the effectiveness of the proposed regulation methodology.Keywords
Cite This Article
This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.