Gradient Gene Algorithm: a fast optimization method to MST problem |
| |
Authors: | Zhang Jin-bo Xu Jing-wen Li Yuan-xiang |
| |
Institution: | 1. State Key Laboratory of Software Engineering, Wuhan University, 430072, Wuhan, China
|
| |
Abstract: | The extension of Minimum Spanning Tree (MST) problem is an NP hard problem which does not exit a polynomial time algorithm. In this paper, a fast optimization method on MST problem—the Gradient Gene Algorithm is introduced. Compared with other evolutionary algorithms on MST problem, it is more advanced: firstly, very simple and easy to realize; then, efficient and accurate; finally general on other combination optimization problems. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|