Application of Genetic Algorithms to Vehicle Routing Problem

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21260%2F14%3A00215143" target="_blank" >RIV/68407700:21260/14:00215143 - isvavai.cz</a>

Výsledek na webu

<a href="http://www.nnw.cz/" target="_blank" >http://www.nnw.cz/</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.14311/NNW.2014.24.003" target="_blank" >10.14311/NNW.2014.24.003</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Application of Genetic Algorithms to Vehicle Routing Problem

Popis výsledku v původním jazyce

Distribution of the goods from a producer to a customer is one of the most important tasks of transportation. This paper focuses on the usage of genetic algorithms (GA) for optimizing problems in transportation, namely vehicle routing problem (VRP). VRPfalls in the field of NP-hard problems, which cannot be solved in polynomial time. The problem was solved using genetic algorithm with two types of crossover, both including and leaving-out elitism, setting variable parameters of crossover and mutation probability, as well as prevention of creating invalid individuals. The algorithm was programmed in Matlab, tested on real world problem of spare parts distribution for garages, while the results were compared with another heuristic method (Clarke-Wrightmethod).

Název v anglickém jazyce

Application of Genetic Algorithms to Vehicle Routing Problem

Popis výsledku anglicky

Distribution of the goods from a producer to a customer is one of the most important tasks of transportation. This paper focuses on the usage of genetic algorithms (GA) for optimizing problems in transportation, namely vehicle routing problem (VRP). VRPfalls in the field of NP-hard problems, which cannot be solved in polynomial time. The problem was solved using genetic algorithm with two types of crossover, both including and leaving-out elitism, setting variable parameters of crossover and mutation probability, as well as prevention of creating invalid individuals. The algorithm was programmed in Matlab, tested on real world problem of spare parts distribution for garages, while the results were compared with another heuristic method (Clarke-Wrightmethod).

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

BB - Aplikovaná statistika, operační výzkum

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2014

Kód důvěrnosti údajů

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

Název periodika

Neural Network World

ISSN

1210-0552

e-ISSN

—

Svazek periodika

24

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

CZ - Česká republika

Počet stran výsledku

22

Strana od-do

57-78

Kód UT WoS článku

000333141100004

EID výsledku v databázi Scopus

2-s2.0-84903181659