A novel genetic algorithm for solving the clustered shortest-path tree problem

被引：0
|
作者：
Cosma, Ovidiu [1 ]
Pop, Petrica C. [1 ]
Zelina, Ioana [1 ]
机构：
[1] Tech Univ Cluj Napoca, North Univ Ctr Baia Mare, Dept Math & Comp Sci, Victoriei 76, RO-430122 Baia Mare, Romania
来源：
CARPATHIAN JOURNAL OF MATHEMATICS | 2020年 / 36卷 / 03期
关键词：
single-source shortest-path problem; clustered shortest-path tree problem; genetic algorithms;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The clustered shortest-path tree problem is an extension of the dassical single-source shortest-path problem, in which, given a graph with the set of nodes divided into a predefined, mutually exclusive and exhaustive set of clusters, we want to determine a shortest-path spanning tree from a given source to all the other nodes of the graph, with the property that each cluster should induce a connected subtree. The investigated problem proved to be NP-hard and therefore we proposed an efficient genetic algorithm in order to solve it. The preliminary computational results reported on a set of benchmark instances from the literature proved that our proposed solution approach yields high-quality solutions within reasonable running times.
引用
收藏
页码：401 / 414
页数：14
相关论文
共 50 条
  • [1] An Effective Genetic Algorithm for Solving the Clustered Shortest-Path Tree Problem
    Cosma, Ovidiu
    Pop, Petrica C.
    Zelina, Ioana
    [J]. IEEE ACCESS, 2021, 9 : 15570 - 15591
  • [2] Evolutionary algorithm and multifactorial evolutionary algorithm on clustered shortest-path tree problem
    Phan Thi Hong Hanh
    Pham Dinh Thanh
    Huynh Thi Thanh Binh
    [J]. INFORMATION SCIENCES, 2021, 553 : 280 - 304
  • [3] New approach to solving the clustered shortest-path tree problem based on reducing the search space of evolutionary algorithm
    Huynh Thi Thanh Binh
    Pham Dinh Thanh
    Ta Bao Thang
    [J]. KNOWLEDGE-BASED SYSTEMS, 2019, 180 : 12 - 25
  • [4] Multifactorial evolutionary algorithm for solving clustered tree problems: competition among Cayley codesCase studies on the clustered shortest-path tree problem and the minimum inter-cluster routing cost clustered tree problem
    Thanh Pham Dinh
    Binh Huynh Thi Thanh
    Trung Tran Ba
    Long Nguyen Binh
    [J]. Memetic Computing, 2020, 12 : 185 - 217
  • [5] Novel two-level hybrid genetic algorithms based on different Cayley-type encodings for solving the clustered shortest-path tree problem
    Petrovan, Adrian
    Pop, Petrica
    Sabo, Cosmin
    Zelina, Ioana
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2023, 215
  • [6] A Two-Level Hybrid Based Genetic Algorithm to Solve the Clustered Shortest-Path Tree Problem Using the Prufer Code
    Petrovan, Adrian
    Pop, Petrica C.
    Sabo, Cosmin
    Zelina, Ioana
    [J]. HYBRID ARTIFICIAL INTELLIGENT SYSTEMS, HAIS 2022, 2022, 13469 : 323 - 334
  • [7] A Heuristic Based on Randomized Greedy Algorithms for the Clustered Shortest-Path Tree Problem
    Pham Dinh Thanh
    Huynh Thi Thanh Binh
    Do Dinh Dac
    Nguyen Binh Long
    Le Minh Hai Phong
    [J]. 2019 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2019, : 2915 - 2922
  • [8] An Effective Representation Scheme in Multifactorial Evolutionary Algorithm for Solving Cluster Shortest-Path Tree Problem
    Pham Dinh Thanh
    Dinh Anh Dung
    Tran Ngoc Tien
    Huynh Thi Thanh Binh
    [J]. 2018 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2018, : 819 - 826
  • [9] Multifactorial evolutionary algorithm for solving clustered tree problems: competition among Cayley codes Case studies on the clustered shortest-path tree problem and the minimum inter-cluster routing cost clustered tree problem
    Dinh, Thanh Pham
    Thanh, Binh Huynh Thi
    Ba, Trung Tran
    Binh, Long Nguyen
    [J]. MEMETIC COMPUTING, 2020, 12 (03) : 185 - 217
  • [10] A new algorithm for the shortest-path problem
    Elmasry, Amr
    Shokry, Ahmed
    [J]. NETWORKS, 2019, 74 (01) : 16 - 39
12345