Vehicle Routing Problem

Vehicle routing problem (VRP) variants: TSP, + (B, TW, M, C, D) etc.

Exact solution algorithms: Branch-and-Cut, Branch-Cut-and-Price.

Heuristic algorithms: Clarke-Wright; meta-heuristics (simulated annealing, genetic algorithm, ant colony optimization, tabu search, changing neighborhood search, adaptive large neighborhood search)