A bi-level encoding scheme for the clustered shortest-path tree problem in multifactorial optimization

02/12/2021
by   Huynh Thi Thanh Binh, et al.
0

The Clustered Shortest-Path Tree Problem (CluSPT) plays an important role in various types of optimization problems in real-life. Recently, some Multifactorial Evolutionary Algorithm (MFEA) have been introduced to deal with the CluSPT, however these researches still have some shortcomings such as evolution operators only perform on complete graphs, huge resource consumption for finding the solution on large search spaces. To overcome these limitations, this paper describes a MFEA-based approach to solve the CluSPT. The proposed algorithm utilizes Dijkstra's algorithm to construct the spanning trees in clusters while using evolutionary operators for building the spanning tree connecting clusters. This approach takes advantage of both exact and approximate algorithms so it enables the algorithm to function efficiently on complete and sparse graphs alike. Furthermore, evolutionary operators such as individual encoding and decoding methods are also designed with great consideration regarding performance and memory usage. We have included a proof on the repairing method's efficacy in ensuring all solutions are valid. We have conducted tests on various types of Euclidean instances to assess the effectiveness of the proposed algorithm and methods. Experiment results point out the effectiveness of the proposed algorithm existing heuristic algorithms in most of the test cases. The impact of the proposed MFEA was analyzed and a possible influential factor that may be useful for further study was also pointed out.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

12/23/2019

Multifactorial Evolutionary Algorithm For Clustered Minimum Routing Cost Problem

Minimum Routing Cost Clustered Tree Problem (CluMRCT) is applied in vari...
05/05/2020

A Heuristic Based on Randomized Greedy Algorithms for the Clustered Shortest-Path Tree Problem

Randomized Greedy Algorithms (RGAs) are interesting approaches to solve ...
06/10/2019

New Approach for Solving The Clustered Shortest-Path Tree Problem Based on Reducing The Search Space of Evolutionary Algorithm

Along with the development of manufacture and services, the problem of d...
10/19/2020

Evolutionary Algorithm and Multifactorial Evolutionary Algorithm on Clustered Shortest-Path Tree problem

In literature, Clustered Shortest-Path Tree Problem (CluSPT) is an NP-ha...
05/06/2020

A Multifactorial Optimization Paradigm for Linkage Tree Genetic Algorithm

Linkage Tree Genetic Algorithm (LTGA) is an effective Evolutionary Algor...
01/08/2014

A Solution of Degree Constrained Spanning Tree Using Hybrid GA

In real life, it is always an urge to reach our goal in minimum effort i...
12/07/2021

Efficient labeling algorithms for adjacent quadratic shortest paths

In this article, we study the Adjacent Quadratic Shortest Path Problem (...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.