IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v18y2026i7p3485-d1912733.html

Collaborative Optimization Scheduling of New Energy Vehicles and Integrated Energy Stations Based on Coupled Vehicle Routing and Charging Decisions

Author

Listed:
  • Na Fang

    (Hubei Key Laboratory for High-Efficiency Utilization of Solar Energy and Operation Control of Energy Storage System, Hubei University of Technology, Wuhan 430068, China
    Hubei Engineering Research Center for Safety Monitoring of New Energy and Power Grid Equipment, Hubei University of Technology, Wuhan 430068, China)

  • Jiahao Yu

    (Hubei Key Laboratory for High-Efficiency Utilization of Solar Energy and Operation Control of Energy Storage System, Hubei University of Technology, Wuhan 430068, China
    Hubei Engineering Research Center for Safety Monitoring of New Energy and Power Grid Equipment, Hubei University of Technology, Wuhan 430068, China)

  • Xiang Liao

    (Hubei Key Laboratory for High-Efficiency Utilization of Solar Energy and Operation Control of Energy Storage System, Hubei University of Technology, Wuhan 430068, China
    Hubei Engineering Research Center for Safety Monitoring of New Energy and Power Grid Equipment, Hubei University of Technology, Wuhan 430068, China)

  • Ying Zuo

    (Hubei Key Laboratory for High-Efficiency Utilization of Solar Energy and Operation Control of Energy Storage System, Hubei University of Technology, Wuhan 430068, China
    Hubei Engineering Research Center for Safety Monitoring of New Energy and Power Grid Equipment, Hubei University of Technology, Wuhan 430068, China)

Abstract

To reduce charging time and improve operational efficiency at integrated energy stations (IESs) for electric vehicles (EVs), this paper develops a sustainability-oriented collaborative optimization model by coupling vehicle routing behavior with charging decision-making. Firstly, a dynamic road network model is established to simulate vehicle arrivals at IESs from different network nodes. Then, considering grid peak–valley electricity prices, station electricity procurement costs and EV charging demand, a dynamic pricing strategy for IESs is proposed to guide EVs to charge at off-peak hours so as to realize peak shaving and valley filling for the power grid. Meanwhile, the NSGA-III algorithm is improved through the introduction of Good Point Set initialization and an adaptive crossover mechanism, and the Good Point Set initialization and Adaptive Crossover NSGA-III (GPS-AC-NSGA-III) algorithm is proposed to solve the scheduling optimization problem. Finally, the CRITIC-based TOPSIS method is employed to identify the optimal compromise solution from the Pareto-optimal set. Case studies further prove the effectiveness of the proposed multi-objective collaborative optimization model for EVs and IESs. Compared with scenarios without dynamic Dijkstra-based navigation and dynamic pricing, the IES daily revenue increased by 39.83%, pollutant emissions decreased by 0.4%, and the peak-to-valley load difference ratio was reduced by 4.94%. The results indicate that dynamic Dijkstra-based vehicle routing improves travel efficiency, while the proposed dynamic pricing strategy enhances station profitability and smooths grid load fluctuations. Overall, the proposed framework contributes to sustainable transportation and energy systems by reducing pollutant emissions, improving energy efficiency, and enhancing the operational stability of integrated energy infrastructure, thereby supporting the transition toward low-carbon and sustainable urban energy systems.

Suggested Citation

  • Na Fang & Jiahao Yu & Xiang Liao & Ying Zuo, 2026. "Collaborative Optimization Scheduling of New Energy Vehicles and Integrated Energy Stations Based on Coupled Vehicle Routing and Charging Decisions," Sustainability, MDPI, vol. 18(7), pages 1-39, April.
  • Handle: RePEc:gam:jsusta:v:18:y:2026:i:7:p:3485-:d:1912733
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/18/7/3485/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2071-1050/18/7/3485/
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:jsusta:v:18:y:2026:i:7:p:3485-:d:1912733. 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: 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.