Clustering search algorithm for the capacitated centered clustering problem

Computers and Operations Research

Volumn 37, Issue 3, 2010, Pages 552-558

  Chaves, Antonio Augusto ^a   Lorena, Luiz Antonio Nogueira ^a  

^a INSTITUTO NACIONAL DE PESQUISAS ESPACIAIS   (Brazil)

Author keywords

Clustering problems; Clustering search algorithm; Hybrid metaheuristics

Indexed keywords

CAPACITY LIMIT; CLUSTERING PROBLEMS; CLUSTERING SEARCH ALGORITHM; COMPUTATIONAL RESULTS; COMPUTATIONAL TIME; DISJOINT CLUSTERS; HYBRID METAHEURISTICS; LOCAL SEARCH HEURISTICS; METAHEURISTIC; SEARCH ALGORITHMS; SEARCH SPACES; SOLUTION PROCEDURE; TEST PROBLEM;

HEURISTIC ALGORITHMS; HEURISTIC METHODS; LEARNING ALGORITHMS;

CLUSTERING ALGORITHMS;

EID: 70349295872     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2008.09.011     Document Type: Article

References (19)

1. Christofides N., and Beasley J.E. A tree search algorithm for the p-median problem. European Journal of Operational Research 10 (1981) 196-204
2. Osman I.H., and Christofides N. Capacitated clustering problems by hybrid simulated annealing and tabu search. International Transactions in Operational Research 1 3 (1994) 317-336
3. Negreiros M.J.N., and Palhano A.W.C. The capacitated centred clustering problem. Computers and Operations Research 33 6 (2006) 1639-1663
4. Oliveira ACM, Lorena LAN. Detecting promising areas by evolutionary clustering search. Advances in artificial intelligence. In: Springer lecture notes in artificial intelligence series, 2004. p. 385-94.
5. Oliveira ACM, Lorena LAN. Hybrid evolutionary algorithms and clustering search. In: Grosan C, Abraham A, Ishibuchi H, editors. Hybrid evolutionary systems-studies in computational intelligence. Springer SCI series, 2007. p. 81-102.
6. Kirkpatrick S., Gelatt C.D., and Vecchi M.P. Optimization by simulated annealing. Science 220 4598 (1983) 671-680
7. Forgy E.W. Cluster analysis of multivariate data: efficiency versus interpretability of classifications. Biometrics 21 3 (1965) 768
8. Lorena L.A.N., and Senne E.L.F. Local search heuristics for capacitated p-median problems. Networks and Spatial Economics 3 4 (2003) 407-419
9. Lorena L.A.N., and Senne E.L.F. A column generation approach to capacitated p-median problems. Computers and Operational Research 31 (1994) 863-876
10. Diaz J.A., and Fernandez E. Hybrid scatter search and path relinking for the capacitated p-median problem. European Journal of Operational Research 169 (2006) 570-585
11. Scheuerer S., and Wendolsky R. A scatter search heuristic for the capacitated clustering problem. European Journal of Operational Research 169 (2006) 533-547
12. Fleszar K, Hindi DS. An effective VNS for the capacitated p-median problem. European Journal of Operational Research 2007, doi:10.1016/j.ejor.2006.12.055.
13. Chaves A.A., Correa F.A., and Lorena L.A.N. Clustering search heuristic for the capacitated p-median problem. Springer Advances in Software Computing Series 44 (2007) 136-143
14. Wesolowsky G. The Weber problem: history and perspectives. Location Science 1 (1993) 5-23
15. Brimberg J., Hansen P., Mladenovic N., and Salhi S. A survey of solution methods for the continuous location-allocation problem. International Journal of Operations Research 5 1 (2008) 1-12
16. Aras N., Orbay M., and Altinel I.K. Efficient heuristics for the rectilinear distance capacitated multi-facilityWeber problem. Journal of the Operational Research Society 59 (2008) 64-79
17. Chaves A.A., and Lorena L.A.N. Hybrid algorithms with detection of promising areas for the prize collecting traveling salesman problem. International Conference on Hybrid Intelligent Systems, IEEE Computer Society (2005) 49-54
18. Glover F. Tabu search and adaptive memory programming: advances, applications and challenges. Interfaces in Computer Science and Operations Research (1996) 1-75
19. Ribeiro G, Nagano MS, Lorena LAN. Hybrid evolutionary algorithm for flowtime minimisation in no-wait flowshop scheduling. Berlin Heidelberg: Springer; 2007. p. 1099-109.