2015
DOI: 10.1016/j.trb.2014.10.003
|View full text |Cite
|
Sign up to set email alerts
|

A 3-step math heuristic for the static repositioning problem in bike-sharing systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

1
155
0
1

Year Published

2016
2016
2021
2021

Publication Types

Select...
7
3

Relationship

1
9

Authors

Journals

citations
Cited by 234 publications
(157 citation statements)
references
References 30 publications
1
155
0
1
Order By: Relevance
“…Benchimol et al [7] first provided the bicycle-repositioning problem (BRP) and presented a method to deal with the balancing of the stations when no bikes are moving. Forma et al [8] classified the BRP as a variation of the Pickup and Delivery Problem (PDP). Raviv et al [9] improved the research by constructing the objective function to minimize the measure of the expected user's dissatisfaction, and Ho and Szeto [10] used the concept of a penalty function [9] and presented an iterated tabu search heuristic to solve the static BRP.…”
Section: Literature Reviewmentioning
confidence: 99%
“…Benchimol et al [7] first provided the bicycle-repositioning problem (BRP) and presented a method to deal with the balancing of the stations when no bikes are moving. Forma et al [8] classified the BRP as a variation of the Pickup and Delivery Problem (PDP). Raviv et al [9] improved the research by constructing the objective function to minimize the measure of the expected user's dissatisfaction, and Ho and Szeto [10] used the concept of a penalty function [9] and presented an iterated tabu search heuristic to solve the static BRP.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In terms of scheduling, Nakamura and Abe [11] evaluated the operational effect of the public bicycle projects in different cities with various numbers of stop stations. Dell'Amico et al [12], Regue and Recker [13], Ho and Szeto [14], and Forma et al [15] discussed how to achieve balance and static positioning of the public bicycle system, and how to minimize total cost while maximizing convenience for the users. To achieve optimal scheduling of bicycles between different public bicycle stations, Liu et al [16] applied dynamic programming to calculate optimal scheduling paths for two stages: collection and rent out.…”
Section: Literature Reviewmentioning
confidence: 99%
“…The arc-indexed formulation from [31] is enhanced in [19] and [14], both proposing methods for solving larger instances. In [19], the formulation is simplied by allowing only one vehicle, stating that a station is either a pickup or delivery station and assuming that each station only can be visited once.…”
Section: Literature Surveymentioning
confidence: 99%