A Planning Algorithm for One-Day Circular Tour Using Public Transport

摘要

Worldwide, the number of foreign independent tours (FITs) is rapidly increasing. FIT visitors usually use one hotel as a base: they leave from it, travel around various sightseeing areas using public transport, and return to their hotel the same day; in this paper, we term this the "one-day circular tour" (OCT). However, owing to restrictions with public transport schedules, it is difficult to visit many sightseeing areas efficiently and satisfactorily within a limited time. In this study, we present a planning algorithm for OCTs that offers high satisfaction when using public transport in this manner. After defining relevant terms related to sightseeing and tour conditions, we describe our new planning algorithm. Finally, we present the results of our evaluation of the algorithm by means of practical examples; we clarify the feasibility of our approach and make proposals for future studies.