{"title":"An Optimal Routing Problem for Attraction with a Fast Pass Constraint","authors":"Kkyohei Sakayori, Satoshi Takahashi","doi":"10.1109/CCATS.2015.46","DOIUrl":null,"url":null,"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.","PeriodicalId":433684,"journal":{"name":"2015 International Conference on Computer Application Technologies","volume":"217 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Computer Application Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCATS.2015.46","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
