Genetic Algorithms and Engineering DesignThe last few years have seen important advances in the use ofgenetic algorithms to address challenging optimization problems inindustrial engineering. Genetic Algorithms and Engineering Designis the only book to cover the most recent technologies and theirapplication to manufacturing, presenting a comprehensive and fullyup-to-date treatment of genetic algorithms in industrialengineering and operations research. Beginning with a tutorial on genetic algorithm fundamentals andtheir use in solving constrained and combinatorial optimizationproblems, the book applies these techniques to problems in specificareas--sequencing, scheduling and production plans, transportationand vehicle routing, facility layout, location-allocation, andmore. Each topic features a clearly written problem description,mathematical model, and summary of conventional heuristicalgorithms. All algorithms are explained in intuitive, rather thanhighly-technical, language and are reinforced with illustrativefigures and numerical examples. Written by two internationally acknowledged experts in the field,Genetic Algorithms and Engineering Design features originalmaterial on the foundation and application of genetic algorithms,and also standardizes the terms and symbols used in othersources--making this complex subject truly accessible to thebeginner as well as to the more advanced reader. Ideal for both self-study and classroom use, this self-containedreference provides indispensable state-of-the-art guidance toprofessionals and students working in industrial engineering,management science, operations research, computer science, andartificial intelligence. The only comprehensive, state-of-the-arttreatment available on the use of genetic algorithms in industrialengineering and operations research . . . Written by internationally recognized experts in the field ofgenetic algorithms and artificial intelligence, Genetic Algorithmsand Engineering Design provides total coverage of currenttechnologies and their application to manufacturing systems.Incorporating original material on the foundation and applicationof genetic algorithms, this unique resource also standardizes theterms and symbols used in other sources--making this complexsubject truly accessible to students as well as experiencedprofessionals. Designed for clarity and ease of use, thisself-contained reference: * Provides a comprehensive survey of selection strategies, penaltytechniques, and genetic operators used for constrained andcombinatorial optimization problems * Shows how to use genetic algorithms to make production schedules,solve facility/location problems, make transportation/vehiclerouting plans, enhance system reliability, and much more * Contains detailed numerical examples, plus more than 160auxiliary figures to make solution procedures transparent andunderstandable |
From inside the book
Results 1-5 of 35
Page 101
Sorry, this page's content is restricted.
Sorry, this page's content is restricted.
Page 104
Sorry, this page's content is restricted.
Sorry, this page's content is restricted.
Page 110
Sorry, this page's content is restricted.
Sorry, this page's content is restricted.
Page 118
Sorry, this page's content is restricted.
Sorry, this page's content is restricted.
Page 119
Sorry, this page's content is restricted.
Sorry, this page's content is restricted.
Contents
I | 1 |
II | 7 |
III | 16 |
IV | 20 |
V | 31 |
VI | 34 |
VII | 42 |
IX | 49 |
XXXIII | 191 |
XXXIV | 197 |
XXXV | 202 |
XXXVI | 223 |
XXXVII | 226 |
XXXVIII | 228 |
XXXIX | 230 |
XL | 231 |
X | 68 |
XI | 76 |
XII | 83 |
XIII | 97 |
XIV | 98 |
XV | 103 |
XVI | 107 |
XVII | 118 |
XVIII | 128 |
XIX | 133 |
XXI | 139 |
XXII | 144 |
XXIII | 151 |
XXIV | 156 |
XXV | 163 |
XXVI | 173 |
XXVII | 174 |
XXVIII | 176 |
XXIX | 179 |
XXX | 182 |
XXXI | 186 |
XXXII | 190 |
XLI | 234 |
XLII | 244 |
XLIII | 247 |
XLIV | 249 |
XLV | 253 |
XLVI | 262 |
XLVII | 263 |
XLVIII | 271 |
XLIX | 278 |
L | 283 |
LI | 292 |
LII | 293 |
LIII | 295 |
LIV | 299 |
LV | 310 |
LVI | 330 |
LVII | 341 |
LVIII | 359 |
LIX | 366 |
LX | 373 |
Other editions - View all
Common terms and phrases
approach assigned beam search best chromosome bicriteria calculated Cheng chromosome combinatorial optimization constraints crossover operator decoding denote determine due date encoding end end eval(v Evolutionary Computation example facility layout failure modes feasible solution fitness value flow-shop fuzzy number genes genetic algorithms genetic operators genetic search goal programming heuristic infeasible solutions initial population integer interval programming job-shop problem job-shop scheduling problem knapsack problem layout problem linear m₁ method Michalewicz minimize minimum spanning tree mutation mutation operator neat clearance nodes nonlinear nonlinear programming objective function offspring Operations Research optimal solution p₁ parameters parent Pareto solutions partial schedule penalty function permutation pop_size position procedure programming problem proposed random number randomly real number reliability optimization representation selection sequence shown in Figure solve Step stochastic strategy subsystem subtour Table techniques tion transportation problem traveling salesman problem v₁ variable vertex Xijk zmin ΣΣ