Tour Planning for Sightseeing with Time-Dependent Satisfactions of Activities and Traveling Times
暂无分享,去创建一个
[1] Saeid Nahavandi,et al. Prediction Intervals to Account for Uncertainties in Travel Time Prediction , 2011, IEEE Transactions on Intelligent Transportation Systems.
[2] Matteo Fischetti,et al. Solving the Orienteering Problem through Branch-and-Cut , 1998, INFORMS J. Comput..
[3] J. Q. Hu,et al. On the tour planning problem , 2012, Ann. Oper. Res..
[4] Farokh B. Bastani,et al. Optimization Models for Assessing the Peak Capacity Utilization of Intelligent Transportation Systems , 2009, Eur. J. Oper. Res..
[5] Leena Suhl,et al. A time-space network based exact optimization model for multi-depot bus scheduling , 2006, Eur. J. Oper. Res..
[6] Gerald L. Thompson,et al. A Dynamic Space-Time Network Flow Model for City Traffic Congestion , 1987, Transp. Sci..
[7] Olivier L. de Weck,et al. Time-expanded decision networks: A framework for designing evolvable complex systems , 2007 .
[8] Michel Gendreau,et al. A tabu search heuristic for the undirected selective travelling salesman problem , 1998, Eur. J. Oper. Res..
[9] H. D. Ratliff,et al. Note—Some Equivalent Objectives for Dynamic Network Flow Problems , 1982 .
[10] 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..
[11] D. Ettema,et al. Out-of-home activities, daily travel, and subjective well-being , 2010 .
[12] Elise Miller-Hooks,et al. A TABU search heuristic for the team orienteering problem , 2005, Comput. Oper. Res..
[13] Parviz Fattahi,et al. A New Solution Seed for Job Shop Scheduling Problem , 2011 .
[14] Michael Florian,et al. The engine scheduling problem in a railway network , 1976 .
[15] Konstantinos G. Zografos,et al. Algorithms for Itinerary Planning in Multimodal Transportation Networks , 2008, IEEE Transactions on Intelligent Transportation Systems.
[16] 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..
[17] Bruce L. Golden,et al. A fast and effective heuristic for the orienteering problem , 1996 .
[18] Dirk Van Oudheusden,et al. A PERSONALIZED TOURIST TRIP DESIGN ALGORITHM FOR MOBILE TOURIST GUIDES , 2008, Appl. Artif. Intell..
[19] Qiwen Wang,et al. Using artificial neural networks to solve the orienteering problem , 1995, Ann. Oper. Res..
[20] Zuren Feng,et al. Ants can solve the team orienteering problem , 2008, Comput. Ind. Eng..
[21] Tsai-Yun Liao,et al. Simulation-Assignment-Based Travel Time Prediction Model for Traffic Corridors , 2012, IEEE Transactions on Intelligent Transportation Systems.
[22] 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 .
[23] Matteo Fischetti,et al. The Generalized Traveling Salesman and Orienteering Problems , 2007 .
[24] Shangyao Yan,et al. An optimization model and a solution algorithm for the many-to-many car pooling problem , 2011, Ann. Oper. Res..
[25] George L. Nemhauser,et al. The fleet assignment problem: Solving a large-scale integer program , 1995, Math. Program..
[26] Jocelyne Elias,et al. Very large-scale neighborhood search algorithms for the design of service overlay networks , 2012, Telecommun. Syst..
[27] Farhad Samadzadegan,et al. Time-dependent personal tour planning and scheduling in metropolises , 2011, Expert Syst. Appl..
[28] Kuan-Lin Chen,et al. Optimization of earth recycling and dump truck dispatching , 2012, Comput. Ind. Eng..
[29] Nilay Noyan,et al. Stochastic optimization models for the airport gate assignment problem , 2012 .
[30] Jeffery L. Kennington,et al. The Uncapacitated Time-Space Fixed-Charge Network Flow Problem: An Empirical Investigation of Procedures for Arc Capacity Assignment , 2010, INFORMS J. Comput..
[31] Xiaoqiang Cai,et al. Time-varying universal maximum flow problems , 2001 .