| Conţinutul numărului revistei |
| Articolul precedent |
| Articolul urmator |
 |
 966 4 |
| Ultima descărcare din IBN: 2022-08-09 06:50 |
| Căutarea după subiecte similare conform CZU |
| 519.863 (8) |
| Cercetări operaționale (OR) teorii şi metode matematice (168) |
 SM ISO690:2012BODNARIUC, Gabriel, CATARANCIUC, Sergiu. Search tree-based approach for the p-median
problem using the ant colony optimization
algorithm. In: Computer Science Journal of Moldova, 2014, nr. 1(64), pp. 62-76. ISSN 1561-4042. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
 Computer Science Journal of Moldova |
||||||
| Numărul 1(64) / 2014 / ISSN 1561-4042 /ISSNe 2587-4330 | ||||||
|
||||||
| CZU: 519.863 | ||||||
| Pag. 62-76 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
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. |
||||||
| Cuvinte-cheie ant colony optimization, p-median, location the- ory, search tree, combinatorial optimization |
||||||
|
|
|
|
