Toward practical algorithms for activity chain optimization

References

• Abdelghany, A. F., and H. S. Mahmassani. 2003. “Temporal-Spatial Microassignment and Sequencing of Travel Demand with Activity-Trip Chains.” Transportation Research Record 1831 (1831): 89–97. Doi: 10.3141/1831-10.
   Google Scholar
• Applegate, D. L., R. E. Bixby, V. Chvatal, and W. J. Cook. 2011. The Traveling Salesman Problem: A Computational Study. Princeton University Press. https://press.princeton.edu/titles/8451.html
   Google Scholar
• Applegate, D. L., R. E. Bixby, V. Chvátal, D. G. William Cook, M. G. Espinoza, and K. Helsgaun. 2009. “Certification of an Optimal TSP Tour through 85,900 Cities.” Operations Research Letters 37 (1): 11–15. doi:10.1016/j.orl.2008.09.006.
   Web of Science ®Google Scholar
• Barach, G., H. Fort, Y. Mehlman, and F. Zypman. 2012. “Information in the Traveling Salesman Problem.” Applied Mathematics 03 (08): 926–930. doi:10.4236/am.2012.38138.
   Google Scholar
• Cantelmo, G., and F. Viti. 2019. “Incorporating Activity Duration and Scheduling Utility into Equilibrium-based Dynamic Traffic Assignment.” Transportation Research Part B: Methodological 126: 365–390. doi:10.1016/j.trb.2018.08.006.
   Web of Science ®Google Scholar
• Chettibi, T., H. E. Lehtihet, M. Haddad, and S. Hanchi. 2004. “Minimum Cost Trajectory Planning for Industrial Robots.” European Journal of Mechanics A/Solids 23: 703–715. doi:10.1016/j.euromechsol.2004.02.006.
   Web of Science ®Google Scholar
• Christofides, N. 1976. Worst-case Analysis of a New Heuristic for the Travelling Salesman Problem. Technical Report 388. Graduate School of Industrial Administration, Carnegie Mellon University..
   Google Scholar
• Comi, A., and A. Nuzzolo. 2016. “Individual Utility-based Path Suggestions in Transit Trip Planners.” IET Intelligent Transport Systems 10 (4): 219–226. doi:10.1049/iet-its.2015.0138.
   Web of Science ®Google Scholar
• Cook, W. J. 2012. In Pursuit of the Traveling Salesman. Princeton University Press. https://press.princeton.edu/titles/9531.html
   Google Scholar
• Dantzig, G., R. Fulkerson, and S. Johnson. 1954. “Solution of a Large-Scale Traveling-Salesman Problem.” Journal of the Operations Research Society of America 2 (4): 393–410. doi:10.1287/opre.2.4.393.
   Web of Science ®Google Scholar
• Dantzig, G. B., A. Orden, and P. Wolfe. 1955. “The Generalized Simplex Method for Minimizing a Linear Form under Linear Inequality Restraints.” Pacific Journal of Mathematics 5 (2): 183–195. doi:10.2140/pjm.
   Google Scholar
• Esztergár-Kiss, D., Z. Rózsa, and T. Tettamanti. 2017. “Comparative Analysis of Test Cases of the Activity Chain Optimization Method.” Transportation Research Procedia 27: 286–293. doi:10.1016/j.trpro.2017.12.136.
   Google Scholar
• Esztergár-Kiss, D., Z. Rózsa, and T. Tettamanti. 2018. “Extensions of the Activity Chain Optimization Method.” Journal of Urban Technology 25 (2): 125–142. doi:10.1080/10630732.2017.1407998.
   Web of Science ®Google Scholar
• Fazlollahtabar, H., and M. Saidi-Mehrabad. 2015. “Optimal Path in an Intelligent AGV-based Manufacturing System.” Transportation Letters 7 (4): 219–228. doi:10.1179/1942787514Y.0000000047.
   Web of Science ®Google Scholar
• Grefenstette, J. J. 1985. Proceedings of the First International Conference on Genetic Algorithms and their Applications. Taylor and Francis. https://www.taylorfrancis.com/books/9781315799674
   Google Scholar
• Gutin, G., and A. Punnen. 2002. Travelling Salesman Problem and Its Variations. Kluwer Academic Publishers. http://site.ebrary.com/lib/wpi/reader.action?docID=10067445
   Google Scholar
• Hafezi, M. H., L. Liu, and H. Millward. 2018. “Learning Daily Activity Sequences of Population Groups Using Random Forest Theory.” Transportation Research Record 036119811877319. Doi: 10.1177/0361198118773197.
   Google Scholar
• Haklay, M., and P. Weber. 2008. “OpenStreet Map: User-generated Street Maps.” IEEE Pervasive Computing 7 (4): 12–18. doi:10.1109/MPRV.2008.80.
   Web of Science ®Google Scholar
• Held, M., and R. M. Karp. 1962. “A Dynamic Programming Approach to Sequencing Problems.” Journal of the Society for Industrial and Applied Mathematics 10 (1): 196–210. http://epubs.siam.org/doi/10.1137/0110015
   Google Scholar
• Helsgaun, K. 2000. “Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic.” European Journal of Operational Research 126 (1): 106–130. doi:10.1016/S0377-2217(99)00284-2.
   Web of Science ®Google Scholar
• Heydecker, B. G., and J. D. Addison. 2006. “Analysis of Dynamic Traffic Assignment.” In DTA2006 First International Symposium on Dynamic Traffic Assignment.
   Google Scholar
• Hilgert, T., M. Kagerbauer, T. Schuster, and C. Becker. 2016. “Optimization of Individual Travel Behavior through Customized Mobility Services and Their Effects on Travel Demand and Transportation Systems.” Transportation Research Procedia 19: 58–69. doi:10.1016/j.trpro.2016.12.068.
   Google Scholar
• Hillsman, E. L., and S. J. Barbeau. 2011. “Enabling Cost-Effective Multimodal Trip Planners through Open Transit Data.” may. https://rosap.ntl.bts.gov/view/dot/20542
   Google Scholar
• Kona, H., and A. Burde. 2015. “A Review of Traveling Salesman Problem with Time Window Constraint.” IJIRST-International Journal for Innovative Research in Science & Technology 2. www.ijirst.org
   Google Scholar
• Li, Z.-C., Y. Yin, W. H. K. Lam, and A. Sumalee. 2016. “Simultaneous Optimization of Fuel Surcharges and Transit Service Runs in a Multimodal Transport Network: A Time-dependent Activity-based Approach.” Transportation Letters 8 (1): 35–46. doi:10.1179/1942787515Y.0000000005.
   Web of Science ®Google Scholar
• Li, Z. C., W. H. K. Lam, and S. C. Wong. 2014. “Bottleneck Model Revisited: An Activity-based Perspective.” Transportation Research Part B: Methodological 68: 262–287. doi:10.1016/j.trb.2014.06.013.
   Web of Science ®Google Scholar
• Liao, F., T. Arentze, and H. Timmermans. 2013. “Incorporating Space-time Constraints and Activity-travel Time Profiles in a Multi-state Supernetwork Approach to Individual Activity-travel Scheduling.” Transportation Research Part B: Methodological 55: 41–58. doi:10.1016/j.trb.2013.05.002.
   Web of Science ®Google Scholar
• Menger, K. 1931. “Bericht Über Ein Mathematisches Kolloquium 1929/30.” Monatshefte Für Mathematik Und Physik 38 (1): 17–38. http://link.springer.com/10.1007/BF01700678
   Google Scholar
• Miller, E. J., and M. J. Roorda. 2003. “Prototype Model of Household Activity-Travel Scheduling.” Transportation Research Record: Journal of the Transportation Research Board 1831 (1): 114–121. doi:10.3141/1831-13.
   Google Scholar
• Nadizadeh, A., and B. Kafash. 2019. “Fuzzy Capacitated Location-routing Problem with Simultaneous Pickup and Delivery Demands.” Transportation Letters 11 (1): 1–19. doi:10.1080/19427867.2016.1270798.
   Web of Science ®Google Scholar
• Polak, J. W., and B. G. Heydecker. 2006. “The Dynamic Assignment of Tours in Congested Networks with Pricing.” In DTA2006 First International Symposium on Dynamic Traffic Assignment, http://dtasymposium.org/dtasymposia/DTA2006/dta2006_proceedings.pdf
   Google Scholar
• Rasouli, S., and H. Timmermans. 2014. “Activity-based Models of Travel Demand: Promises, Progress and Prospects.” International Journal of Urban Sciences 18 (1): 31–60. doi:10.1080/12265934.2013.835118.
   Google Scholar
• Rego, C., D. Gamboa, F. Glover, and C. Osterman. 2011. “Traveling Salesman Problem Heuristics: Leading Methods, Implementations and Latest Advances.” European Journal of Operational Research 211 (3): 427–441. doi:10.1016/j.ejor.2010.09.010.
   Web of Science ®Google Scholar
• Robinson, J. B. 1949. On the Hamiltonian Game (A Traveling-Salesman Problem). Santa Monica: Rand Corp. http://www.rand.org/pubs/research_memoranda/RM303.html
   Google Scholar
• Sharmeen, F., T. Arentze, and H. Timmermans. 2013. “Incorporating Time Dynamics in Activity Travel Behavior Model.” Transportation Research Record: Journal of the Transportation Research Board 2382 (1): 54–62. doi:10.3141/2382-07.
   Web of Science ®Google Scholar
• Smith, S. L., and F. Imeson. 2017. “GLNS: An Effective Large Neighborhood Search Heuristic for the Generalized Traveling Salesman Problem.” Computers and Operations Research 87: 1–19. doi:10.1016/j.cor.2017.05.010.
   Web of Science ®Google Scholar
• Sutton, R. S. 1984. “Temporal Credit Assignment in RL.” Doctoral Dissertations Available from Proquest https://scholarworks.umass.edu/dissertations/AAI8410337
   Google Scholar
• Timmermans, H., P. van der Waerden, M. Alves, J. Polak, A. S. Scott Ellis, A. S. Harvey, and K. S. 2003. “Spatial Context and the Complexity of Daily Travel Patterns: An International Comparison.” Journal of Transport Geography 11 (1): 37–46. doi:10.1016/S0966-6923(02)00050-9.
   Google Scholar
• Timmermans, H., and J. Petrus. 2005. Progress in Activity-based Analysis. Elsevier. https://books.emeraldinsight.com/page/detail/progress-in-activitybased-analysis-by-harry-timmermansProgress-in-Activity-Based-Analysis/?k=9780080445816
   Google Scholar
• Voigt, B. F. 1831. Der Handlungsreisende, Wie Er Sein Soll Und Was Er Zu Thun Hat, Um Aufträge Zu Erhalten Und Eines Glücklichen Erfolgs in Seinen Geschäften Gewiss Zu Sein. Vol. 7. Schramm. https://books.google.hu/books?id=6zAgAAAACAAJ&dq=Der+Handlungsreisende+wie+er+sein+soll&hl=en&sa=X&ved=0ahUKEwib1qCGhK_gAhVHaVAKHSOACUwQ6AEILjAB
   Google Scholar
• Xie, C., and S. Waller. 2010. “Estimation and Application of a Bayesian Network Model for Discrete Travel Choice Analysis.” Transportation Letters 2 (2): 125–144. doi:10.3328/TL.2010.02.02.125-144.
   Web of Science ®Google Scholar
• Yao, B., Q. Cao, Z. Wang, P. Hu, M. Zhang, and B. Yu. 2016. “A Two-stage Heuristic Algorithm for the School Bus Routing Problem with Mixed Load Plan.” Transportation Letters 8 (4): 205–219. doi:10.1080/19427867.2015.1110953.
   Web of Science ®Google Scholar