Time-dependent personal tour planning and scheduling in metropolises (Retracted article. See vol. 214, 2023)
Time-dependent personal tour planning and scheduling in metropolises (Retracted article. See vol. 214, 2023)
复制标题
DOI：
10.1016/j.eswa.2011.04.025
复制
发表时间：
2011-09-15
影响因子：
8.5
通讯作者：
Samadzadegan, Farhad
中科院分区：
文献类型：
--
作者：
Abbaspour, Rahim A.;Samadzadegan, Farhad
本文讨论了在复杂的大城市地区，可能是不同人群的重要性的时间依赖性旅游规划的问题。这个问题是通过几种交通系统的方式，在特定时期内的时间序列的吸引力点的确定。该方法采用嵌套结构，由旅游规划程序调用多通道最短路径子程序，根据用户偏好和兴趣点限制生成行程。两个模块的发动机采用了两种自适应遗传算法。在这些算法中，使用了具有可变长度和特别定义的进化阶段的染色体。所提出的过程已经过测试的数据集的德黑兰。评估包括准备400个具有不同起始点、开始时间和游览持续时间的图尔斯。假设只有步行、公共汽车和地铁三种模式用于在兴趣点之间旅行。此外，一些测试应用于数据集，以说明该方法的适应性和时间依赖性。实验结果和最优率等相关指标表明，该算法能根据引入的约束条件找到最优路径。(C)2011爱思唯尔有限公司保留所有权利。
This paper addresses the problem of time-dependent tour planning in complex and large urban areas that may be of importance for different groups of people. The problem is determination of chronological sequences of attractive points during a specific period via several modes of transportation system. The proposed approach adopted a nested architecture in which tour planning routine calls multimodal shortest path subroutine to generate an itinerary based on user preferences and restrictions of interesting points. Two adapted genetic algorithms were employed in the engine of both blocks. In these algorithms, chromosomes with variable lengths and particularly defined evolutionary stages are used. The proposed process has been tested over the dataset of city of Tehran. The evaluation consists of preparation of 400 tours with different initial points, start time, and tour durations. It was assumed that just three modes of walking, bus, and subway are used to travel between points of interest. Moreover, some tests are applied to dataset to illustrate the adaptability and time-dependency nature of method. The experimental results and related indices such as optimality ratios show that the proposed algorithm can find optimum tour according to introduced constraints. (C) 2011 Elsevier Ltd. All rights reserved.