Optimal Routing for Plug-In Hybrid Electric Vehicles

Published Online:https://doi.org/10.1287/trsc.2016.0706

References

  • Ahuja RK, Magnanti TL, Orlin JB (1993) Network Flows: Theory, Algorithms, and Applications (Prentice Hall, Englewood Cliffs, NJ).Google Scholar
  • Almuhtady A, Lee S, Romeijn E, Wynblatt M, Ni J (2014) A degradation-informed battery-swapping policy for fleets of electric or hybrid-electric vehicles. Transportation Sci. 48(4):609–618.LinkGoogle Scholar
  • Bay M, Limbourg S (2015) TSP model for electric vehicle deliveries, considering speed, loading and road grades. Proc. 6th Internat. Workshop Freight Transportation Logist., Ajaccio, France, 439–442.Google Scholar
  • Bazaraa MS, Jarvis JJ, Sherali HD (2009) Linear Programming and Network Flows, 3rd ed. (John Wiley & Sons, Hoboken, NJ).CrossrefGoogle Scholar
  • Bernstein A (2012) Near linear time (1+ ɛ)-approximation for restricted shortest paths in undirected graphs. Proc. 23rd Annual ACM-SIAM Sympos. Discrete Algorithms, Kyoto, Japan, 189–201.CrossrefGoogle Scholar
  • Bertsekas DP (1991) Linear Network Optimization: Algorithms and Codes (MIT Press, Cambridge, MA).Google Scholar
  • Chen S, Song M, Sahni S (2008) Two techniques for fast computation of constrained shortest paths. IEEE/ACM Trans. Networking 16(1):105–115.CrossrefGoogle Scholar
  • Davis SC, Diegel SW, Boundy RG (2012) Transportation Energy Data Book, 31st ed. (Oak Ridge National Laboratory, Oak Ridge, TN).Google Scholar
  • Di Puglia Pugliese L, Guerriero F (2013a) A survey of resource constrained shortest path problems: Exact solution approaches. Networks 62(3):183–200.CrossrefGoogle Scholar
  • Di Puglia Pugliese L, Guerriero F (2013b) A reference point approach for the resource constrained shortest path problems. Transportation Sci. 47(2):247–265.LinkGoogle Scholar
  • Diakonikolas I, Yannakakis M (2009) Small approximate Pareto sets for biobjective shortest paths and other problems. SIAM J. Comput. 39(4):1340–1371.CrossrefGoogle Scholar
  • Dijkstra EW (1959) A note on two problems in connexion with graphs. Numerische Mathematik 1(1):269–271.CrossrefGoogle Scholar
  • Dumitrescu I, Boland N (2003) Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem. Networks 42(3):135–153.CrossrefGoogle Scholar
  • Eisner J, Funke S, Storandt S (2011) Optimal route planning for electric vehicles in large networks. Proc. 25th Assoc. Advancement Artificial Intelligence Conf., San Francisco, 1108–1113.Google Scholar
  • Ergun F, Sinha R, Zhang L (2002) An improved FPTAS for restricted shortest path. Inform. Processing Lett. 83(5):287–291.CrossrefGoogle Scholar
  • Garey MR, Johnson DS (1979) Computers and Intractability, Vol. 174 (Freeman, New York).Google Scholar
  • Garroppo RG, Giordano S, Tavanti L (2010) A survey on multi-constrained optimal path computation: Exact and approximate algorithms. Comput. Networks 54(17):3081–3107.CrossrefGoogle Scholar
  • Glerum A, Stankovikj L, Thémans M, Bierlaire M (2014) Forecasting the demand for electric vehicles: Accounting for attitudes and perceptions. Transportation Sci. 48(4):483–499.LinkGoogle Scholar
  • Goel A, Ramakrishnan KG, Kataria D, Logothetis D (2001) Efficient computation of delay-sensitive routes from one source to all destinations. Proc. 20th Annual Joint Conf. IEEE Comput. Comm. Soc., Anchorage, AK, 854–858.CrossrefGoogle Scholar
  • Gong Q, Li Y, Peng ZR (2008) Trip-based optimal power management of plug-in hybrid electric vehicles. IEEE Trans. Vehicular Tech. 57(6):3393–3401.CrossrefGoogle Scholar
  • Hassin R (1992) Approximation schemes for the restricted shortest path problem. Math. Oper. Res. 17(1):36–42.LinkGoogle Scholar
  • Hybrid Vehicle Timeline (2012) http://www.hybridcenter.org/hybrid-timeline.html.Google Scholar
  • Ibarra OH, Kim CE (1975) Fast approximation algorithms for the knapsack and sum of subset problems. J. ACM 22(4):463–468.CrossrefGoogle Scholar
  • Johnson DB (1977) Efficient algorithms for shortest paths in sparse networks. J. ACM 24(1):1–13.CrossrefGoogle Scholar
  • Kellerer H, Pferschy U, Pisinger D (2004) Knapsack Problems (Springer, Berlin).CrossrefGoogle Scholar
  • Kieckhäfer K, Volling T, Spengler TS (2014) A hybrid simulation approach for estimating the market share evolution of electric vehicles. Transportation Sci. 48(4):651–670.LinkGoogle Scholar
  • Lin Z (2014) Optimizing and diversifying electric vehicle driving range for U.S. drivers. Transportation Sci. 48(4):635–650.LinkGoogle Scholar
  • Lorenz DH, Orda A (1998) QoS routing in networks with uncertain parameters. IEEE/ACM Trans. Networking 6(6):768–778.CrossrefGoogle Scholar
  • Lorenz DH, Raz D (2001) A simple efficient approximation scheme for the restricted shortest path problem. Oper. Res. Lett. 28(5):213–219.CrossrefGoogle Scholar
  • Lu G, Sadagopan N, Krishnamachari B, Goel A (2005) Delay efficient sleep scheduling in wireless sensor networks. Proc. IEEE INFOCOM 24th Annual Joint Conf. IEEE Comput. Comm. Soc., Miami, 2470–2481.Google Scholar
  • Mak H, Rong Y, Shen ZM (2013) Infrastructure planning for electric vehicles with battery swapping. Management Sci. 59(7):1557–1575.LinkGoogle Scholar
  • Mashayekhy L, Nejad M, Grosu D (2015) A PTAS mechanism for provisioning and allocation of heterogeneous cloud resources. IEEE Trans. Parallel Distributed Systems 26(9):2386–2399.CrossrefGoogle Scholar
  • Mehlhorn K, Ziegelmann M (2000) Resource constrained shortest paths. Paterson M, ed. Algorithms–ESA 2000, Lecture Notes Comput. Sci., Vol. 1879 (Springer-Verlag, Berlin Heidelberg), 326–337.CrossrefGoogle Scholar
  • Murgovski N, Johannesson L, Sjöberg J (2013) Engine on/off control for dimensioning hybrid electric powertrains via convex optimization. IEEE Trans. Vehicular Tech. 62(7):2949–2962.CrossrefGoogle Scholar
  • NAVTEQ (2014) http://www.navteq.com/.Google Scholar
  • Nejad M, Mashayekhy L, Chinnam R, Grosu D (2017) Online scheduling and pricing for electric vehicle charging. IIE Trans. 49(2):178–193.Google Scholar
  • Phillips CA (1993) The network inhibition problem. Proc. 25th Annual ACM Sympos. Theory Comput., San Diego, 776–785.CrossrefGoogle Scholar
  • Plotkin S, Santini D, Vyas A, Anderson J, Wang M, Bharathan D, He J (2002) Hybrid electric vehicle technology assessment: Methodology, analytical issues, and interim results. Technical report, Argonne National Lab, Lemont, IL.Google Scholar
  • priuschat.com (2014) http://priuschat.com/threads/toyota-prius-c-53-mpg-city-46-mpg-hwy-under-19-000.102114/page-15.Google Scholar
  • Raz D, Shavitt Y (2000) Optimal partition of QoS requirements with discrete cost functions. IEEE J. Selected Areas Comm. 18(12):2593–2603.CrossrefGoogle Scholar
  • Romm JJ, Frank AA (2006) Hybrid vehicles gain traction. Sci. Amer. 294(4):72–79.CrossrefGoogle Scholar
  • Sachenbacher M, Leucker M, Artmeier A, Haselmayr J (2011) Efficient energy-optimal routing for electric vehicles. Proc. Assoc. Advancement Artificial Intell. Conf., San Francisco, 1402–1407.Google Scholar
  • Sahni SK (1976) Algorithms for scheduling independent tasks. J. ACM 23(1):116–127.CrossrefGoogle Scholar
  • Salmasi FR (2007) Control strategies for hybrid electric vehicles: Evolution, classification, comparison, and future trends. IEEE Trans. Vehicular Tech. 56(5):2393–2404.CrossrefGoogle Scholar
  • Santos L, Coutinho-Rodrigues J, Current JR (2007) An improved solution algorithm for the constrained shortest path problem. Transportation Res. Part B: Methodological 41(7):756–771.CrossrefGoogle Scholar
  • Schneider M, Stenger A, Goeke D (2014) The electric vehicle-routing problem with time windows and recharging stations. Transportation Sci. 48(4):500–520.LinkGoogle Scholar
  • Sciarretta A, Guzzella L (2007) Control of hybrid electric vehicles. IEEE Control Systems 27(2):60–70.CrossrefGoogle Scholar
  • Sherali HD, Hill JM (2009) Reverse time-restricted shortest paths: Application to air traffic management. Transportation Res. Part C: Emerging Tech. 17(6):631–641.CrossrefGoogle Scholar
  • Sioshansi R (2012) OR forum—modeling the impacts of electricity tariffs on plug-in hybrid electric vehicle charging, costs, and emissions. Oper. Res. 60(3):506–516.LinkGoogle Scholar
  • Sweda TM, Klabjan D (2012) Finding minimum-cost paths for electric vehicles. Proc. IEEE Internat. Electric Vehicle Conf., Greenville, SC, 1–4.CrossrefGoogle Scholar
  • Sweda TM, Dolinskaya IS, Klabjan D (2017) Optimal recharging policies for electric vehicles. Transportation Sci. 51(2):457–479.LinkGoogle Scholar
  • Vazirani VV (2004) Approximation Algorithms (Springer-Verlag, New York).Google Scholar
  • Warburton A (1987) Approximation of Pareto optima in multiple-objective, shortest-path problems. Oper. Res. 35(1):70–79.LinkGoogle Scholar
  • Woeginger GJ (2000) When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)? INFORMS J. Comput. 12(1):57–74.LinkGoogle Scholar
  • Xi X, Sioshansi R, Marano V (2013) Simulation–optimization model for location of a public electric vehicle charging infrastructure. Transportation Res. Part D: Transport Environment 22(5):60–69.CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.