Ant colony optimization for finding medians of weighted graphs

DOI10.1108/02644400810855931zbMath1257.05169MaRDI QIDQ4908024

P. Sharafi, Ali Kaveh

Publication date: 27 February 2013

Published in: Engineering Computations (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1108/02644400810855931

zbMATH Keywords

weighted graphs; facility location problem; optimization techniques; max-min ant system; programming and algorithm theory; ant system algorithm; active ants; finding k-medians; passive ants; rank-based ant system

Mathematics Subject Classification ID

90B80: Discrete location and assignment

05C85: Graph algorithms (graph-theoretic aspects)

05C22: Signed and weighted graphs

Cites Work

• Unnamed Item
• The directional \(p\)-median problem: definition, complexity, and algorithms
• A tree search algorithm for the p-median problem
• A bionomic approach to the capacitated \(p\)-median problem
• An efficient genetic algorithm for the \(p\)-median problem
• An ant colony algorithm for the pos/neg weighted \(p\)-median problem
• Algorithms of ant system and simulated annealing for the \(p\)-median problem
• Hybrid ant systems for the dynamic facility layout problem
• A constant-factor approximation algorithm for the k -median problem (extended abstract)
• On locating path- or tree-shaped facilities on networks
• Map graphs
• On the Complexity of Some Common Geometric Location Problems
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
• Capacitated clustering problems by hybrid simulated annealing and tabu search
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph