文档介绍：ic (Evolutionary) Algorithm: Introduction and its Use as an Engineering Design Tool
A A Adedeji
Department of Civil Engineering
University of Ilorin
Ilorin, Nigeria
2007
© A A Adedeji
No part of this book may be reproduced or stored in a retrieval
system transmitted in any form or by any means, and only by
photocopying or recording for the purpose of research for which
no permission is sought from the author.
Published by:
OLAD PUBLISHERS & PRINTING ENTERPRISES
Head Office: No. 45/70, Niger Road,
Ilorin, Kwara State, Nigeria
ISBN NO: 978 – 8115 – 86 - 1
Printed by: puter Centre
Preface
The theory of evolution was once in scientific circles.
Charles Darwin theorised the evolution as a sort of survival of the fittest or simply put: if you are fit you survive. A single cell would struggle hard, among a pool of cells, to survive, while another cell would also struggle harder and another very hard, but who ever is fit among the population of cells would survive. Survival in this sense does not mean that the harder the fitness, rather the survival is fit by random selection or chaos and not by order. The random chance of variation together with the law of selection is a problem-solving method of immerse power.
This book introduces the use of this principle to optimise design of engineering problems and give putations to some examples and generic idea puter programming.
Adedeji, A. A.
Table of Contents
Preface iii
Table of contents iv
Introduction 1
Objective of the Book 3
Brief History of ic (Evolutionary)
Algorithms 4
Generic System in ic Algorithms 6
Chromosomal representation 6
Initial population 7
Fitness evaluation 7
Selection 8
Elitist 8
Linear rank selection 8
Roulette wheel selection 9
Stochastic universal sampling 10
Truncation selection 11
Tournament selection 11
Reproduction 11
Crossover 11
Mutation 11
Strength of ic Algorithms 14
Limitations of ic Algorithms 16
Some Specific Application of ic Algorithm 17