计算机工程与应用2011，Vol.47Issue(7)：52-56,5.DOI:10.3778/j.issn.1002-8331.2011.07.016
求解多目标旅行商问题的混合遗传算法
Hybrid genetic algorithm for multiple-objective TSP.
摘要
Abstract
General TSP problem is a single target,only the pursuit of a performance index:The shortest path to go. However,the TSP for specific problems,in practice often needs to consider:The shortest distance,the time at least, cost the province,the risk of the smallest, and so a number of factors. In the text, a greedy composite operator and climb operator are introduced for increasing the MTSP searching ability. The experiment result demonstrates that the method is valid and effective.关键词
旅行商问题/多目标旅行商问题/遗传算法/多目标遗传算法/贪婪的复合变异算子/爬山法Key words
Traveling Salesman Problem (TSP)/ multiple-objective travelling salesman problem/ genetic algorithm/ multiple-objective genetic algorithm/greedy composite operator/climb分类
信息技术与安全科学引用本文复制引用
朱云飞,蔡自兴,袁琦钊,郑金华..求解多目标旅行商问题的混合遗传算法[J].计算机工程与应用,2011,47(7):52-56,5.基金项目
国家自然科学基金(the National Natural Science Foundation of China under Grant No.60773047) （the National Natural Science Foundation of China under Grant No.60773047）
湖南省自然科学基金(the Natu-ral Science Foundation of Hunan Province of China under Grant No.09JJ6089) （the Natu-ral Science Foundation of Hunan Province of China under Grant No.09JJ6089）
湖南省教育厅重点科研项目(No.06A074). （No.06A074）
