{"about":{"site":"https://codewithpapers.app","non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page"},"url":"/paper/pasmoqap-a-parallel-asynchronous-memetic","title":"PasMoQAP: A Parallel Asynchronous Memetic Algorithm for solving the Multi-Objective Quadratic Assignment Problem","arxiv_id":"1706.08700","date":"2017-06-27","proceeding":null,"authors":["Claudio Sanhueza","Francia Jimenez","Regina Berretta","Pablo Moscato"],"abstract":"Multi-Objective Optimization Problems (MOPs) have attracted growing attention\nduring the last decades. Multi-Objective Evolutionary Algorithms (MOEAs) have\nbeen extensively used to address MOPs because are able to approximate a set of\nnon-dominated high-quality solutions. The Multi-Objective Quadratic Assignment\nProblem (mQAP) is a MOP. The mQAP is a generalization of the classical QAP\nwhich has been extensively studied, and used in several real-life applications.\nThe mQAP is defined as having as input several flows between the facilities\nwhich generate multiple cost functions that must be optimized simultaneously.\nIn this study, we propose PasMoQAP, a parallel asynchronous memetic algorithm\nto solve the Multi-Objective Quadratic Assignment Problem. PasMoQAP is based on\nan island model that structures the population by creating sub-populations. The\nmemetic algorithm on each island individually evolve a reduced population of\nsolutions, and they asynchronously cooperate by sending selected solutions to\nthe neighboring islands. The experimental results show that our approach\nsignificatively outperforms all the island-based variants of the\nmulti-objective evolutionary algorithm NSGA-II. We show that PasMoQAP is a\nsuitable alternative to solve the Multi-Objective Quadratic Assignment Problem.","url_abs":"http://arxiv.org/abs/1706.08700v1","url_pdf":"http://arxiv.org/pdf/1706.08700v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"pasmoqap-a-parallel-asynchronous-memetic","repo_url":"https://github.com/csanhuezalobos/gar60","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"evolutionary-algorithms","task_name":"Evolutionary Algorithms"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers"},"arxiv_metadata":null,"syntology_extracted_results":null}