说明：  MTSP 问题其实与单 旅行商问题(Traveling Salesperson Problem ,简称TSP) 相似,但是由于添加了任何城市只要被某一旅行商访问到即可这个附加条 件,因而增加了问题复杂度。在以前使用遗传算法(GA) 研究解决MTSP 问题时,通常采用标准的TSP 染色体和处理方法。
(M any app licat ions are invo lved w ith mult ip le salesmen each of w hom visits a subgroup cit ies and returns the same start ing city. The to tal length of all subtours is required to be m ini2 mum. Th is is calledM ult ip le T raveling Salesmen P roblem (M TSP). There are various heurist ic methods to obtain op t imal o r near2op t imal so lut ions fo r the TSP p roblem. But to the M ult ip le T raveling Salesmen P roblem , there are no t much app roaches to so lveM TSP. In th is paper, a hy2 brid genet ic algo rithm to so lve TSP and M TSP is p resented. Th is algo rithm combines GA and heurist ics. N umerical experiments show that the new algo rithm is very efficient and effect ive.)