Network Models and Optimization: Multiobjective Genetic Algorithm ApproachNetwork models are critical tools in business, management, science and industry. Network Models and Optimization: Multiobjective Genetic Algorithm Approach presents an insightful, comprehensive, and up-to-date treatment of multiple objective genetic algorithms to network optimization problems in many disciplines, such as engineering, computer science, operations research, transportation, telecommunication, and manufacturing. Network Models and Optimization: Multiobjective Genetic Algorithm Approach extensively covers algorithms and applications, including shortest path problems, minimum cost flow problems, maximum flow problems, minimum spanning tree problems, travelling salesman and postman problems, location-allocation problems, project scheduling problems, multistage-based scheduling problems, logistics network problems, communication network problem, and network models in assembly line balancing problems, and airline fleet assignment problems. Network Models and Optimization: Multiobjective Genetic Algorithm Approach can be used both as a student textbook and as a professional reference for practitioners in many disciplines who use network optimization methods to model and solve problems. |
From inside the book
Results 1-5 of 78
... decoding fitness computation evaluation crossover mutation decoding C C (t) C M (t) P(t) + C(t) roulette wheel selection terminating condition? Y N New Population best solution Fig. 1.1 The general structure of genetic algorithms Figure ...
... decoding routine; while (not terminating condition) do create C(t) fromP(t) by crossover routine; create C(t) from P(t) by mutation routine; evaluate C(t) by decoding routine; select P(t + 1) fromP(t) and C(t) by selection routine; t ...
... decoding decoding Kennedy gave an explanation of hGA with Lamarckian evolution theory. Fig. 1.5 The general structure of hybrid genetic algorithms Fig. 1.6 Applying a local search technique to a GA. 16 1 Multiobjective Genetic Algorithms ...
... decoding routine; while (not terminating condition) do create C(t) fromP(t) by crossover routine; create C(t) from P(t) by mutation routine; climb C(t) by local search routine; evaluate C(t) by decoding routine; select P(t + 1) fromP(t) ...
... decoding routine; while (not terminating condition) do create C(t) fromP(f) by crossover routine; create C(t ) from P(t ) by mutation routine; create C(t ) from P(f ) by immigration routine; evaluate C{t) by decoding routine; ift > u ...
Contents
1 | |
49 | |
Logistics Network Models | 135 |
Communication Network Models | 229 |
Advanced Planning and Scheduling Models | 297 |
Project Scheduling Models | 419 |
Assembly Line Balancing Models | 477 |
Tasks Scheduling Models | 551 |
References | 604 |
Index | 687 |
Other editions - View all
Network Models and Optimization: Multiobjective Genetic Algorithm Approach Mitsuo Gen,Runwei Cheng,Lin Lin No preview available - 2008 |
Network Models and Optimization: Multiobjective Genetic Algorithm Approach Mitsuo Gen,Runwei Cheng,Lin Lin No preview available - 2010 |