A genetic engineering algorithm for the generalized quadratic assignment problem.
Saved in:
| Title: | A genetic engineering algorithm for the generalized quadratic assignment problem. |
|---|---|
| Authors: | Sohrabi, Majid1,2 (AUTHOR) msohrabi@hse.ru, Fathollahi-Fard, Amir M.3 (AUTHOR) amirfard.ie@gmail.com, Gromov, Vasilii A.1 (AUTHOR) stroller@rambler.ru, Dulebenets, Maxim A.4 (AUTHOR) mdulebenets@eng.famu.fsu.edu |
| Source: | Neural Computing & Applications. Jun2025, Vol. 37 Issue 18, p12253-12279. 27p. |
| Subjects: | Quadratic assignment problem, Genetic engineering, Mining methodology, Chromosomes, Sensitivity analysis, Metaheuristic algorithms |
| Abstract: | The generalized quadratic assignment problem (GQAP) poses a significant challenge in optimization, known for its NP-hard complexity and wide-ranging applications in supply chain and manufacturing contexts. While various metaheuristic algorithms have addressed the GQAP, this paper introduces a novel modification of the genetic algorithm (GA), namely the genetic engineering algorithm (GEA). A traditional GA initializes the population of solutions randomly and refines these solutions iteratively through crossover and mutation operators. However, its reliance on randomness often leads to premature convergence, susceptibility to local optima, and suboptimal solutions at termination of the algorithmic run. To address these drawbacks, our research presents a modified GA framework inspired by genetic engineering principles. This framework introduces novel search mechanisms mimicking gene mining processes, targeting population enhancement through insertion, purification, and genetic material exchange from elite solutions. The GEA adds three search scenarios to the traditional GA framework to exhibit desired characteristics from chromosomes, enhancing solution quality and convergence speed. This GEA demonstrates a superior performance across various search scenarios against state-of-the-art algorithms and exact solutions for the benchmark instances of the GQAP. Additionally, this study conducts comprehensive sensitivity analyses on the search scenarios of the GEA. By employing gene mining strategies, the proposed GEA offers promising solutions for effectively addressing the NP-hard optimization challenges of the GQAP on large-scale datasets. [ABSTRACT FROM AUTHOR] |
| Copyright of Neural Computing & Applications is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) | |
| Database: | Engineering Source |
|
Full text is not displayed to guests.
Login for full access.
|
|
| Abstract: | The generalized quadratic assignment problem (GQAP) poses a significant challenge in optimization, known for its NP-hard complexity and wide-ranging applications in supply chain and manufacturing contexts. While various metaheuristic algorithms have addressed the GQAP, this paper introduces a novel modification of the genetic algorithm (GA), namely the genetic engineering algorithm (GEA). A traditional GA initializes the population of solutions randomly and refines these solutions iteratively through crossover and mutation operators. However, its reliance on randomness often leads to premature convergence, susceptibility to local optima, and suboptimal solutions at termination of the algorithmic run. To address these drawbacks, our research presents a modified GA framework inspired by genetic engineering principles. This framework introduces novel search mechanisms mimicking gene mining processes, targeting population enhancement through insertion, purification, and genetic material exchange from elite solutions. The GEA adds three search scenarios to the traditional GA framework to exhibit desired characteristics from chromosomes, enhancing solution quality and convergence speed. This GEA demonstrates a superior performance across various search scenarios against state-of-the-art algorithms and exact solutions for the benchmark instances of the GQAP. Additionally, this study conducts comprehensive sensitivity analyses on the search scenarios of the GEA. By employing gene mining strategies, the proposed GEA offers promising solutions for effectively addressing the NP-hard optimization challenges of the GQAP on large-scale datasets. [ABSTRACT FROM AUTHOR] |
|---|---|
| ISSN: | 09410643 |
| DOI: | 10.1007/s00521-025-11155-z |
