IDEAS home Printed from https://ideas.repec.org/a/eee/appene/v336y2023ics030626192300209x.html
   My bibliography  Save this article

Collaborative optimization of logistics and electricity for the mobile charging service system

Author

Listed:
  • Wang, Jiawei
  • Guo, Qinglai
  • Sun, Hongbin
  • Chen, Min

Abstract

Mobile charging is proposed as a brand-new charging solution in response to the relatively slow construction of charging facilities. Operating a mobile charging service system involves scheduling mobile charging vehicles (MCVs) and batteries owned by the mobile charging service operator (MCSO), which is important to improve its economic efficiency and has a nonnegligible impact on the power system. In this paper, a bilevel optimization framework for logistics and electricity is developed for MCSOs to achieve joint optimization of planning and operation of the mobile charging service system. For transportation logistics, the upper level plans the size of the MCV fleet and routes MCVs in the dynamic traffic network, which can accommodate dynamic changes in the traffic network and make a reasonable route arrangement. For battery energy management, the lower level plans the battery number and optimizes battery charging and discharging at energy service stations, which can track the electric quantity and the state of each battery during the whole process and accurately describe the matching relationship between batteries in a battery swapping scenario. The upper and lower levels are coupled through the battery swapping behavior between MCVs and energy service stations. Through the iteration and adjustment of the two levels, the results optimize the MCSO’s total net profit as much as possible and provide assistance to the power system using service capacity margins. Numerical experiments of a certain scale are used to verify the validity of the proposed framework.

Suggested Citation

  • Wang, Jiawei & Guo, Qinglai & Sun, Hongbin & Chen, Min, 2023. "Collaborative optimization of logistics and electricity for the mobile charging service system," Applied Energy, Elsevier, vol. 336(C).
    • Handle: RePEc:eee:appene:v:336:y:2023:i:c:s030626192300209x
    DOI: 10.1016/j.apenergy.2023.120845
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S030626192300209X
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.apenergy.2023.120845?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.

    References listed on IDEAS

    as
    1. G. B. Dantzig & J. H. Ramser, 1959. "The Truck Dispatching Problem," Management Science, INFORMS, vol. 6(1), pages 80-91, October.
    2. Ioakimidis, Christos S. & Thomas, Dimitrios & Rycerski, Pawel & Genikomsakis, Konstantinos N., 2018. "Peak shaving and valley filling of power consumption profile in non-residential buildings using an electric vehicle parking lot," Energy, Elsevier, vol. 148(C), pages 148-158.
    3. Li, Zhengshuo & Guo, Qinglai & Sun, Hongbin & Wang, Jianhui, 2015. "Storage-like devices in load leveling: Complementarity constraints and a new and exact relaxation method," Applied Energy, Elsevier, vol. 151(C), pages 13-22.
    4. He, Fang & Yin, Yafeng & Lawphongpanich, Siriphong, 2014. "Network equilibrium models with battery electric vehicles," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 306-319.
    5. 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).
    6. Wang, Ning & Tian, Hangqi & Wu, Huahua & Liu, Qiaoqian & Luan, Jie & Li, Yuan, 2023. "Cost-oriented optimization of the location and capacity of charging stations for the electric Robotaxi fleet," Energy, Elsevier, vol. 263(PC).
    7. Cui, Shaohua & Ma, Xiaolei & Zhang, Mingheng & Yu, Bin & Yao, Baozhen, 2022. "The parallel mobile charging service for free-floating shared electric vehicle clusters," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 160(C).
    8. Chryssi Malandraki & Mark S. Daskin, 1992. "Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms," Transportation Science, INFORMS, vol. 26(3), pages 185-200, August.
    9. Afshar, Shahab & Pecenak, Zachary K. & Barati, Masoud & Disfani, Vahid, 2022. "Mobile charging stations for EV charging management in urban areas: A case study in Chattanooga," Applied Energy, Elsevier, vol. 325(C).
    10. Liang, Yanni & Zhang, Xingping, 2018. "Battery swap pricing and charging strategy for electric taxis in China," Energy, Elsevier, vol. 147(C), pages 561-577.
    11. Ichoua, Soumia & Gendreau, Michel & Potvin, Jean-Yves, 2003. "Vehicle dispatching with time-dependent travel times," European Journal of Operational Research, Elsevier, vol. 144(2), pages 379-396, January.
    12. Marius M. Solomon, 1987. "Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints," Operations Research, INFORMS, vol. 35(2), pages 254-265, April.
    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. Chen, Yuanyi & Hu, Simon & Zheng, Yanchong & Xie, Shiwei & Yang, Qiang & Wang, Yubin & Hu, Qinru, 2024. "Coordinated optimization of logistics scheduling and electricity dispatch for electric logistics vehicles considering uncertain electricity prices and renewable generation," Applied Energy, Elsevier, vol. 364(C).
    2. Li, Xiangda & Peng, Yun & Tian, Qi & Feng, Tao & Wang, Wenyuan & Cao, Zhen & Song, Xiangqun, 2023. "A decomposition-based optimization method for integrated vehicle charging and operation scheduling in automated container terminals under fast charging technology," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 180(C).
    3. Chen, Yuanyi & Hu, Simon & Zheng, Yanchong & Xie, Shiwei & Hu, Qinru & Yang, Qiang, 2024. "Coordinated expansion planning of coupled power and transportation networks considering dynamic network equilibrium," Applied Energy, Elsevier, vol. 360(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. Vidal, Thibaut & Crainic, Teodor Gabriel & Gendreau, Michel & Prins, Christian, 2013. "Heuristics for multi-attribute vehicle routing problems: A survey and synthesis," European Journal of Operational Research, Elsevier, vol. 231(1), pages 1-21.
    2. Rincon-Garcia, Nicolas & Waterson, Ben & Cherrett, Tom J. & Salazar-Arrieta, Fernando, 2020. "A metaheuristic for the time-dependent vehicle routing problem considering driving hours regulations – An application in city logistics," Transportation Research Part A: Policy and Practice, Elsevier, vol. 137(C), pages 429-446.
    3. Nicolas Rincon-Garcia & Ben J. Waterson & Tom J. Cherrett, 2018. "Requirements from vehicle routing software: perspectives from literature, developers and the freight industry," Transport Reviews, Taylor & Francis Journals, vol. 38(1), pages 117-138, January.
    4. M. Alinaghian & M. Ghazanfari & N. Norouzi & H. Nouralizadeh, 2017. "A Novel Model for the Time Dependent Competitive Vehicle Routing Problem: Modified Random Topology Particle Swarm Optimization," Networks and Spatial Economics, Springer, vol. 17(4), pages 1185-1211, December.
    5. Tomáš Režnar & Jan Martinovič & Kateřina Slaninová & Ekaterina Grakova & Vít Vondrák, 2017. "Probabilistic time-dependent vehicle routing problem," Central European Journal of Operations Research, Springer;Slovak Society for Operations Research;Hungarian Operational Research Society;Czech Society for Operations Research;Österr. Gesellschaft für Operations Research (ÖGOR);Slovenian Society Informatika - Section for Operational Research;Croatian Operational Research Society, vol. 25(3), pages 545-560, September.
    6. Andres Figliozzi, Miguel, 2012. "The time dependent vehicle routing problem with time windows: Benchmark problems, an efficient solution algorithm, and solution characteristics," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(3), pages 616-636.
    7. Liu, Yiming & Roberto, Baldacci & Zhou, Jianwen & Yu, Yang & Zhang, Yu & Sun, Wei, 2023. "Efficient feasibility checks and an adaptive large neighborhood search algorithm for the time-dependent green vehicle routing problem with time windows," European Journal of Operational Research, Elsevier, vol. 310(1), pages 133-155.
    8. Pillac, Victor & Gendreau, Michel & Guéret, Christelle & Medaglia, Andrés L., 2013. "A review of dynamic vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 225(1), pages 1-11.
    9. Kok, A.L. & Hans, E.W. & Schutten, J.M.J., 2011. "Optimizing departure times in vehicle routes," European Journal of Operational Research, Elsevier, vol. 210(3), pages 579-587, May.
    10. Tao Zhang & W. Art Chaovalitwongse & Yuejie Zhang, 2014. "Integrated Ant Colony and Tabu Search approach for time dependent vehicle routing problems with simultaneous pickup and delivery," Journal of Combinatorial Optimization, Springer, vol. 28(1), pages 288-309, July.
    11. Wohlgemuth, Sascha & Oloruntoba, Richard & Clausen, Uwe, 2012. "Dynamic vehicle routing with anticipation in disaster relief," Socio-Economic Planning Sciences, Elsevier, vol. 46(4), pages 261-271.
    12. Yiming Liu & Yang Yu & Yu Zhang & Roberto Baldacci & Jiafu Tang & Xinggang Luo & Wei Sun, 2023. "Branch-Cut-and-Price for the Time-Dependent Green Vehicle Routing Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 14-30, January.
    13. Ampol Karoonsoontawong & Puntipa Punyim & Wanvara Nueangnitnaraporn & Vatanavongs Ratanavaraha, 2020. "Multi-Trip Time-Dependent Vehicle Routing Problem with Soft Time Windows and Overtime Constraints," Networks and Spatial Economics, Springer, vol. 20(2), pages 549-598, June.
    14. Daqing Wu & Jiyu Li & Jiye Cui & Dong Hu, 2023. "Research on the Time-Dependent Vehicle Routing Problem for Fresh Agricultural Products Based on Customer Value," Agriculture, MDPI, vol. 13(3), pages 1-23, March.
    15. Loske, Dominic & Klumpp, Matthias, 2021. "Human-AI collaboration in route planning: An empirical efficiency-based analysis in retail logistics," International Journal of Production Economics, Elsevier, vol. 241(C).
    16. Tan, K.C. & Chew, Y.H. & Lee, L.H., 2006. "A hybrid multi-objective evolutionary algorithm for solving truck and trailer vehicle routing problems," European Journal of Operational Research, Elsevier, vol. 172(3), pages 855-885, August.
    17. Xiao, Yiyong & Konak, Abdullah, 2016. "The heterogeneous green vehicle routing and scheduling problem with time-varying traffic congestion," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 88(C), pages 146-166.
    18. Daqing Wu & Chenxiang Wu, 2022. "Research on the Time-Dependent Split Delivery Green Vehicle Routing Problem for Fresh Agricultural Products with Multiple Time Windows," Agriculture, MDPI, vol. 12(6), pages 1-28, May.
    19. Hideki Hashimoto & Mutsunori Yagiura & Shinji Imahori & Toshihide Ibaraki, 2013. "Recent progress of local search in handling the time window constraints of the vehicle routing problem," Annals of Operations Research, Springer, vol. 204(1), pages 171-187, April.
    20. Fang Zhao & Bingfeng Si & Zhenlin Wei & Tianwei Lu, 2023. "Time-dependent vehicle routing problem of perishable product delivery considering the differences among paths on the congested road," Operational Research, Springer, vol. 23(1), pages 1-23, March.

    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:eee:appene:v:336:y:2023:i:c:s030626192300209x. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/405891/description#description .

    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.