A New Representation and Operators for Genetic Algorithms Applied to Grouping Problems-Reference-Cited by-同舟云学术

A New Representation and Operators for Genetic Algorithms Applied to Grouping Problems

Published:1994-06 Issue:2 Volume:2 Page:123-144
ISSN:1063-6560
Container-title:Evolutionary Computation
language:en
Short-container-title:Evolutionary Computation

Author:

Falkenauer Emanuel¹

Affiliation:

1. CRIF - Research Centre for Belgian Metalworking Industry Industrial Automation Division CP 106 - P4 50, av. F. D. Roosevelt B-1050 Brussels Belgium

Abstract

An important class of computational problems are grouping problems, where the aim is to group together members of a set (i.e., find a good partition of the set). We show why both the standard and the ordering GAs fare poorly in this domain by pointing out their inherent difficulty to capture the regularities of the functional landscape of the grouping problems. We then propose a new encoding scheme and genetic operators adapted to these problems, yielding the Grouping Genetic Algorithm (GGA). We give an experimental comparison of the GGA with the other GAs applied to grouping problems, and we illustrate the approach with two more examples of important grouping problems successfully treated with the GGA: the problems of Bin Packing and Economies of Scale.

Publisher

MIT Press - Journals

Subject

Computational Mathematics

Link

https://www.mitpressjournals.org/doi/pdf/10.1162/evco.1994.2.2.123

Reference18 articles.

1. Bhuyan, J. N., Raghavan, V. V. & Elayavalli, V. K. (1991). Genetic algorithm for clustering with an ordered representation. In R. K. Belew & L. B. Booker (Eds.), Proceedings of the Fourth International Conference on Genetic Algorithms (pp. 408-41 5). San Mateo, CA: Morgan Kaufmann.

2. Ding, H., El-Keib, A. A. & Smith, R. E. (1992). Optimal clustering of power nemorks using genetic algorithms (TCGA Report No. 92001). Tuscaloosa, AL: University of Alabama.

3. Falkenauer, E. (1991a). A genetic algorithm for grouping. In R. GutiCrrez & M. J. Valderrama (Eds.), Proceedings of the Fifth International Symposium on Applied Stochastic Models and Data Analysis (pp. 198-206). Granada, Spain: World Scientific.

4. Falkenauer, E. & Delchambre, A. (1992). A genetic algorithm for bin packing and line balancing. In Proceedings of the IEEE 1992 International Conference on Robotics and Automation (ipA92) (pp. 11 86-1192). Los Alamitos, CA: IEE Computer Society Press.

5. Falkenauer, E. (1994). Setting new limits in bin packing with a grouping G A using reduction (Technical Report R0108). Brussels, Belgium: CRIF Industrial Automation.

Cited by 140 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Metaheuristics for variable-size mixed optimization problems: A unified taxonomy and survey;Swarm and Evolutionary Computation;2024-08

2. Meta-Heuristics Algorithm for Computer Communications;Advances in Systems Analysis, Software Engineering, and High Performance Computing;2024-06-30

3. Genetic Clustering Algorithm Based on the Division and Combination of Layer Series of Development;International Journal of Pattern Recognition and Artificial Intelligence;2024-06-29

4. A GA-Based Scheduling Algorithm for Semiconductor-Product Thermal Cycling Tests;Lecture Notes in Electrical Engineering;2024

5. Metaheuristics for (Variable-Size) Mixed Optimization Problems: A Unified Taxonomy and Survey;2024