Algorithm Challenge #15
Merged
Conversation
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
TODO add capacities (of vehicle and events).
iglesias
commented
Feb 20, 2024
custom/tkp/solver.h
Outdated
| int capacity; | ||
| }; | ||
|
|
||
| // Forward declaration. |
There was a problem hiding this comment.
- remove comment, outdated after separating initial main into main and solver.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Tool to compute a (non-optimal) touring route.
Two-stage approach solving deliveries based on capacity first and then incorporating optimization over pickups.
It is expected that the second part will not scale well as the number of picked deliveries gets larger (a more efficient greedy algorithm or dynamic programming method based on minimum spanning tree would be used instead if this is an issue).
For the second stage, the distances are computed following the Manhatta or taxicab geometry.