将启发性信息引入遗传算法的一个思路及实现
来源期刊:中南大学学报(自然科学版)1998年第6期
论文作者:何清华 吴凡 周宏兵
文章页码:67 - 71
关键词:遗传算法; 遗传操作; 邻近; TSP
Key words:genetic algorithms; genetic operation; adjacency; TSP
摘 要:针对遗传算法提出了一个将启发性信息引入该算法的具体方案,即根据所处理的具体问题(TSP),在初始群体和遗传操作中均体现出优势物种的基本结构,并将该基本结构与遗传操作紧密结合.上机实验结果表明,该方案能较好地解决一定规模的TSP问题.为凿岩机器人的孔序规划打下了良好的理论基础.
Abstract: A new way to incorporate problem-specific knowledge into genetic algorithms (GAs) has been developed.First of all,problems (TSP) are analyzed to get problem-specific information,and novel changes are made on genetic operation taking on the information as a guide in the search of the optimal.Computer program has also been devised,and several benchmark TSP problems have been tried.Results show that our method can largely improve the performance of GA.