An Effective Genetic Algorithm for Solving the Clustered Shortest-Path Tree Problem

The clustered shortest-path tree problem (CluSPTP) is an extension of the classical single-source shortest-path problem, in which, given a graph with the set of nodes partitioned into a predefined, mutually exclusive and exhaustive set of clusters, we are looking for a shortest-path spanning tree fr...

Full description

Bibliographic Details
Main Authors: Ovidiu Cosma, Petrica C. Pop, Ioana Zelina
Format: Article
Language:English
Published: IEEE 2021-01-01
Series:IEEE Access
Subjects:
Online Access:https://ieeexplore.ieee.org/document/9330601/