-
Notifications
You must be signed in to change notification settings - Fork 1.1k
Use time-independent heuristic search #4616
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
base: dev-2.x
Are you sure you want to change the base?
Conversation
| RaptorTripScheduleSearch<T> tripSearch(SearchDirection direction); | ||
|
|
||
| default T getHeuristicTrip() { | ||
| return getTripSchedule(0); |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
TOOD: This needs its own implementation which contains the minimum run and dwell times for the pattern.
| } | ||
|
|
||
| private void updateNewBestTimeCostAndRound(int stop, int time, int cost, boolean isTransit) { | ||
| if (heuristicRounds[stop] + roundProvider.round() > roundMaxLimit) { |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
this check could be potentially done before alighting/transfering to avoid computing time and cost
6f40fe7 to
c2601c0
Compare
c2601c0 to
f061554
Compare
f061554 to
1b8a737
Compare
1b8a737 to
bc5f2a0
Compare
Summary
Create a new heuristic search, which is independent of time, and only cares about minimum duration, rounds, and cost.
Issue
Part of #3748
Unit tests
TODO!