Data-driven approaches for emissions-minimized paths in urban areas
Authors:
- Jan Fabian EhmkeJan Fabian Ehmke
- Ann Melissa CampbellAnn Melissa Campbell
- Barrett W. ThomasBTBarrett W. Thomas
- 1 March 2016
- journal article
- Published by Elsevier in Computers & Operations Research
- Vol. 67, 34-47
Abstract
No abstract availableFunding Information
- German Academic Exchange Service
This publication has 27 references indexed in Scilit:
- Dynamic routing under recurrent and non-recurrent congestion using real-time ITS informationComputers & Operations Research, 2012
- The Pollution-Routing ProblemTransportation Research Part B: Methodological, 2011
- Vehicle Routing Problem for Emissions MinimizationTransportation Research Record: Journal of the Transportation Research Board, 2010
- Real-World Carbon Dioxide Impacts of Traffic CongestionTransportation Research Record: Journal of the Transportation Research Board, 2008
- The approach‐dependent, time‐dependent, label‐constrained shortest path problemNetworks, 2006
- Adaptations of the A* algorithm for the computation of fastest paths in deterministic discrete-time dynamic networksIEEE Transactions on Intelligent Transportation Systems, 2002
- MANAGING THE ENVIRONMENTAL EXTERNALITIES OF TRAFFIC LOGISTICS: THE ISSUE OF EMISSIONSProduction and Operations Management, 2001
- Expected shortest paths in dynamic and stochastic traffic networksTransportation Research Part B: Methodological, 1998
- Shortest-path and minimum-delay algorithms in networks with time-dependent edge-lengthJournal of the ACM, 1990
- A note on two problems in connexion with graphsNumerische Mathematik, 1959