Skip to content
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

update route and destination selection algorithms #109

Open
djgroen opened this issue Oct 16, 2024 · 0 comments
Open

update route and destination selection algorithms #109

djgroen opened this issue Oct 16, 2024 · 0 comments

Comments

@djgroen
Copy link
Owner

djgroen commented Oct 16, 2024

  • The current algorithm crawls all routes for all individuals. This is relatively costly.

Possible alternatives

Recommende route list

  • Generate, in advance, a list of recommended routes to all other locations for each location.
    • Needs to be done once per turn.
  • Choose from destinations, accounting for route overhead using the best route.

Pruned destinations

  • Prune destination list, removing non-interesting locations.
  • Then generate routes towards the top destinations using a crawl algorithm.
  • Awareness level should not be crawling-based, but e.g. based on distance or location type.

Destination only

  • Don't use crawler, but first choose possible destinations within awareness criteria.
  • Add a modifier indicating travel overhead.
  • Only generate a route once the destination has been chosen, using A*.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

1 participant