원문정보
초록
영어
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,
목차
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