求解多目标旅行商问题的混合遗传算法

摘要

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.%一般TSP问题是单目标的,只追求一个性能指标:所走路径最短.然而对于具体的TSP问题,实际中常常需要考虑:路程最短、时间最少、费用最省、风险最小等等多方面的因素.设计了贪婪的复合变异算子(GCM),引入隔代爬山法算子来提高多目标TSP问题的搜索能力.实验结果表明该算法是有效的.