Open AccessVEHICLE ROUTING PROBLEM WITH TIME WINDOWS
Author(s) -
Vladimir Vacic,
Tarek M. Sobh
Publication year - 2014
Publication title -
computing
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.184
H-Index - 11
eISSN - 2312-5381
pISSN - 1727-6209
DOI - 10.47839/ijc.3.2.289
Subject(s) - vehicle routing problem , travelling salesman problem , computer science , genetic algorithm , mathematical optimization , routing (electronic design automation) , 2 opt , operations research , algorithm , mathematics , computer network
The topic of this paper is a Genetic Algorithm solution to the Vehicle Routing Problem with Time Windows, a variant of one of the most common problems in contemporary operations research. The paper will introduce the problem starting with more general Traveling Salesman and Vehicle Routing problems and present some of the prevailing strategies for solving them, focusing on Genetic Algorithms. At the end, it will summarize the Genetic Algorithm solution proposed by K.Q. Zhu which was used in the programming part of the project.