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 79
... output: the best solution begin t ← 0; initialize P(t) by encoding routine; evaluate P(t) by decoding routine ... output the best solution end. 1.1.2. Exploitation. and. Exploration. Search is one of the more universal problem solving ...
... output: the best solution begin t ← 0; initialize P(t) by encoding routine; evaluate P(t) by decoding routine ... output the best solution end In the hybrid approach, artificial organisms first pass through Darwin's biological evolution ...
... output: the best solution begin t <- 0; initialize P(t) by encoding routine; evaluate P(t ) by decoding routine; while (not terminating condition) do create C(t) fromP(f) by crossover routine; create C(t ) from P(t ) by mutation routine ...
... output: Pareto optimal solutions E begin t ← 0; initialize P(t) by encoding routine; calculate objectives fi (P),i = 1,···,q by decoding routine; create Pareto E(P); evaluate eval(P) by fitness assignment routine; while (not ...
... output rjq wr r = =∀∈ ∀∈ ←= ← ∑ begin [0,1], 1,2,..., ; //nonnegative random number j random q kk j j k () min 1 , 1,2,..., ; () () , ; (), ; q ikkik i kq eval w f v z i eval i = = ←−∀ ∀ ∑ output v v end Fig. 1.21 Pseudocode ...
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 |