Abstract
In this paper, we designed a dynamic route planning scheme for scenic spots. Specifically, in this scheme, the initial value of each scenic spot is determined in the scenic spot. Then, the map containing the relative distance data between the scenic spots in the scenic spot is processed to obtain the path information between the scenic spots. The tourist’s time requirements are obtained for the scenic area visit in order to get the default optimal route. Furthermore, the default optimal path is obtained to meet the expectations of tourists. Further, based on the current time point, the precise value of the remaining scenic spots in the tourist's selection requirements, and the path information between the remaining scenic spots, the optimal value solving operation is performed to obtain the optimal path for the current time point. Based on the known data, combined with the multi-definition algorithm to solve the optimal path, the best tour route matching the current location can be obtained in real time according to the actual tour mode of the tourists, thereby avoiding time waste and improving the tour experience.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.