Abstract
Genetic algorithms (GAs) are among the widely used in various areas of computer science, including optimization problems. In this paper, we propose a GA hybridized with so-called ruin and recreate (R and R) procedure. We have applied this new hybrid strategy to the well-known combinatorial optimization problem, the quadratic assignment problem (QAP). The results obtained from the experiments on different QAP instances show that the proposed algorithm belongs to the best heuristics for the QAP. The power of this algorithm is also demonstrated by the fact that the new best known solutions were found for several QAP instances.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
