Solution of VRPTW using controlled random search technique

VRPTW is Vehicle Routing Problem with Time windows is a NP hard combinatorial scheduling optimization problem in which minimum number of routes have to be determined so as to serve each of the listed customers within their specified time windows. Different analytic and heuristics approaches have been tried to solve such problems. In this paper an attempt has been made to solve VRPTW scheduling problems in different scenarios using controlled random search technique and obtained some good results with lesser number of vehicles with more distance to travel.