Abstract
This work introduces a modified MAX MIN Ant System (MMAS) designed to solve the Capacitated p-Medians Problem (CPMP). It presents the most relevant steps towards the implementation of an MMAS to solve the CPMP, including some improvements on the original MMAS algorithm, such as the use of a density model in the information heuristics and a local search adapted from the uncapacitated p-medians problem. Extensions to a recently proposed updating rule for the pheromone level, aiming at improving the MMAS ability to deal with large-scale instances, are also presented and discussed. Some simulations are performed using instances available from the literature, and well-known heuristics are employed for benchmarking.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Osman, I.H., Christofides, N.: Capacitated Clustering Problems by Hybrid Simulated Annealing and Tabu Search. Pergamons Press, England (1994); Int. Trans. Opl. Res. 1(3), 317–336 (1994)
Garey, M.R., Johnson, D.S.: Computers and Intractability: a Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)
Dorigo, M.: Optimization, Learning and Natural Algorithms. Ph.D.Thesis, Politecnico di Milano, Italy (1992) (in Italian)
Stützle, T., Hoos, H.H.: The MAX-MIN ant system and local search for the traveling salesman problem. In: Bäck, T., Michalewicz, Z., Yao, X. (eds.) Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC 1997), pp. 309–314. IEEE Press, Piscataway (1997)
Stützle, T., Dorigo, M.: ACO algorithms for the Quadratic Assignment Problem. In: Corne, D., Dorigo, M., Glover, F. (eds.) New Ideas in Optimization, pp. 33–50. McGraw-Hill, New York (1999)
Ahmadi, S., Osman, I.H.: Density based problem space search for the capacitated clustering problem. Annals for Operational Research (2004) (in press)
Resende, G.C.M., Werneck, F.R.: On the implementation of a swap-based local search procedure for the p-median problem. In: Ladner, R.E. (ed.) Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments (ALENEX 2003), pp. 119–127. SIAM, Philadelphia (2003)
Teitz, M.B., Bart, P.: Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph. Operation Research 16(5), 955–961 (1968)
De França, F.O., Von Zuben, F.J., De Castro, L.N.: A Max Min Ant System Applied to the Capacitated Clustering Problem. In: IEEE International Workshop on Machine Learning for Signal Processing, São Luis, Brazil (2004)
Blum, C., Roli, A., Dorigo, M.: Hc-Aco: The hyper-cube framework for Ant Colony Optimization. In: Proceedings of MIC 2001 - Meta-heuristics International Conference, Porto, Portugal, vol. 2, pp. 399–403 (2001)
Blum, C., Dorigo, M.: The Hyper-Cube Framework for Ant Colony Optimization. IEEE Transactions on Systems, Man and Cybernetics, Part B 34(2), 1161–1172 (2004)
Lorena, L.A.N., Senne, E.L.F.: Local Search Heuristics for Capacitated P-Median Problems. Networks and Spatial Economics 3, 407–419 (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Olivetti de França, F., Von Zuben, F.J., Nunes de Castro, L. (2004). Definition of Capacited p-Medians by a Modified Max Min Ant System with Local Search. In: Pal, N.R., Kasabov, N., Mudi, R.K., Pal, S., Parui, S.K. (eds) Neural Information Processing. ICONIP 2004. Lecture Notes in Computer Science, vol 3316. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30499-9_170
Download citation
DOI: https://doi.org/10.1007/978-3-540-30499-9_170
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23931-4
Online ISBN: 978-3-540-30499-9
eBook Packages: Springer Book Archive