A one-parameter genetic algorithm for the minimum labeling spanning tree problem

被引：30
|
作者：
Xiong, YP [1 ]
Golden, B
Wasil, E
机构：
[1] Univ Maryland, Dept Math, College Pk, MD 20742 USA
[2] Univ Maryland, RH Smith Sch Business, College Pk, MD 20742 USA
[3] American Univ, Kogod Sch Business, Washington, DC 20016 USA
来源：
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION | 2005年 / 9卷 / 01期
关键词：
genetic algorithm (GA); NP-hard; spanning trees;
D O I：
10.1109/TEVC.2004.840145
中图分类号：
TP18 [人工智能理论];
学科分类号：
081104 ; 0812 ; 0835 ; 1405 ;
摘要：
Given a connected, undirected graph G whose edges are labeled (or colored), the minimum labeling spanning tree (MLST) problem seeks a spanning tree on G with the minimum number of distinct labels (or colors). In recent work, the MLST problem has been shown to be NP-hard and an effective heuristic [maximum vertex covering algorithm (MVCA)] has been proposed and analyzed. In this paper, we use a one-parameter genetic algorithm (GA) to solve the problem. In computational tests, the GA clearly outperforms MVCA.
引用
收藏
页码：55 / 60
页数：6
相关论文
共 50 条
  • [1] A genetic algorithm for the Capacitated Minimum Spanning Tree problem
    de Lacerda, Estefane George Macedo
    de Medeiros, Manoel Firmino
    [J]. 2006 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-6, 2006, : 725 - +
  • [2] A Novel Binary Firefly Algorithm for the Minimum Labeling Spanning Tree Problem
    Lin, Mugang
    Liu, Fangju
    Zhao, Huihuang
    Chen, Jianzhen
    [J]. CMES-COMPUTER MODELING IN ENGINEERING & SCIENCES, 2020, 125 (01): : 197 - 214
  • [3] A genetic algorithm approach on capacitated minimum spanning tree problem
    Zhou, Gengui
    Cao, Zhenyu
    Cao, Jian
    Meng, Zhiqing
    [J]. 2006 INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY, PTS 1 AND 2, PROCEEDINGS, 2006, : 215 - 218
  • [4] Minimum Spanning Tree Problem Research based on Genetic Algorithm
    Liu, Hong
    Zhou, Gengui
    [J]. SECOND INTERNATIONAL SYMPOSIUM ON COMPUTATIONAL INTELLIGENCE AND DESIGN, VOL 2, PROCEEDINGS, 2009, : 197 - +
  • [5] An effective genetic algorithm for the minimum-label spanning tree problem
    Nummela, Jeremiah
    Julstrom, Bryant A.
    [J]. GECCO 2006: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, 2006, : 553 - +
  • [6] An effective genetic algorithm approach to the quadratic minimum spanning tree problem
    Zhou, GG
    Gen, M
    [J]. COMPUTERS & OPERATIONS RESEARCH, 1998, 25 (03) : 229 - 237
  • [7] A Parallel Genetic Algorithm for Solving the Probabilistic Minimum Spanning Tree Problem
    Wang, Zhurong
    Yu, Changqing
    Hei, Xinhong
    Zhang, Bin
    [J]. 2013 9TH INTERNATIONAL CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND SECURITY (CIS), 2013, : 61 - 65
  • [8] A hybrid metaheuristic for the minimum labeling spanning tree problem
    da Silva, Thiago Gouveia
    Queiroga, Eduardo
    Ochi, Luiz Satoru
    Formiga Cabral, Lucidio dos Anjos
    Gueye, Serigne
    Michelon, Philippe
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 274 (01) : 22 - 34
  • [9] An algorithm for inverse minimum spanning tree problem
    Zhang, JH
    Xu, SJ
    Ma, ZF
    [J]. OPTIMIZATION METHODS & SOFTWARE, 1997, 8 (01): : 69 - 84
  • [10] A multi-operator genetic algorithm for the generalized minimum spanning tree problem
    Contreras-Bolton, Carlos
    Gatica, Gustavo
    Barra, Carlos Rey
    Parada, Victor
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2016, 50 : 1 - 8
12345