1. Route Graph Optimization
RW Taggart - K Geevarghese - L Tao
M.S. Computer Science
Pace University

2. Goal: Improve public transportation and accessibility in rural areas.

3. The problem
Static bus scheduling is easy(er) than dynamic scheduling, but not efficient.
Bus routes are run on a static schedule, causing waste in resources.
$10M
source: Telegraph -

4. Given specific constraints such as: response, wait, travel time, number of busses, and total distance covered, we can schedule busses efficiently enough to justify switching to dynamic scheduling.
The solution
Use dynamic bus scheduling with multiple depots - Mr. Geevarghese research

5. Stakeholder Interaction
Specification
Phase I
Phase II
Introduce Problem Space
First meet was to understand the problem that K. Geevarghese was facing. Present initial design and sample prototype. August 2015
Route Visualization
Gave user access to first iteration tool based on specified requirements. Received user feedback, and redesigned UI based on updated input. October 2015
Multi-Partition Scheduling Algorithm
Generated random test data to run through refactored partitioning and scheduling algorithms.
December 2015

6. Bus Graph Visualization
The Technology
Bus Graph Visualization

7. Graph Representation
Road system can be represented as a graph, which can be abstracted, traversed, and analyzed.

8. Milestones November & December 2015 August 2015
Refactor current implementation of partitioning and scheduling algorithms based on new test input data.
August 2015
Understand problem and deliver initial PoC.
September & October 2015
Iterate on UI design with user to meet his needs.
Finalize visualization tool, and discuss next steps with future work.
4Q2015-1Q2015
Investigate future work and algorithm integration activities

9. Multiple Partitions
Service area may be divided into multiple partitions.
Each partition is serviced by a single bus depot.

10. Questions?

11. Other Applications
Represent computer network or RC Network as a graph.
source: