The objective of vehicle routing problem (VRP) is to deliver a set of customers with known demands on minimum-cost routes originating and terminating at the same depot. A vehicle routing problem with time windows (VRPTW) requires the delivery made in a specific time window given by the customers. Prins (2004) proposed a simple and effective genetic algorithm
(GA) for VRP. In terms of average solution, it outperforms most published tabu search results. We implement this hybrid GA to handle VRPTW. Both the implementation and computation results will be discussed.