Wyniki wyszukiwania - BazTech

Ograniczanie wyników

2 Journal of Telecommunications and Information Technology

2 2006

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Extensions of the minimum labelling spanning tree problem

Cerulli R., Fink A., Gentili M., Voss S.

Journal of Telecommunications and Information Technology

2006

nr 4

39-45

In this paper we propose some extensions of the minimum labelling spanning tree problem. The main focus is on the minimum labelling Steiner tree problem: given a graph G with a color (label) assigned to each edge, and a subset Q of the nodes of G (basic vertices), we look for a connected subgraph of G with the minimum number of different colors covering all the basic vertices. The problem has several applications in telecommunication networks, electric networks, multimodal transportation networks, among others, where one aims to ensure connectivity by means of homogeneous connections. Numerical results for several metaheuristics to solve the problem are presented.

Designing WDM networks by a variable neighborhood search

Melian-Batista B., Höller H., Voss S.

Journal of Telecommunications and Information Technology

2006

nr 4

15-20

With the ever-rising data volume that is demanded by the market, network planning in order to minimize the necessary investment while meeting the demands is constantly an important task for the network providers. Synchronous digital hierarchy (SDH) and wavelength division multiplex (WDM) form the core of many current backbone networks. In order to solve the provisioning and routing problem in such WDM networks, we develop a variable neighborhood search (VNS) metaheuristic. VNS is a metaheuristic that combines series of random and improving local searches based on systematically changed neighborhoods. An integer flow formulation is modeled in AMPL and solved by CPLEX in order to obtain optimal solutions as a reference for the heuristic.