Algorithms of ant system and simulated annealing for the \(p\)-median problem
From MaRDI portal
Publication:2487738
DOI10.1023/B:AURC.0000019375.23201.c1zbMath1075.90052WikidataQ62048230 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
90B99: Operations research and management science
Related Items
Ant colony optimization for finding medians of weighted graphs, Affinity propagation and uncapacitated facility location problems, On statistical bounds of heuristic solutions to location problems, Variable neighborhood search for the pharmacy duty scheduling problem, Confidence in heuristic solutions?, The \(p\)-median problem: a survey of metaheuristic approaches, A scatter search-based heuristic to locate capacitated transshipment points, Exemplar-based clustering via simulated annealing, 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, Pharmacy duty scheduling problem