Route planning problem under fuzzy sightseeing times and satisfaction values of sightseeing places

This paper proposes a personal tour planning problem with uncertain traveling times and satisfaction values of sightseeing places dependent on sightseeing. Since traveling times are dependent on the time of day, it is difficult to represent this uncertain 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 variations of traveling times and satisfactions values of sightseeing places in a single static network. Furthermore, uncertain sightseeing times are represented as fuzzy variables and the proposed model is formulated as a fuzzy 0-1 mixed integer programming problem, and also equivalently transformed into several existing tour planning problems using some natural assumptions in fuzzy programming.

[1]  Farokh B. Bastani,et al.  Optimization Models for Assessing the Peak Capacity Utilization of Intelligent Transportation Systems , 2009, Eur. J. Oper. Res..

[2]  Kuan-Lin Chen,et al.  Optimization of earth recycling and dump truck dispatching , 2012, Comput. Ind. Eng..

[3]  Konstantinos G. Zografos,et al.  Algorithms for Itinerary Planning in Multimodal Transportation Networks , 2008, IEEE Transactions on Intelligent Transportation Systems.

[4]  Olivier L. de Weck,et al.  Time-expanded decision networks: A framework for designing evolvable complex systems , 2007 .

[5]  Leena Suhl,et al.  A time-space network based exact optimization model for multi-depot bus scheduling , 2006, Eur. J. Oper. Res..

[6]  J. Q. Hu,et al.  On the tour planning problem , 2012, Ann. Oper. Res..

[7]  Farhad Samadzadegan,et al.  Time-dependent personal tour planning and scheduling in metropolises , 2011, Expert Syst. Appl..

[8]  Xiaoqiang Cai,et al.  Time-varying universal maximum flow problems , 2001 .

[9]  Michael Florian,et al.  The engine scheduling problem in a railway network , 1976 .

[10]  Tsai-Yun Liao,et al.  Simulation-Assignment-Based Travel Time Prediction Model for Traffic Corridors , 2012, IEEE Transactions on Intelligent Transportation Systems.

[11]  Kees Maat,et al.  Deriving and validating trip purposes and travel modes for multi-day GPS-based travel surveys: A large-scale application in the Netherlands , 2009 .

[12]  Leena Suhl,et al.  A partially integrated airline crew scheduling approach with time-dependent crew capacities and multiple home bases , 2006, Eur. J. Oper. Res..

[13]  Dirk Van Oudheusden,et al.  A PERSONALIZED TOURIST TRIP DESIGN ALGORITHM FOR MOBILE TOURIST GUIDES , 2008, Appl. Artif. Intell..

[14]  D. Ettema,et al.  Out-of-home activities, daily travel, and subjective well-being , 2010 .

[15]  Matteo Fischetti,et al.  The Generalized Traveling Salesman and Orienteering Problems , 2007 .

[16]  Saeid Nahavandi,et al.  Prediction Intervals to Account for Uncertainties in Travel Time Prediction , 2011, IEEE Transactions on Intelligent Transportation Systems.

[17]  Gerald L. Thompson,et al.  A Dynamic Space-Time Network Flow Model for City Traffic Congestion , 1987, Transp. Sci..

[18]  Martin W. P. Savelsbergh,et al.  Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem , 2011, INFORMS J. Comput..

[19]  George L. Nemhauser,et al.  The fleet assignment problem: Solving a large-scale integer program , 1995, Math. Program..

[20]  Shangyao Yan,et al.  An optimization model and a solution algorithm for the many-to-many car pooling problem , 2011, Ann. Oper. Res..