Institutul de Matematică şi Informatică "Vladimir Andrunachievici"
Universitatea de Stat din MoldovaRO EN
Search tree-based approach for the p-median problem using the ant colony optimization algorithm
Authors: Gabriel Bodnariuc, Sergiu Cataranciuc
Keywords: ant colony optimization, p-median, location theory, combinatorial optimization, search tree.
– 0.86 Mb
Keywords: ant colony optimization, p-median, location theory, combinatorial optimization, search tree.
Abstract
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.Gabriel Bodnariuc
State University of Moldova, Republic of Moldova
60 A. Mateevici, MD-2009.
E-mail:
Sergiu Cataranciuc
State University of Moldova
60 A. Mateevici, MD-2009, Republic of Moldova
E-mail:
State University of Moldova, Republic of Moldova
60 A. Mateevici, MD-2009.
E-mail:
Sergiu Cataranciuc
State University of Moldova
60 A. Mateevici, MD-2009, Republic of Moldova
E-mail:
Fulltext
– 0.86 Mb
Contents
- Solving Problems in Various Domains by Hybrid Models of High Performance Computations
- Chromatic Polynomials Of Some (m,l) - Hyperwheels
- A New Full-Newton Step O(n) Infeasible Interior-Point Algorithm for P*(k)-horizontal Linear Complementarity Problems
- Search tree-based approach for the p-median problem using the ant colony optimization algorithm
- Artificial Bee Colony with Different Mutation Schemes: A comparative study
- A Note on Solvable Polynomial Algebras
- Dynamic Object Identification with SOM-based neural networks
- Evaluating the impact of software metrics on defects prediction. Part 2
