The research about balanced route MTSP Based on hybrid algorithm

摘要：

MTSP included two Categories: the first, distributed visit cities (points) number to every Salesman, The distribution required balanced cities number.Second distributed MTSP walking distance to every Salesman, It required balanced path length. For the MTSP which Balance route, designed the hybrid algorithm, it based on genetic algorithms and 2-opt Algorithm. The coding method, Algorithm steps and the MTSP object function is given. Coefficient k in objective function is given, which adjust the ratio of proportionality and route. In order to split MTSP into single TSP, bring up virtual point concept, and set them. In order to minimize the total journey length, salesman always chooses point near center point, the corresponding sample and experiment results are given.

关键词： MTSP balanced MTSP virtual settings hybrid algorithm

作者: Xu hong-li Zhang cheng-ming

作者单位: information institute Shandong Agricultural University Shandong Taian 271018,China

会议类型: 国际会议

会议名称: The International Conference on Communication Software and Networks(2009 IEEE通信软件与网络国际会议 ICCSN 2009)

会议地点: 成都

会议语种:英文

页码: 533-536

在线出版日期: 2009-02-20（万方平台首次上网日期，不代表论文的发表时间）