About: Genetic Algorithms for Solving Vehicle Routing     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • Author in this paper describes the possibilities of solving some vehicle routing variants by genetic algorithm. Specifically, it is a classical capacitated vehicle routing problem (CVRP), vehicle routing problem with time windows (VRP-TW), vehicle routing problem with simultaneous deliveries and pick-ups (VRPDP) and their mutual combinations. Genetic algorithms are a search method used to find suboptimal solutions of complicated combinatorial problems including vehicle routing. Genetic algorithm (GVR) is quite universal due to the two-level representation of the problem - without major modifications it enables successful solving of CVRP, VRP-TW and possibly also other variants of the problem. GVR enables also fast search for new solutions - operators of crossover and mutations provide solutions whose adjustment is not time demanding, and quality of provided solutions is very good, GVR verified with standard data. Parameters of genetic algorithm can be modified in the program environment, the output routes can be presented as texts or/and in map. Each solution is described as the sequence of all customers, while every customer data is stored in binary form. The results calculated by genetic algorithm were verified with standard data. The program can also load selected file formats with standard data in addition to its own text file format.
  • Author in this paper describes the possibilities of solving some vehicle routing variants by genetic algorithm. Specifically, it is a classical capacitated vehicle routing problem (CVRP), vehicle routing problem with time windows (VRP-TW), vehicle routing problem with simultaneous deliveries and pick-ups (VRPDP) and their mutual combinations. Genetic algorithms are a search method used to find suboptimal solutions of complicated combinatorial problems including vehicle routing. Genetic algorithm (GVR) is quite universal due to the two-level representation of the problem - without major modifications it enables successful solving of CVRP, VRP-TW and possibly also other variants of the problem. GVR enables also fast search for new solutions - operators of crossover and mutations provide solutions whose adjustment is not time demanding, and quality of provided solutions is very good, GVR verified with standard data. Parameters of genetic algorithm can be modified in the program environment, the output routes can be presented as texts or/and in map. Each solution is described as the sequence of all customers, while every customer data is stored in binary form. The results calculated by genetic algorithm were verified with standard data. The program can also load selected file formats with standard data in addition to its own text file format. (en)
Title
  • Genetic Algorithms for Solving Vehicle Routing
  • Genetic Algorithms for Solving Vehicle Routing (en)
skos:prefLabel
  • Genetic Algorithms for Solving Vehicle Routing
  • Genetic Algorithms for Solving Vehicle Routing (en)
skos:notation
  • RIV/00216275:25510/11:39894519!RIV12-MSM-25510___
http://linked.open...avai/predkladatel
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • Z(MSM0021627505)
http://linked.open...iv/cisloPeriodika
  • 16
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 200981
http://linked.open...ai/riv/idVysledku
  • RIV/00216275:25510/11:39894519
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Genetic Algorithms,Solving,Vehicle Routing (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...odStatuVydavatele
  • CZ - Česká republika
http://linked.open...ontrolniKodProRIV
  • [962EBDD95017]
http://linked.open...i/riv/nazevZdroje
  • Scientific Papers of the University of Pardubice, Series B, The Jan Perner Transport Faculty
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...v/svazekPeriodika
  • 2010
http://linked.open...iv/tvurceVysledku
  • Široký, Jaromír
http://linked.open...n/vavai/riv/zamer
issn
  • 1211-6610
number of pages
http://localhost/t...ganizacniJednotka
  • 25510
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 85 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software