Design of Tourist Routes in Scenic Spots -Taking Pan'an Lake Scenic Area as an Example
Jiayu Dai
School of Mathematics and Finance, Hunan University of Humanities, Science and Technology, Loudi Hunan, 417000, P.R. China.
Wenhan Huang
School of Mathematics and Finance, Hunan University of Humanities, Science and Technology, Loudi Hunan, 417000, P.R. China.
Zheyuan Hu
School of Mathematics and Finance, Hunan University of Humanities, Science and Technology, Loudi Hunan, 417000, P.R. China.
Lijuan Hu *
School of Mathematics and Finance, Hunan University of Humanities, Science and Technology, Loudi Hunan, 417000, P.R. China.
*Author to whom correspondence should be addressed.
Abstract
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.
Keywords: Programming model, mixed integer programming, optimal solution, route design