Solving Time Constrained Vehicle Routing Problem Using Hybrid Genetic Algorithm


Bhawna Minocha - Amity School of Computer Sciences, Noida, India Saswati Tripathi - Indian Institute of Foreign Trade, Kolkata, India


Vehicle Routing Problem with Time windows (VRPTW) is an example of scheduling in constrained environment. It is a well known NP hard combinatorial scheduling optimization problem in which minimum number of routes have to be determined to serve all the customers within their specified time windows. So far different analytic and heuristic approaches have been tried to solve such problems. In this paper we proposed algorithms which incorporate new local search techniques with genetic algorithm approach to solve VRPTW scheduling problems in various scenarios.