Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

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

Lower and upper bounds for scheduling multiple balancing vehicles in bicycle-sharing systems 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Soft Computing Springer Journals

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

Soft Computing , Volume 23 (14) – May 31, 2018

Loading next page...
1
 
/lp/springer_journal/lower-and-upper-bounds-for-scheduling-multiple-balancing-vehicles-in-2GycshpC0T

References (45)

Publisher
Springer Journals
Copyright
Copyright © 2018 by Springer-Verlag GmbH Germany, part of Springer Nature
Subject
Engineering; Computational Intelligence; Artificial Intelligence; Mathematical Logic and Foundations; Control, Robotics, Mechatronics
ISSN
1432-7643
eISSN
1433-7479
DOI
10.1007/s00500-018-3258-y
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Soft ComputingSpringer Journals

Published: May 31, 2018

There are no references for this article.