Vehicle Routing Problem with Simultaneous Pickup and Delivery.

Team members

Ketan Ramesh
Shreyas Gopalakrishna

Presentation link - https://drive.google.com/open?id=1cuwH8pz-qi_U7fBUoLefFywwQKemDa2afLCOkCug9EM
GitHub link - https://github.com/shreyas-gopalakrishna/Vehicle-Routing/

The drive links are accessible using colorado.edu accounts

Project overview

To study, implement and analyze the Vehicle Routing Problem with Simultaneous Pickup and Delivery. The goal is to find the best routes for a fleet of vehicles visiting a set of locations which also involves collection and distribution of goods from these locations. The problem focuses on minimizing the cost of function for the vehicles (minimizing distance travelled).

Key elements in the Project:

Implemented and analyzed two formulations of Capacity Vehicle Routing problem.
Implemented Vehicle Routing Problem with Simultaneous Pickup and Delivery
Executable Code in PuLP and Gurobi which solves the Vehicle Routing Problem with Simultaneous Pickup and Delivery and Capacity Vehicle Routing problem.
Test results on various datasets. (Both Randomly generated and available datasets).
Comparative results using Google OR tools.
Visualization of solution.

Reference Papers and Datasets:

A generalized formulation for vehicle routing problems by Pedro Munari, Twan Dollevoet and Remy Spliet.
Integer linear programming formulation for a vehicle routing problem by N.R. Achuthan and L. Cacceta.
Vehicle Routing Problem with Deliveries and Pickups: Modelling Issues and Meta-heuristics Solution Approaches by Niaz A. Wassan and Gabor Nagy.
Christofides-Eilon VRP instances-Dataset.

Visualizations

Capacity Vehicle Routing Problem

P-n16-k8.vrp - Augerat et al. Set - P

P-n20-k2.vrp - Augerat et al. Set - P