DocumentCode :
2118887
Title :
The Research about Balanced Route MTSP Based on Hybrid Algorithm
Author :
Hong-li, Xu ; Cheng-ming, Zhang
Author_Institution :
Inf. Inst., Shandong Agric. Univ., Taian
fYear :
2009
fDate :
27-28 Feb. 2009
Firstpage :
533
Lastpage :
536
Abstract :
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.
Keywords :
encoding; genetic algorithms; graph theory; travelling salesman problems; 2-opt algorithm; coding method; genetic algorithms; graph theory; hybrid algorithm; multiple traveling salesman problem; Algorithm design and analysis; Cities and towns; Electronic mail; Genetic algorithms; Genetic mutations; Legged locomotion; Polynomials; Software algorithms; Traveling salesman problems; Virtual manufacturing; MTSP; balanced MTSP; hybrid algorithm; virtual settings;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communication Software and Networks, 2009. ICCSN '09. International Conference on
Conference_Location :
Macau
Print_ISBN :
978-0-7695-3522-7
Type :
conf
DOI :
10.1109/ICCSN.2009.115
Filename :
5076908
Link To Document :
بازگشت