Skip to content

Commit

Permalink
added c1 data and configs
Browse files Browse the repository at this point in the history
  • Loading branch information
Philipp Brendel committed Mar 29, 2022
1 parent 651bde9 commit 9781936
Show file tree
Hide file tree
Showing 26 changed files with 2,204 additions and 4 deletions.
8 changes: 4 additions & 4 deletions configs/c101.yaml → configs/solomon/c1/c101.yaml
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@
# initial settings #
####################
t_0: '10:30' # initial clock time
T: 4 # [h]
T: 21 # [h]
delta_t: 0.25 # [h]
c_init: 1.0 # initial soc of nodes
p_init: 1.0 # initial soc of producers
Expand All @@ -13,7 +13,7 @@ vehicle_init: 0.1 # initial soc of vehicles
# Data locations #
##################
vehicle_dir: 'data/paper/solomon/v1_uniform.csv'
depot_dir: 'data/paper/solomon/c1/d_c101.csv'
depot_dir: 'data/paper/solomon/c1/d_c1.csv'
consumer_dir: 'data/paper/solomon/c1/c_c101.csv'
producer_dir: 'data/paper/solomon/p_all.csv'
other_dir: 'data/others'
Expand All @@ -22,7 +22,7 @@ other_dir: 'data/others'
#####################
# Data restrictions #
#####################
v_max: 20
v_max: 10
c_max: 10
p_max: 4
o_max: 0
Expand All @@ -38,7 +38,7 @@ objective: 0
constr_j: True # (1j) valid inequality
min_vehicles: True # toggle obj and constraints connected to z
limit_vehicles: False # (1l) limit charging vehicles at locations
visualize: True # visualize solution
visualize: False # visualize solution
constrain_vehicles: # only allow leq this many vehicles being used

######################
Expand Down
72 changes: 72 additions & 0 deletions configs/solomon/c1/c102.yaml
Original file line number Diff line number Diff line change
@@ -0,0 +1,72 @@
####################
# initial settings #
####################
t_0: '10:30' # initial clock time
T: 21 # [h]
delta_t: 0.25 # [h]
c_init: 1.0 # initial soc of nodes
p_init: 1.0 # initial soc of producers
vehicle_init: 0.1 # initial soc of vehicles


##################
# Data locations #
##################
vehicle_dir: 'data/paper/solomon/v1_uniform.csv'
depot_dir: 'data/paper/solomon/c1/d_c1.csv'
consumer_dir: 'data/paper/solomon/c1/c_c102.csv'
producer_dir: 'data/paper/solomon/p_all.csv'
other_dir: 'data/others'


#####################
# Data restrictions #
#####################
v_max: 10
c_max: 10
p_max: 4
o_max: 0
d_max: 1
lat: [49.00, 49.90] # min and max vals
lon: [7.50, 11.50]


##################
# Model settings #
##################
objective: 0
constr_j: True # (1j) valid inequality
min_vehicles: True # toggle obj and constraints connected to z
limit_vehicles: False # (1l) limit charging vehicles at locations
visualize: False # visualize solution
constrain_vehicles: # only allow leq this many vehicles being used

######################
# Heuristic settings #
######################
h_init_time_limit: 120
h_time_limit: 60
h_init: quick # [quick, greedy]


###################
# Gurobi settings #
###################
TimeLimit: 1800
threads: 1
# multiple threads for parallel work
# can be restricted in order to save RAM
method: -1
# method used to solve root relaxation (only root!)
# -1: default 1: dual-simplex 2: barrier
MIPFocus: 0
# 0: default, balance between both
# 1: focus on finding feasible solutions
# 2: more attention on proving optimality
# 3: if best bound is barely moving
MIPGap: 0.0001
# default: 0.0001
CutPasses: -1
# default: -1
write_lp: False
LogToConsole: True
72 changes: 72 additions & 0 deletions configs/solomon/c1/c103.yaml
Original file line number Diff line number Diff line change
@@ -0,0 +1,72 @@
####################
# initial settings #
####################
t_0: '10:30' # initial clock time
T: 21 # [h]
delta_t: 0.25 # [h]
c_init: 1.0 # initial soc of nodes
p_init: 1.0 # initial soc of producers
vehicle_init: 0.1 # initial soc of vehicles


##################
# Data locations #
##################
vehicle_dir: 'data/paper/solomon/v1_uniform.csv'
depot_dir: 'data/paper/solomon/c1/d_c1.csv'
consumer_dir: 'data/paper/solomon/c1/c_c103.csv'
producer_dir: 'data/paper/solomon/p_all.csv'
other_dir: 'data/others'


#####################
# Data restrictions #
#####################
v_max: 10
c_max: 10
p_max: 4
o_max: 0
d_max: 1
lat: [49.00, 49.90] # min and max vals
lon: [7.50, 11.50]


##################
# Model settings #
##################
objective: 0
constr_j: True # (1j) valid inequality
min_vehicles: True # toggle obj and constraints connected to z
limit_vehicles: False # (1l) limit charging vehicles at locations
visualize: False # visualize solution
constrain_vehicles: # only allow leq this many vehicles being used

######################
# Heuristic settings #
######################
h_init_time_limit: 120
h_time_limit: 60
h_init: quick # [quick, greedy]


###################
# Gurobi settings #
###################
TimeLimit: 1800
threads: 1
# multiple threads for parallel work
# can be restricted in order to save RAM
method: -1
# method used to solve root relaxation (only root!)
# -1: default 1: dual-simplex 2: barrier
MIPFocus: 0
# 0: default, balance between both
# 1: focus on finding feasible solutions
# 2: more attention on proving optimality
# 3: if best bound is barely moving
MIPGap: 0.0001
# default: 0.0001
CutPasses: -1
# default: -1
write_lp: False
LogToConsole: True
72 changes: 72 additions & 0 deletions configs/solomon/c1/c104.yaml
Original file line number Diff line number Diff line change
@@ -0,0 +1,72 @@
####################
# initial settings #
####################
t_0: '10:30' # initial clock time
T: 21 # [h]
delta_t: 0.25 # [h]
c_init: 1.0 # initial soc of nodes
p_init: 1.0 # initial soc of producers
vehicle_init: 0.1 # initial soc of vehicles


##################
# Data locations #
##################
vehicle_dir: 'data/paper/solomon/v1_uniform.csv'
depot_dir: 'data/paper/solomon/c1/d_c1.csv'
consumer_dir: 'data/paper/solomon/c1/c_c104.csv'
producer_dir: 'data/paper/solomon/p_all.csv'
other_dir: 'data/others'


#####################
# Data restrictions #
#####################
v_max: 10
c_max: 10
p_max: 4
o_max: 0
d_max: 1
lat: [49.00, 49.90] # min and max vals
lon: [7.50, 11.50]


##################
# Model settings #
##################
objective: 0
constr_j: True # (1j) valid inequality
min_vehicles: True # toggle obj and constraints connected to z
limit_vehicles: False # (1l) limit charging vehicles at locations
visualize: False # visualize solution
constrain_vehicles: # only allow leq this many vehicles being used

######################
# Heuristic settings #
######################
h_init_time_limit: 120
h_time_limit: 60
h_init: quick # [quick, greedy]


###################
# Gurobi settings #
###################
TimeLimit: 1800
threads: 1
# multiple threads for parallel work
# can be restricted in order to save RAM
method: -1
# method used to solve root relaxation (only root!)
# -1: default 1: dual-simplex 2: barrier
MIPFocus: 0
# 0: default, balance between both
# 1: focus on finding feasible solutions
# 2: more attention on proving optimality
# 3: if best bound is barely moving
MIPGap: 0.0001
# default: 0.0001
CutPasses: -1
# default: -1
write_lp: False
LogToConsole: True
72 changes: 72 additions & 0 deletions configs/solomon/c1/c105.yaml
Original file line number Diff line number Diff line change
@@ -0,0 +1,72 @@
####################
# initial settings #
####################
t_0: '10:30' # initial clock time
T: 21 # [h]
delta_t: 0.25 # [h]
c_init: 1.0 # initial soc of nodes
p_init: 1.0 # initial soc of producers
vehicle_init: 0.1 # initial soc of vehicles


##################
# Data locations #
##################
vehicle_dir: 'data/paper/solomon/v1_uniform.csv'
depot_dir: 'data/paper/solomon/c1/d_c1.csv'
consumer_dir: 'data/paper/solomon/c1/c_c105.csv'
producer_dir: 'data/paper/solomon/p_all.csv'
other_dir: 'data/others'


#####################
# Data restrictions #
#####################
v_max: 10
c_max: 10
p_max: 4
o_max: 0
d_max: 1
lat: [49.00, 49.90] # min and max vals
lon: [7.50, 11.50]


##################
# Model settings #
##################
objective: 0
constr_j: True # (1j) valid inequality
min_vehicles: True # toggle obj and constraints connected to z
limit_vehicles: False # (1l) limit charging vehicles at locations
visualize: False # visualize solution
constrain_vehicles: # only allow leq this many vehicles being used

######################
# Heuristic settings #
######################
h_init_time_limit: 120
h_time_limit: 60
h_init: quick # [quick, greedy]


###################
# Gurobi settings #
###################
TimeLimit: 1800
threads: 1
# multiple threads for parallel work
# can be restricted in order to save RAM
method: -1
# method used to solve root relaxation (only root!)
# -1: default 1: dual-simplex 2: barrier
MIPFocus: 0
# 0: default, balance between both
# 1: focus on finding feasible solutions
# 2: more attention on proving optimality
# 3: if best bound is barely moving
MIPGap: 0.0001
# default: 0.0001
CutPasses: -1
# default: -1
write_lp: False
LogToConsole: True
Loading

0 comments on commit 9781936

Please sign in to comment.