Ant colony optimization for finding medians of weighted graphs

DOI10.1108/02644400810855931MaRDI QIDQ4908024zbMATH OpenOpenAlexFDO

Authors P. Sharafi, A. 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

active antsant system algorithmfacility location problemfinding k-mediansmax-min ant systemoptimization techniquespassive antsprogramming and algorithm theoryrank-based ant systemweighted graphs

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Graph algorithms (graph-theoretic aspects) (05C85) Discrete location and assignment (90B80)

Recommendations

• 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
• The weighted center and weighted median of network location
• Large neighborhood local search for the p-median problem
• Ant colony optimization techniques for the Hamiltonian p-median problem

Cites work

• A bionomic approach to the capacitated \(p\)-median problem
• A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract)
• A tree search algorithm for the p-median problem
• Algorithms of ant system and simulated annealing for the \(p\)-median problem
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• An ant colony algorithm for the pos/neg weighted \(p\)-median problem
• An efficient genetic algorithm for the \(p\)-median problem
• AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem
• Capacitated clustering problems by hybrid simulated annealing and tabu search
• scientific article; zbMATH DE number 1775395 (Why is no real title available?)
• Hybrid ant systems for the dynamic facility layout problem
• Map graphs
• On locating path- or tree-shaped facilities on networks
• On the Complexity of Some Common Geometric Location Problems
• 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
• The directional \(p\)-median problem: definition, complexity, and algorithms

Cited in

(3)

• An ant colony algorithm for the pos/neg weighted \(p\)-median problem
• Algorithms of ant system and simulated annealing for the \(p\)-median problem
• Search tree-based approach for the \(p\)-median problem using the ant colony optimization algorithm

This page was built for publication: Ant colony optimization for finding medians of weighted graphs

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