|
A memetic algorithm for orienteering problem with hotel and restaurant selection and time window |
|---|---|
| รหัสดีโอไอ | |
| Title | A memetic algorithm for orienteering problem with hotel and restaurant selection and time window |
| Creator | Apisit Cheng |
| Contributor | Aussadavut Dumrongsiri, Advisor |
| Publisher | Thammasat University |
| Publication Year | 2563 |
| Keyword | Tour trip design problem, Memetic algorithm, Mathematical model, Travel routing, Orienteering problem |
| Abstract | To design a tour plan which provide a maximum satisfaction, before have any experiences with the destination can be hard and time consuming process. The goal of this study is to create an algorithm that efficiently generate a tour plan with high or maximum satisfaction within a reasonable processing time. The memetic algorithm which is a combination of genetics algorithm and local search algorithm would be created to solve this problem. This study used real data gathered from trusted tourist community in Thailand such as TripAdvisor.com, Wongnai.com, etc. Information of 181 sites were gathered including 39 hotels, 48 lunch restaurants, 49 dinner restaurants, and 45 tour sites. These information were used as an input for optimization and memetic algorithm approach. The result of this study shown that MA could provide avg. saving in computation time of 158.92 seconds, with the maximum of 736.69 seconds. Avg. %gap in total tour score of 1.59 with standard deviation of 2.24. As a summary, the MA approach could solve tour trip design problem efficiently since both saving in computation time and %gap are in a good shape and well-balanced. |
