An Adaptive Cuckoo Algorithm-Based Optimization Method for Tourist Traffic Routes

Abstract

This paper presents in-depth research and analysis of the optimization method of tourist traffic routes using the adaptive cuckoo algorithm. The traditional cuckoo algorithm has the disadvantages of slow convergence speed and easy falling into local extremes. This paper proposes the iterative adaptive CHSACS algorithm based on iteration. Based on the original CS algorithm, a dynamic adaptive step control amount and a segmented weighted position update formula are introduced to give a class of improved CS algorithms to coordinate the problem of local search and global search of the CS algorithm and speed up the convergence speed at the later stage. To address the problem that the out-of-bounds nests interfere with the convergence of the algorithm, a memory strategy is introduced to relocate the out-of-bounds nests in the search space to improve the stability of the algorithm. Experiments are conducted on the iterative adaptive-based conductive CHSACS algorithm with test function sets. Compared with the original CS algorithm, and ACO algorithm, the CHSACS algorithm has faster convergence, higher search accuracy and a better ability to avoid local optima when dealing with continuous function optimization problems. For the dynamic travel path problem of travel time optimization, the road travel time and sightseeing time of different periods are predicted based on historical data, and the most traveled distance of travel time between two sights is dynamically searched by using the search mechanism based on time windows. The iterative adaptive CHSACS algorithm is used to continuously find the tourist traffic route with the shortest travel time travel path from all combinations of tour sequences. This paper combines the characteristics of bus vehicle scheduling itself, takes into account the interests of both bus companies and tourists, establishes a bus vehicle scheduling model with the departure interval as the independent variable, introduces this hybrid cuckoo algorithm into bus scheduling, verifies the scientific and feasibility of the algorithm through examples, and provides a new idea for solving bus scheduling optimization problems.