AN EFFECTIVE GENETIC ALGORITHM APPROACH TO THE QUADRATIC MINIMUM SPANNING TREE PROBLEM

Authors
ZHOU GG GEN M
Citation
Gg. Zhou et M. Gen, AN EFFECTIVE GENETIC ALGORITHM APPROACH TO THE QUADRATIC MINIMUM SPANNING TREE PROBLEM, Computers & operations research, 25(3), 1998, pp. 229-237
Citations number
15
Categorie Soggetti
Operatione Research & Management Science","Computer Science Interdisciplinary Applications","Operatione Research & Management Science","Computer Science Interdisciplinary Applications","Engineering, Industrial
Journal title
Computers & operations research → ACNP
ISSN journal
03050548
Volume
25
Issue
3
Year of publication
1998
Pages
229 - 237
Database
ISI
SICI code
0305-0548(1998)25:3<229:AEGAAT>2.0.ZU;2-P
Abstract
In this paper we present a new approach to solve the q-MST problem by using a genetic algorithm. A skillful encoding for trees, denoted by P rufer number, is adopted for GA operation. On comparing with the exist ing heuristic algorithms by 17 randomly generated numerical examples f rom 6-vertex graph to 50-vertex graph, the new GA approach shows its h igh effectiveness in solving the q-MST problem and real value in the p ractical network optimization. (C) 1998 Elsevier Science Ltd. All righ ts reserved.