skip to main content
10.1145/1363686.1364111acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
introduction
Free Access

Special track on Applications of Evolutionary Computation: editorial message

Published:16 March 2008Publication History

ABSTRACT

Evolutionary algorithms (EAs) are inspired by the mechanisms that underlie biological evolution: reproduction with variation, selection according to fitness, and repetition. An EA maintains a population of data structures that encode candidate solutions to the target problem instance. These data structures are usually strings of symbols and are called chromosomes. Associated with each chromosome is a numerical fitness that indicates the quality of the solution it represents, and chromosomes of better fitness are selected to be parents. Operators abstracted from genetic crossover and mutation, and bearing those names, generate novel chromosomes from the selected parents. As generations of chromosomes follow each other, representations of better solutions evolve. The algorithm halts and returns the best solution represented in its population after a specified number of generations or when the algorithm identifies a solution of adequate fitness.

Index Terms

  1. Special track on Applications of Evolutionary Computation: editorial message

            Recommendations

            Comments

            Login options

            Check if you have access through your login credentials or your institution to get full access on this article.

            Sign in
            • Published in

              cover image ACM Conferences
              SAC '08: Proceedings of the 2008 ACM symposium on Applied computing
              March 2008
              2586 pages
              ISBN:9781595937537
              DOI:10.1145/1363686

              Copyright © 2008 ACM

              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]

              Publisher

              Association for Computing Machinery

              New York, NY, United States

              Publication History

              • Published: 16 March 2008

              Permissions

              Request permissions about this article.

              Request Permissions

              Check for updates

              Qualifiers

              • introduction

              Acceptance Rates

              Overall Acceptance Rate1,650of6,669submissions,25%
            • Article Metrics

              • Downloads (Last 12 months)0
              • Downloads (Last 6 weeks)0

              Other Metrics

            PDF Format

            View or Download as a PDF file.

            PDF

            eReader

            View online with eReader.

            eReader