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

MaRDI QIDQ495424zbMATH OpenFDO

Authors Gabriel Bodnariuc, Sergiu Cataranciuc

Publication date 10 September 2015

Published in Computer Science Journal of Moldova (Search for Journal in Brave)

Full work available at URL http://www.math.md/publications/csjm/issues/v22-n1/11616/

zbMATH Keywords

\(p\)-medianant colony optimizationcombinatorial optimizationlocation theorysearch tree

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• An ant colony algorithm for the pos/neg weighted \(p\)-median problem
• Ant colony optimization techniques for the Hamiltonian p-median problem
• Algorithms of ant system and simulated annealing for the \(p\)-median problem
• Ant colony optimization for finding medians of weighted graphs
• An efficient tabu search procedure for the p-median problem
• The \(p\)-median problem: a survey of metaheuristic approaches
• Ant-Tree: an ant colony optimization approach to the generalized minimum spanning tree problem
• scientific article; zbMATH DE number 5990417
• Advanced greedy randomized adaptive search procedure for the obnoxious p-median problem

Cited in

(3)

• Algorithms of ant system and simulated annealing for the \(p\)-median problem
• scientific article; zbMATH DE number 5990417 (Why is no real title available?)
• Ant colony optimization for finding medians of weighted graphs

This page was built for publication: Search tree-based approach for the \(p\)-median problem using the ant colony optimization algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q495424)