IDEAS home Printed from https://ideas.repec.org/a/inm/ortrsc/v51y2017i2p457-479.html
   My bibliography  Save this article

Optimal Recharging Policies for Electric Vehicles

Author

Listed:
  • Timothy M. Sweda

    (Schneider, Green Bay, Wisconsin 54313)

  • Irina S. Dolinskaya

    (Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois 60208)

  • Diego Klabjan

    (Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois 60208)

Abstract

Recharging decisions for electric vehicles require many special considerations because of battery dynamics. Battery longevity is prolonged by recharging less frequently and at slower rates, and also by not charging the battery too close to its maximum capacity. In this paper, we address the problem of finding an optimal recharging policy for an electric vehicle along a given path. The path consists of a sequence of nodes, each representing a charging station, and the driver must decide where to stop and how much to recharge at each stop. We present efficient algorithms for finding an optimal policy in general instances with deterministic travel costs and homogeneous charging stations, and also for two specialized cases—one where the vehicle can stop anywhere along the path to recharge and another with equidistant charging stations along the path. In addition, we develop two heuristic procedures that we characterize analytically and explore empirically. We further analyze and test our solution methods on model variations that include stochastic travel costs and nonhomogeneous charging stations.

Suggested Citation

  • Timothy M. Sweda & Irina S. Dolinskaya & Diego Klabjan, 2017. "Optimal Recharging Policies for Electric Vehicles," Transportation Science, INFORMS, vol. 51(2), pages 457-479, May.
    • Handle: RePEc:inm:ortrsc:v:51:y:2017:i:2:p:457-479
    DOI: 10.1287/trsc.2015.0638
    as

    Download full text from publisher

    File URL: https://doi.org/10.1287/trsc.2015.0638
    Download Restriction: no
    File URL: https://libkey.io/10.1287/trsc.2015.0638?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    References listed on IDEAS

    as
    1. Yoshinori Suzuki, 2008. "A generic model of motor‐carrier fuel optimization," Naval Research Logistics (NRL), John Wiley & Sons, vol. 55(8), pages 737-746, December.
    2. Mordechai Henig & Yigal Gerchak & Ricardo Ernst & David F. Pyke, 1997. "An Inventory Model Embedded in Designing a Supply Contract," Management Science, INFORMS, vol. 43(2), pages 184-189, February.
    3. R. Bellman & I. Glicksberg & O. Gross, 1955. "On the Optimal Inventory Equation," Management Science, INFORMS, vol. 2(1), pages 83-104, October.
    4. Sreekumar Bhaskaran & Karthik Ramachandran & John Semple, 2010. "A Dynamic Inventory Model with the Right of Refusal," Management Science, INFORMS, vol. 56(12), pages 2265-2281, December.
    5. M. Florian & J. K. Lenstra & A. H. G. Rinnooy Kan, 1980. "Deterministic Production Planning: Algorithms and Complexity," Management Science, INFORMS, vol. 26(7), pages 669-679, July.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Wang, Dong & Liao, Feixiong & Gao, Ziyou & Tian, Qiong, 2022. "Analysis of activity duration-related charging behavioral responses of electric vehicle travelers to charging services," Transport Policy, Elsevier, vol. 123(C), pages 73-81.
    2. Bektaş, Tolga & Ehmke, Jan Fabian & Psaraftis, Harilaos N. & Puchinger, Jakob, 2019. "The role of operational research in green freight transportation," European Journal of Operational Research, Elsevier, vol. 274(3), pages 807-823.
    3. 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.
    4. Amirmahdi Tafreshian & Neda Masoud & Yafeng Yin, 2020. "Frontiers in Service Science: Ride Matching for Peer-to-Peer Ride Sharing: A Review and Future Directions," Service Science, INFORMS, vol. 12(2-3), pages 44-60, June.
    5. Asghari, Mohammad & Mirzapour Al-e-hashem, S. Mohammad J., 2021. "Green vehicle routing problem: A state-of-the-art review," International Journal of Production Economics, Elsevier, vol. 231(C).
    6. Maximilian Schiffer & Michael Schneider & Grit Walther & Gilbert Laporte, 2019. "Vehicle Routing and Location Routing with Intermediate Stops: A Review," Transportation Science, INFORMS, vol. 53(2), pages 319-343, March.
    7. Mark M. Nejad & Lena Mashayekhy & Daniel Grosu & Ratna Babu Chinnam, 2017. "Optimal Routing for Plug-In Hybrid Electric Vehicles," Transportation Science, INFORMS, vol. 51(4), pages 1304-1325, November.
    8. Mohammad Asghari & Seyed Mohammad Javad Mirzapour Al-E-Hashem, 2021. "Green vehicle routing problem: A state-of-the-art review," Post-Print hal-03182944, HAL.
    9. Schulz, Arne & Suzuki, Yoshinori, 2023. "An efficient heuristic for the fixed-route vehicle-refueling problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 169(C).
    10. Cai, Zeen & Mo, Dong & Geng, Maosi & Tang, Wei & Chen, Xiqun Michael, 2023. "Integrating ride-sourcing with electric vehicle charging under mixed fleets and differentiated services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 169(C).

    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.
    1. 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.
    2. Sreekumar Bhaskaran & Karthik Ramachandran & John Semple, 2010. "A Dynamic Inventory Model with the Right of Refusal," Management Science, INFORMS, vol. 56(12), pages 2265-2281, December.
    3. Chubanov, Sergei & Kovalyov, Mikhail Y. & Pesch, Erwin, 2008. "A single-item economic lot-sizing problem with a non-uniform resource: Approximation," European Journal of Operational Research, Elsevier, vol. 189(3), pages 877-889, September.
    4. Ng, C.T. & Kovalyov, Mikhail Y. & Cheng, T.C.E., 2010. "A simple FPTAS for a single-item capacitated economic lot-sizing problem with a monotone cost structure," European Journal of Operational Research, Elsevier, vol. 200(2), pages 621-624, January.
    5. Ou, Jinwen, 2017. "Improved exact algorithms to economic lot-sizing with piecewise linear production costs," European Journal of Operational Research, Elsevier, vol. 256(3), pages 777-784.
    6. Martin L. Weitzman, 1971. "Material Balances Under Uncertainty," The Quarterly Journal of Economics, President and Fellows of Harvard College, vol. 85(2), pages 262-282.
    7. Ming Zhao & Minjiao Zhang, 2020. "Multiechelon Lot Sizing: New Complexities and Inequalities," Operations Research, INFORMS, vol. 68(2), pages 534-551, March.
    8. Mathijn Retel Helmrich & Raf Jans & Wilco van den Heuvel & Albert Wagelmans, 2014. "Economic lot-sizing with remanufacturing: complexity and efficient formulations," IISE Transactions, Taylor & Francis Journals, vol. 46(1), pages 67-86.
    9. Jenny Carolina Saldana Cortés, 2011. "Programación semidefinida aplicada a problemas de cantidad económica de pedido," Documentos CEDE 8735, Universidad de los Andes, Facultad de Economía, CEDE.
    10. van den Heuvel, W., 2004. "On the complexity of the economic lot-sizing problem with remanufacturing options," Econometric Institute Research Papers EI 2004-46, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    11. Önal, Mehmet & Romeijn, H.Edwin & Sapra, Amar & van den Heuvel, Wilco, 2015. "The economic lot-sizing problem with perishable items and consumption order preference," European Journal of Operational Research, Elsevier, vol. 244(3), pages 881-891.
    12. van den Heuvel, W.J. & Wagelmans, A.P.M., 2003. "A geometric algorithm to solve the NI/G/NI/ND capacitated lot-sizing problem in O(T2) time," Econometric Institute Research Papers EI 2003-24, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    13. Stan van Hoesel & H. Edwin Romeijn & Dolores Romero Morales & Albert P. M. Wagelmans, 2005. "Integrated Lot Sizing in Serial Supply Chains with Production Capacities," Management Science, INFORMS, vol. 51(11), pages 1706-1719, November.
    14. Shoshana Anily & Michal Tzur, 2006. "Algorithms for the multi‐item multi‐vehicles dynamic lot sizing problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(2), pages 157-169, March.
    15. Jian Yang & Xiangtong Qi & Gang Yu, 2005. "Disruption management in production planning," Naval Research Logistics (NRL), John Wiley & Sons, vol. 52(5), pages 420-442, August.
    16. Yongbo Xiao, 2018. "Dynamic pricing and replenishment: Optimality, bounds, and asymptotics," Naval Research Logistics (NRL), John Wiley & Sons, vol. 65(1), pages 3-25, February.
    17. Mesut Yavuz & Ismail Çapar, 2017. "Alternative-Fuel Vehicle Adoption in Service Fleets: Impact Evaluation Through Optimization Modeling," Transportation Science, INFORMS, vol. 51(2), pages 480-493, May.
    18. Awi Federgruen & Joern Meissner & Michal Tzur, 2007. "Progressive Interval Heuristics for Multi-Item Capacitated Lot-Sizing Problems," Operations Research, INFORMS, vol. 55(3), pages 490-502, June.
    19. Mike Prince & J. Cole Smith & Joseph Geunes, 2013. "A three‐stage procurement optimization problem under uncertainty," Naval Research Logistics (NRL), John Wiley & Sons, vol. 60(5), pages 395-412, August.
    20. Hwang, Hark-Chin & Jaruphongsa, Wikrom, 2008. "Dynamic lot-sizing model for major and minor demands," European Journal of Operational Research, Elsevier, vol. 184(2), pages 711-724, January.

    Corrections

    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:ortrsc:v:51:y:2017:i:2:p:457-479. 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.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.