New approach to solving the clustered shortest-path tree problem based on reducing the search space of evolutionary algorithm

Volume: 180, Pages: 12 - 25
Published: Sep 1, 2019
Abstract
Along with the development of manufacture and services, the problem of distribution network optimization has been growing in importance, thus receiving much attention from the research community. One of the most recently introduced network optimization problems is the Clustered Shortest-Path Tree Problem (CluSTP). Since the problem is NP-Hard, recent approaches often prefer to use approximation algorithms to solve it, several of which used...
Paper Details
Title
New approach to solving the clustered shortest-path tree problem based on reducing the search space of evolutionary algorithm
Published Date
Sep 1, 2019
Volume
180
Pages
12 - 25
Citation AnalysisPro
  • Scinapse’s Top 10 Citation Journals & Affiliations graph reveals the quality and authenticity of citations received by a paper.
  • Discover whether citations have been inflated due to self-citations, or if citations include institutional bias.