Algorithms

Ideas

The path taken shouldn't usually be the shortest should have a "fuzzy" sense of path, but precise sense of destination...

Perhaps some measure of number of passengers' destinations reachable?

• Should take into account number of (good?) paths available to a given passenger?
• Maybe, do a good job transporting most of the passengers, then route other passengers on already scheduled trains.

1. Annotate graph edges with a weighting of how many passengers want to go this way.
2. Route many trains just based on the weighting.
3. Try to get the passengers through this system.

• Train routes would be based on something like the minimum spanning tree - but like not actually a tree...
• Then maybe re-do the annotation based on that initial schedule - and repeat