Skip to content

About

Constrained multimodal routing: MILP-based cost-time optimal paths across bus, train & flight networks. Tested on 2,040 routes from a central U.S. hub.

Topics

Resources

Stars

0 stars

Watchers

0 watching

Forks

Latest commit

 

History

6 Commits

Folders and files

Repository files navigation

Multimodal Optimization Framework (OptiRoute)

CI Python MILP License

Constrained multimodal routing — exact MILP for cost–time optimal travel across bus, train, and flight networks. Flow conservation · Stopover limits · Mode feasibility · Tested on 2,040 routes from a central U.S. hub


OptiRoute is a constrained multimodal routing framework that computes cost–time optimal travel paths across bus, train, and flight networks.

Routes are generated by solving an exact Mixed-Integer Linear Program (MILP) with flow conservation, stopover limits, and mode feasibility for geographically isolated destinations.


Highlights

  • Unified network — Bus, train, and flight in a single graph
  • Exact optimization — No heuristics; constraint-compliant itineraries
  • Cost–time trade-off — Tunable composite objective
  • Scalable — Per-destination formulation; tested on 2,040 routes from a central U.S. hub

Results

Optimized 2,040 routes from a central hub across the U.S., with negligible transportation cost relative to revenue and full operational feasibility.


Repo structure

  • Code/ — MILP model and solution pipeline
  • Result/ — Output routes and summaries
  • Saleman.pdf — Project report and methodology

Keywords

Optimization · Logistics · MILP · Multimodal routing · Operations research

About

Constrained multimodal routing: MILP-based cost-time optimal paths across bus, train & flight networks. Tested on 2,040 routes from a central U.S. hub.

Topics

Resources

Stars

0 stars

Watchers

0 watching

Forks

Releases

Contributors

Languages