HAN Jun, FANG Qingan, MAO Liyong, HUANG Yaling. A Hybrid Optimization Algorithm for the CMST Problem[J]. Chinese Journal of Electronics, 2011, 20(4): 583-589.
Citation: HAN Jun, FANG Qingan, MAO Liyong, HUANG Yaling. A Hybrid Optimization Algorithm for the CMST Problem[J]. Chinese Journal of Electronics, 2011, 20(4): 583-589.

A Hybrid Optimization Algorithm for the CMST Problem

  • Received Date: 2010-02-01
  • Rev Recd Date: 2011-05-01
  • Publish Date: 2011-10-25
  • The Capacitated minimum spanning tree (CMST) problem is one of the most fundamental and significant problems in the optimal design of networks. It is also a classical combinatorial optimization problem which has been tackled by researchers for centuries using various methods. In this paper, a new NS-TS hybrid optimization algorithm that combines neighborhood search and tabu search is proposed. A novel neighborhood structure and associate tabu strategy is proposed and implemented. Computational experiments showing the effectiveness and efficiency of the algorithm on benchmark instances are given.
  • loading
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (874) PDF downloads(1732) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return