This HTML5 document contains 44 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n21http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n17http://localhost/temp/predkladatel/
n14http://purl.org/net/nknouf/ns/bibtex#
n6http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n13http://linked.opendata.cz/resource/domain/vavai/subjekt/
n3http://linked.opendata.cz/ontology/domain/vavai/
n20https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n10http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F62690094%3A18450%2F12%3A50001880%21RIV14-MSM-18450___/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n12http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F62690094%3A18450%2F12%3A50001880%21RIV14-MSM-18450___
rdf:type
n3:Vysledek skos:Concept
dcterms:description
This article compares many ways of solving the traveling salesman problem. At first classical heuristic methods and methods using graph theory are mentioned. At the first part many universal methods are described, which can be also used in other transportation problems. The traveling salesman problem is solved by using genetic algorithm in the second part of this article. This algorithm generates at the beginning the first generation, chooses five thousand parents by the roulette method, crosses these pairs and determines the next generation. This process continues with next generations until stabilization. The algorithm is demonstrated on two examples. At the final part extremal algebras, max-plus algebra and max-min algebra, are defined and illustrated by examples. Monge matrices and some their properties are described in these algebras. The optimization of the traveling salesman problem, which leads to a reduction of the computation complexity, is described for these matrices. The optimization is solved at first for the classical case and then for the matrices that satisfy the strict Monge property. Matrices with the strict Monge property lead to the linear complexity of the problem. This article compares many ways of solving the traveling salesman problem. At first classical heuristic methods and methods using graph theory are mentioned. At the first part many universal methods are described, which can be also used in other transportation problems. The traveling salesman problem is solved by using genetic algorithm in the second part of this article. This algorithm generates at the beginning the first generation, chooses five thousand parents by the roulette method, crosses these pairs and determines the next generation. This process continues with next generations until stabilization. The algorithm is demonstrated on two examples. At the final part extremal algebras, max-plus algebra and max-min algebra, are defined and illustrated by examples. Monge matrices and some their properties are described in these algebras. The optimization of the traveling salesman problem, which leads to a reduction of the computation complexity, is described for these matrices. The optimization is solved at first for the classical case and then for the matrices that satisfy the strict Monge property. Matrices with the strict Monge property lead to the linear complexity of the problem.
dcterms:title
Usage of the extremal algebra in solving the travelling salesman problem Usage of the extremal algebra in solving the travelling salesman problem
skos:prefLabel
Usage of the extremal algebra in solving the travelling salesman problem Usage of the extremal algebra in solving the travelling salesman problem
skos:notation
RIV/62690094:18450/12:50001880!RIV14-MSM-18450___
n3:predkladatel
n13:orjk%3A18450
n5:aktivita
n16:O
n5:aktivity
O
n5:dodaniDat
n12:2014
n5:domaciTvurceVysledku
n6:2727749 n6:2654601
n5:druhVysledku
n19:D
n5:duvernostUdaju
n9:S
n5:entitaPredkladatele
n10:predkladatel
n5:idSjednocenehoVysledku
176289
n5:idVysledku
RIV/62690094:18450/12:50001880
n5:jazykVysledku
n18:eng
n5:klicovaSlova
genetic algorithm; travelling salesman problém; max-min algebra; max-plus algebra; Monge matrix
n5:klicoveSlovo
n15:travelling%20salesman%20probl%C3%A9m n15:Monge%20matrix n15:max-min%20algebra n15:max-plus%20algebra n15:genetic%20algorithm
n5:kontrolniKodProRIV
[B358D907ADFB]
n5:mistoKonaniAkce
Karviná
n5:mistoVydani
Karviná
n5:nazevZdroje
Mathematical methods in economics : proceedings of 30th international conference
n5:obor
n7:IN
n5:pocetDomacichTvurcuVysledku
2
n5:pocetTvurcuVysledku
2
n5:rokUplatneniVysledku
n12:2012
n5:tvurceVysledku
Pozdílková, Alena Cimler, Richard
n5:typAkce
n21:WRD
n5:wos
000316715900126
n5:zahajeniAkce
2012-01-11+01:00
s:numberOfPages
6
n14:hasPublisher
Slezská univerzita. Obchodně podnikatelská fakulta
n20:isbn
978-80-7248-779-0
n17:organizacniJednotka
18450