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

Research on a Joint Distribution Vehicle Routing Problem Considering Simultaneous Pick-Up and Delivery under the Background of Carbon Trading

Author

Listed:
  • Lingji Ma

    (School of Energy and Mining Engineering, Shandong University of Science and Technology, Qingdao 266000, China)

  • Meiyan Li

    (School of Energy and Mining Engineering, Shandong University of Science and Technology, Qingdao 266000, China)

Abstract

In order to explore the positive impact of the joint distribution model on the reduction in logistics costs in small-scale logistics enterprises, considering the demand on enterprises for simultaneous pick-up and delivery, as well as the cost of carbon emissions, this study considers the vehicle routing problem of simultaneous pick-up and delivery under a joint distribution model. First of all, an independent distribution model and a joint distribution model including fixed transportation, variable transportation, time penalty, and carbon emissions costs are established; second, by adding the self-adaption cross-mutation probability and the destruction and repair mechanism in the large-scale neighborhood search algorithm, the genetic algorithm is improved to adapt to the solution of the model in this paper, and the effectiveness of the improved algorithm is verified and analyzed. It is found that the improved genetic algorithm is more advantageous than the original algorithm for solving the problems of both models designed in this paper. Finally, the improved genetic algorithm is used to solve the two models, and the results are compared and analyzed. It is found that the joint distribution model can reduce the total cost by 6.61% and the carbon emissions cost by 5.73%. Additionally, the impact of the carbon trading mechanism on the simultaneous pick-up and delivery vehicle routing problem under the joint distribution model is further explored. The results of this study prove that enterprises can effectively reduce costs, improve profits, reduce carbon emissions, and promote the sustainable development of logistics enterprises under the condition of joint distribution.

Suggested Citation

  • Lingji Ma & Meiyan Li, 2024. "Research on a Joint Distribution Vehicle Routing Problem Considering Simultaneous Pick-Up and Delivery under the Background of Carbon Trading," Sustainability, MDPI, vol. 16(4), pages 1-29, February.
    • Handle: RePEc:gam:jsusta:v:16:y:2024:i:4:p:1698-:d:1341561
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2071-1050/16/4/1698/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2071-1050/16/4/1698/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Zhang, Qihuan & Wang, Ziteng & Huang, Min & Yu, Yang & Fang, Shu-Cherng, 2022. "Heterogeneous multi-depot collaborative vehicle routing problem," Transportation Research Part B: Methodological, Elsevier, vol. 160(C), pages 1-20.
    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. Wang, Yong & Wei, Zikai & Luo, Siyu & Zhou, Jingxin & Zhen, Lu, 2024. "Collaboration and resource sharing in the multidepot time-dependent vehicle routing problem with time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 192(C).
    2. Guo, Wenjing & Zhang, Yimeng & Li, Wenfeng & Negenborn, Rudy R. & Atasoy, Bilge, 2024. "Augmented Lagrangian relaxation-based coordinated approach for global synchromodal transport planning with multiple operators," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 185(C).
    3. Yong Wang & Jiayi Zhe & Xiuwen Wang & Yaoyao Sun & Haizhong Wang, 2022. "Collaborative Multidepot Vehicle Routing Problem with Dynamic Customer Demands and Time Windows," Sustainability, MDPI, vol. 14(11), pages 1-37, May.
    4. Zhang, Qihuan & Wang, Ziteng & Huang, Min & Wang, Huihui & Wang, Xingwei & Fang, Shu-Cherng, 2025. "Collaborative supply chain network design under demand uncertainty: A robust optimization approach," International Journal of Production Economics, Elsevier, vol. 279(C).
    5. Zhang, Yimeng & Tan, Xiangrong & Gan, Mi & Liu, Xiaobo & Atasoy, Bilge, 2025. "Operational synchromodal transport planning methodologies: Review and roadmap," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 194(C).
    6. Qiuping Ni & Yuanxiang Tang, 2023. "A Bibliometric Visualized Analysis and Classification of Vehicle Routing Problem Research," Sustainability, MDPI, vol. 15(9), pages 1-37, April.
    7. Li, Jian & Cang, Lu & Wu, Yisheng & Zhang, Zhaotong, 2025. "Two-echelon collaborative many-to-many pickup and delivery problem for agricultural wholesale markets with workload balance," Omega, Elsevier, vol. 130(C).
    8. Morteza Salehi Sarbijan & Javad Behnamian, 2025. "Feeder vehicle routing problem in a collaborative environment using hybrid particle swarm optimization and adaptive learning strategy," Environment, Development and Sustainability: A Multidisciplinary Approach to the Theory and Practice of Sustainable Development, Springer, vol. 27(3), pages 6165-6205, March.
    9. Wang, Yong & Luo, Siyu & Fan, Jianxin & Zhen, Lu, 2024. "The multidepot vehicle routing problem with intelligent recycling prices and transportation resource sharing," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 185(C).
    10. Yu, Hao & Huang, Min & Chao, Xiuli & Yue, Xiaohang, 2022. "Truthful multi-attribute multi-unit double auctions for B2B e-commerce logistics service transactions," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).

    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:4:p:1698-:d:1341561. 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.