Implementation of an effective hybrid GA for large-scale traveling salesman problems

This correspondence describes a hybrid genetic algorithm (GA) to find high-quality solutions for the traveling salesman problem (TSP). The proposed method is based on a parallel implementation of a multipopulation steady-state GA involving local search heuristics. It uses a variant of the maximal pr...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society. - 1997. - 37(2007), 1 vom: 05. Feb., Seite 92-9
1. Verfasser: Nguyen, Hung Dinh (VerfasserIn)
Weitere Verfasser: Yoshihara, Ikuo, Yamamori, Kunihito, Yasunaga, Moritoshi
Format: Aufsatz
Sprache:English
Veröffentlicht: 2007
Zugriff auf das übergeordnete Werk:IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society
Schlagworte:Evaluation Study Letter
LEADER 01000caa a22002652 4500
001 NLM168207400
003 DE-627
005 20250208002500.0
007 tu
008 231223s2007 xx ||||| 00| ||eng c
028 5 2 |a pubmed25n0561.xml 
035 |a (DE-627)NLM168207400 
035 |a (NLM)17278563 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Nguyen, Hung Dinh  |e verfasserin  |4 aut 
245 1 0 |a Implementation of an effective hybrid GA for large-scale traveling salesman problems 
264 1 |c 2007 
336 |a Text  |b txt  |2 rdacontent 
337 |a ohne Hilfsmittel zu benutzen  |b n  |2 rdamedia 
338 |a Band  |b nc  |2 rdacarrier 
500 |a Date Completed 28.02.2007 
500 |a Date Revised 10.12.2019 
500 |a published: Print 
500 |a Citation Status MEDLINE 
520 |a This correspondence describes a hybrid genetic algorithm (GA) to find high-quality solutions for the traveling salesman problem (TSP). The proposed method is based on a parallel implementation of a multipopulation steady-state GA involving local search heuristics. It uses a variant of the maximal preservative crossover and the double-bridge move mutation. An effective implementation of the Lin-Kernighan heuristic (LK) is incorporated into the method to compensate for the GA's lack of local search ability. The method is validated by comparing it with the LK-Helsgaun method (LKH), which is one of the most effective methods for the TSP. Experimental results with benchmarks having up to 316228 cities show that the proposed method works more effectively and efficiently than LKH when solving large-scale problems. Finally, the method is used together with the implementation of the iterated LK to find a new best tour (as of June 2, 2003) for a 1904711-city TSP challenge 
650 4 |a Evaluation Study 
650 4 |a Letter 
700 1 |a Yoshihara, Ikuo  |e verfasserin  |4 aut 
700 1 |a Yamamori, Kunihito  |e verfasserin  |4 aut 
700 1 |a Yasunaga, Moritoshi  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society  |d 1997  |g 37(2007), 1 vom: 05. Feb., Seite 92-9  |w (DE-627)NLM098252887  |x 1083-4419  |7 nnns 
773 1 8 |g volume:37  |g year:2007  |g number:1  |g day:05  |g month:02  |g pages:92-9 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 37  |j 2007  |e 1  |b 05  |c 02  |h 92-9