Year: 2010
Type: report
Abstract: The Vehicle Routing Problem with Time Windows (VRPTW) is a well-known combinatorial optimization problem of high computational complexity.It can be described as the problem of designing least cost routes from a depot to a set of customers of known demand.The routes must be designed such that each customer is visited only once by exactly one vehicle within a given time interval without violating capacity constraints.The goal is to minimize first the total number of vehicles required and second the total travel distance incurred.As research move towards more larger and realistic problems, the trend is towards the development of computationally intelligent algorithms capable of producing high quality solutions with reasonable computational burdens.The purpose of this survey is to discuss the state-of-the-art in the field of advanced heuristics proposed for solving large-scale problem instances.The effort is not only to provide an overview of solution methods, but also to identify the ingredients of success.Computational results, comparing the performance of different algorithms, are reported, while an analysis based on essential attributes, such as efficiency, effectiveness, simplicity and flexibility, is also provided.
Authors: Michel Gendreau, Christos D. Tarantilis
Language: English
Subfield: Industrial and Manufacturing Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2358128336
