All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Application of Genetic Algorithms to Vehicle Routing Problem

The result's identifiers

  • Result code in 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>

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Application of Genetic Algorithms to Vehicle Routing Problem

  • Original language description

    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).

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    BB - Applied statistics, operational research

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    Z - Vyzkumny zamer (s odkazem do CEZ)

Others

  • Publication year

    2014

  • Confidentiality

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

Data specific for result type

  • Name of the periodical

    Neural Network World

  • ISSN

    1210-0552

  • e-ISSN

  • Volume of the periodical

    24

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    CZ - CZECH REPUBLIC

  • Number of pages

    22

  • Pages from-to

    57-78

  • UT code for WoS article

    000333141100004

  • EID of the result in the Scopus database

    2-s2.0-84903181659