期刊名称：International Journal of Computer Science and Information Technologies
电子版ISSN：0975-9646
出版年度：2011
卷号：2
期号：6
页码：2671-2676
出版社：TechScience Publications
摘要：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 an algorithm which incorporates a new local search technique with genetic algorithm approach to solve time constrained vehicle routing and scheduling problems in various scenarios.
关键词：Vehicle routing problem; genetic algorithm;heuristics based search techniquess
