By Topic

Tabu Search Algorithm for Two-Layer Networks Design Problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Lenarski, K. ; Dept. of Syst. & Comput. Networks, Wroclaw Univ. of Technol., Wroclaw ; Czajka, B. ; Pozniak-Koszalka, I. ; Kasprzak, A.

This paper concerns tabu search approach for solving two-layer networks design problem. We present a modular case of two-layer network dimensioning in networks with non-bifurcated flows, what cause stated problem NP complete. Hardness of presented problem makes it impossible (for large networks) to attain optimal results with deterministic methods. An estimate solution may be reachable in satisfying time using heuristic methods. The main goal of this paper is to examine tabu search parameters and structures to achieve the best effect. To carry out researches we designed computer experimentation system. The created application allows to make simulations along with the complex experiments showing obtained results in convenient way utilizing presentation module. The results of research are shown on examples and discussed.

Published in:

Systems Engineering, 2008. ICSENG '08. 19th International Conference on

Date of Conference:

19-21 Aug. 2008