基于M/M/s/K模型和Dijkstra算法的迪士尼乐园优化问题

A Study on the Disneyland Optimization Based on M/M/s/K Model and Dijkstra Algorithm

本文主要研究了上海迪士尼乐园优化问题,包括为顾客提供游园引导、建立休息区等,给游客以更佳的游园体验。利用最小二乘法预计未来一段时间的入园人数并将游乐场的游客量情况分为高峰期、中低峰期两种状态,分别利用TSP模型和M/M/s/K模型进行游客疏导。利用Dijkstra算法建立最短路径分析模型,将游乐园依据地理位置和项目人数分成三个区域,将地图离散化成以“一分钟步行的路程”为间隔的点,点与点之间用有向线段连接,枚举休息区。

This paper deals with the optimization of Disneyland and is determined to guild visitors with the best course, building up the rest area, bring the tourists the best experience. The paper prognoses the number of visitors a few times later with the least-squares, dividing the circumstances into two situations: high and low, leading the visitors with TSP model and M/M/S/K model. Develop a model for the shortest road with Dijkstra arithmetic, to separate the amusement park into three areas, discretize the map into distant points then connect them with directed segments, enumerating the relax areas.