Key points are not available for this paper at this time.
This paper addresses a tourist trip design problem and a tour route planning problem to improve the competitiveness of community tourism. The problem was investigated with the objective to maximise the total number of tourists interested in visiting multiple points of interest and several specific activities to receive a satisfactory service by matching their preferences. The problem was formulated as (FJSP|TW, MRijk, SDijk|∑k∈KNumOut). To solve this problem, a mixed-integer linear programming model was developed for small-size problems, while the modified differential evolution with K-variable moves and random variable neighbourhood search (MDE–RVNS) was developed to determine near-optimal solutions for real problems. To assist the tourism service provider to schedule and sequence the trip and route planning for the tourists, a tourism service provider scheduling and sequencing software based on the MDE-RVNS was designed and developed. A mobile application using the software has been planned for launching to assist tour route planning decision-makers. This can help local tourism businesses to manage demands and ensure that the tourism revenue is evenly distributed in a tourism supply chain to enhance the well-being of local communities.
Thumrongvut et al. (Tue,) studied this question.