user_friendly
Solve the user-friendly V2G problem
Description
user_friendly solves the user-friendly optimization problem under a given scenario using either a centralized or distributed algorithm.
Syntax
[cost,u,result_option] = user_friendly(scenario,algorithm_type)
[cost,u,result_option] = user_friendly(scenario,algorithm_type,Name=Value)
Input Arguments
Name |
Type |
Description |
|---|---|---|
|
Scenario object |
Scenario object that specifies the optimization problem |
|
“cent” | “dist” |
Type of algorithm, either “cent” for centralized or “dist” for distributed algorithm |
Name-Value Arguments
Name |
Type |
Description |
|---|---|---|
|
5000 (default) | nonnegative scalar |
Penalty parameter |
|
40 (default) | positive integer |
Number of iterations for the distributed algorithm (Only for “dist”) |
|
30 (default) | positive integer |
Number of fractional iterations for the distributed algorithm (Only for “dist”) |
|
0.1 (default) | positive scalar |
Parameter for the distributed algorithm (Only for “dist”) |
|
0 (default) | scalar |
Parameter for the distributed algorithm (Only for “dist”) |
|
false (default) | logical |
On/off solver messages |
Output Arguments
Name |
Type |
Description |
|---|---|---|
|
scalar |
Optimal cost of the solution |
|
T×N_c matrix |
Optimal charging/discharging schedule |
|
struct |
Specification of the options used for solver |