About: A Novel Evolutionary Algorithm with Indirect Representation and Extended Nearest Neighbor Constructive Procedure for Solving Routing Problems

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: A Novel Evolutionary Algorithm with Indirect Representation and Extended Nearest Neighbor Constructive Procedure for Solving Routing Problems 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)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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. (en)
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 (en)
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 (en)
skos:notation	RIV/68407700:21230/14:00222878!RIV15-MSM-21230___
http://linked.open...avai/riv/aktivita	S Z
http://linked.open...avai/riv/aktivity	S, Z(MSM6840770038)
http://linked.open...vai/riv/dodaniDat	2015
http://linked.open...aciTvurceVysledku	Snížek, Michal Kubalík, Jiří
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	České vysoké učení technické v Praze / Fakulta elektrotechnická
http://linked.open...dnocenehoVysledku	993
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/14:00222878
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	Combinatorial Optimization; Evolutionary Algorithms; Representation (en)
http://linked.open.../riv/klicoveSlovo	Combinatorial Optimization Evolutionary Algorithms Representation
http://linked.open...ontrolniKodProRIV	[D1EDFD6CC8D4]
http://linked.open...v/mistoKonaniAkce	Okinawa
http://linked.open...i/riv/mistoVydani	Piscataway
http://linked.open...i/riv/nazevZdroje	Proccedings of 2014 International Conference on Intelligent Systems Design and Applications
http://linked.open...in/vavai/riv/obor	JC
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...UplatneniVysledku	2014
http://linked.open...iv/tvurceVysledku	Kubalík, Jiří Snížek, Michal
http://linked.open...vavai/riv/typAkce	WRD - Světová
http://linked.open.../riv/zahajeniAkce	2014-11-27 (xsd:date)
http://linked.open...n/vavai/riv/zamer	Decision Making and Control for Manufacturing III
number of pages	6 (xsd:int)
http://purl.org/ne...btex#hasPublisher	IEEE
https://schema.org/isbn	978-1-4799-7938-7
http://localhost/t...ganizacniJednotka	21230

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

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, 77 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software