Abstract

It is well known that simulated annealing (SA) and genetic algorithm (GA) are two global methods and can then be used to determine the optimal solution of NP-hard problem. In this paper, due to difficulty of obtaining the optimal solution in medium and large-scaled problems, a hybrid genetic algorithm (HGA) was also developed. The proposed HGA incorporates simulated annealing into a basic genetic algorithm that enables the algorithm to perform genetic search over the subspace of local optima. The two proposed solution methods were compared on Rosenbrock function global optimal problems, and computational results suggest that the HGA algorithm have good ability of solving the problem and the performance of HGA is very promising because it is able to find an optimal or near-optimal solution for the test problems.

Full Text

Published Version

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.