Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/emerald-publishing/ant-colony-optimization-for-finding-medians-of-weighted-graphs-Rgk6qiTunr
References (35)
-
N. Megiddo, K. Supowit (1984)
On the Complexity of Some Common Geometric Location ProblemsSIAM J. Comput., 13
-
Zhi-Zhong Chen, M. Grigni, C. Papadimitriou (1999)
Map graphsArXiv, cs.DM/9910013
-
10.1017/CCOL0521340446.006
-
S. HAKIMIt (1979)
AN ALGORITHMIC APPROACH TO NETWORK LOCATION PROBLEMS. -
T. Stützle (2009)
Ant Colony Optimization -
Zhi-Zhong Chen, M. Grigni, C. Papadimitriou (1998)
Planar map graphs -
L. Jackson, G. Rouskas, Matthias Stallmann (2007)
The directional pEur. J. Oper. Res., 179
-
M. Dorigo, V. Maniezzo, A. Colorni (1991)
Ant System: An Autocatalytic Optimizing Process -
A. McKendall, Jin Shang (2006)
Hybrid ant systems for the dynamic facility layout problemComput. Oper. Res., 33
-
M. Charikar, S. Guha (1999)
Improved combinatorial algorithms for the facility location and k-median problems40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)
-
O. Kariv, S. Hakimi (1979)
An Algorithmic Approach to Network Location Problems. II: The p-MediansSiam Journal on Applied Mathematics, 37
-
V. Maniezzo, A. Mingozzi, Roberto Baldacci (1998)
A Bionomic Approach to the Capacitated p-Median ProblemJournal of Heuristics, 4
-
S. Hakimi, E. Schmeichel, M. Labbé (1993)
On locating path- or tree-shaped facilities on networksNetworks, 23
-
10.7551/mitpress/1290.001.0001
-
R. Panigrahy, S. Vishwanathan (1996)
An O(log*n) approximation algorithm for the asymmetric p-center problemJ. Algorithms, 27
-
M. Charikar, Chandra Chekuriy, Ashish Goelz, Sudipto Guhax (1998)
Rounding via Trees : Deterministic Approximation Algorithms forGroup -
S. Hakimi (1964)
Optimum Locations of Switching Centers and the Absolute Centers and Medians of a GraphOperations Research, 12
-
J. Laffont (1995)
Advances in Economic Theory -
10.1111/1475-3995.d01-43
-
B. Bullnheimer, R.F. Hartl, C. Strauss
A new rank‐based version of ant system: a computational study -
S. Hakimi (1965)
Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic ProblemsOperations Research, 13
-
I. Osman, Nicos Christofides (1994)
Capacitated clustering problems by hybrid simulated annealing and tabu searchInternational Transactions in Operational Research, 1
-
L. Jackson, G. Rouskas, Matthias Stallmann (2003)
The directional p-median problem with applications to traffic quantization and multiprocessor scheduling -
T. Stützle, H. Hoos (1997)
MAX-MIN Ant System and local search for the traveling salesman problemProceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97)
-
M. Dorigo, V. Maniezzo, A. Colorni (1996)
Ant system: optimization by a colony of cooperating agentsIEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society, 26 1
-
Nicos Christofides, J. Beasley (1982)
A tree search algorithm for the p-median problemEuropean Journal of Operational Research, 10
-
J. Fathali, H. Kakhki, R. Burkard (2006)
An ant colony algorithm for the pos/neg weighted p-median problemCentral European Journal of Operations Research, 14
-
E. Kay (1975)
Graph Theory. An Algorithmic Approach -
M. Charikar, C. Chekuri, A. Goel, S. Guha
Rounding via trees: deterministic approximation algorithms for group Steiner trees and k ‐median -
V. Estivill-Castro, Rodolfo Torres-Velázquez (1998)
Hybrid Genetic Algorithm for Solving the p-Median Problem -
T. Levanova, M. Loresh (2004)
Algorithms of Ant System and Simulated Annealing for the p-median ProblemAutomation and Remote Control, 65
-
Aaron Archer (2001)
Two O (log* k)-Approximation Algorithms for the Asymmetric k-Center Problem -
M. Charikar, S. Guha, É. Tardos, D. Shmoys (1999)
A constant-factor approximation algorithm for the k-median problem (extended abstract) -
O. Alp, E. Erkut, Z. Drezner (2003)
An Efficient Genetic Algorithm for the p-Median ProblemAnnals of Operations Research, 122
-
M. Charikar, S. Guha, É. Tardos, D. Shmoys (2002)
A Constant-Factor Approximation Algorithm for the k-Median ProblemJ. Comput. Syst. Sci., 65
- Publisher
- Emerald Publishing
- Copyright
- Copyright © 2008 Emerald Group Publishing Limited. All rights reserved.
- ISSN
- 0264-4401
- DOI
- 10.1108/02644400810855931
- Publisher site
- See Article on Publisher Site
Abstract
Purpose – Medians of a graph have many applications in engineering. Optimal locations for facility centers, distribution of centers and domain decomposition for parallel computation are a few examples of such applications. In this paper, a new ant system (AS) algorithm based on the idea of using two sets of ants, named active and passive ants is proposed for the problem of finding k ‐medians of a weighted graph or the facility location problem on a network. Design/methodology/approach – The structure of the algorithm is derived from two known heuristics; namely, rank‐based AS and max‐min ant system with some adjustments in pheromone updating and locating the ants on the graph nodes. The algorithms are designed with and without a local search. Findings – An efficient algorithm for location finding, and the novel application of an ant colony system can be considered as the main contribution of this paper. Originality/value – Combining two different tools; namely, graph theory and AS algorithm results in an efficient and accurate method for location finding. The results are compared to those of another algorithm based on the theory of graphs.
Journal
Engineering Computations: International Journal for Computer-Aided Engineering and Software – Emerald Publishing
Published: Mar 7, 2008
Keywords: Optimization techniques; Programming and algorithm theory