Table of Content

Open AccessOpen Access


A Clustering-based Approach for Balancing and Scheduling Bicycle-sharing Systems

Imed Kacem, Ahmed Kadri, Pierre Laroche

LCOMS EA 7306, Université de Lorraine, Metz, FRANCE
Email: {imed.kacem; ahmed-abdelmoumene.kadri; pierre.laroche}

* Corresponding Author: Imed KACEM,

Intelligent Automation & Soft Computing 2018, 24(2), 421-430.


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.


Cite This Article

I. Kacem, . A. Kadri and . P. Laroche, "A clustering-based approach for balancing and scheduling bicycle-sharing systems," Intelligent Automation & Soft Computing, vol. 24, no.2, pp. 421–430, 2018.

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.
  • 782


  • 661


  • 0


Share Link

WeChat scan