| Title: | EVOLUTIONARY METAHEURISTIC APPROACHES FOR THE VEHICLE ROUTING PROBLEM WITH TIME WINDOWS |
| DOI No: | 10.1142/9781860948534_0067 |
| Source: | INNOVATIVE APPLICATIONS OF INFORMATION TECHNOLOGY FOR THE DEVELOPING WORLD (pp 435-445)
|
| Author(s): | SASWATI TRIPATHI
Amity School of Computer Sciences, Noida, India
BHAWNA MINOCHA
Amity School of Computer Sciences, Noida, India
|
| Abstract: | The Vehicle Routing Problem with Time Windows (VRPTW) is an important problem in logistics. This paper reviews the research on metaheuristic algorithms comprising Tabu Search and Evolutionary Algorithms for VRPTW. The main types of evolutionary algorithms for the VRPTW are Genetic Algorithms and Evolutionary Strategies which may also be described as Evolutionary metaheuristics to distinguish them from other metaheuristics. Along with these evolutionary metaheuristics, this paper reviews heuristic search methods that hybridize ideas of evolutionary computation with some other search technique, such as tabu search, guided local search, hierarchal tournament selection. In addition to the basic features of each method, experimental results for the 56 benchmark problem with 100 customers of Solomon (1987) are presented and analyzed. |
| Full Text: | View full text in PDF format (530KB) |
| TOC: | Back to Table of Contents |
|
|
