Algorithms of ant system and simulated annealing for the p-median problem
From MaRDI portal
Publication:2487738
DOI10.1023/B:AURC.0000019375.23201.C1zbMATH Open1075.90052OpenAlexW1967035201WikidataQ62048230 ScholiaQ62048230MaRDI QIDQ2487738FDOQ2487738
Authors: 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
Recommendations
- scientific article; zbMATH DE number 5590060
- Ant colony optimization techniques for the Hamiltonian p-median problem
- An ant colony algorithm for the pos/neg weighted \(p\)-median problem
- Search tree-based approach for the \(p\)-median problem using the ant colony optimization algorithm
- Ant algorithms and simulated annealing for multicriteria dynamic programming
- scientific article; zbMATH DE number 2215631
- Ant colony optimization for finding medians of weighted graphs
- Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
- Simulated annealing-based ant colony algorithm for traveling salesman problems
Cited In (18)
- Ant algorithms: theory and applications
- Pharmacy duty scheduling problem
- Title not available (Why is that?)
- An ant colony algorithm for the pos/neg weighted \(p\)-median problem
- On statistical bounds of heuristic solutions to location problems
- 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
- Affinity propagation and uncapacitated facility location problems
- A Lagrangian search method for the \(P\)-median problem
- A statistical analysis of simulated annealing applied to the \(p\)-median problem
- Confidence in heuristic solutions?
- Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem
- Variable neighborhood search for the pharmacy duty scheduling problem
- Ant colony optimization for finding medians of weighted graphs
- Search tree-based approach for the \(p\)-median problem using the ant colony optimization algorithm
- Large neighborhood local search for the \(p\)-median problem
- Title not available (Why is that?)
This page was built for publication: Algorithms of ant system and simulated annealing for the \(p\)-median problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2487738)
