PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems

Rainer-Harbach, Marian; Papazek, Petrina; Raidl, Günther R.; Hu, Bin; Kloimüllner, Christian

doi:10.1007/s10898-014-0147-5

Cited by 81 publications

(46 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Given the high degree of complexity, metaheuristics have been proposed to tackle larger instances and problems with multiple vehicles. We refer the interested reader to the heuristic papers by Rainer-Harbach, Papazek, Raidl, Hu, and Kloimüllner (2014), Papazek, Raidl, Rainer-Harbach, and Hu (2013), Gaspero, Rendl, and Urli (2013), and Schuijbroek, Hampshire, and van Hoeve (2013). In what follows, we will focus on the studies about exact methods for bicycle rebalancing problems.…”

Section: Literature Surveymentioning

confidence: 99%

An exact algorithm for the static rebalancing problem arising in bicycle sharing systems

Erdoğan

Battarra

Calvo

2015

European Journal of Operational Research

176

View full text Add to dashboard Cite

a b s t r a c tBicycle 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.

show abstract

Section: Literature Surveymentioning

confidence: 99%

An exact algorithm for the static rebalancing problem arising in bicycle sharing systems

Erdoğan

Battarra

Calvo

2015

European Journal of Operational Research

176

View full text Add to dashboard Cite

show abstract

“…These methods were initially proposed in the context of the Steiner tree problem in [12], [13]. However, in the meanwhile, applications to other problems-such as the optimization of bycicle sharing systems [14]-exist.…”

Section: B Greedy-based Pilot Methodsmentioning

confidence: 99%

On solving the most strings with few bad columns problem: An ILP model and heuristics

Lizárraga

Blesa

Blum

et al. 2015

2015 International Symposium on Innovations in Intelligent SysTems and Applications (INISTA)

View full text Add to dashboard Cite

Abstract-The most strings with few bad columns problem is an NP-hard combinatorial optimization problem from the bioinformatics field. This paper presents the first integer linear programming model for this problem. Moreover, a simple greedy heuristic and a more sophisticated extension, namely a greedybased pilot method, are proposed. Experiments show that, as expected, the greedy-based pilot method improves over the greedy strategy. For problem instances of small and medium size the best results were obtained by solving the integer linear programming model by CPLEX, while the greedy-based pilot methods scales much better to large problem instances.

show abstract

“…Di Gaspero et al [13] tackled the BRP by means of Constraint Programming (CP). Rainer-Harbach et al [14] investigated different metaheuristic approaches for solving the BRP. Szeto et al [15] proposed chemical reaction optimization (CRO) to solve the single-vehicle static BRP with the objective of minimizing the operational time on the vehicle route and the weighted sum of unmet customer demand.…”

Section: Literature Reviewmentioning

confidence: 99%

A Dynamic Programming Model for Operation Decision-Making in Bicycle Sharing Systems under a Sustainable Development Perspective

Shan

Liu

et al. 2017

Sustainability

View full text Add to dashboard Cite

Abstract:Maintaining a balance between revenue and expenditure is the key to the sustainable development of a bicycle sharing system (BSS), and is a challenge for almost all systems worldwide. This article proposes a dynamic programming approach to obtain the optimal strategy to maximize the revenue of overall BSS. The Variable Granularity-Depth First Search (VG-DFS) algorithm is designed to speed up the solution. A numerical experiment is presented to verify the applicability of the model through a comparison with real data from the BSS in Hangzhou. Results indicated that the BSS could achieve break-even, or even obtain a substantial income by utilizing our model to make operational decisions, especially when the region it is located in has a relatively high GDP. Moreover, the best investment strategy proved is to involve stations in the initial construction period of the BSS as much as possible.

show abstract

PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems

Cited by 81 publications

References 24 publications

An exact algorithm for the static rebalancing problem arising in bicycle sharing systems

An exact algorithm for the static rebalancing problem arising in bicycle sharing systems

On solving the most strings with few bad columns problem: An ILP model and heuristics

A Dynamic Programming Model for Operation Decision-Making in Bicycle Sharing Systems under a Sustainable Development Perspective

Contact Info

Product

Resources

About