Travel Route Optimization Based on 0-1 Integer Programming

Abstract

This paper carries out the research on tourism route optimization based on 0-1 integer programming, aiming to provide scientific planning solutions for diversified tourism needs. Firstly, a single-objective optimization model is constructed to obtain the optimal route and time cost for visiting major cities in the shortest time. Secondly, for the analysis of the travel plan to get the most “A-star” experience in three weeks, the single-objective planning model is used first, and then the multi-objective planning model is optimized by considering the influence of rest time on the travel experience, setting different weights, and then solving the problem again to get a more reasonable travel plan. Finally, the single-objective planning model is used to obtain the optimal route and the maximum number of attractions for the demand of visiting the most attractions. The model proposed in this study effectively responds to specific tourism situations, provides a generalized solution for tourism planning, and demonstrates stability in response to budget and cost changes.