^ Parallel Ant Colony Algorithm for Shortest Path Problem | Structurae
0
  • DE
  • EN
  • FR
  • International Database and Gallery of Structures

Advertisement

Parallel Ant Colony Algorithm for Shortest Path Problem

Author(s):


Medium: journal article
Language(s): English
Published in: Periodica Polytechnica Civil Engineering
DOI: 10.3311/ppci.12813
Abstract:

During travelling, more and more information must be taken into account, and travelers have to make several complex decisions. In order to support these decisions, IT solutions are unavoidable, and as the computational demand is constantly growing, the examination of state-of-the-art methodologies is necessary. In our research, a parallelized Ant Colony algorithm was investigated, and a parameter study on a real network has been made. The aim was to inspect the sensibility of the method and to demonstrate its applicability in a multi-threaded system (e.g. Cloud-based systems). Based on the research, increased effectiveness can be reached by using more threads. The novelty of the paper is the usage of the processors’ parallel computing capability for routing with the Ant Colony algorithm.

Structurae cannot make the full text of this publication available at this time. The full text can be accessed through the publisher via the DOI: 10.3311/ppci.12813.
  • About this
    data sheet
  • Reference-ID
    10536506
  • Published on:
    01/01/2021
  • Last updated on:
    19/02/2021