About: Ant Colony Optimization with Parallel Subsolutions Heuristic     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
  • For solving N-complete Travelling Salesman Problem (TSP) by combining solutions of its subproblems, we designed algorithm inspired by Ant Colony Optimization (ACO) modified by adding parallel subsolutions heuristic. ACO can be parallelized simply by simultaneous execution of the algorithm with eventual exchange of the best solutions between all computational units. This approach requires access to a whole state matrix (which is of size O(n^2)) for each of them. It can limit the size of solvable problems on special architectures with different available memory capacities such as Cell Broadband Engine Architecture (CBEA). The presented algorithm keeps only one pheromone matrix in the memory of a main unit. The matrix is updated by subsolutions computed by ACO on other units in parallel. We show that this approach performs significantly better than greedy algorithm, even though it generates the whole solution from solutions of subproblems.
  • For solving N-complete Travelling Salesman Problem (TSP) by combining solutions of its subproblems, we designed algorithm inspired by Ant Colony Optimization (ACO) modified by adding parallel subsolutions heuristic. ACO can be parallelized simply by simultaneous execution of the algorithm with eventual exchange of the best solutions between all computational units. This approach requires access to a whole state matrix (which is of size O(n^2)) for each of them. It can limit the size of solvable problems on special architectures with different available memory capacities such as Cell Broadband Engine Architecture (CBEA). The presented algorithm keeps only one pheromone matrix in the memory of a main unit. The matrix is updated by subsolutions computed by ACO on other units in parallel. We show that this approach performs significantly better than greedy algorithm, even though it generates the whole solution from solutions of subproblems. (en)
Title
  • Ant Colony Optimization with Parallel Subsolutions Heuristic
  • Ant Colony Optimization with Parallel Subsolutions Heuristic (en)
skos:prefLabel
  • Ant Colony Optimization with Parallel Subsolutions Heuristic
  • Ant Colony Optimization with Parallel Subsolutions Heuristic (en)
skos:notation
  • RIV/68407700:21230/08:00147052!RIV10-MSM-21230___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • Z(MSM6840770012)
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
  • 356365
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/08:00147052
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Ant Colony Optimization; Travelling Salesman Problem (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [8115745A3BFA]
http://linked.open...v/mistoKonaniAkce
  • Le Havre
http://linked.open...i/riv/mistoVydani
  • Ghent
http://linked.open...i/riv/nazevZdroje
  • European Simulation and Modelling Conference 2008
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Skrbek, Miroslav
  • Kovářík, Oleg
http://linked.open...vavai/riv/typAkce
http://linked.open...ain/vavai/riv/wos
  • 000264749400036
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • EUROSIS - ETI
https://schema.org/isbn
  • 978-90-77381-44-1
http://localhost/t...ganizacniJednotka
  • 21230
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, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software