This paper presents a hybrid algorithm for traveling salesman problem. The algorithm is a combination of the genetic algorithm and simulated annealing algorithm; in other words, it is a hybrid algorithm. The combination overcomes the deficiencies of the two algorithms when acting separately. The real distance between customers has been used on the basis of geographical information system (GIS) in order to make the result more suitable in real-life. The algorithm has tested on the examples of international standards. We made a comparison with the result of second nearest neighbor algorithm and genetic optimization algorithm. The test showed that the algorithm proposed in this paper has improved the results.
목차
Abstract 1. Introduction 2. GIS in Logistics and Distribution 3. Model Based on GIS 4. Algorithm 4.1. The Basic Idea of the Hybrid Algorithm 4.2. The Key Points of Genetic Algorithm 4.3. The Key Step of Simulated Annealing Algorithm 4.4. Steps of Hybrid Algorithm Implementation 4.5. Computational Comparison 5. Conclusions 6. Acknowledgements References
키워드
traveling salesman problemgenetic-simulated annealing algorithmgeographical information system
저자
Wei Gu [ Donlinks School of Economics and Management, University of Science and Technology, Beijing, China ]
Yong Liu [ 100083,2Tobacco Company of Baotou City, Inner Mongolia, China ]
Li-Rong Wei [ Donlinks School of Economics and Management, University of Science and Technology, Beijing, China ]
Bing-Kun Dong [ China Cigarette Sales Corporation, Beijing, China ]
보안공학연구지원센터(IJGDC) [Science & Engineering Research Support Center, Republic of Korea(IJGDC)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Grid and Distributed Computing
간기
격월간
pISSN
2005-4262
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Grid and Distributed Computing Vol.8 No.3