Route planning problem with groups of sightseeing sites classified by tourist's sensitivity under Time-Expanded Network
Route planning problem with groups of sightseeing sites classified by tourist's sensitivity under Time-Expanded Network
复制标题
DOI：
10.1109/smc.2014.6973905
复制
发表时间：
2014-12
期刊：
影响因子：
--
通讯作者：
T. Hasuike;H. Katagiri;H. Tsubaki;H. Tsuda
中科院分区：
文献类型：
--
作者：
T. Hasuike;H. Katagiri;H. Tsubaki;H. Tsuda
本文提出了一个旅游景点之间旅行时间依赖于时间的旅游路线规划问题。由于旅行时间取决于一天中的时间，因此引入了时间扩展网络（TEN），它包含每个离散时间步的底层静态网络中的节点集的副本。此外，由于游客的模糊敏感性，很难用数字来确定观光景点的满意度值，但游客将观光景点分为几组并不难。因此，我们所提出的模型的目标函数设置为最大化的总访问观光景点在每个组。该问题是一个多目标规划问题，因此，妥协原则被引入到解决我们提出的网络优化问题。此外，还开发了一个严格的算法，将主要问题等价地转换为现有的基于TEN的问题。
This paper proposes a sightseeing route planning problem with time-dependent traveling times among sightseeing sites. Since traveling times are dependent on the time of day, Time-Expanded Network (TEN), which contains a copy to the set of nodes in the underlying static network for each discrete time step, is introduced. In addition, it is hard to set satisfaction values at sightseeing sites numerically due to tourist's ambiguous sensitivity, but it is not difficult to classify sightseeing sites into several groups by the tourist. Therefore, the objective function of our proposed model is set to maximize the total visiting sightseeing sites in each group. The problem is a multiobjective programming problem, and hence, a principle of compromise is introduced to solve our proposed problem in network optimization. Furthermore, a strict algorithm is also developed to equivalently transform the main problem into the existing TEN-based problem.