点击次数：

论文类型：会议论文

发表时间：2010-12-10

收录刊物：EI、Scopus

摘要：Minimal Steiner tree problem on graphs is a traditional optimization problem, which has wide-spread use in different application areas. Greedy heuristics for all the people to use the problem are using the shortest path heuristic, and various variants are also used. In this paper, a new heuristic for solving STPG is proposed. The new heuristic defined a novel neighborhood for local search methods. Experimental results show that the new heuristic outperforms the normal MPH heuristic in solution quality. ?2010 IEEE.