| dc.creator | De Franca F.O. | |
| dc.creator | Von Zuben F.J. | |
| dc.creator | De Castro L.N. | |
| dc.date | 2005 | |
| dc.date | 2015-06-26T14:07:31Z | |
| dc.date | 2015-11-26T15:41:47Z | |
| dc.date | 2015-06-26T14:07:31Z | |
| dc.date | 2015-11-26T15:41:47Z | |
| dc.date.accessioned | 2018-03-28T22:50:20Z | |
| dc.date.available | 2018-03-28T22:50:20Z | |
| dc.identifier | | |
| dc.identifier | Informatica (ljubljana). , v. 29, n. 2, p. 163 - 171, 2005. | |
| dc.identifier | 3505596 | |
| dc.identifier | | |
| dc.identifier | http://www.scopus.com/inward/record.url?eid=2-s2.0-24744440406&partnerID=40&md5=5cc5edde0d2851aac9f55fa64f5e8a1e | |
| dc.identifier | http://www.repositorio.unicamp.br/handle/REPOSIP/93373 | |
| dc.identifier | http://repositorio.unicamp.br/jspui/handle/REPOSIP/93373 | |
| dc.identifier | 2-s2.0-24744440406 | |
| dc.identifier.uri | http://repositorioslatinoamericanos.uchile.cl/handle/2250/1264702 | |
| dc.description | 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 of 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. | |
| dc.description | 29 | |
| dc.description | 2 | |
| dc.description | 163 | |
| dc.description | 171 | |
| dc.description | Osman, I.H., Christofides, N., Capacitated clustering problems by hybrid simulated annealing and tabu search (1994) Int. Trans. Opl. Res., 1 (3), pp. 317-336. , Pergamon Press, England, 1994 | |
| dc.description | Garey, M.R., Johnson, D.S., (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness, , San Francisco: Freeman | |
| dc.description | Dorigo, M., (1992) Optimization, Learning and Natural Algorithms, , Ph.D.Thesis, Politecnico di Milano. Italy, in Italian | |
| dc.description | Dorigo, M., Di Caro, G., The ant colony optimization meta-heuristic (1999) New Ideas in Optimization, pp. 11-32. , D. Corne, M. Dorigo and F. Glover (Eds.) McGraw Hill, London, UK, Chapter 2 | |
| dc.description | De França, F.O., Von Zuben, F.J., De Castro, L.N., Definition of capacited p-Medians by a modified max min ant system with local search (2004) Lecture Notes in Computer Science, 3316, pp. 1094-1100. , ICONIP - 2004 11th International Conference on Neural Information Processing - SPECIAL SESSION ON ANT COLONY AND MULTI-AGENT SYSTEMS, 2004, Calcutta | |
| dc.description | Dorigo, M., Stützle, T., The ant colony optimization metaheuristic: Algorithms, applications, and advances (2003) Handbook of Metaheuristics, pp. 251-286. , F. Glover and G. A. Ko chenberger, Kluwer Academic Press, Chapter 9 | |
| dc.description | De Castro, L.N., Von Zuben, F.J., (2004) Recent Developments in Biologically Inspired Computing, , Idea Group Inc | |
| dc.description | Stü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. Bäck, Z. Michalewicz, and X. Yao, editors, IEEE Press, Piscataway, NJ, USA | |
| dc.description | Stützle, 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.description | Ahmadi, S., Osman, I.H., Density based problem space search for the capacitated clustering problem (2004) Annals for Operational Research, , in press | |
| dc.description | Resende, 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'03), pp. 119-127. , Richard E. Ladner (Ed.), SIAM, Philadelphia | |
| dc.description | Teitz, 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.description | Blum, C., Roli, A., Hcaco, D.M., The hyper-cube framework for Ant Colony Optimization (2001) Proceedings of MIC'2001 - Metaheuristics International Conference, 2, pp. 399-403. , Porto, Portugal | |
| dc.description | Blum, 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.description | Lorena, 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.language | en | |
| dc.publisher | | |
| dc.relation | Informatica (Ljubljana) | |
| dc.rights | aberto | |
| dc.source | Scopus | |
| dc.title | Max Min Ant System And Capacitated P-medians: Extensions And Improved Solutions | |
| dc.type | Artículos de revistas | |
