An Optimal Routing Problem for Attraction with a Fast Pass Constraint

2015 International Conference on Computer Application Technologies Pub Date : 2015-08-31 DOI:10.1109/CCATS.2015.46

Kkyohei Sakayori, Satoshi Takahashi

引用次数: 3

Abstract

There are some recommendation sites for many popular amusement parks. It is difficult for visitors to find the best way of moving about with enjoyment, excitement and relaxation. Our research is to model to find an optimal routing of amusement parks with fast pass constraint.

查看原文本刊更多论文

具有快速通过约束的吸引最优路径问题

许多热门的游乐园都有一些推荐的地点。游客很难找到最好的方式来享受、兴奋和放松地走动。我们的研究是在快速通道约束下建立游乐园最优路线的模型。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2015 International Conference on Computer Application Technologies

自引率

0.00%

发文量