TimefoldAI / TimefoldAI/timefold-solver
Dynamic nearby
Nobody has claimed this yet.
- Dominant language
- Java
- Stars
- 1.8k
- Forks
- 228
- Avg merge
- 1d 13h
- Merged PRs (30d)
- 46
Description
(epic)
Nearby selection swaps with A with the 40 nearest locations from A, favoring the nearest most (parabolic distribution).
Dynamic nearby selection swaps A with any location that is at most 60 minutes far (1), favoring the nearest most (parabolic distribution).
(1) If less than 10 within 60 minutes, take the 10 nearest. If more than 1000 withing 60 minutes, take the 1000 nearest.
Additionally, dynamic nearby selection shouldn't do the sorting. That should be done in advance, so the travel time matrix can be filtered on the at most 60 minutes too, to reduce bandwidth consumption. This brings true scalability in sight (100k+ locations etc).
Contributor guide
First steps
- Read the whole issue, then the project's contributing guide.
- Comment on the issue to say you are picking it up — it saves two people doing the same work.
- Fork the repository and make your change on a branch.
- Open a pull request that references the issue number.
Research direction
The issue names no files, tests, or entry points and describes an algorithmic epic. Start by locating the nearby-selection and travel-time-matrix components, then determine how the distance limits, fallback counts, weighting, and pre-sorting should integrate; done means dynamic selection avoids sorting and filters candidates and matrix data as specified.
Written by the indexing model from the issue text.
Assessment
- Tech stack
- java
- Domain
- ai
- Issue type
- Feature
- Difficulty
- 5/5
- Estimated time
- Over a week
- Activity status
- Stale
- Clarity
- Needs clarification
- Newbie friendliness
- 20/100