Table of Content

Open Access iconOpen Access

ARTICLE

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}@univ-lorraine.fr

* Corresponding Author: Imed KACEM, email

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

APA Style
Kacem, I., Kadri, A., Laroche, P. (2018). A clustering-based approach for balancing and scheduling bicycle-sharing systems. Intelligent Automation & Soft Computing, 24(2), 421-430. https://doi.org/10.31209/2018.100000016
Vancouver Style
Kacem I, Kadri A, Laroche P. A clustering-based approach for balancing and scheduling bicycle-sharing systems. Intell Automat Soft Comput . 2018;24(2):421-430 https://doi.org/10.31209/2018.100000016
IEEE Style
I. Kacem, A. Kadri, and P. Laroche, “A Clustering-based Approach for Balancing and Scheduling Bicycle-sharing Systems,” Intell. Automat. Soft Comput. , vol. 24, no. 2, pp. 421-430, 2018. https://doi.org/10.31209/2018.100000016



cc Copyright © 2018 The Author(s). Published by Tech Science Press.
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.
  • 1267

    View

  • 1053

    Download

  • 0

    Like

Share Link