Download now Free registration required
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, the authors 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.
- Format: PDF
- Size: 469.51 KB