Vehicle Routing Problem with Time Windows, Part II: Metaheuristics

摘要: This paper surveys the research on metaheuristics for Vehicle Routing Problem with Time Windows (VRPTW). The VRPTW can be described as problem of designing least cost routes from one depot to a set geographically scattered points. must designed in such way that each point is visited only once by exactly vehicle within given time interval; all start and end at depot, total demands points particular route not exceed capacity vehicle. Metaheuristics are general solution procedures explore space identify good solutions often embed some standard construction improvement heuristics first part this article. In addition describing basic features method, experimental results Solomon's benchmark test problems presented analyzed.