In recent years, e-commerce recommendation systems become more mature which is widely used. E-commerce tourist routes recommendation system realize the personalized design in the ant colony algorithm based on tourist routes. In the past few years, research on ant colony optimization algorithm is widely used in the TSP problem. In this paper we propose the Branching Ant Colony with Dynamic Perturbation (DP) algorithm under the electronic commerce environment .The algorithm introduces dynamic disturbance to select cities. Experiments show that the algorithm can effectively improve the disadvantages of long search time and easy to fall into local minima in basic ant colony algorithm. This method helps the tourists choose the travel route under the environment of e-commerce more effectively,
목차
Abstract 1. Introduction 2. The Basic Algorithm 2.1. TSP Prototype 2.2. The Principle of Ant Colony Algorithm 2.3. The Model of the Algorithm and the Main Steps 3. The Improved Algorithm 3.2. The Condition of the Dynamic Disturbance Strategy 4. Experiments, Results Analysis and System Structure Design 4.1. Parameter Value 5. Conclusion References
키워드
E-commerceTSPE-commerceRoutes recommendation
저자
Yanping Ding [ Business School, Xi’an International University ]
보안공학연구지원센터(IJUNESST) [Science & Engineering Research Support Center, Republic of Korea(IJUNESST)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of u- and e- Service, Science and Technology
간기
격월간
pISSN
2005-4246
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of u- and e- Service, Science and Technology Vol.7 No.3