当前位置: X-MOL 学术Memetic Comp. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Hierarchicity-based (self-similar) hybrid genetic algorithm for the grey pattern quadratic assignment problem
Memetic Computing ( IF 3.3 ) Pub Date : 2021-01-07 , DOI: 10.1007/s12293-020-00321-6
Alfonsas Misevičius , Gintaras Palubeckis , Zvi Drezner

In this paper, we present a hierarchicity-based (self-similar) hybrid genetic algorithm for the solution of the grey pattern quadratic assignment problem. This is a novel hybrid genetic search-based heuristic algorithm with the original, hierarchical architecture and it is in connection with what is known as self-similarity—this means that an object (in our case, algorithm) is exactly or approximately similar to constituent parts of itself. The two main aspects of the proposed algorithm are the following: (1) the hierarchical (self-similar) structure of the genetic algorithm itself, and (2) the hierarchical (self-similar) form of the iterated tabu search algorithm, which is integrated into the genetic algorithm as an efficient local optimizer (local improvement algorithm) of the offspring solutions produced by the crossover operator of the genetic algorithm.



中文翻译:

灰度模式二次分配问题的基于层次(自相似)混合遗传算法

在本文中,我们提出了一种基于层次性(自相似)的混合遗传算法,用于解决灰色模式二次分配问题。这是一种新颖的基于混合遗传搜索的启发式算法,具有原始的分层体系结构,并且与所谓的自相似性相关联-这意味着对象(在我们的情况下,算法)与构成元素完全或近似相似本身的一部分。提出的算法的两个主要方面如下:(1)遗传算法本身的分层(自相似)结构,以及(2)迭代禁忌搜索算法的分层(自相似)形式,

更新日期:2021-01-07
down
wechat
bug