| Summary: | 碩士 === 元智大學 === 工業工程與管理學系 === 105 === Tourist trip design problem belongs to the category of the orienteering problem with time windows. Orienteering problem, unlike the travelling salesman problem, doesn’t need to visit all nodes when considering the time constraint. Moreover, in the orienteering problem with time window, each node is assigned a time window that represents the time interval of a node able to be visited. When the scenario comes to the tour planning, how to let a group of tourists feels satisfied about the tour planned is full of challenge. Different members may have different consideration for the budget, and different preference for the points of interest. Therefore, the score associated with each node can be used to represent the profit or preference. In order to better fit the actual situation, an orienteering problem with time windows is extended to a multi-objective orienteering problem with time windows. The concept of Pareto-optimal front is used to provide alternative routes for tourists to choose.
In this thesis, a novel metaheuristic algorithm, called virus optimization algorithm, is proposed to solve 76 benchmark instances to show the performance of the proposed VOA. The results of VOA is compared with the ones by the ant colony optimization method from Chen et al. (2015). The results show that VOA performs well in the second type of classes r and c instances. As for the rc and pr benchmark instances, VOA is able to perform competitive in both classes.
|
|---|
