Journal
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Volume 245, Issue 3, Pages 667-679Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/j.ejor.2015.03.043
Keywords
Bicycle sharing systems; Pickup and delivery; Multiple visits; Branch-and-cut
Funding
- Centre for Operational Research, Management Science and Information Systems (CORMSIS) based within the University of Southampton
Ask authors/readers for more resources
Bicycle sharing systems can significantly reduce traffic, pollution, and the need for parking spaces in city centers. One of the keys to success for a bicycle sharing system is the efficiency of rebalancing operations, where the number of bicycles in each station has to be restored to its target value by a truck through pickup and delivery operations. The Static Bicycle Rebalancing Problem aims to determine a minimum cost sequence of stations to be visited by a single vehicle as well as the amount of bicycles to be collected or delivered at each station. Multiple visits to a station are allowed, as well as using stations as temporary storage. This paper presents an exact algorithm for the problem and results of computational tests on benchmark instances from the literature. The computational experiments show that instances with up to 60 stations can be solved to optimality within 2 hours of computing time. (C) 2015 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available