IDEAS home Printed from https://ideas.repec.org/a/gam/jeners/v17y2024i10p2243-d1389655.html
   My bibliography  Save this article

Optimized Dynamic Vehicle-to-Vehicle Charging for Increased Profit

Author

Listed:
  • Shorooq Alaskar

    (Department of Computer Science and Electrical Engineering, University of Maryland, Baltimore County, Baltimore, MD 21250, USA)

  • Mohamed Younis

    (Department of Computer Science and Electrical Engineering, University of Maryland, Baltimore County, Baltimore, MD 21250, USA)

Abstract

Many challenges have arisen as a result of the rapid growth of the electric vehicles (EVs) market, due to the lack of charging infrastructure capable of handling such a large number of EVs. To alleviate power grid system overloads and reduce the cost of corresponding infrastructure deployments, a direct vehicle-to-vehicle (V2V) energy exchange strategy has become an emerging research topic. In this paper, we formulate the problem of V2V energy charging on a time–space network and develop a dynamic-programming solution methodology for efficiently finding the solution. The algorithm can pair and route the energy supplier (ES) and the requester (ER) in such a way that maximizes the supplier’s profit. Specifically, the ES is incentivized to rendezvous ERs at any encounter nodes in order to dispense the requested energy amount through platooning. Unlike existing V2V charging solutions, our approach involves charging while vehicles are in motion. We validate the effectiveness of our approach in maximizing the profit of the ES and reducing the incurred overhead on the ER in terms of increased trip time, distance, and energy consumption.

Suggested Citation

  • Shorooq Alaskar & Mohamed Younis, 2024. "Optimized Dynamic Vehicle-to-Vehicle Charging for Increased Profit," Energies, MDPI, vol. 17(10), pages 1-23, May.
  • Handle: RePEc:gam:jeners:v:17:y:2024:i:10:p:2243-:d:1389655
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1996-1073/17/10/2243/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1996-1073/17/10/2243/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Zhang, Yaoli & Liu, Xingyu & Wei, Wenshen & Peng, Tianji & Hong, Gang & Meng, Chao, 2020. "Mobile charging: A novel charging system for electric vehicles in urban areas," Applied Energy, Elsevier, vol. 278(C).
    2. Stefan Irnich & Guy Desaulniers, 2005. "Shortest Path Problems with Resource Constraints," Springer Books, in: Guy Desaulniers & Jacques Desrosiers & Marius M. Solomon (ed.), Column Generation, chapter 0, pages 33-65, Springer.
    3. Frank Schneider & Ulrich W. Thonemann & Diego Klabjan, 2018. "Optimization of Battery Charging and Purchasing at Electric Vehicle Battery Swap Stations," Transportation Science, INFORMS, vol. 52(5), pages 1211-1234, October.
    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. Shorooq Alaskar & Mohamed Younis, 2024. "Scheduling a Fleet of Dynamic EV Chargers for Maximal Profile," Energies, MDPI, vol. 17(23), pages 1-28, November.

    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. Arpan Rijal & Marco Bijvank & Asvin Goel & René de Koster, 2021. "Workforce Scheduling with Order-Picking Assignments in Distribution Facilities," Transportation Science, INFORMS, vol. 55(3), pages 725-746, May.
    2. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
    3. Gutiérrez-Jarpa, Gabriel & Desaulniers, Guy & Laporte, Gilbert & Marianov, Vladimir, 2010. "A branch-and-price algorithm for the Vehicle Routing Problem with Deliveries, Selective Pickups and Time Windows," European Journal of Operational Research, Elsevier, vol. 206(2), pages 341-349, October.
    4. Ann-Kathrin Rothenbächer & Michael Drexl & Stefan Irnich, 2018. "Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 52(5), pages 1174-1190, October.
    5. Bode, Claudia & Irnich, Stefan, 2014. "The shortest-path problem with resource constraints with (k,2)-loop elimination and its application to the capacitated arc-routing problem," European Journal of Operational Research, Elsevier, vol. 238(2), pages 415-426.
    6. Schulz, Arne & Boysen, Nils & Briskorn, Dirk, 2024. "Centrally-chosen versus user-selected swaps: How the selection of swapping stations impacts standby battery inventories," European Journal of Operational Research, Elsevier, vol. 319(3), pages 726-738.
    7. 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.
    8. Santini, Alberto & Plum, Christian E.M. & Ropke, Stefan, 2018. "A branch-and-price approach to the feeder network design problem," European Journal of Operational Research, Elsevier, vol. 264(2), pages 607-622.
    9. Qin, Hu & Moriakin, Anton & Xu, Gangyan & Li, Jiliu, 2024. "The generator distribution problem for base stations during emergency power outage: A branch-and-price-and-cut approach," European Journal of Operational Research, Elsevier, vol. 318(3), pages 752-767.
    10. Heßler, Katrin, 2021. "Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes," European Journal of Operational Research, Elsevier, vol. 294(1), pages 188-205.
    11. Timo Gschwind & Stefan Irnich, 2012. "Effective Handling of Dynamic Time Windows and Synchronization with Precedences for Exact Vehicle Routing," Working Papers 1211, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    12. Albert H. Schrotenboer & Evrim Ursavas & Iris F. A. Vis, 2019. "A Branch-and-Price-and-Cut Algorithm for Resource-Constrained Pickup and Delivery Problems," Transportation Science, INFORMS, vol. 53(4), pages 1001-1022, July.
    13. Timo Gschwind & Stefan Irnich & Simon Emde & Christian Tilk, 2018. "Branch-Cut-and-Price for the Scheduling Deliveries with Time Windows in a Direct Shipping Network," Working Papers 1805, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    14. Bani, Abderrahman & El Hallaoui, Issmail & Corréa, Ayoub Insa & Tahir, Adil, 2023. "Solving a real-world multi-depot multi-period petrol replenishment problem with complex loading constraints," European Journal of Operational Research, Elsevier, vol. 311(1), pages 154-172.
    15. Asadi, Amin & Nurre Pinkley, Sarah, 2021. "A stochastic scheduling, allocation, and inventory replenishment problem for battery swap stations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 146(C).
    16. Jesica Armas & Luis Cadarso & Angel A. Juan & Javier Faulin, 2017. "A multi-start randomized heuristic for real-life crew rostering problems in airlines with work-balancing goals," Annals of Operations Research, Springer, vol. 258(2), pages 825-848, November.
    17. Guy Desaulniers & Diego Pecin & Claudio Contardo, 2019. "Selective pricing in branch-price-and-cut algorithms for vehicle routing," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(2), pages 147-168, June.
    18. Walteros, Jose L. & Vogiatzis, Chrysafis & Pasiliao, Eduardo L. & Pardalos, Panos M., 2014. "Integer programming models for the multidimensional assignment problem with star costs," European Journal of Operational Research, Elsevier, vol. 235(3), pages 553-568.
    19. Haahr, J.T. & Wagenaar, J.C. & Veelenturf, L.P. & Kroon, L.G., 2015. "A Comparison of Two Exact Methods for Passenger Railway Rolling Stock (Re)Scheduling," ERIM Report Series Research in Management ERS-2015-007-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    20. Li, Jiliu & Qin, Hu & Baldacci, Roberto & Zhu, Wenbin, 2020. "Branch-and-price-and-cut for the synchronized vehicle routing problem with split delivery, proportional service time and multiple time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).

    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:gam:jeners:v:17:y:2024:i:10:p:2243-:d:1389655. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.