Evolutionary Computation 1: Basic Algorithms and Operators

Note: Supplemental materials are not guaranteed with Rental or Used book purchases.

ISBN: 9780750306645 | 0750306645
Cover: Nonspecific Binding
Copyright: 1/1/2000

Rent

(Recommended)

$65.04

Term

Due

Price

Semester

Dec 13

$68.46

Quarter

Aug 16

$65.04

Short Term

Jul 9

$61.61

*This item is part of an exclusive publisher rental program and requires an additional convenience fee. This fee will be reflected in the shopping cart.
Buy New

Usually Ships in 3-5 Business Days

$93.54
eBook

Available Instantly

Online: 180 Days

Downloadable: 180 Days

$61.88

The field of evolutionary computation is expanding dramatically, fueled by the vast investment that reflects the value of applying its techniques. Culling material from the Handbook of Evolutionary Computation, Evolutionary Computation 1: Basic Algorithms and Operators contains up-to-date information on algorithms and operators used in evolutionary computing. This volume discusses the basic ideas that underlie the main paradigms of evolutionary algorithms, evolution strategies, evolutionary programming, and genetic programming. It is intended to be used by individual researchers, teachers, and students working and studying in this expanding field.

Preface

xiii

List of contributors

xvii

Glossary

xxi

PART 1 WHY EVOLUTIONARY COMPUTATION?

Introduction to evolutionary computation

(3)

David B Fogel

Introductory remarks

(1)

Optimization

(1)

Robust adaptation

(1)

Machine intelligence

(1)

Biology

(1)

Discussion

(1)

References

(1)

Possible applications of evolutionary computation

(16)

David Beasley

Introduction

(1)

Applications in planning

(2)

Applications in design

(1)

Applications in simulation and identification

(1)

Applications in control

(1)

Applications in classification

(1)

Summary

(10)

References

(8)

Further reading

(2)

Advantages (and disadvantages) of evolutionary computation over other approaches

(3)

Hans-Paul Schwefel

No-free-lunch theorem

(1)

Conclusions

(2)

References

(1)

PART 2 EVOLUTIONARY COMPUTATION: THE BACKGROUND

Principles of evolutionary processes

(4)

David B Fogel

Overview

(4)

References

(1)

Principles of genetics

(13)

Raymond C Paton

Introduction

(1)

Some fundamental concepts in genetics

(6)

The gene in more detail

(2)

Options for change

(1)

Population thinking

(5)

References

(2)

A history of evolutionary computation

(19)

Kenneth De Jong

David B Fogel

Hans-Paul Schwefel

Introduction

(1)

Evolutionary programming

(3)

Genetic algorithms

(4)

Evolution strategies

(11)

References

(8)

PART 3 EVOLUTIONARY ALGORITHMS AND THEIR STANDARD INSTANCES

Introduction to evolutionary algorithms

(5)

Thomas Back

General outline of evolutionary algorithms

(5)

References

(1)

Further reading

(2)

Genetic algorithms

(17)

Larry J Eshelman

Introduction

(1)

Genetic algorithm basics and some variations

(3)

Mutation and crossover

(7)

Representation

(2)

Parallel genetic algorithms

(1)

Conclusion

(3)

References

(3)

Evolution strategies

(8)

Gunter Rudolph

The archetype of evolution strategies

(2)

Contemporary evolution strategies

(3)

Nested evolution strategies

(3)

References

(2)

Evolutionary programming

(14)

V William Porto

Introduction

(1)

History

(7)

Current directions

(3)

Future research

100

(3)

References

100

(2)

Further reading

102

(1)

Derivative methods in genetic programming

103

(11)

Kenneth E Kinnear, Jr

Introduction

103

(1)

Genetic programming defined and explained

103

(5)

The development of genetic programming

108

(1)

The value of genetic programming

109

(5)

References

111

(1)

Further reading

112

(2)

Learning classifier systems

114

(10)

Robert E Smith

Introduction

114

(1)

Types of learning problem

114

(3)

Learning classifier system introduction

117

(1)

`Michigan' and `Pitt' style learning classifier systems

118

(1)

The bucket brigade algorithm (implicit form)

119

(1)

Internal messages

120

(1)

Parasites

120

(1)

Variations of the learning classification system

121

(1)

Final comments

122

(2)

References

122

(2)

Hybrid methods

124

(3)

Zbigniew Michalewicz

References

126

(1)

PART 4 REPRESENTATIONS

Introduction to representations

127

(5)

Kalyanmoy Deb

Solutions and representations

127

(1)

Important representations

128

(2)

Combined representations

130

(2)

References

131

(1)

Binary strings

132

(4)

Thomas Back

References

135

(1)

Real-valued vectors

136

(3)

David B Fogel

Object variables

136

(1)

Object variables and strategy parameters

137

(2)

References

138

(1)

Permutations

139

(12)

Darrell Whitley

Introduction

139

(2)

Mapping integers to permutations

141

(1)

The inverse of a permutation

141

(1)

The mapping function

142

(1)

Matrix representations

143

(2)

Alternative representations

145

(1)

Ordering schemata and other metrics

146

(3)

Operator descriptions and local search

149

(2)

References

149

(2)

Finite-state representations

151

(4)

David B Fogel

Introduction

151

(1)

Applications

152

(3)

References

154

(1)

Parse trees

155

(5)

Peter J Angeline

References

158

(2)

Guidelines for a suitable encoding

160

(3)

David B Fogel

Peter J Angeline

References

162

(1)

Other representations

163

(3)

Peter J Angeline

David B Fogel

Mixed-integer structures

163

(1)

Introns

163

(1)

Diploid representations

164

(2)

References

164

(2)

PART 5 SELECTION

Introduction to selection

166

(6)

Kalyanmoy Deb

Working mechanisms

166

(1)

Pseudocode

167

(3)

Theory of selective pressure

170

(2)

References

171

(1)

Proportional selection and sampling algorithms

172

(9)

John Grefenstette

Introduction

172

(1)

Fitness functions

172

(3)

Selection probabilities

175

(1)

Sampling

175

(1)

Theory

176

(5)

References

180

(1)

Tournament selection

181

(6)

Tobias Blicke

Working mechanism

181

(1)

Parameter settings

182

(1)

Formal description

182

(1)

Properties

183

(4)

References

185

(2)

Rank-based selection

187

(8)

John Grefenstette

Introduction

187

(1)

Linear ranking

188

(1)

Nonlinear ranking

188

(1)

(μ, γ), (μ + γ) and threshold selection

189

(1)

Theory

190

(5)

References

194

(1)

Boltzmann selection

195

(6)

Samir W Mahfoud

Introduction

195

(1)

Simulated annealing

196

(1)

Working mechanism for parallel recombinative simulated annealing

196

(1)

Pseudocode for a common variation of parallel recombinative simulated annealing

197

(1)

Parameters and their settings

197

(2)

Global convergence theory and proofs

199

(2)

References

200

(1)

Other selection methods

201

(4)

David B Fogel

Introduction

201

(1)

Tournament selection

201

(1)

Soft brood selection

202

(1)

Disruptive selection

202

(1)

Boltzmann selection

202

(1)

Nonlinear ranking selection

202

(1)

Competitive selection

203

(1)

Variable lifespan

203

(2)

References

204

(1)

Generation gap methods

205

(7)

Jayshree Sarma

Kenneth De Jong

Introduction

205

(1)

Historical perspective

206

(1)

Steady state and generational evolutionary algorithms

207

(3)

Elitist strategies

210

(2)

Refernces

211

(1)

A comparison of selection mechanisms

212

(16)

Peter J B Hancock

Introduction

212

(1)

Simulations

213

(1)

Population models

214

(1)

Equivalence: expectations and reality

214

(4)

Simulation results

218

(4)

The effects of evalution noise

222

(2)

Analytic comparison

224

(1)

Conclusions

225

(3)

References

225

(3)

Interactive evolution

228

(7)

Wolfgang Banzhaf

Introduction

228

(1)

History

228

(1)

The problem

229

(1)

The interactive evolution approach

229

(2)

Difficulties

231

(1)

Application areas

231

(1)

Further developments and perspectives

232

(3)

References

233

(1)

Further reading

234

(1)

PART 6 SEARCH OPERATORS

Introduction to search operators

235

(2)

Zbigniew Michalewicz

References

236

(1)

Mutation operators

237

(19)

Thomas Back

David B Fogel

Darrell Whitley

Peter J Angeline

Binary strings

237

(2)

Real-valued vectors

239

(4)

Permutations

243

(3)

Finite-state machines

246

(2)

Parse trees

248

(2)

Other representations

250

(6)

References

252

(4)

Recombination

256

(52)

Lashon B Booker

David B Fogel

Darrell Whitley

Peter J Angeline

A E Eiben

Binary strings

256

(14)

Real-valued vectors

270

(4)

Permutations

274

(10)

Finite-state machines

284

(2)

Crossover: parse trees

286

(3)

Other representations

289

(1)

Multiparent recombination

289

(19)

References

302

(6)

Other operators

308

(23)

Russell W Anderson

David B Fogel

Martin Schutz

The Baldwin effect

308

(9)

Knowledge-augmented operators

317

(2)

Gene duplication and deletion

319

(12)

References

326

(3)

Further reading

329

(2)

Index

331

Please wait while the item is added to your bag...

FREE SHIPPING

Amazon no longer offers textbook rentals. We do!

Evolutionary Computation 1: Basic Algorithms and Operators

Summary

Table of Contents

Supplemental Materials