Skip to Main Content
Skip Nav Destination
ASME Press Select Proceedings

International Conference on Information Technology and Management Engineering (ITME 2011)

Editor
W. B. Hu
W. B. Hu
Wuhan University
,
China
Search for other works by this author on:
W. X. Wang
W. X. Wang
Royal Institute of Technology
,
Sweden
Search for other works by this author on:
ISBN:
9780791859827
No. of Pages:
500
Publisher:
ASME Press
Publication date:
2011

Genetic Algorithm (GA) is restricted by actual system computing ability. Because of the limited number of population and iteration, the choice of initiation Population is a vital of fact, which directly influents the result of algorithm and the efficiency. GA's Initiation Population is created by the path of well-proportioned choosing seed or stochastic choosing seed generally, but both of them have a vice of inefficient search. The paper, combining with interrelated theories in graph theory, brings forward two kinds of Optimization Algorithms of Initiation Population based on Minimize Spanning Tree Local-Effective-Information Theory towards the limitations of them, and we successes...

Abstract
Keywords
Introduction
Nomenclature
2 The construction algorithm based on minimal spanning tree
3 Example solutions
4 Conclusions
References
This content is only available via PDF.
You do not currently have access to this chapter.
Close Modal

or Create an Account

Close Modal
Close Modal