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

价格
元 337
不含税

远程仓调货

预计送达时间 年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
语言 德语