Home

VRP Solver

Interactive Vehicle Routing Problem solver with multiple algorithms. Add customer nodes by clicking on the canvas and watch different algorithms find optimal routes.

Network Visualization

Click to add customer nodes (random demand assigned)

Legend

Depot (Distribution Center)
Customer (demand shown on top)
Vehicle Route

About Vehicle Routing Problems

The Vehicle Routing Problem (VRP) is a classic optimization problem in operations research and computer science. It seeks to find optimal routes for a fleet of vehicles to deliver goods to a set of customers, minimizing total travel distance while respecting constraints such as vehicle capacity.

Algorithms Implemented:

  • Nearest Neighbor: A greedy heuristic that always visits the closest unvisited customer
  • Savings Algorithm: Uses savings calculations to merge routes efficiently
  • Sweep Algorithm: Sorts customers by polar angle and assigns them to routes sequentially

Applications:

  • Logistics and supply chain management
  • Waste collection optimization
  • Public transportation planning
  • Emergency service routing