Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
ba
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Requirements
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Locked files
Build
Pipelines
Jobs
Pipeline schedules
Test cases
Artifacts
Deploy
Releases
Package Registry
Container Registry
Model registry
Operate
Environments
Terraform modules
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Code review analytics
Issue analytics
Insights
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
markn92
ba
Commits
8af22a8f
Commit
8af22a8f
authored
4 years ago
by
markn92
Browse files
Options
Downloads
Patches
Plain Diff
test setup
parent
a7bf0e15
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
tests/osm/test_gasstation_osm.py
+18
-6
18 additions, 6 deletions
tests/osm/test_gasstation_osm.py
with
18 additions
and
6 deletions
tests/osm/test_gasstation_osm.py
+
18
−
6
View file @
8af22a8f
import
networkx
as
nx
from
evrouting
import
gasstation
from
evrouting.T
import
Result
from
evrouting.osm.profiles
import
car
from
evrouting.osm.routing
import
shortest_path
from
evrouting.graph_tools
import
charging_cofficient
def
test_charge_shortest_route_dimensions
(
map_graph
):
...
...
@@ -39,21 +42,30 @@ def test_charge_shortest_route_stop(map_graph):
_s
=
map_graph
.
find_nearest
(
s
)
_t
=
map_graph
.
find_nearest
(
t
)
consumption
=
0.5
# kWh/s
# Traveltime gonna be less than 10 min = 600 sek := 300 kWh.
# => initial soc of 300 000
consumption
=
0.5
*
1000
# Wh/s
# Traveltime to first charging station is < 5 min = 300 sek := 150 kWh
# => Initial soc of 150 000 is enough to charge but not to reach target.
initial_soc
=
150000
result
=
gasstation
.
shortest_path
(
G
=
map_graph
,
charging_stations
=
map_graph
.
charging_stations
,
s
=
_s
,
t
=
_t
,
initial_soc
=
150000
,
initial_soc
=
initial_soc
,
final_soc
=
0
,
capacity
=
300000
,
c
=
consumption
*
1000
,
c
=
consumption
,
extended_graph
=
None
,
contracted_graph
=
None
)
assert
type
(
result
)
is
Result
charge_nodes
=
[(
n
,
t
)
for
n
,
t
in
result
.
charge_path
if
t
>
0
]
assert
len
(
charge_nodes
)
==
1
charge_node
,
charge_time
=
charge_nodes
[
0
]
charging_station_c
=
charging_cofficient
(
map_graph
,
charge_node
)
# calc travel time to charge_node an
s_to_c
=
consumption
*
nx
.
shortest_path_length
(
map_graph
,
_s
,
charge_node
)
c_to_t
=
consumption
*
nx
.
shortest_path_length
(
map_graph
,
charge_node
,
_t
)
assert
initial_soc
+
charge_time
*
charging_station_c
==
s_to_c
+
c_to_t
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment