arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1801.07233cs.NE
收藏

基于知识和随机性的混合变异改进TSP解的GA算法

Improving TSP Solutions Using GA with a New Hybrid Mutation Based on Knowledge and Randomness

Esra'a Alkafaween, Ahmad B. A. Hassanat

摘要:

遗传算法(Genetic Algorithm,GA)是一种模拟达尔文自然进化理论的进化算法,是求解优化问题的有效工具。变异算子被认为是遗传算法的探索算子,是遗传算法成功的关键因素之一。存在各种变异算子来解决困难的组合问题,如TSP。在本文中,我们提出了一个混合变异算子称为“IRGIBNNM”,这种变异是一个组合的两个现有的突变,基于知识的变异,和基于随机的变异。我们还改进了现有的“选择最佳变异”策略,使用所提出的变异。我们对12个基准对称旅行推销员问题(STSP)实例进行了几次实验。我们的实验结果表明,所提出的突变的效率,特别是当我们使用它与其他一些突变。关键词:基于知识的突变,倒位突变,滑动突变,RGIBNNM,SBM。

英文摘要:

Genetic algorithm (GA) is an efficient tool for solving optimization problems by evolving solutions, as it mimics the Darwinian theory of natural evolution. The mutation operator is one of the key success factors in GA, as it is considered the exploration operator of GA. Various mutation operators exist to solve hard combinatorial problems such as the TSP. In this paper, we propose a hybrid mutation operator called "IRGIBNNM", this mutation is a combination of two existing mutations, a knowledge-based mutation, and a random-based mutation. We also improve the existing "select best mutation" strategy using the proposed mutation. We conducted several experiments on twelve benchmark Symmetric traveling salesman problem (STSP) instances. The results of our experiments show the efficiency of the proposed mutation, particularly when we use it with some other mutations. Keyword: Knowledge-based mutation, Inversion mutation, Slide mutation, RGIBNNM, SBM.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑