지원사업
학술연구/단체지원/교육 등 연구자 활동을 지속하도록 DBpia가 지원하고 있어요.
커뮤니티
연구자들이 자신의 연구와 전문성을 널리 알리고, 새로운 협력의 기회를 만들 수 있는 네트워킹 공간이에요.
논문 기본 정보
- 자료유형
- 학술저널
- 저자정보
- 저널정보
- 한국지능시스템학회 INTERNATIONAL JOURNAL of FUZZY LOGIC and INTELLIGENT SYSTEMS INTERNATIONAL JOURNAL of FUZZY LOGIC and INTELLIGENT SYSTEMS Vol.11 No.4
- 발행연도
- 2011.12
- 수록면
- 217 - 222 (6page)
이용수
초록· 키워드
오류제보하기
Genetic algorithms are one of the most important methods used to solve the Traveling Salesman Problem. Therefore, many researchers have tried to improve the Genetic Algorithm by using different methods and operations in order to find the optimal solution within reasonable time. This paper intends to find a new approach that adopts an improved genetic algorithm to solve the Traveling Salesman Problem, and compare with the well known heuristic method, namely, Kohonen Self-Organizing Map by using different data sets of symmetric TSP from TSPLIB. In order to improve the search process for the optimal solution, the proposed approach consists of three strategies: two separate tour segments sets, the improved crossover operator, and the improved mutation operator. The two separate tour segments sets are construction heuristic which produces tour of the first generation with low cost. The improved crossover operator finds the candidate fine tour segments in parents and preserves them for descendants. The mutation operator is an operator which can optimize a chromosome with mutation successfully by altering the mutation probability dynamically. The two improved operators can be used to avoid the premature convergence. Simulation experiments are executed to investigate the quality of the solution and convergence speed by using a representative set of test problems taken from TSPLIB. The results of a comparison between the new approach using the improved genetic algorithm and the Kohonen Self-Organizing Map show that the new approach yields better results for problems up to 200 cities.
목차
Abstract
1. Introduction
2. Materials and Methods
3. Results
4. Discussion
5. Conclusion
References
참고문헌 (15)
참고문헌 신청
1. [학술지(정기간행물)] - K.Kurbel / 1998 / Solving optimization problems by parallel recombinative simulated annealing on a parallel computer-an application to standard cell placement in VLSI design / IEEE Transactions on Systems, Man and Cybernetics, Part B 28 (3) : 454 ~ 461
2. [학술지(정기간행물)] - G.Reinelt / 1991 / TSPLIB A Traveling Salesman Problem Library / ORSA Journal on Computing 3 (4) : 376 ~ 384
3. [학술지(정기간행물)] - P.Larranaga / 1999 / Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators / s1: A rtif. Intell 13 (2) : 129 ~ 170
4. [단행본] - J.Holland / 1992 / Adaptation in Natural Artificial Systems / the University of Michigan Press
5. [학술대회논문] - M.Yoshikawa / 2006 / A Novel Genetic Algorithm Routing Technique in 3-Dimetional Space / Proceedings of the 10th World Multiconference on Systemics, Cybernetics and Informatics : 70 ~ 75
2. [학술지(정기간행물)] - G.Reinelt / 1991 / TSPLIB A Traveling Salesman Problem Library / ORSA Journal on Computing 3 (4) : 376 ~ 384
3. [학술지(정기간행물)] - P.Larranaga / 1999 / Genetic Algorithms for the Travelling Salesman Problem: A Review of Representations and Operators / s1: A rtif. Intell 13 (2) : 129 ~ 170
4. [단행본] - J.Holland / 1992 / Adaptation in Natural Artificial Systems / the University of Michigan Press
5. [학술대회논문] - M.Yoshikawa / 2006 / A Novel Genetic Algorithm Routing Technique in 3-Dimetional Space / Proceedings of the 10th World Multiconference on Systemics, Cybernetics and Informatics : 70 ~ 75
이 논문의 저자 정보
이 논문과 함께 이용한 논문
최근 본 자료
댓글(0)
0
UCI(KEPA) : I410-ECN-0101-2013-028-001376342