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

A Physical Internet (PI) based inland container transportation problem with selective non-containerized shipping requests

Author

Listed:
  • Li, Ming
  • Shao, Saijun
  • Li, Yang
  • Zhang, Hua
  • Zhang, Nianwu
  • He, Yandong

Abstract

The imbalance of inbound and outbound containers generates large numbers of idle runs of container trucks in inland container transportation. In tradition, the trucking company acquires shipping requests from the spot market to increase profitability, with the precondition that both origin and destination locations of the acquired request are the same as the idle travel. Such precondition undoubtably leads to limited benefits and poor stability, given that shipping requests from the spot market are of high randomness. This paper proposes to adopt the idea of Physical Internet (PI) and assign an acquired request to several trucks, allowing transfers from one truck to another at logistics hubs. In this way, temporally and spatially dispersed idle resources could be consolidated to achieve the shipments of selective shipping requests, in a relay manner. To our knowledge, this paper is among the first to study the new paradigm of inland container transportation and formally model it as a PI-based selective vehicle routing problem (PI-SVRP). A mixed integer program (MIP) is presented and validated with CPLEX on small instances. In order to tackle real world instances, several novel heuristics have been designed particularly according to the special problem structure and embedded into an adaptive large neighborhood search (ALNS) framework. Finally, substantial instances are generated based on real data and a series of numerical studies are performed to derive managerial implications for practitioners.

Suggested Citation

  • Li, Ming & Shao, Saijun & Li, Yang & Zhang, Hua & Zhang, Nianwu & He, Yandong, 2022. "A Physical Internet (PI) based inland container transportation problem with selective non-containerized shipping requests," International Journal of Production Economics, Elsevier, vol. 245(C).
    • Handle: RePEc:eee:proeco:v:245:y:2022:i:c:s0925527321003790
    DOI: 10.1016/j.ijpe.2021.108403
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0925527321003790
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ijpe.2021.108403?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. Dumas, Yvan & Desrosiers, Jacques & Soumis, Francois, 1991. "The pickup and delivery problem with time windows," European Journal of Operational Research, Elsevier, vol. 54(1), pages 7-22, September.
    2. Stefan Ropke & David Pisinger, 2006. "An Adaptive Large Neighborhood Search Heuristic for the Pickup and Delivery Problem with Time Windows," Transportation Science, INFORMS, vol. 40(4), pages 455-472, November.
    3. Zhang, Ruiyou & Yun, Won Young & Moon, Ilkyeong, 2009. "A reactive tabu search algorithm for the multi-depot container truck transportation problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 45(6), pages 904-914, November.
    4. Shou-feng Ji & Xiao-shuai Peng & Rong-juan Luo, 2019. "An integrated model for the production-inventory-distribution problem in the Physical Internet," International Journal of Production Research, Taylor & Francis Journals, vol. 57(4), pages 1000-1017, February.
    5. Rochdi Sarraj & Eric Ballot & Shenle Pan & Driss Hakimi & Benoit Montreuil, 2014. "Interconnected logistic networks and protocols: simulation-based efficiency assessment," Post-Print hal-01112138, HAL.
    6. Zhengyang Hu & Ronald G. Askin & Guiping Hu, 2019. "Hub relay network design for daily driver routes," International Journal of Production Research, Taylor & Francis Journals, vol. 57(19), pages 6130-6145, October.
    7. Coslovich, Luca & Pesenti, Raffaele & Ukovich, Walter, 2006. "Minimizing fleet operating costs for a container transportation company," European Journal of Operational Research, Elsevier, vol. 171(3), pages 776-786, June.
    8. Wenqing He & Zhihong Jin & Ying Huang & Shida Xu, 2021. "The Inland Container Transportation Problem with Separation Mode Considering Carbon Dioxide Emissions," Sustainability, MDPI, vol. 13(3), pages 1-16, February.
    9. Santos, Maria João & Curcio, Eduardo & Mulati, Mauro Henrique & Amorim, Pedro & Miyazawa, Flávio Keidi, 2020. "A robust optimization approach for the vehicle routing problem with selective backhauls," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 136(C).
    10. Racha El-Hajj & Rym Nesrine Guibadj & Aziz Moukrim & Mehdi Serairi, 2020. "A PSO based algorithm with an efficient optimal split procedure for the multiperiod vehicle routing problem with profit," Annals of Operations Research, Springer, vol. 291(1), pages 281-316, August.
    11. Theo E. Notteboom * & Jean-Paul Rodrigue, 2005. "Port regionalization: towards a new phase in port development," Maritime Policy & Management, Taylor & Francis Journals, vol. 32(3), pages 297-313, July.
    12. Funke, Julia & Kopfer, Herbert, 2016. "A model for a multi-size inland container transportation problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 89(C), pages 70-85.
    13. Imen Ben Mohamed & Walid Klibi & Olivier Labarthe & Jean-Christophe Deschamps & Mohamed Zied Babai, 2017. "Modelling and solution approaches for the interconnected city logistics," International Journal of Production Research, Taylor & Francis Journals, vol. 55(9), pages 2664-2684, May.
    14. Bruce L. Golden & Larry Levy & Rakesh Vohra, 1987. "The orienteering problem," Naval Research Logistics (NRL), John Wiley & Sons, vol. 34(3), pages 307-318, June.
    15. Defryn, Christof & Sörensen, Kenneth & Cornelissens, Trijntje, 2016. "The selective vehicle routing problem in a collaborative environment," European Journal of Operational Research, Elsevier, vol. 250(2), pages 400-411.
    16. Rob Konings, 2005. "Foldable Containers to Reduce the Costs of Empty Transport? A Cost–Benefit Analysis from a Chain and Multi-Actor Perspective," Maritime Economics & Logistics, Palgrave Macmillan;International Association of Maritime Economists (IAME), vol. 7(3), pages 223-249, September.
    17. Gunawan, Aldy & Lau, Hoong Chuin & Vansteenwegen, Pieter, 2016. "Orienteering Problem: A survey of recent variants, solution approaches and applications," European Journal of Operational Research, Elsevier, vol. 255(2), pages 315-332.
    18. Şahinyazan, Feyza Güliz & Kara, Bahar Y. & Taner, Mehmet Rüştü, 2015. "Selective vehicle routing for a mobile blood donation system," European Journal of Operational Research, Elsevier, vol. 245(1), pages 22-34.
    19. Hao Luo & Siyu Tian & Xiang T. R. Kong, 2021. "Physical Internet-enabled customised furniture delivery in the metropolitan areas: digitalisation, optimisation and case study," International Journal of Production Research, Taylor & Francis Journals, vol. 59(7), pages 2193-2217, April.
    20. Vansteenwegen, Pieter & Souffriau, Wouter & Oudheusden, Dirk Van, 2011. "The orienteering problem: A survey," European Journal of Operational Research, Elsevier, vol. 209(1), pages 1-10, February.
    21. Bin Qiao & Shenle Pan & Eric Ballot, 2020. "Revenue Optimization for Less-than-truckload Carriers in the Physical Internet: dynamic pricing and request selection," Post-Print hal-01949543, HAL.
    22. Song, Yujian & Zhang, Jiantong & Liang, Zhe & Ye, Chunming, 2017. "An exact algorithm for the container drayage problem under a separation mode," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 106(C), pages 231-254.
    23. Tarik Chargui & Abdelghani Bekrar & Mohamed Reghioui & Damien Trentesaux, 2020. "Proposal of a multi-agent model for the sustainable truck scheduling and containers grouping problem in a Road-Rail physical internet hub," International Journal of Production Research, Taylor & Francis Journals, vol. 58(18), pages 5477-5501, September.
    24. M. W. P. Savelsbergh & M. Sol, 1995. "The General Pickup and Delivery Problem," Transportation Science, INFORMS, vol. 29(1), pages 17-29, 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. Escudero-Santana, Alejandro & Muñuzuri, Jesús & Cortés, Pablo & Onieva, Luis, 2021. "The one container drayage problem with soft time windows," Research in Transportation Economics, Elsevier, vol. 90(C).
    2. Orenstein, Ido & Raviv, Tal, 2022. "Parcel delivery using the hyperconnected service network," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 161(C).
    3. Nguyen, Tiep & Duong, Quang Huy & Nguyen, Truong Van & Zhu, You & Zhou, Li, 2022. "Knowledge mapping of digital twin and physical internet in Supply Chain Management: A systematic literature review," International Journal of Production Economics, Elsevier, vol. 244(C).
    4. Hajem A. Daham & Xinan Yang & Michaela K. Warnes, 2017. "An efficient mixed integer programming model for pairing containers in inland transportation based on the assignment of orders," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 68(6), pages 678-694, June.
    5. Xinan Yang & Hajem A. Daham, 2020. "A column generation-based decomposition and aggregation approach for combining orders in inland transportation of containers," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(1), pages 261-296, March.
    6. Funke, Julia & Kopfer, Herbert, 2016. "A model for a multi-size inland container transportation problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 89(C), pages 70-85.
    7. Bustos-Coral, Daniel & Costa, Alysson M., 2022. "Drayage routing with heterogeneous fleet, compatibility constraints, and truck load configurations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 168(C).
    8. Dikas, G. & Minis, I., 2014. "Scheduled paratransit transport systems," Transportation Research Part B: Methodological, Elsevier, vol. 67(C), pages 18-34.
    9. Michael D. Moskal & Erdi Dasdemir & Rajan Batta, 2023. "Unmanned Aerial Vehicle Information Collection Missions with Uncertain Characteristics," INFORMS Journal on Computing, INFORMS, vol. 35(1), pages 120-137, January.
    10. Chen, Rui & Meng, Qiang & Jia, Peng, 2022. "Container port drayage operations and management: Past and future," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 159(C).
    11. Liu, Mengyang & Luo, Zhixing & Lim, Andrew, 2015. "A branch-and-cut algorithm for a realistic dial-a-ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 81(P1), pages 267-288.
    12. Sun, Peng & Veelenturf, Lucas P. & Hewitt, Mike & Van Woensel, Tom, 2018. "The time-dependent pickup and delivery problem with time windows," Transportation Research Part B: Methodological, Elsevier, vol. 116(C), pages 1-24.
    13. Qinxiao Yu & Yossiri Adulyasak & Louis-Martin Rousseau & Ning Zhu & Shoufeng Ma, 2022. "Team Orienteering with Time-Varying Profit," INFORMS Journal on Computing, INFORMS, vol. 34(1), pages 262-280, January.
    14. Chargui, Tarik & Ladier, Anne-Laure & Bekrar, Abdelghani & Pan, Shenle & Trentesaux, Damien, 2022. "Towards designing and operating physical internet cross-docks: Problem specifications and research perspectives," Omega, Elsevier, vol. 111(C).
    15. 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.
    16. Orlis, Christos & Laganá, Demetrio & Dullaert, Wout & Vigo, Daniele, 2020. "Distribution with Quality of Service Considerations: The Capacitated Routing Problem with Profits and Service Level Requirements," Omega, Elsevier, vol. 93(C).
    17. Rahma Lahyani & Mahdi Khemakhem & Frédéric Semet, 2017. "A unified matheuristic for solving multi-constrained traveling salesman problems with profits," EURO Journal on Computational Optimization, Springer;EURO - The Association of European Operational Research Societies, vol. 5(3), pages 393-422, September.
    18. Christos Orlis & Nicola Bianchessi & Roberto Roberti & Wout Dullaert, 2020. "The Team Orienteering Problem with Overlaps: An Application in Cash Logistics," Transportation Science, INFORMS, vol. 54(2), pages 470-487, March.
    19. Moghaddam, Mahboobeh & Pearce, Robin H. & Mokhtar, Hamid & Prato, Carlo G., 2020. "A generalised model for container drayage operations with heterogeneous fleet, multi-container sizes and two modes of operation," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 139(C).
    20. Liu, Ran & Xie, Xiaolan & Augusto, Vincent & Rodriguez, Carlos, 2013. "Heuristic algorithms for a vehicle routing problem with simultaneous delivery and pickup and time windows in home health care," European Journal of Operational Research, Elsevier, vol. 230(3), pages 475-486.

    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:proeco:v:245:y:2022:i:c:s0925527321003790. 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/locate/ijpe .

    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.