Tabu search for the Steiner problem in graphs
Given an undirected graph with weights associated with its nodes, the Steiner tree problem consists in nding a minimum weight subgraph spanning a given subset of nodes (terminals) of the original graph. In this paper, we describe an improved tabu search algorithm for the Steiner problem in graphs, based on a neighborhood deened by insertions and eliminations of Steiner nodes. Move estimations, elimination tests, and neighborhood reduction techniques are used to speedup the local search, leading to a very fast algorithm with very good results in terms of solution quality. Computational experiments on benchmark problems are reported, comparing the behavior of the improved tabu search with that of other heuristics from the literature. The improved tabu search algorithm clearly outperforms other heuristics in terms of computation times, obtaining better or comparably good solutions.
An Integer Programming Model and a Tabu Search Algorithm to Generate α-labeling of Special Classes of Quadratic Graphs
First, an integer programming model is proposed to find an α-labeling for quadratic graphs. Then, a Tabu search algorithm is developed to solve large scale problems. The proposed approach can generate α-labeling for special classes of quadratic graphs, not previously reported in the literature. Then, the main theorem of the paper is presented. We show how a problem in graph theory c...متن کامل
With today's development of information technology comes the increased development of numerous real-time multimedia network applications. Some examples include video and tele-conferencing, tele-medicine, video-on-demand, distance education, applications in finance, etc. Several of these applications require multicasting with a certain Quality of Service (QoS). One of the most important QoS para...متن کامل
KULKARNI, GIRISH. A Tabu Search Algorithm for the Steiner Tree Problem. (Under the direction of Professor Yahya Fathi.) The Steiner Tree problem in graphs is an NP-hard problem having applications in many areas including telecommunication, distribution and transportation systems. We survey, briefly, a few exact methods and a few heuristic approaches that have been proposed for solving this prob...متن کامل
Given an undirected graph with prizes associated with its vertices and costs associated with its edges, the prize-collecting Steiner tree problem in graphs (PCSPG) consists of finding a subtree of this graph, so as to minimize the sum of the costs of its edges plus the prizes of the vertices not spanned. In this paper, we propose a knowledge guided tabu search (named K-TS) algorithm for the PCS...متن کامل
The Steiner tree problem in graphs is to determine a minimum cost subgraph of a given graph spanning a set of specified vertices. In certain telecommunication networks, additional constraints such as, e.g., reliability constraints, have to be observed. Assume that a certain reliability is associated with each arc of the network, measuring the probability that the respective arc is operational. ...متن کامل