Skip to content

Conversation

@hannesj
Copy link
Contributor

@hannesj hannesj commented Nov 18, 2022

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!

@hannesj hannesj added the !Optimization The feature is to improve performance. label Nov 18, 2022
@hannesj hannesj added this to the 2.3 milestone Nov 18, 2022
@hannesj hannesj requested a review from a team as a code owner November 18, 2022 15:22
RaptorTripScheduleSearch<T> tripSearch(SearchDirection direction);

default T getHeuristicTrip() {
return getTripSchedule(0);
Copy link
Contributor Author

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.

@hannesj hannesj marked this pull request as draft November 21, 2022 09:35
}

private void updateNewBestTimeCostAndRound(int stop, int time, int cost, boolean isTransit) {
if (heuristicRounds[stop] + roundProvider.round() > roundMaxLimit) {
Copy link
Member

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

@hannesj hannesj marked this pull request as ready for review December 23, 2022 15:39
@hannesj hannesj requested a review from t2gran December 23, 2022 15:39
@hannesj hannesj marked this pull request as draft January 10, 2023 08:45
@t2gran t2gran removed this from the 2.3 milestone Apr 24, 2023
@t2gran t2gran added this to the Parked milestone Sep 13, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

!Optimization The feature is to improve performance.

Projects

None yet

Development

Successfully merging this pull request may close these issues.

3 participants