Abstract
The quadratic assignment problem (QAP) is known as one of NP-hard combinatorial optimization problems where a set of facilities must be assigned to a set of locations in order to minimize total cost. In this paper, we present the effect of local search algorithm referred to as meme on Memetic Algorithms (MAs). We also compare four different local search metaheuristics: Hill Climbing Algorithm (HC), Tabu Search (TS), Simulated Annealing (SA), and Iterated Local Search (ILS) for solving QAP and analyze their performance in terms of solution quality. The results show that ILS is the best metaheuristic followed by SA, TS, and HC, respectively. While the MA using ILS as a meme is the best among all four MAs, the MA using SA as a meme is not the second-best metaheuristic, but the worst among all.
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.
