期刊名称：International Journal of Artificial Intelligence and Expert Systems (IJAE)
电子版ISSN：2180-124X
出版年度：2013
卷号：4
期号：1
页码：1-16
出版社：Computer Science Journals
摘要：Vehicle Routing Problem with Time Windows (VRPTW) 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. Different analytic and heuristic approaches have been tried to solve such problems. In this paper we propose a two phase method which utilizes Genetic algorithms as well as random search incorporating simulated annealing concepts to solve VRPTW problem in various scenarios.
关键词：Vehicle Routing Problem with Time Windows; Genetic Algorithm; Random Search Algorithm; Simulated Annealing
