Scholarlink

<p>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&#xa0;GQAP on large-scale datasets.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

A genetic engineering algorithm for the generalized quadratic assignment problem

  • 期刊论文

  • 发表日期：

    2025年3月28日

查看全文
  • Majid Sohrabi,
  • Amir M. Fathollahi-Fard,
  • Vasilii A. Gromov,
  • Maxim A. Dulebenets

摘要

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.