A Heuristic for the Vehicle Routing Problem with Time Windows Constraints
Li Dawei Wang Li Wang Mengguang
Through analyzing the vehicle routing problem,we modify the nearest distance searching heuristic for the traveling salesman problem. A new evaluation function is constructed and a new heuristic for the vehicle routing problem with time windows constraints is proposed according to the new e-valuation function. The example we solved is shown that the heuristic can obtain the near optimal solution using less calculation and simple compari-tion.