Relative Trip Scheduling #8
Draft
Conversation
This file contains hidden or 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
|
Current status: The relative trip scheduling algorithm represents a more efficient process for scheduling trips. This algorithm is used and tested in the SANDAG two-zone example model, so it's not critical that this is enabled here for testing purposes. The consortium may eventually make this change for the one zone system, but it will be easier to do so as part of a more comprehensive clean up for this example model, so this draft PR is being left as is (open, draft) for now. |
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.
This should solve the problem of the trip scheduling model iterating and costing us run time. The algorithm is also arguably just much better. (documentation: ActivitySim/activitysim#823)