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

Localized package shipment with partial outsourcing: An exact optimization approach for Chinese courier companies

Author

Listed:
  • Wang, Zhuolin
  • Zhu, Rongping
  • Ding, Jian-Ya
  • Yang, Yu
  • You, Keyou

Abstract

This work is concerned with the daily package shipment problem that aims to find low-cost paths for a large volume of packages and transportation vehicles over a network of transshipment centers (TCs). For Chinese courier companies, this typically involves tens of thousands of origin–destination (OD) pairs and has to be solved in a limited time window every early morning. Inspired by their industry practices, where most vehicles (99.8% for our industry partner STO) only unload packages after departing from the origin and the shipment volumes can be split, we propose a novel Localized Package Shipment with Partial Outsourcing (LPSPO) model for each TC to individually decide their daily shipment profiles, which aligns with their current operations. Though the number of OD pairs in our localized model is considerably reduced, it is strongly NP-hard and we exploit the model structure to design a column generation-based algorithm, which iteratively identifies profitable paths for the restricted master problem. Then, we develop problem-specific cutting planes and variable bound tightening techniques to accelerate our algorithm. An extensive numerical study validates that our algorithm significantly outperforms CPLEX in solving the LPSPO model. Finally, experiments on realistic instances from a leading Chinese courier company illustrate that the LPSPO model may reduce its transportation costs by up to 10 million USD annually.

Suggested Citation

  • Wang, Zhuolin & Zhu, Rongping & Ding, Jian-Ya & Yang, Yu & You, Keyou, 2025. "Localized package shipment with partial outsourcing: An exact optimization approach for Chinese courier companies," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 194(C).
  • Handle: RePEc:eee:transe:v:194:y:2025:i:c:s1366554524004927
    DOI: 10.1016/j.tre.2024.103901
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S1366554524004927
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.tre.2024.103901?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. Li, Zhujun & Shalaby, Amer & Roorda, Matthew J. & Mao, Baohua, 2021. "Urban rail service design for collaborative passenger and freight transport," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 147(C).
    2. Archetti, Claudia & Peirano, Lorenzo, 2020. "Air intermodal freight transportation: The freight forwarder service problem," Omega, Elsevier, vol. 94(C).
    3. Xue, Ning & Bai, Ruibin & Qu, Rong & Aickelin, Uwe, 2021. "A hybrid pricing and cutting approach for the multi-shift full truckload vehicle routing problem," European Journal of Operational Research, Elsevier, vol. 292(2), pages 500-514.
    4. Ülkü, M. Ali & Bookbinder, James H., 2012. "Optimal quoting of delivery time by a third party logistics provider: The impact of shipment consolidation and temporal pricing schemes," European Journal of Operational Research, Elsevier, vol. 221(1), pages 110-117.
    5. Jin Y. Yen, 1971. "Finding the K Shortest Loopless Paths in a Network," Management Science, INFORMS, vol. 17(11), pages 712-716, July.
    6. Ziebuhr, Mario & Kopfer, Herbert, 2016. "Solving an integrated operational transportation planning problem with forwarding limitations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 87(C), pages 149-166.
    7. Song, Dong-Ping & Dong, Jing-Xin, 2012. "Cargo routing and empty container repositioning in multiple shipping service routes," Transportation Research Part B: Methodological, Elsevier, vol. 46(10), pages 1556-1575.
    8. Gürler, Ülkü & Alp, Osman & Büyükkaramikli, Nasuh Çağdaş, 2014. "Coordinated inventory replenishment and outsourced transportation operations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 70(C), pages 400-415.
    9. Xiao, Jie & Pachl, Joern & Lin, Boliang & Wang, Jiaxi, 2018. "Solving the block-to-train assignment problem using the heuristic approach based on the genetic algorithm and tabu search," Transportation Research Part B: Methodological, Elsevier, vol. 108(C), pages 148-171.
    10. Özkaya, Evren & Keskinocak, PInar & Roshan Joseph, V. & Weight, Ryan, 2010. "Estimating and benchmarking Less-than-Truckload market rates," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 46(5), pages 667-682, September.
    11. Cruijssen, Frans & Borm, Peter & Fleuren, Hein & Hamers, Herbert, 2010. "Supplier-initiated outsourcing: A methodology to exploit synergy in transportation," European Journal of Operational Research, Elsevier, vol. 207(2), pages 763-774, December.
    12. Chu, James C., 2018. "Mixed-integer programming model and branch-and-price-and-cut algorithm for urban bus network design and timetabling," Transportation Research Part B: Methodological, Elsevier, vol. 108(C), pages 188-216.
    13. Wang, Zhuolin & You, Keyou & Song, Shiji & Zhang, Yuli, 2020. "Wasserstein distributionally robust shortest path problem," European Journal of Operational Research, Elsevier, vol. 284(1), pages 31-43.
    14. Ahmad I. Jarrah & Ellis Johnson & Lucas C. Neubert, 2009. "Large-Scale, Less-than-Truckload Service Network Design," Operations Research, INFORMS, vol. 57(3), pages 609-625, June.
    15. Yu Yang, 2023. "An Exact Price-Cut-and-Enumerate Method for the Capacitated Multitrip Vehicle Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 57(1), pages 230-251, January.
    16. Luitpold Babel & Hans Kellerer & Vladimir Kotov, 1998. "Thek-partitioning problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 47(1), pages 59-82, February.
    17. Sadati, Mir Ehsan Hesam & Çatay, Bülent, 2021. "A hybrid variable neighborhood search approach for the multi-depot green vehicle routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 149(C).
    18. Haotian Wu & Ian Herszterg & Martin Savelsbergh & Yixiao Huang, 2023. "Service Network Design for Same-Day Delivery with Hub Capacity Constraints," Transportation Science, INFORMS, vol. 57(1), pages 273-287, January.
    19. Bahar Y. Kara & Vedat Verter, 2004. "Designing a Road Network for Hazardous Materials Transportation," Transportation Science, INFORMS, vol. 38(2), pages 188-196, May.
    20. Teodor Gabriel Crainic & Mike Hewitt & Michel Toulouse & Duc Minh Vu, 2016. "Service Network Design with Resource Constraints," Transportation Science, INFORMS, vol. 50(4), pages 1380-1393, November.
    21. Yang, Yu & Yan, Chiwei & Cao, Yufeng & Roberti, Roberto, 2023. "Planning robust drone-truck delivery routes under road traffic uncertainty," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1145-1160.
    22. Yıldız, Barış & Savelsbergh, Martin, 2022. "Optimizing package express operations in China," European Journal of Operational Research, Elsevier, vol. 300(1), pages 320-335.
    23. SteadieSeifi, M. & Dellaert, N.P. & Nuijten, W. & Van Woensel, T. & Raoufi, R., 2014. "Multimodal freight transportation planning: A literature review," European Journal of Operational Research, Elsevier, vol. 233(1), pages 1-15.
    24. Jacques Guélat & Michael Florian & Teodor Gabriel Crainic, 1990. "A Multimode Multiproduct Network Assignment Model for Strategic Planning of Freight Flows," Transportation Science, INFORMS, vol. 24(1), pages 25-39, February.
    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. Li, Siqiao & Zhu, Xiaoning & Shang, Pan & Li, Tianqi & Liu, Wenqian, 2023. "Optimizing a shared freight and passenger high-speed railway system: A multi-commodity flow formulation with Benders decomposition solution approach," Transportation Research Part B: Methodological, Elsevier, vol. 172(C), pages 1-31.
    2. SteadieSeifi, M. & Dellaert, N.P. & Nuijten, W. & Van Woensel, T., 2017. "A metaheuristic for the multimodal network flow problem with product quality preservation and empty repositioning," Transportation Research Part B: Methodological, Elsevier, vol. 106(C), pages 321-344.
    3. Archetti, Claudia & Peirano, Lorenzo & Speranza, M. Grazia, 2022. "Optimization in multimodal freight transportation problems: A Survey," European Journal of Operational Research, Elsevier, vol. 299(1), pages 1-20.
    4. Baṣak Altan & Okan Örsan Özener, 2021. "A Game Theoretical Approach for Improving the Operational Efficiencies of Less-than-truckload Carriers Through Load Exchanges," Networks and Spatial Economics, Springer, vol. 21(3), pages 547-579, September.
    5. Engebrethsen, Erna & Dauzère-Pérès, Stéphane, 2019. "Transportation mode selection in inventory models: A literature review," European Journal of Operational Research, Elsevier, vol. 279(1), pages 1-25.
    6. Al Hajj Hassan, Lama & Hewitt, Mike & Mahmassani, Hani S., 2022. "Daily load planning under different autonomous truck deployment scenarios," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 166(C).
    7. David Wolfinger & Fabien Tricoire & Karl F. Doerner, 2019. "A matheuristic for a multimodal long haul routing problem," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(4), pages 397-433, December.
    8. Hatzenbühler, Jonas & Jenelius, Erik & Gidófalvi, Gyözö & Cats, Oded, 2023. "Modular vehicle routing for combined passenger and freight transport," Transportation Research Part A: Policy and Practice, Elsevier, vol. 173(C).
    9. Li, Siqiao & Zhu, Xiaoning & Shang, Pan & Wang, Li & Li, Tianqi, 2024. "Scheduling shared passenger and freight transport for an underground logistics system," Transportation Research Part B: Methodological, Elsevier, vol. 183(C).
    10. Yi Zhao & Ronghui Liu & Xi Zhang & Anthony Whiteing, 2018. "A chance-constrained stochastic approach to intermodal container routing problems," PLOS ONE, Public Library of Science, vol. 13(2), pages 1-22, February.
    11. Greening, Lacy M. & Dahan, Mathieu & Erera, Alan L., 2023. "Lead-Time-Constrained Middle-Mile Consolidation Network Design with Fixed Origins and Destinations," Transportation Research Part B: Methodological, Elsevier, vol. 174(C).
    12. van Riessen, B. & Negenborn, R.R. & Dekker, R. & Lodewijks, G., 2013. "Impact and relevance of transit disturbances on planning in intermodal container networks," Econometric Institute Research Papers EI 2013-18, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute.
    13. Chabot, Thomas & Bouchard, Florence & Legault-Michaud, Ariane & Renaud, Jacques & Coelho, Leandro C., 2018. "Service level, cost and environmental optimization of collaborative transportation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 110(C), pages 1-14.
    14. Liu, Chuanju & Zhang, Junlong & Lin, Shaochong & Shen, Zuo-Jun Max, 2023. "Service network design with consistent multiple trips," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 171(C).
    15. Guo, Wenjing & Atasoy, Bilge & van Blokland, Wouter Beelaerts & Negenborn, Rudy R., 2021. "Global synchromodal transport with dynamic and stochastic shipment matching," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    16. Crainic, Teodor Gabriel & Perboli, Guido & Rosano, Mariangela, 2018. "Simulation of intermodal freight transportation systems: a taxonomy," European Journal of Operational Research, Elsevier, vol. 270(2), pages 401-418.
    17. Chen, Chongshuang & Dollevoet, Twan & Zhao, Jun, 2018. "One-block train formation in large-scale railway networks: An exact model and a tree-based decomposition algorithm," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 1-30.
    18. Romero-Silva, Rodrigo & Mujica Mota, Miguel, 2022. "Trade-offs in the landside operations of air cargo hubs: Horizontal cooperation and shipment consolidation policies considering capacitated nodes," Journal of Air Transport Management, Elsevier, vol. 103(C).
    19. Juliette Medina & Mike Hewitt & Fabien Lehuédé & Olivier Péton, 2019. "Integrating long-haul and local transportation planning: the Service Network Design and Routing Problem," EURO Journal on Transportation and Logistics, Springer;EURO - The Association of European Operational Research Societies, vol. 8(2), pages 119-145, June.
    20. Francesco Corman & Francesco Viti & Rudy R. Negenborn, 2017. "Equilibrium models in multimodal container transport systems," Flexible Services and Manufacturing Journal, Springer, vol. 29(1), pages 125-153, 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:transe:v:194:y:2025:i:c:s1366554524004927. 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/600244/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.