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 47
... routing, and multi-commodity flow constitute the most common class of practical network optimization problems. In this chapter, we introduce some of the core models of network design (Fig. 2.1), such as shortest path models (i.e., node ...
... routing in communication systems: The routing algorithm computes the shortest (least cost) path between the router and all the networks of the internetwork. It is one of the most important issues that has a significant impact on the ...
... Routing Problems Bottleneck traveling salesman, Chinese postman for mixed graphs, Euclidean traveling salesman, K most vital arcs, K-th shortest path, Metric traveling salesman, Longest circuit, Longest path, Prize Collecting Traveling ...
... routing problem has been a single objective problem having as a goal the minimization of either the total distance or travel time. However, in many applications dealing with the design and efficient use of networks, the complexity of ...
... routing algorithm. The most important algorithms for solving this problem are: Dijkstra's algorithm: Solves single ... routing (SPR) problem [10]– [14], multicasting routing problem [11], ATM bandwidth allocation problem [15], capacity ...
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 |