期刊论文

Lin, Mugang

英文

工程与科学中的计算机建模(英文)

1526-1492

2020

125

1

197-214

10.32604/cmes.2020.09502

Funding Statement: This work is supported by the National Natural Science Foundation of China under Grant 61772179, the Hunan Provincial Natural Science Foundation of China under Grant 2019JJ40005, the Science and Technology Plan Project of Hunan Province under Grant 2016TP1020, the Double First-Class University Project of Hunan Province under Grant Xiangjiaotong [2018]469, the Open Fund Project of Hunan Provincial Key Laboratory of Intelligent Information Processing and Application for Hengyang Normal University under Grant IIPA19K02, and the Science Foundation of Hengyang Normal University under Grant 19QD13.

本校为第一且通讯机构

Given a connected undirected graph G whose edges are labeled, the minimum labeling spanning tree (MLST) problem is to find a spanning tree of G with the smallest number of different labels. The MLST is an NP-hard combinatorial optimization problem, which is widely applied in communication networks, multimodal transportation networks, and data compression. Some approximation algorithms and heuristics algorithms have been proposed for the problem. Firefly algorithm is a new meta-heuristic algorithm. Because of its simplicity and easy implementati...