Search Results for author:
Found 7 papers, 1 papers with code
A bi-level encoding scheme for the clustered shortest-path tree problem in multifactorial optimization
We have conducted tests on various types of Euclidean instances to assess the effectiveness of the proposed algorithm and methods.
Evolutionary Algorithm and Multifactorial Evolutionary Algorithm on Clustered Shortest-Path Tree problem
Consequently, an effective Evolutionary Algorithm (EA) is proposed for solving CluSPT.
A Multifactorial Optimization Paradigm for Linkage Tree Genetic Algorithm
Linkage Tree Genetic Algorithm (LTGA) is an effective Evolutionary Algorithm (EA) to solve complex problems using the linkage information between problem variables.
A Heuristic Based on Randomized Greedy Algorithms for the Clustered Shortest-Path Tree Problem
Randomized Greedy Algorithms (RGAs) are interesting approaches to solve problems whose structures are not well understood as well as problems in combinatorial optimization which incorporate the random processes and the greedy algorithms.
New mechanism of combination crossover operators in genetic algorithm for solving the traveling salesman problem
Traveling salesman problem (TSP) is a well-known in computing field.
Multifactorial Evolutionary Algorithm For Clustered Minimum Routing Cost Problem
Minimum Routing Cost Clustered Tree Problem (CluMRCT) is applied in various fields in both theory and application.
New Approach for Solving The Clustered Shortest-Path Tree Problem Based on Reducing The Search Space of Evolutionary Algorithm
In addition, this paper proposes a new EAs, which can be applied to solve the first sub-problem and suggests using the Dijkstra's algorithm to solve the second sub-problem.
