IDEAS home Printed from https://ideas.repec.org/a/spr/jcomop/v49y2025i1d10.1007_s10878-024-01251-6.html
   My bibliography  Save this article

Optimal dispatching of electric vehicles based on optimized deep learning in IoT

Author

Listed:
  • V. Agalya

    (New Horizon College of Engineering)

  • M. Muthuvinayagam

    (Mahendra Engineering College)

  • R. Gandhi

    (Gnanamani College of Technology)

Abstract

Recent years have witnessed a growing trend in the utilization of Electric Vehicles (EVs), however with the increased usage of EVs, appropriate strategies for supporting the charging demands has not garnered much attention. The absence of adaptable plans in charging may result in minimized participation; further, the charging demands have to be addressed with utmost care for ensuring reliability and efficiency of the grid. In this paper, an efficient EV charging technique based on blockchain based user transaction and smart contract is devised. Here, charge scheduling is performed by acquiring the information the charging demand of the EV over Internet of things. In case the EV does not have sufficient power to reach the target, nearest Charging Station (CS) with the minimal electricity price is identified. The CS is selected considering various factors, such average waiting time, distance, power, traffic, and so on. Here, power prediction is performed using the Deep Maxout Network (DMN), whose weights are adapted based on the devised Exponentially Snake Optimization (ESO) algorithm. Furthermore, the efficacy of the devised ESO-DMN is examined considering metrics, like average waiting time, distance, and number of EVs charged and power and is found to have attained values of 1.937 s, 13.952 km, 55 and 2.876 J.

Suggested Citation

  • V. Agalya & M. Muthuvinayagam & R. Gandhi, 2025. "Optimal dispatching of electric vehicles based on optimized deep learning in IoT," Journal of Combinatorial Optimization, Springer, vol. 49(1), pages 1-28, January.
  • Handle: RePEc:spr:jcomop:v:49:y:2025:i:1:d:10.1007_s10878-024-01251-6
    DOI: 10.1007/s10878-024-01251-6
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10878-024-01251-6
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10878-024-01251-6?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:jcomop:v:49:y:2025:i:1:d:10.1007_s10878-024-01251-6. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.