Thi Thanh Binh Huynh

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
We investigate a mechanism of combining Genetic Algorithms (GA) and the Variable Neighborhood Search (VNS) for solving Traveling Salesman Problem (TSP). This combination aims to take advantage of GA's strength in exploring solution space and VNS's powerful exploitation in that space. In order to improve the solution quality, we propose a VNS with four(More)
The Linear Ordering Problem (LOP) is a well-known NP-Hard problem and has many applications in various fields. In this paper, we propose two new crossover operators and a novel combination crossover operators in Genetic Algorithm (GA) for solving LOP. We experimented on LOP instances from XLOLIB and compared the results of the proposed algorithm with GA(More)
The study of protection and prevention against failures is an important problem in communication networks due to the growth of capacity demands for data transmission, especially in the Internet traffic. In this paper, we consider the Survivable Network Design Problem (SNDP) with Protected Working Capacity Envelope (PWCE) called capacity SNDP (ca-SNDP) in(More)
Traveling Salesman Problem (TSP) is an NP-hard combinatorial optimization problem with a wide variety of applications. Biogeography-Based Optimization Algorithm (BBO) is a new optimization technique, is inspired by geographical distribution of species within islands. The main idea of BBO based on migration strategy of species to derive algorithm for solving(More)
Master thesis defense scheduling problem is a real-world practical problem that arises from the Vietnamese Universities. In this paper, we give the formulation of the problem based on realistic requirements. We then show that the considered problem is NP-hard and propose a genetic algorithm for solving it. We experiment the proposed algorithm on the real(More)
  • 1