A scatter search approach for the minimum sum-of-squares clustering problem

Computers and Operations Research

Volumn 32, Issue 5, 2005, Pages 1325-1335

  Pacheco, Joaquín A ^a  

^a UNIVERSITY OF BURGOS   (Spain)

Author keywords

Clusterization; GRASP; Local search; Metaheuristics; Path relinking; Scatter search; Tabu search

Indexed keywords

AQUIFERS; DECISION MAKING; GROUNDWATER; IRRIGATION; OPTIMIZATION; PROBLEM SOLVING; RESERVOIRS (WATER); SEAWATER; SENSITIVITY ANALYSIS; WATER QUALITY;

CHANCE CONTRAINTS; DEFICIT IRRIGATION; RESERVOIR MANAGEMENT; STOCHASTIC DEMAND; STOCHASTIC SUPPLY;

MATHEMATICAL MODELS;

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

References (22)

1. Brucker P. On the complexity of clustering problems. Lecture notes in economics and mathematical systems, vol. 157, 1978. p. 45-54.
2. Koontz W.L.G., Narendra P.M., Fukunuga K. A branch and bound clustering algorithm. IEEE Transactions on Computers. C-24:1975;908-915.
3. Diehr G. Evaluation of a branch and bound algorithm for clustering. SIAM Journal on Scientific and Statistical Computing. 6:1985;268-284.
4. du Merle O., Hansen P., Jaumard B., Mladenovic N. An interior point algorithm for minimum sum of squares clustering. SIAM Journal on Scientific Computing. 21(4):2000;1485-1505.
5. Jancey R.C. Multidimensional group analysis. Australian Journal of Botany. 14:1966;127-130.
6. Howard R. Classifying a population into homogeneous groups. Lawrence J.R. Operational research in the social sciences. 1966;Tavistock, London.
7. Hansen P., Mladenovic N. J-Means. a new local search heuristic for minimum sum-of-squares clustering Pattern Recognition. 34(2):2001;405-413.
8. Klein R.W., Dubes R.C. Experiments in projection and clustering by simulated annealing. Pattern Recognition. 22:1989;213-220.
9. Al-Sultan K.H. A tabu search approach to the clustering problem. Pattern Recognition. 28:1995;1443-1451.
10. Babu G.P., Murty M.N. A near-optimal initial seed value selection in K-means algorithm using genetic algorithms. Pattern Recognition Letters. 14:1993;763-769.
11. Pacheco J., Valencia O. Design of hibrids for the minimum sum-of-squares clustering problem. Computational Statistics and Data Analysis. 43(2):2003;235-248.
12. Glover F. A template for scatter search and path relinking. Hao J.-.K., Lutton E., Ronald E., Schoenauer M., Snyers D. Artificial evolution. Lecture notes in computer science, vol. 1363. 1998;13-54 Springer, Berlin.
13. Glover F., Laguna M., Martí R. Fundamentals of scatter search and path relinking. Control and Cybernetics. 39(3):2000;653-684.
14. Laguna M. Scatter search. Pardalos P.M., Resende M.G.C. Handbook of applied optimization. 2002;183-193 Oxford University Press, New York.
15. Feo T.A., Resende M.G.C. A probabilistic heuristic for a computationally difficult set covering problem. Operations Research Letters. 8:1989;67-71.
16. Feo T.A., Resende M.G.C. Greedy randomized adaptive search procedures. Journal of Global Optimization. 2:1995;1-27.
17. Pitsoulis L.S., Resende M.G.C. Greedy randomized adaptive search procedures. Pardalos P.M., Resende M.G.C. Handbook of applied optimization. 2002;168-182 Oxford University Press, Oxford.
18. Campos V., Glover F., Laguna M., Martí R. An experimental evaluation of a scatter search for the linear ordering problem. Journal of Global Optimization. 21:2001;397-414.
19. Späth H. Cluster analysis algorithms for data reduction and classification of objects. 1980;Ellis Horwood, Chichester.
20. Adenso-Díaz B., Laguna M. Automated fine tuning of algorithms with taguchi fractional experimental designs and local search. 2001;University of Colorado, Boulder.
21. Beltrán M., Pacheco J. Nuevos métodos para el diseño de cluster no jerárquicos. Una aplicación a los municipios de Castilla y León. Estadística Española. Instituto Nacional de Estadística. 43(148):2001;209-224. available in www.ine.es.
22. Reinelt G. TSPLIB. a travelling salesman problem library ORSA Journal on Computing. 3:1991;376-384.