Sivanandam - Introduction to Genetic Algorithms (Springer, 2008).pdf
(
9664 KB
)
Pobierz
654145654 UNPDF
Introduction to Genetic Algorithms
S.N.Sivanandam
·
S.N.Deepa
Introduction to Genetic
Algorithms
With 193 Figures and 13 Tables
Authors
S.N.Sivanandam
Professor and Head
Dept. of Computer Science and Engineering
PSG College of Technology
Coimbatore - 641 004
TN, India
S.N.Deepa
Ph.D Scholar Dept. of Computer Science
and Engineering
PSG College of Technology
Coimbatore - 641 004
TN, India
Library of Congress Control Number: 2007930221
ISBN 978-3-540-73189-4 Springer Berlin Heidelberg New York
This work is subject to copyright. All rights are reserved, whether the whole or part of the material is
concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting,
reproduction on microfilm or in any other way, and storage in data banks. Duplication of this publication
or parts thereof is permitted only under the provisions of the German Copyright Law of September 9,
1965, in its current version, and permission for use must always be obtained from Springer. Violations
are liable for prosecution under the German Copyright Law.
Springer is a part of Springer Science+Business Media
springer.com
c
The use of general descriptive names, registered names, trademarks, etc. in this publication does not
imply, even in the absence of a specific statement, that such names are exempt from the relevant protective
laws and regulations and therefore free for general use.
Typesetting: Integra Software Services Pvt. Ltd., India
Cover design: Erich Kirchner, Heidelberg
Printed on acid-free paper
SPIN: 12053230
89/3180/Integra
5 4 3 2 1 0
Springer-Verlag Berlin Heidelberg 2008
Preface
The origin of evolutionary algorithms was an attempt to mimic some of the processes
taking place in natural evolution. Although the details of biological evolution are
not completely understood (even nowadays), there exist some points supported by
strong experimental evidence:
•
Evolution is a process operating over chromosomes rather than over organisms.
The former are organic tools encoding the structure of a living being, i.e., a crea-
ture is “built” decoding a set of chromosomes.
•
Natural selection is the mechanism that relates chromosomes with the efficiency
of the entity they represent, thus allowing that efficient organism which is well-
adapted to the environment to reproduce more often than those which are not.
•
The evolutionary process takes place during the reproduction stage. There exists
a large number of reproductive mechanisms in Nature. Most common ones are
mutation (that causes the chromosomes of offspring to be different to those of
the parents) and recombination (that combines the chromosomes of the parents
to produce the offspring).
Based upon the features above, the three mentioned models of evolutionary com-
puting were independently (and almost simultaneously) developed.
An Evolutionary Algorithm (EA) is an iterative and stochastic process that op-
erates on a set of individuals (population). Each individual represents a potential
solution to the problem being solved. This solution is obtained by means of a en-
coding/decoding mechanism. Initially, the population is randomly generated (per-
haps with the help of a construction heuristic). Every individual in the population
is assigned, by means of a fitness function, a measure of its goodness with respect
to the problem under consideration. This value is the quantitative information the
algorithm uses to guide the search.
Among the evolutionary techniques, the genetic algorithms (GAs) are the most
extended group of methods representing the application of evolutionary tools. They
rely on the use of a selection, crossover and mutation operators. Replacement is
usually by generations of new individuals.
Intuitively a GA proceeds by creating successive generations of better and better
individuals by applying very simple operations. The search is only guided by the
fitness value associated to every individual in the population. This value is used
to rank individuals depending on their relative suitability for the problem being
v
Plik z chomika:
Yohoho25
Inne pliki z tego folderu:
Alpaydin - Introduction to Machine Learning (MIT, 2004).pdf
(37036 KB)
An Intro to Computer Simulation Methods - Applns to Physical Systems 3rd ed. - H. Gould, et al., [poor scan, dp] (Pearson, 2007) WW.pdf
(41874 KB)
An Introduction to Neural Networks (Math Computer Science).PDF
(1293 KB)
An Introduction to Neural Networks - Patrick van der Smagt.pdf
(1293 KB)
An Introduction to Neural Networks 8th ed. - B. Krose, P. Van der Smagt (1996) WW.pdf
(1293 KB)
Inne foldery tego chomika:
Algorithms & Data Structures
Computer Vision & Graphics & Image Processing
Game Programming
HDL Books - VHDL FPGA CPLD Verilog Digital Electronics eBook
Low Level
Zgłoś jeśli
naruszono regulamin