skip to main content
10.1145/2001576.2001644acmconferencesArticle/Chapter ViewAbstractPublication PagesgeccoConference Proceedingsconference-collections
research-article

The TransRAR crossover operator for genetic algorithms with set encoding

Published: 12 July 2011 Publication History

Abstract

This work introduces a new crossover operator specially designed to be used in genetic algorithms (GAs) that encode candidate solutions as sets of fixed cardinality. The Transmitting Random Assortment Recombination (TransRAR) operator proceeds by taking elements from a multiset, which is built by the union of the parent chromosomes, allowing repeated elements. If an element that is present in both parents is drawn, it is accepted with probability 1. Elements that belong to only one of the parents are accepted with a probability p, smaller than 1. The performance of this novel crossover operator is assessed in synthetic and real-world problems. In these problems, GAs that employ this type of crossover outperform those that use alternative operators for sets, such as Random Assortment Recombination (RAR), Random Respectful Recombination (R3) or Random Transmitting Recombination (RTR). Furthermore, TransRAR can be implemented very efficiently and is faster than RAR, its closest competitor in terms of overall performance.

References

[1]
J. E. Beasley. OR-library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41 (11):1069--1072, 1990.
[2]
K. D. Crawford, C. J. Hoelting, R. L. Wainwright, and D. Schoenefeld. A study of fixed-length subset recombination. In R. K. Belew and M. D. Vose (Eds.) Foundations of Genetic Algorithms 4, pages 365--378. Morgan Kaufmann, 1997.
[3]
D. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Weasley, Reading, MA, 1989.
[4]
J. H. Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, 1975.
[5]
B. A. Julstrom. Codings and operators in two genetic algorithms for the leaf-constrained minimum spanning tree problem. International Journal of Applied Mathematics and Computer Science, 14(3):385--396, 2004.
[6]
H. Kellerer, U. Pferschy, and D. Pisinger. Knapsack Problems. Springer Verlag, 2004.
[7]
S. Ku and B. Lee. A set-oriented genetic algorithm and the knapsack problem. In Proceedings of the IEEE World Congress on Evolutionary Computation (CEC2001), 2001.
[8]
P. Larranaga and J. A. Lozano, editors. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Publishers, 2002.
[9]
C. Lee, Z. Lee, and S. Su. A new approach for solving 0/1 knapsack problem. In Proceedings of the IEEE International Conference on Systems, Man and Cybernetics 2006, October 8--11, Taipei, Taiwan, 2006.
[10]
A. Lim and Z. Xu. A fixed-length subset genetic algorithm for the p-median problem. In Genetic and Evolutionary Computation GECCO 2003, Lecture Notes in Computer Science, volume 2724, pages 212--213, 2003.
[11]
H. Markowitz. Portfolio selection. Journal of Finance, 7:77--91, 1952.
[12]
X. Meng, Y. Zhu, and X. Wu. Improved dynamic programming algorithms for the 0--1 knapsack problem. In Proceedings of the 3rd IEEE International Conference on Computer Science and Information Technology (ICCSIT), 2010.
[13]
Z. Michalewicz. Genetic Algorithms + Data Structures = Evolution Programs. Springer Verlag, 1996.
[14]
R. Moral-Escudero, R. Ruiz-Torrubiano, and A. Suárez. Selection of optimal investment portfolios with cardinality constraints. In Proceedings of the IEEE World Congress on Evolutionary Computation, pages 2382--2388, 2006.
[15]
D. Pisinger. Where are the hard knapsack problems? Computers & Operations Research, 32:2271--2284, 2005.
[16]
N. J. Radcliffe. Genetic set recombination. In Foundations of Genetic Algorithms. Morgan Kaufmann Pulishers, 1993.
[17]
N. J. Radcliffe. The algebra of genetic algorithms. Annals of Maths and Artificial Intelligence, pages 339--384, 1994.
[18]
N. J. Radcliffe and F. George. A study in set recombination. In Proceedings of the 5th International Conference on Genetic Algorithms. Morgan Kaufmann Pulishers, 1993.
[19]
R. Ruiz-Torrubiano, S. Garcia-Moratilla, and A. Suarez. Optimization problems with cardinality constraints. In Y. Tenne and C. K. Goh, editors, Computational Intelligence in Optimization: Implementations and Applications. Springer Verlag, 2010.
[20]
A. Schaerf. Local search techniques for constrained portfolio selection problems. Computational Economics, 20:177--190, 2002.
[21]
J. Shapcott. Index tracking: genetic algorithms for investment portfolio selection. Technical report, EPCC-SS92--24, Edinburgh, Parallel Computing Centre, 1992.
[22]
A. Simoes and E. Costa. An evolutionary approach to the zero/one knapsack problem: Testing ideas from biology. In Proceedings of the Fifth International Conference on Artificial Neural Networks and Genetic Algorithms ICANNGA, 2001.

Cited By

View all

Index Terms

  1. The TransRAR crossover operator for genetic algorithms with set encoding

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    GECCO '11: Proceedings of the 13th annual conference on Genetic and evolutionary computation
    July 2011
    2140 pages
    ISBN:9781450305570
    DOI:10.1145/2001576
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 12 July 2011

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. crossover operators
    2. forma theory
    3. genetic algorithms

    Qualifiers

    • Research-article

    Conference

    GECCO '11
    Sponsor:

    Acceptance Rates

    Overall Acceptance Rate 1,669 of 4,410 submissions, 38%

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)3
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 19 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media