Multiple Vehicle Routing Problem

Concrete | 2018

The major objective of this project was to find a solution to the multiple vehicle routing problem (mVRP) which is a combinatorial optimization and integer programming problem which results in a ‘optimal set of routes for a fleet of vehicles to traverse in order to deliver to a given set of customers’. This can be extended to applications in

  • Urban Transportation Engineering
  • Logistics and Supply Chain
  • Optimal Delivery Systems
  • Search and Rescue Operation

Vehicle Routing