Search tree-based approach for the p-median problem using the ant colony optimization algorithm

In this paper we present an approximation algorithm for the $p$-median problem that uses the principles of ant colony optimization technique. We introduce a search tree that keeps the partial solutions during the solution process of the $p$-median problem. An adaptation is proposed that allows ant c...

Full description

Bibliographic Details
Main Authors: Gabriel Bodnariuc, Sergiu Cataranciuc
Format: Article
Language:English
Published: Vladimir Andrunachievici Institute of Mathematics and Computer Science 2014-03-01
Series:Computer Science Journal of Moldova
Subjects:
Online Access:http://www.math.md/files/csjm/v22-n1/v22-n1-(pp62-76).pdf
_version_ 1811306487788601344
author Gabriel Bodnariuc
Sergiu Cataranciuc
author_facet Gabriel Bodnariuc
Sergiu Cataranciuc
author_sort Gabriel Bodnariuc
collection DOAJ
description In this paper we present an approximation algorithm for the $p$-median problem that uses the principles of ant colony optimization technique. We introduce a search tree that keeps the partial solutions during the solution process of the $p$-median problem. An adaptation is proposed that allows ant colony optimization algorithm to perform on this tree and obtain good results in short time.
first_indexed 2024-04-13T08:45:24Z
format Article
id doaj.art-50990afe922e4d828955ca57bd45638a
institution Directory Open Access Journal
issn 1561-4042
language English
last_indexed 2024-04-13T08:45:24Z
publishDate 2014-03-01
publisher Vladimir Andrunachievici Institute of Mathematics and Computer Science
record_format Article
series Computer Science Journal of Moldova
spelling doaj.art-50990afe922e4d828955ca57bd45638a2022-12-22T02:53:40ZengVladimir Andrunachievici Institute of Mathematics and Computer ScienceComputer Science Journal of Moldova1561-40422014-03-01221(64)6276Search tree-based approach for the p-median problem using the ant colony optimization algorithmGabriel Bodnariuc0Sergiu Cataranciuc1State University of Moldova, Republic of Moldova, 60 A. Mateevici, MD-2009State University of Moldova, Republic of Moldova, 60 A. Mateevici, MD-2009In this paper we present an approximation algorithm for the $p$-median problem that uses the principles of ant colony optimization technique. We introduce a search tree that keeps the partial solutions during the solution process of the $p$-median problem. An adaptation is proposed that allows ant colony optimization algorithm to perform on this tree and obtain good results in short time.http://www.math.md/files/csjm/v22-n1/v22-n1-(pp62-76).pdfant colony optimization$p$-medianlocation theorycombinatorial optimizationsearch tree
spellingShingle Gabriel Bodnariuc
Sergiu Cataranciuc
Search tree-based approach for the p-median problem using the ant colony optimization algorithm
Computer Science Journal of Moldova
ant colony optimization
$p$-median
location theory
combinatorial optimization
search tree
title Search tree-based approach for the p-median problem using the ant colony optimization algorithm
title_full Search tree-based approach for the p-median problem using the ant colony optimization algorithm
title_fullStr Search tree-based approach for the p-median problem using the ant colony optimization algorithm
title_full_unstemmed Search tree-based approach for the p-median problem using the ant colony optimization algorithm
title_short Search tree-based approach for the p-median problem using the ant colony optimization algorithm
title_sort search tree based approach for the p median problem using the ant colony optimization algorithm
topic ant colony optimization
$p$-median
location theory
combinatorial optimization
search tree
url http://www.math.md/files/csjm/v22-n1/v22-n1-(pp62-76).pdf
work_keys_str_mv AT gabrielbodnariuc searchtreebasedapproachforthepmedianproblemusingtheantcolonyoptimizationalgorithm
AT sergiucataranciuc searchtreebasedapproachforthepmedianproblemusingtheantcolonyoptimizationalgorithm