Fleet Route Optimization Model Development

OVERVIEW Calculate minimum number of drivers to meet daily passenger point to point journeys, whilst considering operational constraints, including driver working hours and travel times. PROJECT DELIVERABLES Utilizing route optimization algorithms determine the lowest number of drivers that are required to complete all passenger journeys for a day. Provide vehicle routes for the day in a KML file format including time stamps. JOURNEY DATA Data set representing a day with up to 800 passenger journeys with the following fields: • Time passenger made booking made • Requested pick up time • Drop-off time • Travel time • Pick up location (address with GPS coordinates) • Drop off location (address with GPS coordinates) CONSTRAINTS • Maximum hour driver shifts. • Can’t be more than # mins late to a pick-up. • Driver start and end locations are not fixed. MODEL FUNCTIONAL REQUIREMENTS • Import of journey data. • Allow editing of constraints. • Runtime VRPTW solver optimizing for minimum vehicle count (subject to constraints). • Export KML vehicle routes for the day. • Run model for a number of daily data sets.

Project ID: 39718635