IDEAS home Printed from https://ideas.repec.org/a/gam/jijerp/v15y2018i5p949-d145511.html
   My bibliography  Save this article

A New TS Algorithm for Solving Low-Carbon Logistics Vehicle Routing Problem with Split Deliveries by Backpack—From a Green Operation Perspective

Author

Listed:
  • Yangkun Xia

    (School of Traffic and Transportation Engineering, Central South University, Changsha 410075, China)

  • Zhuo Fu

    (School of Traffic and Transportation Engineering, Central South University, Changsha 410075, China)

  • Sang-Bing Tsai

    (Zhongshan Institute, University of Electronic Science and Technology of China, Zhongshan 528400, China)

  • Jiangtao Wang

    (Zhongshan Institute, University of Electronic Science and Technology of China, Zhongshan 528400, China)

Abstract

In order to promote the development of low-carbon logistics and economize logistics distribution costs, the vehicle routing problem with split deliveries by backpack is studied. With the help of the model of classical capacitated vehicle routing problem, in this study, a form of discrete split deliveries was designed in which the customer demand can be split only by backpack. A double-objective mathematical model and the corresponding adaptive tabu search (TS) algorithm were constructed for solving this problem. By embedding the adaptive penalty mechanism, and adopting the random neighborhood selection strategy and reinitialization principle, the global optimization ability of the new algorithm was enhanced. Comparisons with the results in the literature show the effectiveness of the proposed algorithm. The proposed method can save the costs of low-carbon logistics and reduce carbon emissions, which is conducive to the sustainable development of low-carbon logistics.

Suggested Citation

  • Yangkun Xia & Zhuo Fu & Sang-Bing Tsai & Jiangtao Wang, 2018. "A New TS Algorithm for Solving Low-Carbon Logistics Vehicle Routing Problem with Split Deliveries by Backpack—From a Green Operation Perspective," IJERPH, MDPI, vol. 15(5), pages 1-12, May.
    • Handle: RePEc:gam:jijerp:v:15:y:2018:i:5:p:949-:d:145511
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1660-4601/15/5/949/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/1660-4601/15/5/949/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Zhuo Fu & Richard Eglese & Mike Wright, 2007. "A Branch-And-Bound Algorithm For Finding All Optimal Solutions Of The Assignment Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 24(06), pages 831-839.
    2. Q Mu & Z Fu & J Lysgaard & R Eglese, 2011. "Disruption management of the vehicle routing problem with vehicle breakdown," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(4), pages 742-749, April.
    3. Choi, Tsan-Ming, 2013. "Local sourcing and fashion quick response system: The impacts of carbon footprint tax," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 55(C), pages 43-54.
    4. Leonardo Berbotto & Sergio García & Francisco Nogales, 2014. "A Randomized Granular Tabu Search heuristic for the split delivery vehicle routing problem," Annals of Operations Research, Springer, vol. 222(1), pages 153-173, November.
    5. Han, Anthony Fu-Wha & Chu, Yu-Ching, 2016. "A multi-start heuristic approach for the split-delivery vehicle routing problem with minimum delivery amounts," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 88(C), pages 11-31.
    6. W Maden & R Eglese & D Black, 2010. "Vehicle routing and scheduling with time-varying data: A case study," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 61(3), pages 515-522, March.
    7. C. Archetti & M. G. Speranza & A. Hertz, 2006. "A Tabu Search Algorithm for the Split Delivery Vehicle Routing Problem," Transportation Science, INFORMS, vol. 40(1), pages 64-73, February.
    8. Moshe Dror & Pierre Trudeau, 1989. "Savings by Split Delivery Routing," Transportation Science, INFORMS, vol. 23(2), pages 141-145, May.
    9. Z Fu & R Eglese & L Y O Li, 2008. "A unified tabu search algorithm for vehicle routing problems with soft time windows," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 59(5), pages 663-673, May.
    10. Songyi Wang & Fengming Tao & Yuhe Shi & Haolin Wen, 2017. "Optimization of Vehicle Routing Problem with Time Windows for Cold Chain Logistics Based on Carbon Tax," Sustainability, MDPI, vol. 9(5), pages 1-23, April.
    11. Archetti, Claudia & Bianchessi, Nicola & Speranza, M. Grazia, 2014. "Branch-and-cut algorithms for the split delivery vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 238(3), pages 685-698.
    12. Junhu Ruan & Xuping Wang & Yan Shi, 2014. "A Two-Stage Approach for Medical Supplies Intermodal Transportation in Large-Scale Disaster Responses," IJERPH, MDPI, vol. 11(11), pages 1-29, October.
    13. Salani, Matteo & Vacca, Ilaria, 2011. "Branch and price for the vehicle routing problem with discrete split deliveries and time windows," European Journal of Operational Research, Elsevier, vol. 213(3), pages 470-477, September.
    14. Xu, Dongyang & Li, Kunpeng & Zou, Xuxia & Liu, Ling, 2017. "An unpaired pickup and delivery vehicle routing problem with multi-visit," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 103(C), pages 218-247.
    15. Z Fu & R Eglese & L Y O Li, 2005. "A new tabu search heuristic for the open vehicle routing problem," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 56(3), pages 267-274, March.
    16. Marco Melacini & Elena Tappia, 2018. "A Critical Comparison of Alternative Distribution Configurations in Omni-Channel Retailing in Terms of Cost and Greenhouse Gas Emissions," Sustainability, MDPI, vol. 10(2), pages 1-15, January.
    17. Zongsheng Huang & Jiajia Nie & Sang-Bing Tsai, 2017. "Dynamic Collection Strategy and Coordination of a Remanufacturing Closed-Loop Supply Chain under Uncertainty," Sustainability, MDPI, vol. 9(5), pages 1-18, April.
    18. Alan C. McKinnon, 2016. "Freight Transport Deceleration: Its Possible Contribution to the Decarbonisation of Logistics," Transport Reviews, Taylor & Francis Journals, vol. 36(4), pages 418-436, July.
    19. Yangkun Xia & Zhuo Fu & Lijun Pan & Fenghua Duan, 2018. "Tabu search algorithm for the distance-constrained vehicle routing problem with split deliveries by order," PLOS ONE, Public Library of Science, vol. 13(5), pages 1-19, May.
    20. Changzheng Yuan & Yangbo Sun & Jun Lv & Anne C. Lusk, 2017. "Cycle Tracks and Parking Environments in China: Learning from College Students at Peking University," IJERPH, MDPI, vol. 14(8), pages 1-14, August.
    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. Rui Ren & Wanjie Hu & Jianjun Dong & Bo Sun & Yicun Chen & Zhilong Chen, 2019. "A Systematic Literature Review of Green and Sustainable Logistics: Bibliometric Analysis, Research Trend and Knowledge Taxonomy," IJERPH, MDPI, vol. 17(1), pages 1-25, December.
    2. 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.
    3. Wanting Zhang & Ming Zeng & Peng Guo & Kun Wen, 2022. "Variable Neighborhood Search for Multi-Cycle Medical Waste Recycling Vehicle Routing Problem with Time Windows," IJERPH, MDPI, vol. 19(19), pages 1-25, October.
    4. Qingqing Qiao & Fengming Tao & Hailin Wu & Xuewei Yu & Mengjun Zhang, 2020. "Optimization of a Capacitated Vehicle Routing Problem for Sustainable Municipal Solid Waste Collection Management Using the PSO-TS Algorithm," IJERPH, MDPI, vol. 17(6), pages 1-22, March.
    5. Weikang Fang & Zailin Guan & Peiyue Su & Dan Luo & Linshan Ding & Lei Yue, 2022. "Multi-Objective Material Logistics Planning with Discrete Split Deliveries Using a Hybrid NSGA-II Algorithm," Mathematics, MDPI, vol. 10(16), pages 1-30, August.

    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. Yangkun Xia & Zhuo Fu & Lijun Pan & Fenghua Duan, 2018. "Tabu search algorithm for the distance-constrained vehicle routing problem with split deliveries by order," PLOS ONE, Public Library of Science, vol. 13(5), pages 1-19, May.
    2. Gizem Ozbaygin & Oya Karasan & Hande Yaman, 2018. "New exact solution approaches for the split delivery vehicle routing problem," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 6(1), pages 85-115, March.
    3. Weikang Fang & Zailin Guan & Peiyue Su & Dan Luo & Linshan Ding & Lei Yue, 2022. "Multi-Objective Material Logistics Planning with Discrete Split Deliveries Using a Hybrid NSGA-II Algorithm," Mathematics, MDPI, vol. 10(16), pages 1-30, August.
    4. Xiaxia Ma & Wenliang Bian & Wenchao Wei & Fei Wei, 2022. "Customer-Centric, Two-Product Split Delivery Vehicle Routing Problem under Consideration of Weighted Customer Waiting Time in Power Industry," Energies, MDPI, vol. 15(10), pages 1-23, May.
    5. Jianli Shi & Jin Zhang & Kun Wang & Xin Fang, 2018. "Particle Swarm Optimization for Split Delivery Vehicle Routing Problem," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 35(02), pages 1-42, April.
    6. Jing Chen & Pengfei Gui & Tao Ding & Sanggyun Na & Yingtang Zhou, 2019. "Optimization of Transportation Routing Problem for Fresh Food by Improved Ant Colony Algorithm Based on Tabu Search," Sustainability, MDPI, vol. 11(23), pages 1-22, November.
    7. Bortfeldt, Andreas & Yi, Junmin, 2020. "The Split Delivery Vehicle Routing Problem with three-dimensional loading constraints," European Journal of Operational Research, Elsevier, vol. 282(2), pages 545-558.
    8. Han, Anthony Fu-Wha & Chu, Yu-Ching, 2016. "A multi-start heuristic approach for the split-delivery vehicle routing problem with minimum delivery amounts," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 88(C), pages 11-31.
    9. Xu, Dongyang & Li, Kunpeng & Zou, Xuxia & Liu, Ling, 2017. "An unpaired pickup and delivery vehicle routing problem with multi-visit," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 103(C), pages 218-247.
    10. Nicola Bianchessi & Stefan Irnich, 2016. "Branch-and-Cut for the Split Delivery Vehicle Routing Problem with Time Windows," Working Papers 1620, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    11. Sophie N. Parragh & Jorge Pinho de Sousa & Bernardo Almada-Lobo, 2015. "The Dial-a-Ride Problem with Split Requests and Profits," Transportation Science, INFORMS, vol. 49(2), pages 311-334, May.
    12. Jeffrey W. Ohlmann & Michael J. Fry & Barrett W. Thomas, 2008. "Route Design for Lean Production Systems," Transportation Science, INFORMS, vol. 42(3), pages 352-370, August.
    13. Yuhe Shi & Zhenggang He, 2018. "Decision Analysis of Disturbance Management in the Process of Medical Supplies Transportation after Natural Disasters," IJERPH, MDPI, vol. 15(8), pages 1-18, August.
    14. Songyi Wang & Fengming Tao & Yuhe Shi, 2018. "Optimization of Location–Routing Problem for Cold Chain Logistics Considering Carbon Footprint," IJERPH, MDPI, vol. 15(1), pages 1-17, January.
    15. Jiliu Li & Zhixing Luo & Roberto Baldacci & Hu Qin & Zhou Xu, 2023. "A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 31-49, January.
    16. Lin, Yen-Hung & Batta, Rajan & Rogerson, Peter A. & Blatt, Alan & Flanigan, Marie, 2011. "A logistics model for emergency supply of critical items in the aftermath of a disaster," Socio-Economic Planning Sciences, Elsevier, vol. 45(4), pages 132-145, December.
    17. Bhusiri, Narath & Qureshi, Ali Gul & Taniguchi, Eiichi, 2014. "The trade-off between fixed vehicle costs and time-dependent arrival penalties in a routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 62(C), pages 1-22.
    18. Daniel Schubert & André Scholz & Gerhard Wäscher, 2018. "Integrated order picking and vehicle routing with due dates," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 40(4), pages 1109-1139, October.
    19. Pedro Munari & Martin Savelsbergh, 2020. "A Column Generation-Based Heuristic for the Split Delivery Vehicle Routing Problem with Time Windows," SN Operations Research Forum, Springer, vol. 1(4), pages 1-24, December.
    20. Belfiore, PatrI´cia & Yoshida Yoshizaki, Hugo Tsugunobu, 2009. "Scatter search for a real-life heterogeneous fleet vehicle routing problem with time windows and split deliveries in Brazil," European Journal of Operational Research, Elsevier, vol. 199(3), pages 750-758, December.

    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:jijerp:v:15:y:2018:i:5:p:949-:d:145511. 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.