|
个人信息Personal Information
教授
博士生导师
硕士生导师
主要任职：未来技术学院/人工智能学院副院长
性别：男
毕业院校：中国科技大学
学位：博士
所在单位：软件学院、国际信息与软件学院
联系方式：jianghe@dlut.edu.cn
扫描关注
A new effective heuristic for solving minimal Steiner tree problem on graphs
点击次数：
论文类型：会议论文
发表时间：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.