Name
Abstract | ||
|---|---|---|
This paper deals with the NP-hard Capacitated Network Design Problem (CNDP) with modular link capacity structure. We aim to optimize the underlying network, the allocation facilities and the transportation costs. It is assumed that for connecting two nodes, a fixed construction link cost is occurred or a specific unit transportation cost. There are several types of module facilities to allocate on links. In this paper, we propose a general model that combines design, allocation and routing problems. An hybrid approach is proposed which uses a greedy constructive and an iterative local search heuristics. Our proposition is tested on the Survivable fixed telecommunication Network Design Library (SNDlib) and a comparison of its performances against the best solution available in the literature is done. Computational tests show that our proposition is very efficient. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.3233/JHS-150528 | JOURNAL OF HIGH SPEED NETWORKS |
Keywords | Field | DocType |
Capacitated network design, facility allocation, modular capacity, iterative local search, greedy search, SNDlib | Heuristic,Network planning and design,Computer science,Computer network,Distributed computing | Journal |
Volume | Issue | ISSN |
21 | 4 | 0926-6801 |
Citations | PageRank | References |
1 | 0.63 | 16 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Meriem Khelifi | 1 | 1 | 0.96 |
| Malika Babes | 2 | 1 | 0.63 |
| Salim Ghanemi | 3 | 28 | 6.04 |
| Mohand Yazid Saidi | 4 | 28 | 7.40 |
| Saadi Boudjit | 5 | 66 | 13.08 |