IDEAS home Printed from https://ideas.repec.org/p/cdl/itsdav/qt1g17p2cj.html
   My bibliography  Save this paper

Routing of Battery Electric Heavy Duty-Trucks for Drayage Operations

Author

Listed:
  • Dessouky, Maged
  • Yao, Siyuan

Abstract

California has a long history of reducing greenhouse gas (GHG) emissions, and has been working to accelerate the adoption of battery electric heavy-duty trucks (BEHDTs). Unlike diesel heavy-duty trucks (DHDTs), which have hundreds of miles of range per refill, BEHDTs have a restricted, load-dependent driving range, which makes charging planning an important role in the use of BEHDTs as an alternative to DHDTs. This research study investigates a mixed fleet drayage routing problem (MFDRP) with non-linear charging times. The study extends existing mixed fleet drayage routing models by considering multiple charging locations and allowing for more flexible routes for freight pickup and delivery. We formulate the MFDRP as a mixed integer programming model. After linearization and variable elimination, the model can be solved by commercial optimization solvers. However, the model becomes inefficient to solve when the problem size increases. Therefore, we develop a modified adaptive large neighborhood search algorithm, which can solve the problem with hundreds of units of demand in a few CPU minutes. Finally, we simulate one-day drayage operations with different BEHDT shares in the fleet for the years 2022, 2025, and 2030 to assess the potential for substituting DHDTs with BEHDTs. The numerical experiments indicate that employing BEHDTs as substitutes for DHDTs will increase the fleet size under the same level of demand. To reach the maximum share of BEHDTs in the truck fleet, the fleet size increases by 47.2%, 3.4%, and 3.4% in 2022, 2025, and 2030, respectively. Over 50% (90%) CO2 (NOx) emission reductions can be achieved by employing BEHDTs to the maximum share in the fleet. View the NCST Project Webpage

Suggested Citation

  • Dessouky, Maged & Yao, Siyuan, 2023. "Routing of Battery Electric Heavy Duty-Trucks for Drayage Operations," Institute of Transportation Studies, Working Paper Series qt1g17p2cj, Institute of Transportation Studies, UC Davis.
    • Handle: RePEc:cdl:itsdav:qt1g17p2cj
    as

    Download full text from publisher

    File URL: https://www.escholarship.org/uc/item/1g17p2cj.pdf;origin=repeccitec
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Wang, Xiubin & Regan, Amelia C., 2002. "Local truckload pickup and delivery with hard time window constraints," Transportation Research Part B: Methodological, Elsevier, vol. 36(2), pages 97-112, February.
    2. Giuliano, Genevieve & Dessouky, Maged & Dexter, Sue & Fang, Jiawen & Hu, Shichun & Steimetz, Seiji & O'Brien, Thomas & Miller, Marshall & Fulton, Lewis, 2020. "Developing Markets for Zero Emission Vehicles in Short Haul Goods Movement," Institute of Transportation Studies, Working Paper Series qt0nw4q530, Institute of Transportation Studies, UC Davis.
    Full references (including those not matched with items on IDEAS)

    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. Lara, Cristiana L. & Koenemann, Jochen & Nie, Yisu & de Souza, Cid C., 2023. "Scalable timing-aware network design via lagrangian decomposition," European Journal of Operational Research, Elsevier, vol. 309(1), pages 152-169.
    2. Yuan, Shuai & Skinner, Bradley & Huang, Shoudong & Liu, Dikai, 2013. "A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms," European Journal of Operational Research, Elsevier, vol. 228(1), pages 72-82.
    3. Sanjeeb Dash & Oktay Günlük & Andrea Lodi & Andrea Tramontani, 2012. "A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows," INFORMS Journal on Computing, INFORMS, vol. 24(1), pages 132-147, February.
    4. Zolfagharinia, Hossein & Haughton, Michael, 2018. "The importance of considering non-linear layover and delay costs for local truckers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 109(C), pages 331-355.
    5. Arturo E. Pérez Rivera & Martijn R. K. Mes, 2019. "Integrated scheduling of drayage and long-haul operations in synchromodal transport," Flexible Services and Manufacturing Journal, Springer, vol. 31(3), pages 763-806, September.
    6. Mahmoudi, Monirehalsadat & Zhou, Xuesong, 2016. "Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 19-42.
    7. Gupta, Gautam & Goodchild, Anne & Hansen, Mark, 2011. "A competitive, charter air-service planning model for student athlete travel," Transportation Research Part B: Methodological, Elsevier, vol. 45(1), pages 128-149, January.
    8. Qiu, Xuan & Lee, Chung-Yee, 2019. "Quantity discount pricing for rail transport in a dry port system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 122(C), pages 563-580.
    9. Shiri, Samaneh & Huynh, Nathan, 2016. "Optimization of drayage operations with time-window constraints," International Journal of Production Economics, Elsevier, vol. 176(C), pages 7-20.
    10. Nourinejad, Mehdi & Zhu, Sirui & Bahrami, Sina & Roorda, Matthew J., 2015. "Vehicle relocation and staff rebalancing in one-way carsharing systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 81(C), pages 98-113.
    11. Xue, Zhaojie & Zhang, Canrong & Lin, Wei-Hua & Miao, Lixin & Yang, Peng, 2014. "A tabu search heuristic for the local container drayage problem under a new operation mode," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 62(C), pages 136-150.
    12. Zhang, Ruiyou & Lu, Jye-Chyi & Wang, Dingwei, 2014. "Container drayage problem with flexible orders and its near real-time solution strategies," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 61(C), pages 235-251.
    13. Jinming Liu & Guoting Zhang & Lining Xing & Weihua Qi & Yingwu Chen, 2022. "An Exact Algorithm for Multi-Task Large-Scale Inter-Satellite Routing Problem with Time Windows and Capacity Constraints," Mathematics, MDPI, vol. 10(21), pages 1-24, October.
    14. Scherr, Yannick Oskar & Hewitt, Mike & Neumann Saavedra, Bruno Albert & Mattfeld, Dirk Christian, 2020. "Dynamic discretization discovery for the service network design problem with mixed autonomous fleets," Transportation Research Part B: Methodological, Elsevier, vol. 141(C), pages 164-195.
    15. Weiwei Chen & Jie Song & Leyuan Shi & Liang Pi & Peter Sun, 2013. "Data mining-based dispatching system for solving the local pickup and delivery problem," Annals of Operations Research, Springer, vol. 203(1), pages 351-370, March.
    16. Fan, Tijun & Pan, Qianlan & Pan, Fei & Zhou, Wei & Chen, Jingyi, 2020. "Intelligent logistics integration of internal and external transportation with separation mode," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 133(C).
    17. Luke Marshall & Natashia Boland & Martin Savelsbergh & Mike Hewitt, 2021. "Interval-Based Dynamic Discretization Discovery for Solving the Continuous-Time Service Network Design Problem," Transportation Science, INFORMS, vol. 55(1), pages 29-51, 1-2.
    18. Edward Yuhang He & Natashia Boland & George Nemhauser & Martin Savelsbergh, 2022. "Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1086-1114, March.
    19. Macharis, C. & Bontekoning, Y. M., 2004. "Opportunities for OR in intermodal freight transport research: A review," European Journal of Operational Research, Elsevier, vol. 153(2), pages 400-416, March.
    20. Zhang, Ruiyou & Zhao, Haishu & Moon, Ilkyeong, 2018. "Range-based truck-state transition modeling method for foldable container drayage services," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 225-239.

    More about this item

    Keywords

    Engineering; Diesel trucks; Drayage; Electric trucks; Electric vehicle charging; Routes and routing; Vehicle mix;
    All these keywords.

    NEP fields

    This paper has been announced in the following NEP Reports:

    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:cdl:itsdav:qt1g17p2cj. 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: Lisa Schiff (email available below). General contact details of provider: https://edirc.repec.org/data/itucdus.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.