Skip to content

Re-Structure of Trip Scheduling #593

@dhensle

Description

@dhensle

The current implementation of probabilistic trip scheduling results in about 25% of stops failing to produce valid schedules. Trips fail to schedule when a selection for an earlier trip in a half-tour makes scheduling of a subsequent trip impossible (or very low probability) based on the probability distribution.

The current trip scheduling probability distributions are segmented by purpose, half-tour direction, tour time period, and trip number. The selected probabilities are independent of what the previous trip departure time was and can lead to the failed trips. The current implementation is consistent with TM1's version of CT-RAMP.

Re-structuring the trip scheduling probabilities file to replace the tour time period segment with the previous trip's time period would ensure that a trip does not get scheduled before it's previous trip. This enhancement was made in the SANDAG version of CT-RAMP and an example probabilities table for that implementation can be seen here.

The advantages of this new approach would be less failed trip schedules. Trip scheduling currently iterates up to the maximum iterations to try to get a valid tour pattern, so less failed trips would also mean less iteration and therefore decreased run-times.

(A setting in the current implementation will deal with failed trips by either throwing them out or setting them to the previous trip departure time in the outbound direction or next trip departure time in the inbound direction.)

Metadata

Metadata

Assignees

No one assigned

    Labels

    FeatureNew feature or request

    Type

    No type

    Projects

    No projects

    Milestone

    No milestone

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions