An Ant Algorithm for the Steiner Tree Problem in Graphs
نویسندگان
چکیده
The Steiner Tree Problem (STP) in graphs is a well-known NP-hard problem. It has regained attention due to the introduction of new telecommunication technologies, since it is the mathematical structure behind multi-cast communications. The goal of this paper is to design an ant algorithm (called ANT-STP) for the STP in graphs which is better than TM, which is a greedy constructive method for the STP proposed in [34]. We derive ANT-STP from TM as follows: each ant is a constructive heuristic close to TM, but the population of ants can collaborate by exchanging information by the use of the trail systems. In addition, the decision rule used by each individual ant is different from the decision rule used in TM. We compare TM and ANT-STP on a set of benchmark problems of the OR-Library.
منابع مشابه
Ant Colony Optimization for Multi-objective Digital Convergent Product Network
Convergent product is an assembly shape concept integrating functions and sub-functions to form a final product. To conceptualize the convergent product problem, a web-based network is considered in which a collection of base functions and sub-functions configure the nodes and each arc in the network is considered to be a link between two nodes. The aim is to find an optimal tree of functionali...
متن کاملA hybrid ensemble approach for the Steiner tree problem in large graphs: A geographical application
Hybrid approaches are often recommended for dealing in an efficient manner with complex problems that require considerable computational time. In this study, we follow a similar approach consisting of combining spectral clustering and ant colony optimization in a two-stage algorithm for the purpose of efficiently solving the Steiner tree problem in large graphs. The idea of the two-stage approa...
متن کاملAn Ant Colony Optimization Algorithm for Network Vulnerability Analysis
Intruders often combine exploits against multiple vulnerabilities in order to break into the system. Each attack scenario is a sequence of exploits launched by an intruder that leads to an undesirable state such as access to a database, service disruption, etc. The collection of possible attack scenarios in a computer network can be represented by a directed graph, called network attack gra...
متن کاملMulticast computer network routing using genetic algorithm and ant colony
Due to the growth and development of computer networks, the importance of the routing topic has been increased. The importance of the use of multicast networks is not negligible nowadays. Many of multimedia programs need to use a communication link to send a packet from a sender to several receivers. To support such programs, there is a need to make an optimal multicast tree to indicate the opt...
متن کاملSolving Minimum Steiner Tree Problem Using Generalized Distributed Learning Automata
Minimum Steiner tree problem in a weighted graph is to find a least cost sub tree in the graph such that it contains special vertices called terminal points. Since this problem belongs to NP-Complete problems, many approximate algorithms including genetic algorithms and ant colony strategies have been designed for solving it. In this paper, we propose an algorithm based on distributed learning ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007