Design of Tourist Routes in Scenic Spots -Taking Pan'an Lake Scenic Area as an Example

In this paper, we explore the application of 0-1 integer programming and mixed integer programming to solve the route design problem using the Pan'an Lake Scenic Area in Xuzhou as a case study. We aim to design scenic tour routes with the shortest walking distance and the longest visit time. We formulate the problem using a 0-1 integer programming model, with an objective function that minimizes the total route length. Constraints are established to ensure the route starts at Scenic Stone, ends at Wetland Commercial Street, each attraction is visited once, and there are no repeated paths. The research results of the article have certain reference significance for route optimization problems.