A Flexible Tour Route Planning Problem with Time-Dependent Parameters Considering Rescheduling Based on Current Conditions
A Flexible Tour Route Planning Problem with Time-Dependent Parameters Considering Rescheduling Based on Current Conditions
复制标题
DOI：
10.1109/smc.2013.358
复制
发表时间：
2013-10
期刊：
影响因子：
--
通讯作者：
T. Hasuike;H. Tsubaki;H. Katagiri;H. Tsuda
中科院分区：
文献类型：
--
作者：
T. Hasuike;H. Tsubaki;H. Katagiri;H. Tsuda
本文提出了一种旅游线路规划问题，在旅游时间不确定、观光地点依赖于观光的满意值不确定的情况下，对初始路线规划进行灵活的重新调度。我们提出的模型的目标是在这些时间依赖的参数下，在所有可能的条件下，最大限度地提高旅游景点的总满意度值。由于出行时间依赖于一天中的时间，因此很难用一般的静态网络模型来表示我们所提出的模型。本文介绍了时间扩展网络（TEN），它在每个离散时间步长中包含对底层静态网络中节点集的副本。利用提出的基于神经网络的模型，可以在单个静态网络中构造各种类型的旅游路线规划问题。针对上述目标，提出了一个0-1混合整数规划问题，并开发了严格算法，将主问题等效转化为现有的基于ten的问题。
This paper proposes a tour route planning problem to flexibly reschedule the initial route plan with uncertain traveling times and satisfaction values of sightseeing places dependent on sightseeing. The objective of our proposed model is to maximize the total satisfaction value in all possible conditions after visiting a sightseeing place under such time-dependent parameters. Since traveling times are dependent on the time of day, it is hard to represent our proposed model using the general static network model. In this paper, 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. Using the proposed TEN-based model, it is possible to construct various types of tour route planning problems in a single static network. Furthermore, a 0-1 mixed integer programming problem is formulated to the above-mentioned objective, and the strict algorithm is also developed to equivalently transform the main problem into the existing TEN-based problem.