i have a project about solving Vehicle Routing Problem with with Augment-merge heuristic or Scanning-path heuristic to get a solution and after that i must generate an optimal solution with Simulated Annealing algorithm.My problem is that i got enough documentation about Simulated Annealing algorithm, but i didn't find any helpful documents or tutorials to understand those heuristics and a way to implement one of them .Can You help me please.
Heuristics for Vehicle Routing Problem
graph theory