Lower and upper bounds for scheduling multiple balancing vehicles in bicycle-sharing systems - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Soft Computing Année : 2019

Lower and upper bounds for scheduling multiple balancing vehicles in bicycle-sharing systems

Résumé

Public bicycle-sharing systems have been implemented in many big cities around the world to face many public transport problems. The exploitation and the management of such transportation systems imply crucial operational challenges. The balancing of stations is the most crucial question for their operational efficiency and economic viability. In this paper, we study the balancing problem of stations with multiple vehicles by considering the static case. A mathematical formulation of the problem is proposed, and two lower bounds based on Eastman’s bound and SPT rule are developed. Moreover, we proposed four upper bounds based on a genetic algorithm, a greedy search algorithm and two hybrid methods that integrate a genetic algorithm, a local search method and a branch-and-bound algorithm. The developed lower and upper bounds are tested and compared on a large set of instances.
Fichier non déposé

Dates et versions

hal-03938889 , version 1 (14-01-2023)

Identifiants

Citer

Ahmed Kadri, Imed Kacem, Karim Labadi. Lower and upper bounds for scheduling multiple balancing vehicles in bicycle-sharing systems. Soft Computing, 2019, 23 (14), pp.5945-5966. ⟨10.1007/s00500-018-3258-y⟩. ⟨hal-03938889⟩
14 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More