activity
20192021
most citedNew Approach for Solving The Clustered Shortest-Path Tree Problem Based on Reducing The Search Space of Evolutionary Algorithm

43 citations · 110 across the 7 of their papers we have counts for

collaborators

7 papers

cs.AI2021★ 15 cited

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

Huynh Thi Thanh Binh, Ta Bao Thang, Nguyen Duc Thai +1

The Clustered Shortest-Path Tree Problem (CluSPT) plays an important role in various types of optimization problems in real-life. Recently, some Multifactorial Evolutionary Algorit…

cs.NE2020

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

Phan Thi Hong Hanh, Pham Dinh Thanh, Huynh Thi Thanh Binh

In literature, Clustered Shortest-Path Tree Problem (CluSPT) is an NP-hard problem. Previous studies often search for an optimal solution in relatively large space. To enhance the…

cs.NE2020★ 25 cited

A Multifactorial Optimization Paradigm for Linkage Tree Genetic Algorithm

Huynh Thi Thanh Binh, Pham Dinh Thanh, Tran Ba Trung +4

Linkage Tree Genetic Algorithm (LTGA) is an effective Evolutionary Algorithm (EA) to solve complex problems using the linkage information between problem variables. LTGA performs w…

cs.DC2020★ 8 cited

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

Pham Dinh Thanh, Huynh Thi Thanh Binh, Do Dinh Dac +2

Randomized Greedy Algorithms (RGAs) are interesting approaches to solve problems whose structures are not well understood as well as problems in combinatorial optimization which in…

cs.NE2020★ 13 cited

New mechanism of combination crossover operators in genetic algorithm for solving the traveling salesman problem

Pham Dinh Thanh, Huynh Thi Thanh Binh, Bui Thu Lam

Traveling salesman problem (TSP) is a well-known in computing field. There are many researches to improve the genetic algorithm for solving TSP. In this paper, we propose two new c…

cs.NE2019★ 6 cited

Multifactorial Evolutionary Algorithm For Clustered Minimum Routing Cost Problem

Tran Ba Trung, Huynh Thi Thanh Binh, Le Tien Thanh +2

Minimum Routing Cost Clustered Tree Problem (CluMRCT) is applied in various fields in both theory and application. Because the CluMRCT is NP-Hard, the approximate approaches are su…

cs.NE2019★ 43 cited

New Approach for 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

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 rese…