Solving the Euclidean Steiner Minimum Tree Using Cellular Stochastic Diffusion Search Algorithm

The Euclidean Steiner minimum tree problem is a classical NP-hard combinatorial optimization problem.Because of the intrinsic characteristic of the hard computability,this problem cannot be solved accurately by efficient algorithms up to now.Due to the extensive applications in real world,it is quite important to find some heuristics for it.The stochastic diffusion search algorithm is a newly population-based algorithm whose operating mechanism is quite different from ordinary intelligent algorithms,so this algorithm has its own advantage in solving some optimization problems.This paper has carefully studied the stochastic diffusion search algorithm and designed a cellular automata stochastic diffusion search algorithm for the Euclidean Steiner minimum tree problem which has low time complexity.Practical results show that the proposed algorithm can find approving results in short time even for the large scale size,while exact algorithms need to cost several hours.

The Euclidean Steiner minimum tree problem is a classical NP-hard combinatorial optimization problem. Because of the intrinsic characteristic of the hard computability, this problem cannot be solved accurately by efficient algorithms up to now. Due to the extensive applications in real world, it is quite important to find some heuristics for it. The stochastic diffusion search algorithm is a newly population-based algorithm whose operating mechanism is quite different from ordinary intelligent algorithms, so this algorithm has its own advantage in solving some optimization problems. This paper has carefully studied the stochastic diffusion search algorithm and designed a cellular automata stochastic diffusion search algorithm for the Euclidean Steiner minimum trec problem which has low time complexity. Practical results show that the proposed algorithm can find approving results in short time even for the large scale size, while exact algorithms need to cost several hours.