Abstract
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,
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of u- and e-Service, Science and Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
