IDEAS home Printed from https://ideas.repec.org/a/gam/jsusta/v16y2024i6p2357-d1355814.html
   My bibliography  Save this article

Consideration of Carbon Emissions in Multi-Trip Delivery Optimization of Unmanned Vehicles

Author

Listed:
  • Xinhua Gao

    (School of Traffic and Transportation, Chongqing Jiaotong University, Chongqing 400074, China)

  • Song Liu

    (School of Traffic and Transportation, Chongqing Jiaotong University, Chongqing 400074, China
    Institute for Intelligent Optimization of Comprehensive Transportation Systems, Chongqing Jiaotong University, Chongqing 400074, China)

  • Yan Wang

    (T.Y.LIN International Group Chongqing, Chongqing 401121, China)

  • Dennis Z. Yu

    (The David D. Reh School of Business, Clarkson University, Potsdam, NY 13699, USA)

  • Yong Peng

    (School of Traffic and Transportation, Chongqing Jiaotong University, Chongqing 400074, China)

  • Xianting Ma

    (School of Traffic and Transportation, Chongqing Jiaotong University, Chongqing 400074, China)

Abstract

In order to achieve the goal of low-carbon, efficient delivery using unmanned vehicles, a multi-objective optimization model considering carbon emissions in the problem of optimizing multi-route delivery for unmanned vehicles is proposed. An improved genetic algorithm (IGA) is designed for solving this problem. This study takes into account constraints such as the maximum service duration for delivery, the number of vehicles, and the approved loading capacity of the vehicles, with the objective of minimizing the startup cost, transportation cost, fuel cost, and environmental cost in terms of the carbon dioxide emissions of unmanned vehicles. A combination encoding method based on the integer of the number of trips, the number of vehicles, and the number of customers is used. The inclusion of a simulated annealing algorithm and an elite selection strategy in the design of the IGA enhances the quality and efficiency of the algorithm. The international dataset Solomon RC 208 is used to verify the effectiveness of the model and the algorithm in small-, medium-, and large-scale cases by comparing them with the genetic algorithm (GA) and simulated annealing algorithm (SA). The research results show that the proposed model is applicable to the problem of optimizing the multi-route delivery of unmanned vehicles while considering carbon emissions. Compared with the GA and SA, the IGA demonstrates faster convergence speed and higher optimization efficiency. Additionally, as the problem’s scale increases, the average total cost deviation rate changes significantly, and better delivery solutions for unmanned vehicles are obtained with the IGA. Furthermore, the selection of delivery routes for unmanned vehicles primarily depends on their startup costs and transportation distance, and the choice of different vehicle types has an impact on delivery duration, total distance, and the average number of trips. The delivery strategy that considers carbon emissions shows a 22.6% difference in its total cost compared to the strategy that does not consider carbon emissions. The model and algorithms proposed in this study provide optimization solutions for achieving low-carbon and efficient delivery using unmanned vehicles, aiming to reduce their environmental impact and costs. They also contribute to the development and application of unmanned vehicle technology in the delivery field.

Suggested Citation

  • Xinhua Gao & Song Liu & Yan Wang & Dennis Z. Yu & Yong Peng & Xianting Ma, 2024. "Consideration of Carbon Emissions in Multi-Trip Delivery Optimization of Unmanned Vehicles," Sustainability, MDPI, vol. 16(6), pages 1-26, March.
  • Handle: RePEc:gam:jsusta:v:16:y:2024:i:6:p:2357-:d:1355814
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/16/6/2357/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2071-1050/16/6/2357/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Brandao, Jose & Mercer, Alan, 1997. "A tabu search algorithm for the multi-trip vehicle routing and scheduling problem," European Journal of Operational Research, Elsevier, vol. 100(1), pages 180-191, July.
    2. Bettinelli, Andrea & Cacchiani, Valentina & Crainic, Teodor Gabriel & Vigo, Daniele, 2019. "A Branch-and-Cut-and-Price algorithm for the Multi-trip Separate Pickup and Delivery Problem with Time Windows at Customers and Facilities," European Journal of Operational Research, Elsevier, vol. 279(3), pages 824-839.
    3. Pedro Munari & Reinaldo Morabito, 2018. "A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 26(3), pages 437-464, October.
    4. Kangye Tan & Weihua Liu & Fang Xu & Chunsheng Li, 2023. "Optimization Model and Algorithm of Logistics Vehicle Routing Problem under Major Emergency," Mathematics, MDPI, vol. 11(5), pages 1-18, March.
    5. Ilias Vlachos & Rodrigo Martinez Pascazzi & George Zobolas & Panagiotis Repoussis & Mihalis Giannakis, 2023. "Lean manufacturing systems in the area of Industry 4.0: a lean automation plan of AGVs/IoT integration," Post-Print hal-04004536, HAL.
    6. Yunlin Guan & Yun Wang & Xuedong Yan & Haonan Guo & Yi Zhao, 2022. "The One E-Ticket Customized Bus Service Mode for Passengers with Multiple Trips and the Routing Problem," Sustainability, MDPI, vol. 14(4), pages 1-17, February.
    7. Changlu Zhang & Liqian Tang & Jian Zhang & Liming Gou, 2023. "Optimizing Distribution Routes for Chain Supermarket Considering Carbon Emission Cost," Mathematics, MDPI, vol. 11(12), pages 1-20, June.
    8. Cristian Cataldo-Díaz & Rodrigo Linfati & John Willmer Escobar, 2022. "Mathematical Model for the Electric Vehicle Routing Problem Considering the State of Charge of the Batteries," Sustainability, MDPI, vol. 14(3), pages 1-26, January.
    9. 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)

    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. Azi, Nabila & Gendreau, Michel & Potvin, Jean-Yves, 2010. "An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles," European Journal of Operational Research, Elsevier, vol. 202(3), pages 756-763, May.
    2. Garside, Annisa Kesy & Ahmad, Robiah & Muhtazaruddin, Mohd Nabil Bin, 2024. "A recent review of solution approaches for green vehicle routing problem and its variants," Operations Research Perspectives, Elsevier, vol. 12(C).
    3. Huang, Nan & Li, Jiliu & Zhu, Wenbin & Qin, Hu, 2021. "The multi-trip vehicle routing problem with time windows and unloading queue at depot," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    4. Diego Cattaruzza & Nabil Absi & Dominique Feillet, 2018. "Vehicle routing problems with multiple trips," Annals of Operations Research, Springer, vol. 271(1), pages 127-159, December.
    5. Diego Cattaruzza & Nabil Absi & Dominique Feillet, 2016. "Vehicle routing problems with multiple trips," 4OR, Springer, vol. 14(3), pages 223-259, September.
    6. Yinghui Wu & Haoran Du & Huixin Song, 2024. "An Iterated Local Search Heuristic for the Multi-Trip Vehicle Routing Problem with Multiple Time Windows," Mathematics, MDPI, vol. 12(11), pages 1-16, May.
    7. 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.
    8. Song Liu & Xinhua Gao & Liu Chen & Sihui Zhou & Yong Peng & Dennis Z. Yu & Xianting Ma & Yan Wang, 2023. "Multi-Traveler Salesman Problem for Unmanned Vehicles: Optimization through Improved Hopfield Neural Network," Sustainability, MDPI, vol. 15(20), pages 1-25, October.
    9. Senna, Fernando & Coelho, Leandro C. & Morabito, Reinaldo & Munari, Pedro, 2024. "An exact method for a last-mile delivery routing problem with multiple deliverymen," European Journal of Operational Research, Elsevier, vol. 317(2), pages 550-562.
    10. Shao, Saijun & Xu, Su Xiu & Huang, George Q., 2020. "Variable neighborhood search and tabu search for auction-based waste collection synchronization," Transportation Research Part B: Methodological, Elsevier, vol. 133(C), pages 1-20.
    11. Ampol Karoonsoontawong & Onwasa Kobkiattawin & Chi Xie, 2019. "Efficient Insertion Heuristic Algorithms for Multi-Trip Inventory Routing Problem with Time Windows, Shift Time Limits and Variable Delivery Time," Networks and Spatial Economics, Springer, vol. 19(2), pages 331-379, June.
    12. Pedro Munari & Alfredo Moreno & Jonathan De La Vega & Douglas Alem & Jacek Gondzio & Reinaldo Morabito, 2019. "The Robust Vehicle Routing Problem with Time Windows: Compact Formulation and Branch-Price-and-Cut Method," Transportation Science, INFORMS, vol. 53(4), pages 1043-1066, July.
    13. J. Arturo Castillo-Salazar & Dario Landa-Silva & Rong Qu, 2016. "Workforce scheduling and routing problems: literature survey and computational study," Annals of Operations Research, Springer, vol. 239(1), pages 39-67, April.
    14. Andrew Lim & Zhenzhen Zhang & Hu Qin, 2017. "Pickup and Delivery Service with Manpower Planning in Hong Kong Public Hospitals," Transportation Science, INFORMS, vol. 51(2), pages 688-705, May.
    15. 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.
    16. Kritikos, Manolis N. & Ioannou, George, 2013. "The heterogeneous fleet vehicle routing problem with overloads and time windows," International Journal of Production Economics, Elsevier, vol. 144(1), pages 68-75.
    17. Yi-Kuei Lin & Cheng-Fu Huang & Yi-Chieh Liao, 2019. "Reliability of a stochastic intermodal logistics network under spoilage and time considerations," Annals of Operations Research, Springer, vol. 277(1), pages 95-118, June.
    18. Filippo Focacci & Andrea Lodi & Michela Milano, 2002. "A Hybrid Exact Algorithm for the TSPTW," INFORMS Journal on Computing, INFORMS, vol. 14(4), pages 403-417, November.
    19. Zhang, Ying & Qi, Mingyao & Miao, Lixin & Liu, Erchao, 2014. "Hybrid metaheuristic solutions to inventory location routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 70(C), pages 305-323.
    20. 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.

    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:16:y:2024:i:6:p:2357-:d:1355814. 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.