يك الگوريتم جديد بر مبناي اتوماتاهاي يادگير براي حل مسيله درخت اشتاينر

A New Approach Based on Learning Automata for Solving Steiner Tree Problem

The 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. The Steiner tree problem on graphs is one of the best-known NP-hard problems. For this reason, many approximation algorithms for solving steiner tree problem have been proposed. The traditional algorithms achieve near optimal results, but cost more computational time. In this paper we propose an iterative algorithm based on learning automata for solving dynamic Steiner tree problem. Simulation results show that our proposed algorithm generates Steiner trees of low cost in reasonable running time.