An Integer Goal Programming Model for a Touring Route Planning under the Factors by Tourists

Abstract

Generally, a touring route planning can be solved by applying the traveling salesman problem (TSP). However, TSP considers the total number of locations regardless of time constraints, including the various factors of tourists, which can be considered only one factor at a time. Sometimes tourists may prioritize each factor differently. Therefore, in this paper, we propose an integer goal programming model to plan a comprehensive travel itinerary and meet the needs of tourists as much as possible by considering factors of cost, time, and satisfaction with the tourist attractions. In the proposed model, constraints to select locations are introduced to the traveling salesman model, and goal programming is applied to meet the requirement of tourists. The model results show that the proposed model can be used more efficiently in actual trip planning than manual routing or the use of the traveling salesman problem.