Travel Time Estimation in the Age of Big Data
Author
Abstract
Suggested Citation
DOI: 10.1287/opre.2018.1784
Download full text from publisher
References listed on IDEAS
- Michał Pióro & Yoann Fouquet & Dritan Nace & Michael Poss, 2016. "Optimizing Flow Thinning Protection in Multicommodity Networks with Variable Link Capacity," Operations Research, INFORMS, vol. 64(2), pages 273-289, April.
- E. Nikolova & N. E. Stier-Moses, 2014. "A Mean-Risk Model for the Traffic Assignment Problem with Stochastic Travel Times," Operations Research, INFORMS, vol. 62(2), pages 366-382, April.
- Patrick Jaillet & Jin Qi & Melvyn Sim, 2016. "Routing Optimization Under Uncertainty," Operations Research, INFORMS, vol. 64(1), pages 186-200, February.
- Jenelius, Erik & Koutsopoulos, Haris N., 2013. "Travel time estimation for urban road networks using low frequency probe vehicle data," Transportation Research Part B: Methodological, Elsevier, vol. 53(C), pages 64-81.
- Coifman, Benjamin, 2002. "Estimating travel times and vehicle trajectories on freeways using dual loop detectors," Transportation Research Part A: Policy and Practice, Elsevier, vol. 36(4), pages 351-364, May.
- Miles Lubin & Iain Dunning, 2015. "Computing in Operations Research Using Julia," INFORMS Journal on Computing, INFORMS, vol. 27(2), pages 238-248, May.
- Flurin S. Hänseler & Nicholas A. Molyneaux & Michel Bierlaire, 2017. "Estimation of Pedestrian Origin-Destination Demand in Train Stations," Transportation Science, INFORMS, vol. 51(3), pages 981-997, August.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Long He & Sheng Liu & Zuo‐Jun Max Shen, 2022. "Smart urban transport and logistics: A business analytics perspective," Production and Operations Management, Production and Operations Management Society, vol. 31(10), pages 3771-3787, October.
- Wagenaar, J.C. & Fragkos, I. & Faro, W.L.C., 2023. "Transportation asset acquisition under a newsvendor model with cutting-stock restrictions: Approximation and decomposition algorithms," Other publications TiSEM 97eddbd0-6e34-489c-b27d-9, Tilburg University, School of Economics and Management.
- Saridakis, Charalampos & Katsikeas, Constantine S. & Angelidou, Sofia & Oikonomidou, Maria & Pratikakis, Polyvios, 2023. "Mining Twitter lists to extract brand-related associative information for celebrity endorsement," European Journal of Operational Research, Elsevier, vol. 311(1), pages 316-332.
- Tsan‐Ming Choi & Subodha Kumar & Xiaohang Yue & Hau‐Ling Chan, 2022. "Disruptive Technologies and Operations Management in the Industry 4.0 Era and Beyond," Production and Operations Management, Production and Operations Management Society, vol. 31(1), pages 9-31, January.
- Felipe Lagos & Sebastián Moreno & Wilfredo F. Yushimito & Tomás Brstilo, 2024. "Urban Origin–Destination Travel Time Estimation Using K-Nearest-Neighbor-Based Methods," Mathematics, MDPI, vol. 12(8), pages 1-18, April.
- Alexandre M. Florio & Nabil Absi & Dominique Feillet, 2021. "Routing Electric Vehicles on Congested Street Networks," Transportation Science, INFORMS, vol. 55(1), pages 238-256, 1-2.
- Edward He & Natashia Boland & George Nemhauser & Martin Savelsbergh, 2021. "Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 997-1014, July.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Zhaoqi Zang & Xiangdong Xu & Kai Qu & Ruiya Chen & Anthony Chen, 2022. "Travel time reliability in transportation networks: A review of methodological developments," Papers 2206.12696, arXiv.org, revised Jul 2022.
- Luo, Xiaoqian & Wang, Dianhai & Ma, Dongfang & Jin, Sheng, 2019. "Grouped travel time estimation in signalized arterials using point-to-point detectors," Transportation Research Part B: Methodological, Elsevier, vol. 130(C), pages 130-151.
- Leilei Zhang & Tito Homem-de-Mello, 2017. "An Optimal Path Model for the Risk-Averse Traveler," Transportation Science, INFORMS, vol. 51(2), pages 518-535, May.
- Fahad Alrukaibi & Rushdi Alsaleh & Tarek Sayed, 2019. "Applying Machine Learning and Statistical Approaches for Travel Time Estimation in Partial Network Coverage," Sustainability, MDPI, vol. 11(14), pages 1-18, July.
- Nantes, Alfredo & Ngoduy, Dong & Miska, Marc & Chung, Edward, 2015. "Probabilistic travel time progression and its application to automatic vehicle identification data," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 131-145.
- Mojtaba Rajabi-Bahaabadi & Afshin Shariat-Mohaymany & Mohsen Babaei & Daniele Vigo, 2021. "Reliable vehicle routing problem in stochastic networks with correlated travel times," Operational Research, Springer, vol. 21(1), pages 299-330, March.
- Shafqat Jawad & Junyong Liu, 2020. "Electrical Vehicle Charging Services Planning and Operation with Interdependent Power Networks and Transportation Networks: A Review of the Current Scenario and Future Trends," Energies, MDPI, vol. 13(13), pages 1-24, July.
- Randall Berry & Michael Honig & Thành Nguyen & Vijay Subramanian & Rakesh Vohra, 2020. "The Value of Sharing Intermittent Spectrum," Management Science, INFORMS, vol. 66(11), pages 5242-5264, November.
- Peer, Stefanie & Knockaert, Jasper & Koster, Paul & Tseng, Yin-Yen & Verhoef, Erik T., 2013. "Door-to-door travel times in RP departure time choice models: An approximation method using GPS data," Transportation Research Part B: Methodological, Elsevier, vol. 58(C), pages 134-150.
- Aritra Pal & Hadi Charkhgard, 2019. "A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming," INFORMS Journal on Computing, INFORMS, vol. 31(1), pages 115-133, February.
- Enrico Bartolini & Dominik Goeke & Michael Schneider & Mengdie Ye, 2021. "The Robust Traveling Salesman Problem with Time Windows Under Knapsack-Constrained Travel Time Uncertainty," Transportation Science, INFORMS, vol. 55(2), pages 371-394, March.
- Sara Mattia & Michael Poss, 2018. "A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation," Computational Optimization and Applications, Springer, vol. 69(3), pages 753-800, April.
- Sun, Hao & Yang, Jun & Yang, Chao, 2019. "A robust optimization approach to multi-interval location-inventory and recharging planning for electric vehicles," Omega, Elsevier, vol. 86(C), pages 59-75.
- Ma, Tao & Zhou, Zhou & Antoniou, Constantinos, 2018. "Dynamic factor model for network traffic state forecast," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 281-317.
- Cao, Yankai & Zavala, Victor M. & D’Amato, Fernando, 2018. "Using stochastic programming and statistical extrapolation to mitigate long-term extreme loads in wind turbines," Applied Energy, Elsevier, vol. 230(C), pages 1230-1241.
- Treiber, Martin & Kesting, Arne & Helbing, Dirk, 2010. "Three-phase traffic theory and two-phase models with a fundamental diagram in the light of empirical stylized facts," Transportation Research Part B: Methodological, Elsevier, vol. 44(8-9), pages 983-1000, September.
- Timothy M. Sweda & Irina S. Dolinskaya & Diego Klabjan, 2017. "Adaptive Routing and Recharging Policies for Electric Vehicles," Transportation Science, INFORMS, vol. 51(4), pages 1326-1348, November.
- Zhang, Yu & Wang, Yu & Tang, Jiafu & Lim, Andrew, 2020. "Mitigating overtime risk in tactical surgical scheduling," Omega, Elsevier, vol. 93(C).
- Eli Towle & James Luedtke, 2018. "New solution approaches for the maximum-reliability stochastic network interdiction problem," Computational Management Science, Springer, vol. 15(3), pages 455-477, October.
- Chen, Chao, 2004. "Travel Times on Changeable Message Signs: Pilot Project," Institute of Transportation Studies, Research Reports, Working Papers, Proceedings qt2wp2p0m6, Institute of Transportation Studies, UC Berkeley.
More about this item
Keywords
cost function estimation; second-order cone optimization; inverse shortest path length problem; large data set;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:inm:oropre:v:67:y:2019:i:2:p:498-515. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.