Global Optimization 1

List Price: $9.00

Add to Cart
About the author:
Brian Luke obtained BS degrees in Biology and Chemistry from the California Institute of Technology in 1975, and a Ph.D. in Theoretical Chemistry from the University of Southern California in December 1980. After a post-doctoral position at Carnegie Mellon University and jobs at SRI International and IBM, he currently works for SAIC-Frederick at the computing center of the National Cancer Institute at Frederick. He is manager of the Modeling Group and develops algorithms to examine large biological data sets.

Global Optimization 1

Using Genetic Methods on the (0,1)-Knapsack Problem

Authored by Brian T Luke Ph.D.

Finding the best solution to a combinatorial problem can be difficult due to the extremely large number of possible solutions. This book describes the application of Genetic Methods to one such problem; the (0,1)-Knapsack Problem. Part I presents an overview of several combinatorial problems and different solution methods. It then gives a detailed description of two search strategies; Genetic Algorithms and Evolutionary Programming. Both of these search strategies are population-based methodologies that use one or two members of the current population of solutions to generate a new solution and a heuristic "survival of the fittest" strategy to improve the performance of the population. Procedures are described for selecting parent solutions, generating new solutions and processing these offspring. Part II examines the performance of these algorithms on the (0,1)-Knapsack Problem and describes how software can be obtained and run to test other parameters.

Publication Date:
1449509312 / 9781449509316
Page Count:
Binding Type:
US Trade Paper
Trim Size:
6" x 9"
Black and White
Related Categories:
Mathematics / Reference

Site Help Order Help Policies Contact