Host: Japan Society for Fuzzy Theory and Intelligent Informatics
In this paper, we propose a support system for tour planning that can be used from PCs and portable devices via http protocol. In this system, when a tourist specifies the starting location, the end location, the usable time and the candidate destinations with relative importance, the departure time and the arrival time, the nearly best schedule is automatically computed. We model tourism as a combinatorial problem and give a practical example of Hokkaido campus adopted as Testbed. In particular, we examine computing time that is the most inevitable problem when this support is operating. We assume that practical computing time for tour planning is ten seconds and compare heuristic and exact algorithms in terms of attraction of total tour. Our experimental results show that if we conduct this comparison and register these results in advance, our tour planning system can compute the nearly best schedule in reasonable time.
