USING GENETIC ALGORTIHM TO SOLVE STEINER MINIMUM SPANNING TREE PROBLEM

被引：0

作者：

Isci, Oznur ^{[1
]}

Korukoglu, Serdar ^{[2
]}

机构：

[1] Mugla Univ, Fen Edebiyat Fak, Istat Bolumu, TR-48170 Mugla, Turkey

[2] Ege Univ, Muhendislik Fak, Bilgisayar Muhendisligi Bolumu, TR-35000 Izmir, Turkey

来源：

PAMUKKALE UNIVERSITY JOURNAL OF ENGINEERING SCIENCES-PAMUKKALE UNIVERSITESI MUHENDISLIK BILIMLERI DERGISI | 2006年 / 12卷 / 03期

关键词：

Genetic algorithm; Minimum spanning tree problem; Steiner minimum spanning tree problem;

D O I：

暂无

中图分类号：

T [工业技术];

学科分类号：

08 ;

摘要：

Genetic algorithms (GA) are a stochastic research methods, and they produce solutions that are close to optimum or near optimum. In addition to GA's successful application to traveling salesman problem, square designation, allocation, workshop table, preparation of lesson/ examination schedules, planning of communication networks, assembling line balanced, minimum spanning tree type many combinatorial optimization problems it would be applicable to make the best comparison in optimization. In this study a Java program is developed to solve Steiner minimum spanning tree problem by genetic algorithm and its performance is examined. According to the tests carried out on the problems that were given before in the literature, results that are close to optimum are obtained in by GA approach that is recommended in this study. For the predetermined points in the study, length and gain are calculated for Steiner minimum spanning tree problem and minimum spanning tree problem.

引用

页码：429 / 437

页数：9

共 50 条

[1] A Genetic Algorithm to solve Minimum Spanning Tree problem with fuzzy parameters using possibility measure
Almeida, TA
Prado, FMS
Souza, VN
Yamakami, A
Takahashi, MT
NAFIPS 2005 - 2005 ANNUAL MEETING OF THE NORTH AMERICAN FUZZY INFORMATION PROCESSING SOCIETY, 2005, : 627 - 632
[2] Parallel Minimum Spanning Tree Heuristic for the Steiner problem in graphs
Akbari, Hoda
Iramnanesh, Zeinab
Ghodsi, Mohammad
2007 INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, VOLS 1 AND 2, 2007, : 443 - 450
[3] An evolutionary approach to solve minimum spanning tree problem with fuzzy parameters
de Almeida, Tiago Agostinho
Yamakami, Akebo
Takahashi, Marcia Tornie
INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE FOR MODELLING, CONTROL & AUTOMATION JOINTLY WITH INTERNATIONAL CONFERENCE ON INTELLIGENT AGENTS, WEB TECHNOLOGIES & INTERNET COMMERCE, VOL 2, PROCEEDINGS, 2006, : 203 - +
[4] A genetic algorithm for the Capacitated Minimum Spanning Tree problem
de Lacerda, Estefane George Macedo
de Medeiros, Manoel Firmino
2006 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-6, 2006, : 725 - +
[5] Degree-Constrained Minimum Spanning Tree Problem Using Genetic Algorithm
Liu, Keke
Chen, Zhenxiang
Abraham, Ajith
Cao, Wenjie
Jing, Shan
PROCEEDINGS OF THE 2012 FOURTH WORLD CONGRESS ON NATURE AND BIOLOGICALLY INSPIRED COMPUTING (NABIC), 2012, : 8 - 14
[6] Genetic algorithm based approach to solve the Clustered Steiner Tree Problem
Do, Tuan Anh
Ban, Ha-Bang
Huynh, Thi Thanh Binh
Le, Minh Tu
Nguyen, Binh Long
EVOLUTIONARY INTELLIGENCE, 2024, 17 (03) : 1547 - 1566
[7] Using multiflow formulations to solve the Steiner tree problem in graphs
Bahiense, Laura
Besso, Arthur
Tostas, Rogerio
Maculan, Nelson
RAIRO-OPERATIONS RESEARCH, 2021, 55 : S343 - S350
[8] A genetic algorithm approach on capacitated minimum spanning tree problem
Zhou, Gengui
Cao, Zhenyu
Cao, Jian
Meng, Zhiqing
2006 INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY, PTS 1 AND 2, PROCEEDINGS, 2006, : 215 - 218
[9] Minimum Spanning Tree Problem Research based on Genetic Algorithm
Liu, Hong
Zhou, Gengui
SECOND INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DESIGN, VOL 2, PROCEEDINGS, 2009, : 197 - +
[10] USING DNA COMPUTING TO SOLVE MINIMUN SPANNING TREE PROBLEM
Li, Yan
CIICT 2008: PROCEEDINGS OF CHINA-IRELAND INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATIONS TECHNOLOGIES 2008, 2008, : 150 - 154

← 1 2 3 4 5 →