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

A Benders decomposition method for locating stations in a one-way electric car sharing system under demand uncertainty

Abstract: We focus on a problem of locating recharging stations in one-way station based electric car sharing systems which operate under demand uncertainty. We model this problem as a mixed integer stochastic program and develop a Benders decomposition algorithm based on this formulation. We integrate a stabilization procedure to our algorithm and conduct a large-scale experimental study on our methods. To conduct the computational experiments, we develop a demand forecasting method allowing to generate many demand sce… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
17
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
3

Relationship

1
8

Authors

Journals

citations
Cited by 54 publications
(19 citation statements)
references
References 37 publications
0
17
0
Order By: Relevance
“…Over the past decade, VReP has become the most commonly considered problem [11] - [18]. However, only a little literature has concentrated on strategic decisions involving location problems, as revealed by Çalık and Fortz [7].…”
Section: Literature Reviewmentioning
confidence: 99%
See 1 more Smart Citation
“…Over the past decade, VReP has become the most commonly considered problem [11] - [18]. However, only a little literature has concentrated on strategic decisions involving location problems, as revealed by Çalık and Fortz [7].…”
Section: Literature Reviewmentioning
confidence: 99%
“…In this study, we focus on the strategic design of one-way stationbased carsharing systems from the vantage point of the system operator. The most related research (e.g., [4], [6], [7]) copes with strategic problems based on the traditional riskneutral two-stage stochastic programming by considering the expectation value as the preference criterion. However, the resulting decisions may be poor under certain realizations of random data.…”
Section: Introductionmentioning
confidence: 99%
“…The total number of stations to be laid out in the solved layout plan should not exceed the total number of alternative stations. According to Equation (15), N is the total number of proposed network points.…”
Section: (6) Other Constraintsmentioning
confidence: 99%
“…In the study of this article, we set ε as 0.01, that is, stop iteration when the relative gap between the upper and lower bounds is less than 1%. The setting and value of ε is common in other precision algorithms, such as the Benders decomposition algorithm 29,30 and the classic branch and bound algorithm. 31,32…”
Section: Solution Algorithmmentioning
confidence: 99%