Abstract

Abstract The protection, inheritance, and innovation of non-heritage tourism projects need to find a suitable entry point so that more people can participate in the inheritance and innovation of non-heritage in order to promote the long-term stable development of non-heritage tourism projects. The article establishes the framework for the ecological chain of non-heritage tourism projects based on the cultural ecological chain and analyzes the problems that exist in the development process of the ecological chain of non-heritage tourism. The optimization of the ecological chain of non-heritage tourism projects is considered a dynamic multi-objective optimization problem, and a dynamic planning model for tourism paths is established. The tourism path dynamic planning model is solved using a two-stage parallel optimization ant colony algorithm and a two-stage heuristic algorithm based on the ant colony algorithm. A simulation experiment was conducted to analyze the data and evaluate the effectiveness of the algorithm. The results show that the DACS algorithm can solve the optimal path of the ecological chain of non-heritage tourism projects with an average gap value of GAP between [10.88% and 18.71%]. The IGD of the DACS algorithm in the dMOP test case varies within 0.005, the average running time of the DACS algorithm is 29.72s, and the maximum deviation rate between the optimal solution of the algorithm and the actual optimal solution is only 3.85%. The use of the DACS algorithm can optimize the ecological chain model of non-heritage tourism projects and help the healthy development of non-heritage tourism ecological chains.

Full Text
Paper version not known

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 call

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.