Genetic Algorithms and Engineering Optimization
A comprehensive guide to a powerful new analytical tool by two of its foremost innovators
The past decade has witnessed many exciting advances in the use of genetic algorithms (GAs) to solve optimization problems in everything from product design to scheduling and client/server networking. Aided by GAs, analysts and designers now routinely evolve solutions to complex combinatorial and multiobjective optimization problems with an ease and rapidity unthinkable withconventional methods. Despite the continued growth and refinement of this powerful analytical tool, there continues to be a lack of up–to–date guides to contemporary GA optimization principles and practices. Written by two of the world′s leading experts in the field, this book fills that gap in the literature.
Taking an intuitive approach, Mitsuo Gen and Runwei Cheng employ numerous illustrations and real–world examples to help readers gain a thorough understanding of basic GA concepts–including encoding, adaptation, and genetic optimizations–and to show how GAs can be used to solve an array of constrained, combinatorial, multiobjective, and fuzzy optimization problems. Focusing on problems commonly encountered in industry–especially in manufacturing–Professors Gen and Cheng provide in–depth coverage of advanced GA techniques for:
∗ Reliability design
∗ Manufacturing cell design
∗ Advanced transportation problems
∗ Network design and routing
Genetic Algorithms and Engineering Optimization is an indispensable working resource for industrial engineers and designers, as well as systems analysts, operations researchers, and management scientists working in manufacturing and related industries. It also makes an excellent primary or supplementary text for advanced courses in industrial engineering, management science, operations research, computer science, and artificial intelligence.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
adaptive applied assigned beam search calculated cell design chromosome combinatorial optimization computation constraints cost crossover operator decision maker defined denote design problem determine dissertation edge evaluation evolutionary example feasible fitness function fitness value follows gene genetic algorithm approach genetic operators genetic search given go to step goal programming graph heuristic ideal point individuals initial population integer programming knapsack problem linear programming m-GA matrix max-gen membership function minimize minimum spanning tree multiobjective optimization mutation operator node nondominated nonlinear number of machines objective function objective value obtained offspring optimal solution optimization problems packet parameters parent Pareto optimal Pareto solutions path permutation pop-size Priifer number procedure process plan production programming problem proposed random number randomly real number representation roulette wheel selection scheduling problem selection sequence shown in Figure solve spanning tree problem st-GA strategy string techniques topological sort transportation problem variables vertex weight
Page 460 - A new representation and operators for genetic algorithms applied to grouping problems.