Solving the Terminal Assignment Problem Using Optimisation Algorithms - Eugénia Moreira Bernardino - 書籍 - LAP LAMBERT Academic Publishing - 9783659607646 - 2014年9月17日
カバー画像とタイトルが一致しない場合、正しいのはタイトルです

Solving the Terminal Assignment Problem Using Optimisation Algorithms

価格
¥ 7.955
税抜

遠隔倉庫からの取り寄せ

発送予定日 年6月29日 - 年7月9日
iMusicのウィッシュリストに追加

In recent years, we have witnessed a tremendous growth of communication networks. This is because they are widely used in all walks of life, and this trend continues increasing. The research on computer communication networking field has also grown explosively due to a large variety of combinatorial optimisation problems. One of these problems is the Terminal Assignment Problem which implies fixing the minimum cost links to construct a network between a specified set of terminals and concentrators. A good solution for this problem should maintain small distances between concentrators and terminals assigned to them without exceeding the capacity of any concentrator. Additionally, it should also maintain a balanced distribution of terminals among concentrators. The intractability of this problem is a motivation for the pursuits of different approximation algorithms. In this book, we explore several metaheuristics applied to the Terminal Assignment Problem and other similar problems. Simulation results verify the effectiveness of these algorithms.

メディア 書籍     Paperback Book   (ソフトカバーで背表紙を接着した本)
リリース済み 2014年9月17日
ISBN13 9783659607646
出版社 LAP LAMBERT Academic Publishing
ページ数 204
寸法 150 × 220 × 10 mm   ·   322 g
言語 ドイツ語