The Vehicle Routing Problem extends TSP to multiple vehicles serving customers from a depot. Basic VRP: minimize total distance for m vehicles with capacity Q serving n customers with demands dᵢ. Each customer visited exactly once, vehicle capacities respected, all routes start/end at depot. VRP is NP-hard with numerous variants: CVRP (capacitated), VRPTW (time windows), MDVRP (multiple depots), SDVRP (split deliveries), PVRP (periodic), DVRP (dynamic). Solution approaches: exact methods (branch-and-cut, column generation), classical heuristics (Clarke-Wright savings, sweep algorithm), and metaheuristics (genetic algorithms, tabu search, ant colony optimization). Critical for logistics, delivery services, and supply chain optimization.