This HTML5 document contains 42 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/
n10http://localhost/temp/predkladatel/
n6http://purl.org/net/nknouf/ns/bibtex#
n9http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n15http://linked.opendata.cz/ontology/domain/vavai/
n16http://linked.opendata.cz/resource/domain/vavai/zamer/
n14https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n4http://linked.opendata.cz/ontology/domain/vavai/riv/
n19http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F14%3A00222878%21RIV15-MSM-21230___/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n5http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n12http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n17http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n7http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n8http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F14%3A00222878%21RIV15-MSM-21230___
rdf:type
n15:Vysledek skos:Concept
dcterms:description
This paper presents a novel evolutionary algorithm for solving routing and sequencing problems. It builds directly on the observation that the optimal solution is composed mostly of short and low-cost links. It uses an indirect representation and an extended nearest neighbor constructive procedure. The representation scheme is redundant making it possible to have multiple attractors in the search space representing the same optimal solution. The order-based crossover is used that allows for combining partial solutions contained in parental individuals. Further, an adaptive iterated scheme is used to allow for escaping from a region of attraction of a local optimum. Proof-of-concept experiments have been carried out on the classical TSP with data sets ranging from 100 to 2392 nodes. The proposed algorithm was compared with two other relevant EAs. The achieved results clearly show the proposed method is competitive to and better than the compared EAs. This paper presents a novel evolutionary algorithm for solving routing and sequencing problems. It builds directly on the observation that the optimal solution is composed mostly of short and low-cost links. It uses an indirect representation and an extended nearest neighbor constructive procedure. The representation scheme is redundant making it possible to have multiple attractors in the search space representing the same optimal solution. The order-based crossover is used that allows for combining partial solutions contained in parental individuals. Further, an adaptive iterated scheme is used to allow for escaping from a region of attraction of a local optimum. Proof-of-concept experiments have been carried out on the classical TSP with data sets ranging from 100 to 2392 nodes. The proposed algorithm was compared with two other relevant EAs. The achieved results clearly show the proposed method is competitive to and better than the compared EAs.
dcterms:title
A Novel Evolutionary Algorithm with Indirect Representation and Extended Nearest Neighbor Constructive Procedure for Solving Routing Problems A Novel Evolutionary Algorithm with Indirect Representation and Extended Nearest Neighbor Constructive Procedure for Solving Routing Problems
skos:prefLabel
A Novel Evolutionary Algorithm with Indirect Representation and Extended Nearest Neighbor Constructive Procedure for Solving Routing Problems A Novel Evolutionary Algorithm with Indirect Representation and Extended Nearest Neighbor Constructive Procedure for Solving Routing Problems
skos:notation
RIV/68407700:21230/14:00222878!RIV15-MSM-21230___
n4:aktivita
n7:Z n7:S
n4:aktivity
S, Z(MSM6840770038)
n4:dodaniDat
n8:2015
n4:domaciTvurceVysledku
n9:4339681 n9:1775022
n4:druhVysledku
n18:D
n4:duvernostUdaju
n12:S
n4:entitaPredkladatele
n19:predkladatel
n4:idSjednocenehoVysledku
993
n4:idVysledku
RIV/68407700:21230/14:00222878
n4:jazykVysledku
n17:eng
n4:klicovaSlova
Combinatorial Optimization; Evolutionary Algorithms; Representation
n4:klicoveSlovo
n5:Combinatorial%20Optimization n5:Evolutionary%20Algorithms n5:Representation
n4:kontrolniKodProRIV
[D1EDFD6CC8D4]
n4:mistoKonaniAkce
Okinawa
n4:mistoVydani
Piscataway
n4:nazevZdroje
Proccedings of 2014 International Conference on Intelligent Systems Design and Applications
n4:obor
n13:JC
n4:pocetDomacichTvurcuVysledku
2
n4:pocetTvurcuVysledku
2
n4:rokUplatneniVysledku
n8:2014
n4:tvurceVysledku
Snížek, Michal Kubalík, Jiří
n4:typAkce
n21:WRD
n4:zahajeniAkce
2014-11-27+01:00
n4:zamer
n16:MSM6840770038
s:numberOfPages
6
n6:hasPublisher
IEEE
n14:isbn
978-1-4799-7938-7
n10:organizacniJednotka
21230