RETRACTED: Time-dependent personal tour planning and scheduling in metropolises (Retracted article. See vol. 214, 2023)

被引:90
作者
Abbaspour, Rahim A. [1 ]
Samadzadegan, Farhad [1 ]
机构
[1] Univ Tehran, Coll Engn, Surveying Eng Dept, Tehran, Iran
关键词
Itinerary planning; Multimodal transportation network; Genetic algorithm; Shortest path; Time-dependent; ALGORITHM; DESIGN; SOLVE;
D O I
10.1016/j.eswa.2011.04.025
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:12439 / 12452
页数:14
相关论文
共 51 条
[1]   A genetic algorithm for shortest path routing problem and the sizing of populations [J].
Ahn, CW ;
Ramakrishna, RS .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (06) :566-579
[2]   Multiobjective optimum path algorithm for passenger pretrip planning in multimodal transportation networks [J].
Aifadopoulou, Georgia ;
Zillaskopoulos, Athanaslos ;
Chrisohoou, Evangelia .
TRANSPORTATION RESEARCH RECORD, 2007, (2032) :26-34
[3]  
Allen G.L., 2007, Threats from Car Traffic to the Quality of Urban Life: Problems, Causes, and Solutions, P79
[4]  
ANDROUTSOPOULOS KN, 2007, EUR J OPER RES, V192, P18
[5]  
[Anonymous], 1999, Evolutionary Algorithms for Multiobjective Optimization: Methods and Applications
[6]   Metaheuristics for the team orienteering problem [J].
Archetti, Claudia ;
Hertz, Alain ;
Speranza, Maria Grazia .
JOURNAL OF HEURISTICS, 2007, 13 (01) :49-76
[7]  
Back T., 1997, IEEE Transactions on Evolutionary Computation, V1, P3, DOI 10.1109/4235.585888
[8]   Time-dependent shortest paths through a fixed sequence of nodes:: application to a travel planning problem [J].
Bérubé, JF ;
Potvin, JY ;
Vaucher, J .
COMPUTERS & OPERATIONS RESEARCH, 2006, 33 (06) :1838-1856
[9]   Object modeling and path computation for multimodal travel systems [J].
Bielli, Maurizio ;
Boulmakoul, Azedine ;
Mouncif, Hicham .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 175 (03) :1705-1730
[10]  
Bouly H, 2008, LECT NOTES COMPUT SC, V4974, P649