dc.creatorDe Franca F.O.
dc.creatorVon Zuben F.J.
dc.creatorDe Castro L.N.
dc.date2004
dc.date2015-06-26T14:23:50Z
dc.date2015-11-26T14:12:30Z
dc.date2015-06-26T14:23:50Z
dc.date2015-11-26T14:12:30Z
dc.date.accessioned2018-03-28T21:13:07Z
dc.date.available2018-03-28T21:13:07Z
dc.identifier
dc.identifierLecture Notes In Computer Science (including Subseries Lecture Notes In Artificial Intelligence And Lecture Notes In Bioinformatics). , v. 3316, n. , p. 1094 - 1100, 2004.
dc.identifier3029743
dc.identifier
dc.identifierhttp://www.scopus.com/inward/record.url?eid=2-s2.0-35048887599&partnerID=40&md5=aaa77a366418ad03f0d5617347279948
dc.identifierhttp://www.repositorio.unicamp.br/handle/REPOSIP/94265
dc.identifierhttp://repositorio.unicamp.br/jspui/handle/REPOSIP/94265
dc.identifier2-s2.0-35048887599
dc.identifier.urihttp://repositorioslatinoamericanos.uchile.cl/handle/2250/1242012
dc.descriptionThis 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. © Springer-Verlag Berlin Heidelberg 2004.
dc.description3316
dc.description
dc.description1094
dc.description1100
dc.descriptionOsman, I.H., Christofides, N., Capacitated Clustering Problems by Hybrid Simulated Annealing and Tabu Search (1994) Int. Trans. Opl. Res., 1 (3), pp. 317-336. , Pergamons Press, England, 1994
dc.descriptionGarey, M.R., Johnson, D.S., (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, , San Francisco: Freeman
dc.descriptionDorigo, M., (1992) Optimization, Learning and Natural Algorithms, , Ph.D.Thesis, Politecnico di Milano, Italy, in Italian
dc.descriptionStützle, T., Hoos, H.H., The MAX-MIN ant system and local search for the traveling salesman problem (1997) Proceedings of the IEEE International Conference on Evolutionary Computation (ICEC'97), pp. 309-314. , T. Back, Z. Michalewicz, and X. Yao, editors, IEEE Press, Piscataway, NJ, USA
dc.descriptionStützte, T., Dorigo, M., ACO algorithms for the Quadratic Assignment Problem (1999) New Ideas in Optimization, pp. 33-50. , D. Corne, M. Dorigo, and F. Glover, editors, McGraw-Hill
dc.descriptionAhmadi, S., Osman, I.H., Density based problem space search for the capacitated clustering problem (2004) Annals for Operational Research, , in press
dc.descriptionResende, G.C.M., Werneck, F.R., On the implementation of a swap-based local search procedure for the p-median problem (2003) Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments (ALENEX'O3), pp. 119-127. , Richard E. Ladner (Ed.), SIAM, Philadelphia
dc.descriptionTeitz, M.B., Bart, P., Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph (1968) Operation Research, 16 (5), pp. 955-961
dc.descriptionDe França, P.O., Von Zuben, F.J., De Castro, L.N., A Max Min Ant System Applied to the Capacitated Clustering Problem (2004) IEEE International Workshop on Machine Learning for Signal Processing, , São Luis, Brazil
dc.descriptionBlum, C., Roli, A., Dorigo, M., Hc-Aco: The hyper-cube framework for Ant Colony Optimization (2001) Proceedings of MIC'2001 - Meta-heuristics International Conference, 2, pp. 399-403. , Porto, Portugal
dc.descriptionBlum, C., Dorigo, M., The Hyper-Cube Framework for Ant Colony Optimization (2004) IEEE Transactions on Systems, Man and Cybernetics, Part B, 34 (2), pp. 1161-1172
dc.descriptionLorena, L.A.N., Senne, E.L.F., Local Search Heuristics for Capacitated P-Median Problems (2003) Networks and Spatial Economics, 3, pp. 407-419
dc.languageen
dc.publisher
dc.relationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
dc.rightsfechado
dc.sourceScopus
dc.titleDefinition Of Capacited P-medians By A Modified Max Min Ant System With Local Search
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución