| Summary: | 碩士 === 萬能科技大學 === 經營管理研究所在職專班 === 105 === This thesis considers the tour-guide scheduling problem which was motivated by the field trip of the elementary school. Many studies about field trip have focused on questionnaire survey to find the customers’ satisfactory level after field trip activity. For activity supplier, it is important to arrange the tour route for these groups in advance so that each group can enjoy their tours around these sites timely, thus this project applies scheduling theory for the tour-guide scheduling problem and attempts to find a good tour schedule to make the tour be finished smoothly as possible.
For the field trip, the students are separated into some groups which can be referred as jobs, and each site can be referred as a city or a machine. The field trip is related to the well-known travelling salesman problem and the open shop scheduling problem. In traditional travelling salesman problem, it tries to find out the route for the salesperson to minimize the total travelling distance under the condition of each city being visited exactly once by a salesman. In tour-guide scheduling problem this constraint is relaxed, and assumes that all groups must visit each site exactly once, and sites might accommodate one or more than one groups. In addition, the guide time in the site and transport time between sites are considered in the field trip. In open shop scheduling problem, the transport time between stations is not involved, and a machine can at least process one job at a time. Due to these differences, it is hard to find a study completely the same as the field trip considered in the project to the best of my knowledge.
For systematically solving the tour-guide scheduling problem, this thesis expects that the results could be references for the field trip providers to arrange their own tour-guide schedules efficiently.
|
|---|
