Parallel Ant Colony Algorithm for Shortest Path Problem
Authors:
Open Access
- 28 January 2019
- journal article
- research article
- Published by Periodica Polytechnica Budapest University of Technology and Economics in Periodica Polytechnica Civil Engineering
- Vol. 63 (1) , 243-254
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.Keywords
This publication has 45 references indexed in Scilit:
- Smart and Digital City: A Systematic Literature Review2014
- Asynchronous grid computation for American options derivativesAdvances in Engineering Software, 2013
- An algorithm for finding reasonable paths in transit networksJournal of Advanced Transportation, 2007
- A Stochastic Traffic Assignment Algorithm Based on Ant Colony OptimisationLecture Notes in Computer Science, 2006
- Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing ProblemMathematical Programming, 2005
- A new branch-and-cut algorithm for the capacitated vehicle routing problemMathematical Programming, 2004
- Genetic algorithms applied to partitioning for parallel analyses using geometric entities2003
- Optimal strategies: A new assignment model for transit networksTransportation Research Part B: Methodological, 1989
- A branch and bound algorithm for the capacitated vehicle routing problemOR Spectrum, 1983
- A note on two problems in connexion with graphsNumerische Mathematik, 1959