Extensions of the Activity Chain Optimization Method

ABSTRACT For the optimization of daily activity chains a novel method has been elaborated, where flexible demand points were introduced. Some activities are not necessarily fixed temporally and spatially, therefore they can be realized in different times or locations. By using flexible demand points, the method is capable of finding new combinations of activity chains and choosing the optimal set of activities. The optimization algorithm solves the TSP-TW (Traveling Salesman Problem – Time Window) problem with many flexible demand points, which resulted in high complexity and long processing times. Therefore, two extensions were developed to speed up the processes. A POI (Point Of Interest) search algorithm enabled to search demand points in advance and store them in an offline database. Furthermore GA (genetic algorithm) was applied and customized to realize lower optimization times. During the implementation, three different transportation modes were defined: car, public transport, and combined (public transport with car-sharing opportunity). The simulations were performed on arbitrarily chosen test networks using Matlab. Promising test results were obtained for all transportation modes with total travel time reduction of 10–15 percent. The application of the extended optimization method produced shorter activity chains and decreased total travel time for the users.

[1]  Matthew J. Roorda,et al.  Exploring spatial variety in patterns of activity-travel behaviour: initial results from the Toronto Travel-Activity Panel Survey (TTAPS) , 2008 .

[2]  Weibo Li,et al.  A Critical Review of New Mobility Services for Urban Transport , 2016 .

[3]  Gilberto Reynoso Meza,et al.  Background on Multiobjective Optimization for Controller Tuning , 2017 .

[4]  Harry Timmermans,et al.  Individuals' Activity–Travel Rescheduling Behaviour: Experiment and Model-Based Analysis , 2009 .

[5]  Domokos Esztergár-Kiss,et al.  Simulation results for a daily activity chain optimization method , 2015, 2015 International Conference on Models and Technologies for Intelligent Transportation Systems (MT-ITS).

[6]  J. Sallis,et al.  Urban form correlates of pedestrian travel in youth: Differences by gender, race-ethnicity and household attributes , 2007 .

[7]  S. B. Pattnaik,et al.  Urban Bus Transit Route Network Design Using Genetic Algorithm , 1998 .

[8]  Sean T. Doherty,et al.  How Far in Advance Are Activities Planned? , 2005 .

[9]  Banihan Gunay,et al.  Using GIS to visualise and evaluate student travel behaviour , 2011 .

[10]  Kay W. Axhausen,et al.  Continuous Activity Planning for Continuous Traffic Simulation , 2011 .

[11]  Mitsuo Gen,et al.  Genetic algorithms and engineering optimization , 1999 .

[12]  Darren M. Scott,et al.  Exploring day-to-day variability in time use for household members , 2010 .

[13]  Dorothea Heiss-Czedik,et al.  An Introduction to Genetic Algorithms. , 1997, Artificial Life.

[14]  Michal Jakob,et al.  Fully agent-based simulation model of multimodal mobility in European cities , 2015, 2015 International Conference on Models and Technologies for Intelligent Transportation Systems (MT-ITS).

[15]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[16]  Matthew J. Roorda,et al.  Prototype Model of Household Activity-Travel Scheduling , 2003 .

[17]  Harry Timmermans,et al.  Incorporating Time Dynamics in Activity Travel Behavior Model , 2013 .

[18]  Sanjeeb Dash,et al.  A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows , 2012, INFORMS J. Comput..

[19]  Warren B. Powell,et al.  An Optimization-Based Heuristic for Vehicle Routing and Scheduling with Soft Time Window Constraints , 1992, Transp. Sci..

[20]  Hjp Harry Timmermans,et al.  Incorporating space-time constraints and activity-travel time profiles in a multi-state supernetwork approach to individual activity-travel scheduling , 2013 .

[21]  Hang Liu,et al.  Generalized Profitable Tour Problems for Online Activity Routing System , 2012 .

[22]  T. Mátrai,et al.  CHANGES IN TRAVEL DEMAND IN BUDAPEST DURING THE LAST 10 YEARS , 2013 .

[23]  Jacques Desrosiers,et al.  An Optimal Algorithm for the Traveling Salesman Problem with Time Windows , 1991, Oper. Res..

[24]  A. Kazemi,et al.  A multi-agent system to solve the production–distribution planning problem for a supply chain: a genetic algorithm approach , 2009 .

[25]  Kay W. Axhausen,et al.  Location Choice Modeling for Shopping and Leisure Activities with MATSim , 2009 .

[26]  K. Nagel,et al.  Generating complete all-day activity plans with genetic algorithms , 2005 .

[28]  Harry Timmermans,et al.  Incorporating planned activities and events in a dynamic multi-day activity agenda generator , 2012 .

[29]  Joshua Auld,et al.  Analysis of Activity Conflict Resolution Strategies , 2008 .

[30]  Ireneusz Celiński,et al.  Travel Behavior Profiling Using a Trip Planner , 2016 .

[31]  R. Jayakrishnan,et al.  Tourist Activity Simulation Model for Assessing Real-Time Tour Information Systems , 2012, J. Intell. Transp. Syst..

[32]  Sean T. Doherty.  Should we abandon activity type analysis? Redefining activities by their salient attributes , 2006 .

[33]  Kay W. Axhausen,et al.  Location Choice Modeling for Shopping and Leisure Activities with MATSim , 2010 .

[34]  Szabolcs Duleba,et al.  A dynamic analysis on public bus transport's supply quality by using AHP , 2012 .

[35]  H. Timmermans,et al.  Spatial context and the complexity of daily travel patterns: an international comparison , 2003 .

[36]  Theo A. Arentze,et al.  Adaptive Personalized Travel Information Systems: A Bayesian Method to Learn Users' Personal Preferences in Multimodal Transport Networks , 2013, IEEE Transactions on Intelligent Transportation Systems.

[37]  Laurent Moalic,et al.  Combining VNS with Genetic Algorithm to solve the one-to-one routing issue in road networks , 2017, Comput. Oper. Res..

[38]  Jee Eun Kang,et al.  The location selection problem for the household activity pattern problem , 2013 .

[39]  Agostino Nuzzolo,et al.  Advanced public transport systems and ITS: New tools for operations control and traveler advising , 2014, 17th International IEEE Conference on Intelligent Transportation Systems (ITSC).

[40]  Yusak O. Susilo,et al.  Comparative framework for activity-travel diary collection systems , 2015, 2015 International Conference on Models and Technologies for Intelligent Transportation Systems (MT-ITS).

[41]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

[42]  Roberto Roberti,et al.  New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows , 2012, INFORMS J. Comput..

[43]  G. Reinelt.  The traveling salesman: computational solutions for TSP applications , 1994 .

[44]  Kay W. Axhausen,et al.  Continuous Activity Planning for a Continuous Traffic Simulation , 2010 .

[45]  Matthew J. Roorda,et al.  Strategies for Resolving Activity Scheduling Conflicts: An Empirical Analysis , 2005 .