DOI: 10.18297/etd/1607
|View full text |Cite
|
Sign up to set email alerts
|

Optimal scheduling for charging electric vehicles with fixed setup costs.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 32 publications
0
2
0
Order By: Relevance
“…Coordinated Strategies (CSTs) are defined as the "charging" or "charging and discharging" modes of a single or a fleet of EVs which occur in a coordinated manner, with scheduling, with using optimization techniques, with or without coordination between different EVs on the same transformer, and with following the pricing mechanisms [46][47][48][49][50][51][52][53]. This group contains two major branches: "Continuous" and "Discrete" Charging Strategies as in Tables 2 and 3, respectively.…”
Section: Coordinated Strategiesmentioning
confidence: 99%
See 1 more Smart Citation
“…Coordinated Strategies (CSTs) are defined as the "charging" or "charging and discharging" modes of a single or a fleet of EVs which occur in a coordinated manner, with scheduling, with using optimization techniques, with or without coordination between different EVs on the same transformer, and with following the pricing mechanisms [46][47][48][49][50][51][52][53]. This group contains two major branches: "Continuous" and "Discrete" Charging Strategies as in Tables 2 and 3, respectively.…”
Section: Coordinated Strategiesmentioning
confidence: 99%
“…The conventional mathematical optimization includes (1) linear programming [23][24][25][51][52][53]102,103]; (2) quadratic programming [9,20,26,40,52,104]; (3) stochastic/deterministic dynamic programming [20,28,55,105] and relaxed dynamic programming [27,29]; (4) Lagrange relaxation [55]; (5) binary linear programming [53]; (6) mixed integer linear programming [38,52,55,57,89,106]; (7) mixed-integer nonlinear programming [107]; (8) stochastic programming [20,57]; (9) mixed-integer linear stochastic programming [57]; (10) maximum sensitivities selection optimization approach [39,44]; (11) game theory [35,108,109]; and (12) queuing theory [88,110].…”
Section: The Optimization Problemmentioning
confidence: 99%