RGFGA: An efficient representation and crossover for grouping genetic algorithms

Evolutionary Computation

Volumn 13, Issue 4, 2005, Pages 477-499

  Tucker, Allan ^a   Crampton, Jason ^b   Swift, Stephen ^a  

^a BRUNEL UNIVERSITY   (United Kingdom)

^b UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Bin packing; Genetic algorithms; Grouping; Hill climbing; Multivariate time series; Restricted growth functions

Indexed keywords

ALGORITHM; ARTICLE; BIOLOGICAL MODEL; CLASSIFICATION; COMPARATIVE STUDY; COMPUTER SIMULATION; EVOLUTION; MUTATION;

ALGORITHMS; CLASSIFICATION; COMPUTER SIMULATION; EVOLUTION; MODELS, GENETIC; MUTATION;

EID: 33745463144     PISSN: 10636560     EISSN: 15309304     Source Type: Journal    
DOI: 10.1162/106365605774666903     Document Type: Article

References (30)

1. Altaian, D. G. (1991). Practical Statistics for Medical Research. Chapman and Hall/CRC, Boca Raton, FL.
2. Beasley, J. (1990). Or-library: Distributing test problems by electronic mail. European Journal on Operational Research, 41:1069-1072.
3. Er, M. (1988). A fast algorithm for generating set partitions. The Computer Journal, 31(3):283-284.
4. Falkenauer, E. (1996). A hybrid grouping genetic algorithm for bin packing. Journal of Heuristics, 2:5-30.
5. Falkenauer, E. (1999). Genetic Algorithms and Grouping Problems. John Wiley, New York,NY.
6. Friedman, N., Murphy, K., and Russell, S. (1998). Learning the structure of dynamic probabilistic networks. In Cooper, G. F. and Moral, S., editors, Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence, pages 139-147.
7. Garey, M. and Johnson, D. (1979). Computers and Intractability. W. H. Freeman and Company, New York, NY.
8. Goldberg, D. and Lingle, R. (1985). Alleles, loci, and the travelling salesman problem. In Proceedings of the First International Conference on Genetic Algorithms and their Applications, pages 154-159.
9. Hamming, R. (1950). Error detecting and error correcting codes. Bell Systems Technical Journal, 29:147-160.
10. Hancock, P. (1992). Genetic algorithms and permutation problems: a comparison of recombination operators for neural net structure specification. In Proceedings of COGANN-92: International Workshop on combinatorics of Genetic Algorithms and Neural Networks, pages 108-122.
11. Jain, A., Murty, M., and Flynn, P. (1999). Data clustering: A review. ACM Computing Surveys, 31(3):264-323.
12. Kaufman, L. and Rousseeuw, P. J. (1990). Finding Groups in Data: An Introduction to Cluster Analysis. John Wiley & Sons, New York, NY.
13. Kaye, R. (1976). A Gray code for set partitions. Information Processing Letters, 5(6):171-173.
14. Lutkepohl, H. (1993). Introduction to Multivariate Time Series Analysis. Springer-Verlag, London.
15. Mahfoud, S. (1995). Niching Methods for Genetic Algorithms. PhD thesis, University of Illinois at Urbana-Champaign, Urbana, IL.
16. McQueen, J. (1967). Some methods for classification and analysis of multivariate observations. In Proceedings of 5th Berkeley Symposium on Mathematics, Statistics and Probabiliity, volume 1, pages 281-298.
17. Michalewicz, Z. and Fogel, D. (2000). How to Solve It: Modern Heuristics. Springer Verlag, New York, NY.
18. Morrison, D. (1990). Multivariate Statistical Methods. McGraw-Hill, Inc., New York, NY, 3rd edition.
19. Pearson, K. and Lee, A. (1903). On the laws of inheritance in man: Inheritance of physical characters. Biometrika, 2(4):357-462.
20. Pole, A., West, M., and Harrison, P. (1994). Applied Bayesian Forecasting and Time Series Analysis. Chapman-Hall, New York, NY.
21. Proskurowski, A., Ruskey, F., and Smith, M. (1998). Analysis of algorithms for listing equivalence classes of k-ary strings. SIAM Journal on Discrete Mathematics, 11(1):94-109.
22. Radcliffe, N. (1991). Equivalence class analysis of genetic algorithms. Complex Systems, 5:183-205.
23. Radcliffe, N. and Surry, P. (1995). Fitness variance of formae and performance prediction. In Whitley, D. and Vose, M., editors, Foundations of genetic algorithms 3, pages 51-72, San Mateo. Morgan Kaufmann.
24. Reeves, C. and Yamada, T. (1998). Genetic algorithms, path relinking, and the flowshop sequencing problem. Evolutionary Computation, 6(1):45-60.
25. Sacerdoti, E. (1977). A Structure for Plans and Behavior. Elsevier North-Holland, Amsterdam, Holland.
26. Smith, T., Husbands, P., and O'Shea, M. (2001). Neutral networks and evolvability with complex genotype-phenotype mapping. In Proceedings of Advances in Artificial Life, 6th European Conference, ECAL2001, pages 272-281.
27. Swift, S., Tucker, A., Vinciotti, V., Martin, N., Orengo, C., Liu, X., and Kellam, P. (2004). Consensus clustering and functional interpretation of data. Genome Biology, 5(11:R94).
28. Tucker, A., Liu, X., and Ogden-Swift, A. (2001a). Evolutionary learning of dynamic probabilistic models with large time lags. The International Journal of Intelligent Systems, 16(5):621-646.
29. Tucker, A., Swift, S., and Liu, X. (2001b). Grouping multivariate time series via correlation. IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics, 31:235-245.
30. Ward, J. (1963). Hierarchical grouping to optimize an objective function. Journal of the American Statistical Association, 58:236-244.