Algorithms of ant system and simulated annealing for the \(p\)-median problem

DOI10.1023/B:AURC.0000019375.23201.c1zbMath1075.90052OpenAlexW1967035201WikidataQ62048230 ScholiaQ62048230MaRDI QIDQ2487738

Tat'yana Valentinovna Levanova, M. A. Loresh

Publication date: 8 August 2005

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:aurc.0000019375.23201.c1

zbMATH Keywords

\(p\)-median problem

Mathematics Subject Classification ID

Operations research and management science (90B99)

Related Items (13)

On statistical bounds of heuristic solutions to location problems ⋮ Variable neighborhood search for the pharmacy duty scheduling problem ⋮ The \(p\)-median problem: a survey of metaheuristic approaches ⋮ A scatter search-based heuristic to locate capacitated transshipment points ⋮ A Lagrangian search method for the \(P\)-median problem ⋮ Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem ⋮ Ant algorithms: theory and applications ⋮ An ant colony algorithm for the pos/neg weighted \(p\)-median problem ⋮ Ant colony optimization for finding medians of weighted graphs ⋮ Affinity propagation and uncapacitated facility location problems ⋮ Pharmacy duty scheduling problem ⋮ Confidence in heuristic solutions? ⋮ Exemplar-based clustering via simulated annealing

This page was built for publication: Algorithms of ant system and simulated annealing for the \(p\)-median problem