Abstract
Let a graph G = (V, E) with vertex set V and edge set E be given. The classical graph version of the p-median problem asks for a subset \(X\subseteq V\) of cardinality p, so that the (weighted) sum of the minimum distances from X to all other vertices in V is minimized. We consider the semi-obnoxious case, where every vertex has either a positive or a negative weight. This gives rise to two different objective functions, namely the weighted sum of the minimum distances from X to the vertices in V\X and, differently, the sum over the minimum weighted distances from X to V\X. In this paper an Ant Colony algorithm with a tabu restriction is designed for both problems. Computational results show its superiority with respect to a previously investigated variable neighborhood search and a tabu search heuristic.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alp O, Drezner Z, Erkut E (2003) An efficient genetic algorithm for the p-median Problem. Ann Oper Res 122:21–42
Beasley JE (1990) OR-Library: distributing test problems by electronic mail. J Oper Res Soc 41(11):1069–1072
Bonabeau E, Dorigo M, Theraulaz G (1999) From natural to artifical swarm inteligence. Oxford University Press, New York
Burkard RE, Krarup J (1998) A linear algorithm for the pos/neg-weighted 1-median problem on a cactus. Computing 60:193–215
Burkard RE, Çela E, Dollani H (2000) 2-Median in trees with pos/neg weights. Discrete Appl Math 105:51–71
Cappanera P (1999) A survey on obnoxious facility location problems. Technical report: TR-99-11, Dipartimento di Informatica, Universita di Pisa
Captivo EM (1991) Fast primal and dual heuristics for the p-median location problem. Eur J Oper Res 52:65–74
Carrizosa E, Plastria F (1999) Location of semi-obnoxious facilities. Stud Locat Anal 12:1–27
Dorigo M, Di Caro G (1999) The ant colony optimization meta-heuristic. In: Corne D, Dorigo M, Glover F (eds) New ideas in optimization. McGraw-Hill, Maidenhead
Dorigo M, Stützle T (2004) Ant colony optimization. MIT, Cambridge
Dorigo M, Maniezzo V, Colorni A (1991) Positive feedback as a search strategy. Technical report 91-016, Politecnico di Milano, Milan, Italy
Eiselt HA, Laporte G (1995). Objectives in location problems. In: Drezner Z (eds). Facility location. A survey of applications and methods, Chap 8. Springer, Berlin Heidelberg New York
Fathali J, Taghizadeh Kakhki H (2006) Solving the p-median problem with pos/neg weights by variable neighborhood search and some results for special cases. Eur J Oper Res 170:440–462
Hansen P, Mladenovic N (1997) Variable neighborhood search for the p-median. Locat Sci 5:207–226
Hansen P, Mladenovic N (2001) Variable neighborhood search: principles and applications. Eur J Oper Res 130:449–467
Kariv O, Hakimi SL (1979) An algorithmic approach to network location problems. Part II: p-medians. SIAM J Appl Math 37:539–560
Kuehn AA, Hamburger MJ (1963) A heuristic program for locating warehouses. Manage Sci 9:643–666
Levanova TV, Loresh MA (2004) Algorithms of ant system and simulated annealing for the p-median problem. Autom Remote Control 65:431–438
Plastria F (1996) Optimal location of undesirable facilities: an overview. Belg J Oper Res Stat Comput Sci 36:109–127
Resende MGC, Werneck R (2004) A Hybrid heuristic for the p-median problem. J Heuristics 10:59–88
Rolland E, Schilling DA, Current JR (1996) An efficient tabu search heuristic for the p-median problem. Eur J Oper Res 96:329–342
Teitz MB, Bart P (1968) Heuristic methods for estimating generalized vertex median of a weighted graph. Oper Res 16:955–961
Whitaker R (1983) A fast algorithm for the greedy interchange for large-scale clustering and median location problems. INFOR 21:95–108
Author information
Authors and Affiliations
Corresponding author
Additional information
This research has partially been supported by the Spezialforschungsbereich F 003 “Optimierung und Kontrolle”, Projektbereich Diskrete Optimierung.
Rights and permissions
About this article
Cite this article
Fathali, J., Kakhki, H.T. & Burkard, R.E. An ant colony algorithm for the pos/neg weighted p-median problem. 14, 229–246 (2006). https://doi.org/10.1007/s10100-006-0001-z
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10100-006-0001-z