Preface |
|
xiii | |
|
Foundations of Genetic Algorithms |
|
|
1 | (52) |
|
|
1 | (13) |
|
|
2 | (5) |
|
|
7 | (2) |
|
|
9 | (2) |
|
|
11 | (3) |
|
Adaptation of Genetic Algorithms |
|
|
14 | (13) |
|
|
15 | (1) |
|
|
16 | (2) |
|
|
18 | (9) |
|
|
27 | (13) |
|
|
27 | (7) |
|
Constrained Optimizations |
|
|
34 | (4) |
|
Combinatorial Optimizations |
|
|
38 | (1) |
|
Multiobjective Optimizations |
|
|
39 | (1) |
|
Recent Genetic Algorithm Dissertations |
|
|
40 | (13) |
|
Combinatorial Optimization Problems |
|
|
53 | (44) |
|
|
53 | (1) |
|
|
53 | (8) |
|
Airline Crew Scheduling Problems |
|
|
56 | (1) |
|
|
56 | (2) |
|
|
58 | (2) |
|
|
60 | (1) |
|
|
61 | (1) |
|
|
61 | (10) |
|
|
63 | (2) |
|
|
65 | (3) |
|
|
68 | (1) |
|
|
69 | (1) |
|
|
69 | (1) |
|
|
70 | (1) |
|
|
71 | (10) |
|
Multiple-Choice Knapsack Problem |
|
|
72 | (5) |
|
Multiconstraint Knapsack Problem |
|
|
77 | (4) |
|
Minimum Spanning Tree Problem |
|
|
81 | (16) |
|
Quadratic Minimum Spanning Tree Problem |
|
|
82 | (3) |
|
Degree-Constrained Minimum Spanning Tree Problem |
|
|
85 | (5) |
|
Bicriteria Minimum Spanning Tree Problem |
|
|
90 | (7) |
|
Multiobjective Optimization Problems |
|
|
97 | (45) |
|
|
97 | (1) |
|
Basic Concepts of Multiobjective Optimizations |
|
|
97 | (9) |
|
|
98 | (3) |
|
|
101 | (1) |
|
Basic Solution Approaches |
|
|
102 | (4) |
|
Structures and Properties of Problems |
|
|
106 | (1) |
|
Genetic Multiobjective Optimization |
|
|
106 | (9) |
|
Features of Genetic Search |
|
|
106 | (1) |
|
Fitness Assignment Mechanism |
|
|
107 | (4) |
|
Fitness Sharing and Population Diversity |
|
|
111 | (2) |
|
The Concept of Pareto Solution |
|
|
113 | (2) |
|
Vector-Evaluated Genetic Algorithms |
|
|
115 | (3) |
|
Pareto Ranking and Tournament Methods |
|
|
118 | (6) |
|
|
118 | (4) |
|
|
122 | (2) |
|
|
124 | (7) |
|
|
125 | (2) |
|
|
127 | (4) |
|
|
131 | (5) |
|
General Idea of the Distance Method |
|
|
131 | (2) |
|
Calculation of Distance Measure |
|
|
133 | (3) |
|
Application of the Distance Method |
|
|
136 | (1) |
|
|
136 | (2) |
|
Goal Programming Approach |
|
|
138 | (4) |
|
Fuzzy Optimization Problems |
|
|
142 | (52) |
|
|
142 | (1) |
|
|
143 | (13) |
|
Fuzzy Linear Programming Model |
|
|
143 | (6) |
|
Genetic Algorithm Approach |
|
|
149 | (3) |
|
|
152 | (2) |
|
|
154 | (2) |
|
Fuzzy Nonlinear Programming |
|
|
156 | (9) |
|
Nonlinear Programming Model |
|
|
157 | (4) |
|
Inexact Approach to FO/RNP-1 |
|
|
161 | (2) |
|
|
163 | (1) |
|
|
164 | (1) |
|
Fuzzy Nonlinear Mixed-Integer Goal Programming |
|
|
165 | (13) |
|
Fuzzy Nonlinear Mixed-Integer Goal Programming Model |
|
|
168 | (2) |
|
Genetic Algorithm Approach |
|
|
170 | (3) |
|
|
173 | (5) |
|
Fuzzy Multiobjective Integer Programming |
|
|
178 | (16) |
|
|
181 | (3) |
|
Augmented Minimax Problems |
|
|
184 | (1) |
|
Genetic Algorithm Approach |
|
|
185 | (4) |
|
Interactive Fuzzy Satisfaction Method |
|
|
189 | (1) |
|
|
190 | (4) |
|
Reliability Design Problems |
|
|
194 | (41) |
|
|
194 | (1) |
|
Network Reliability Design |
|
|
195 | (16) |
|
|
196 | (2) |
|
Dengiz, Altiparmak, and Smith's Approach |
|
|
198 | (6) |
|
Deeter and Smith's Approach |
|
|
204 | (7) |
|
Tree-Based Network Reliability and LAN Design |
|
|
211 | (10) |
|
Bicriteria Network Topology Design |
|
|
212 | (7) |
|
|
219 | (2) |
|
Multiobjective Reliability Design |
|
|
221 | (14) |
|
Bicriteria Reliability Design |
|
|
221 | (3) |
|
Genetic Algorithm Approach |
|
|
224 | (2) |
|
Hybrid Genetic Algorithm Approach |
|
|
226 | (4) |
|
Reliability Design with Fuzzy Goals |
|
|
230 | (5) |
|
|
235 | (62) |
|
|
235 | (1) |
|
|
235 | (18) |
|
|
236 | (1) |
|
|
236 | (2) |
|
Adapted Genetic Operators |
|
|
238 | (4) |
|
Heuristic-Featured Genetic Operators |
|
|
242 | (2) |
|
Hybrid Genetic Algorithms |
|
|
244 | (7) |
|
|
251 | (2) |
|
Grouped Job Scheduling Problem |
|
|
253 | (10) |
|
Problem Description and Necessary Condition |
|
|
253 | (2) |
|
|
255 | (2) |
|
|
257 | (2) |
|
|
259 | (1) |
|
|
260 | (1) |
|
|
260 | (1) |
|
|
261 | (2) |
|
Resource-Constrained Project Scheduling |
|
|
263 | (15) |
|
|
265 | (5) |
|
|
270 | (2) |
|
|
272 | (2) |
|
|
274 | (4) |
|
Parallel Machine Scheduling |
|
|
278 | (10) |
|
|
280 | (4) |
|
|
284 | (3) |
|
|
287 | (1) |
|
Multiprocessor Scheduling |
|
|
288 | (9) |
|
Problem Description and Assumptions |
|
|
289 | (1) |
|
Genetic Algorithm for MSP |
|
|
290 | (5) |
|
|
295 | (2) |
|
Advanced Transportation Problems |
|
|
297 | (44) |
|
|
297 | (7) |
|
|
297 | (2) |
|
Formulation of Transportation Problems |
|
|
299 | (5) |
|
Spanning Tree-Based Approach |
|
|
304 | (7) |
|
|
304 | (2) |
|
|
306 | (2) |
|
|
308 | (1) |
|
|
308 | (3) |
|
|
311 | (1) |
|
Multiobjective Transportation Problem |
|
|
311 | (9) |
|
|
312 | (1) |
|
Spanning Tree--Based Genetic Algorithm for Multiobjective Transportation Problem |
|
|
313 | (3) |
|
|
316 | (4) |
|
Fixed-Charge Transportation Problem |
|
|
320 | (5) |
|
|
321 | (1) |
|
Difficulty of fcTP Instances |
|
|
321 | (1) |
|
Solution Method for the fcTP |
|
|
322 | (1) |
|
Implementation of the Genetic Algorithm |
|
|
322 | (1) |
|
|
323 | (2) |
|
Capacitated Plant Location Problem |
|
|
325 | (5) |
|
|
326 | (2) |
|
Spanning Tree--Based Genetic Algorithm for Plant Location Problems |
|
|
328 | (1) |
|
|
329 | (1) |
|
Bicriteria Transportation Problem with Fuzzy Coefficients |
|
|
330 | (11) |
|
|
331 | (1) |
|
|
332 | (1) |
|
Implementation of the Genetic Algorithm |
|
|
333 | (3) |
|
|
336 | (5) |
|
Network Design and Routing |
|
|
341 | (49) |
|
|
341 | (1) |
|
|
341 | (11) |
|
|
342 | (1) |
|
Genetic Algorithm Approach |
|
|
343 | (8) |
|
|
351 | (1) |
|
|
352 | (11) |
|
Genetic-Based Adaptive Routing |
|
|
353 | (1) |
|
Representation of Chromosomes |
|
|
354 | (1) |
|
Evaluation of Chromosomes |
|
|
355 | (1) |
|
|
355 | (5) |
|
|
360 | (3) |
|
Centralized Network Design |
|
|
363 | (3) |
|
|
364 | (1) |
|
Genetic Algorithm Approach |
|
|
365 | (1) |
|
|
366 | (1) |
|
Computer Network Expansion |
|
|
366 | (7) |
|
|
368 | (1) |
|
Kummar, Pathak, and Gupta's Approach |
|
|
369 | (4) |
|
|
373 | (1) |
|
Multistage Process Planning |
|
|
373 | (5) |
|
|
374 | (2) |
|
Genetic Algorithm Approach |
|
|
376 | (1) |
|
|
377 | (1) |
|
M/G/s Queuing Facility Location on a Network |
|
|
378 | (12) |
|
|
379 | (4) |
|
Evolutionary Computation Approach |
|
|
383 | (4) |
|
|
387 | (3) |
|
Manufacturing Cell Design |
|
|
390 | (61) |
|
|
390 | (1) |
|
Manufacturing Cell Design |
|
|
391 | (2) |
|
Traditional MCD Approaches |
|
|
393 | (3) |
|
Similarity Coefficient Methods |
|
|
394 | (1) |
|
|
395 | (1) |
|
Mathematical Programming Methods |
|
|
395 | (1) |
|
Graph and Network Methods |
|
|
396 | (1) |
|
Genetic Algorithm Approaches |
|
|
396 | (23) |
|
Representative and Genetic Operators |
|
|
396 | (3) |
|
Joines' Order-Based Approach |
|
|
399 | (6) |
|
|
405 | (5) |
|
Joines' Integer Programming Formulation Approach |
|
|
410 | (9) |
|
|
419 | (1) |
|
Cell Design with Alternative Process Plans |
|
|
419 | (19) |
|
Incorporation of Alternative Operations and Machine Redundancy |
|
|
421 | (3) |
|
Incorporation of Alternative Routings |
|
|
424 | (9) |
|
Moon, Gen, and Kim's Approach to Independent Cells |
|
|
433 | (5) |
|
Designing Independent Cells |
|
|
438 | (13) |
|
Family Formation for Minimizing Number of Machine Types |
|
|
439 | (4) |
|
Determining Number of Families |
|
|
443 | (5) |
|
Minimizing Number of Machines |
|
|
448 | (1) |
|
|
449 | (2) |
References |
|
451 | (40) |
Index |
|
491 | |