|
|
Select Language
Simple Search
Advanced Search
OPAC
Katalog Online Perpustakaan Universitas Ma Chung
Villa Puncak Tidar N-01 Malang - Jawa Timur.
DDC v.22
Klasifikasi & Katalogisasi DDC versi 22
Validated
|
Title |
An Efficient Heuristic for Solving an Extended Capacitated Concentrator Location Problem |
Edition |
Volume 23, Numbers 1-2 |
Call Number |
|
ISBN/ISSN |
1018-4864 |
Author(s) |
RAJA,V.T. HAN,BERNARD T.
|
Subject(s) |
|
Classification |
|
Series Title |
Telecommunication Systems |
GMD |
Electronic Journal |
Language |
English |
Publisher |
Springer Netherlands |
Publishing Year |
2003 |
Publishing Place |
Netherlands |
Collation |
29p |
Abstract/Notes |
In this paper, a mathematical model and a solution algorithm are developed for solving an
extended capacitated concentrator location problem. Our model extends the conventional formulation
by simultaneously addressing the two capacity constraints, total connection ports and maximum data
processing rate, on each concentrator to be selected for satisfying the communication demands of the
given end-user nodes. Since the problem is NP-complete, an efficient and effective Lagrangian heuristic
is developed and tested by solving 100 randomly generated test problems with sizes ranging from
30 (nodes) × 30 (concentrators) to 150 × 30. Altogether 58% of the tested problems are solved optimally
with an average solution gap 0.36% from the optimality and average solution times are from a few seconds
to one half of a minute. |
Specific Detail Info |
|
Image |
 |
File Attachment |
LOADING LIST... |
Availability |
LOADING LIST... |
|
Back To Previous |
|