• Àüü
  • ÀüÀÚ/Àü±â
  • Åë½Å
  • ÄÄÇ»ÅÍ
´Ý±â

»çÀÌÆ®¸Ê

Loading..

Please wait....

¿µ¹® ³í¹®Áö

Ȩ Ȩ > ¿¬±¸¹®Çå > ¿µ¹® ³í¹®Áö > JIPS (Çѱ¹Á¤º¸Ã³¸®ÇÐȸ)

JIPS (Çѱ¹Á¤º¸Ã³¸®ÇÐȸ)

Current Result Document :

ÇѱÛÁ¦¸ñ(Korean Title) Route Optimization Algorithm Based on Game Theory for Tourism Routes at Pseudo-Imperial Palace
¿µ¹®Á¦¸ñ(English Title) Route Optimization Algorithm Based on Game Theory for Tourism Routes at Pseudo-Imperial Palace
ÀúÀÚ(Author) Guangjie Liu   Jinlong Zhu   Qiucheng Sun   Jiaze Hu   Hao Yu  
¿ø¹®¼ö·Ïó(Citation) VOL 17 NO. 05 PP. 0879 ~ 0891 (2021. 10)
Çѱ۳»¿ë
(Korean Abstract)
¿µ¹®³»¿ë
(English Abstract)
With improvements in living conditions, an increasing number of people are choosing to spend their time traveling. Comfortable tour routes are affected by the season, time, and other local factors. In this paper, the influencing factors and principles of scenic spots are analyzed, a model used to find the available routes is built, and a multi-route choice model based on a game theory utilizing a path recommendation weight is developed. A Monte Carlo analysis of a tourist route subjected to fixed access point conditions is applied to account for uncertainties such as the season, start time, end time, stay time, number of scenic spots, destination, and start point. We use the Dijkstra method to obtain multiple path plans and calculate the path evaluation score using the Monte Carlo method. Finally, according to the user preference in the input path, game theory generates path ordering for user choice. The proposed approach achieves a state-of-the-art performance at the pseudo-imperial palace. Compared with other methods, the proposed method can avoid congestion and reduce the time cost.
Å°¿öµå(Keyword) Game   Monte Carlo   Route Optimization  
ÆÄÀÏ÷ºÎ PDF ´Ù¿î·Îµå