Genetic algorithms for the vehicle routing problem

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61988987%3A17310%2F16%3AA1701HNF" target="_blank" >RIV/61988987:17310/16:A1701HNF - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Genetic algorithms for the vehicle routing problem
Original language description
The Vehicle Routing Problem (VRP) is one of the most challenging combinatorial optimization tasks. This problem consists in designing the optimal set of routes for fleet of vehicles in order to serve a given set of customers. Evolutionary algorithms are general iterative algorithms for combinatorial optimization. These algorithms have been found to be very effective and robust in solving numerous problems from a wide range of application domains. This problem is known to be NP-hard; hence many heuristic procedures for its solution have been suggested. For such problems it is often desirable to obtain approximate solutions, so they can be found fast enough and are sufficiently accurate for the purpose. In this paper we have performed an experimental study that indicates the suitable use of genetic algorithms for the vehicle routing problem.
Czech name
—
Czech description
—

Publication year
2016
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON NUMERICAL ANALYSIS AND APPLIED MATHEMATICS 2015 (ICNAAM-2015)
ISBN
978-0-7354-1392-4
ISSN
0094-243X
e-ISSN
—
Number of pages
4
Pages from-to
—
Publisher name
American Institute of Physics Inc.
Place of publication
—
Event location
Rodos, Greece
Event date
Sep 23, 2015
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000380803300131

Similar results(10)