Emergent search on double circle TSPs using subgour exchange crossover
Emergent search on double circle TSPs using subgour exchange crossover
复制标题
使用 subgour 交换交叉对双圈 TSP 进行紧急搜索
DOI：
10.1109/icec.1996.542656
复制
发表时间：
1996
期刊：
影响因子：
--
通讯作者：
S. Kobayashi
中科院分区：
文献类型：
--
作者：
M. Yamamura;I. Ono;S. Kobayashi
遗传算法(GAs)具有局部搜索技术(如模拟退火法)和并行局部搜索技术(如进化策略和进化规划等其他进化计算)所不具备的实现紧急搜索的潜力。交叉算子带来了这些潜力，因为它们可以随着种群的进化而出现其邻域结构。提出了一种利用遗传算法实现紧急搜索的方法。首先，我们指出了局部搜索技术在求解双圈TSP问题上的困难，并讨论了涌现搜索如何克服这些困难。其次，提出了用遗传算法实现紧急搜索的指导思想：保持特征的编码/交叉设计和保持多样性的世代交替模型设计。根据这些准则，我们实际上实现了用遗传算法来求解双圈TSP问题。
Genetic algorithms (GAs) have such potentials for realizing emergent searches that local search techniques, such as simulated annealings, and parallel local search techniques, like other evolutionary computation such as evolution strategies and evolutionary programmings, do not have. Crossover operators bring these potentials because they can emerge their neighborhood structures as populations evolve. The paper presents a realization of emergent searches by GAs. First, we show difficulties for local search techniques to solve double circle TSPs, and discuss how emergent searches can overcome such difficulties. Second, we propose guidelines to achieve emergent searches by GAs; the characteristics preserving encodings/crossovers design and the diversity maintaining generation alternation models design. According to these guidelines, we actually realize GAs to solve double circle TSPs.