IDEAS home Printed from https://ideas.repec.org/p/zbw/bclgwp/5.html

A three-phase heuristic for a multi-size container transport problem with partially specified requests

Author

Listed:
  • Nordsieck, Niklas
  • Buer, Tobias
  • Schönberger, Jörn

Abstract

The present paper studies a generalization of the less-than-truckload pickup and delivery problem. The problem at hand arises in the hinterland of container terminal where empty and loaded containers have to be transported between a container depot and a set of customer locations. However, requests including empty containers are only partially specified. That is, either the pickup location or the delivery location of a request including the transportation of an empty container is a priori known. Customers who demand an empty container do not care which specific empty container is provided, i.e., while the delivery location is given, the pickup location is part of the problem's solution. To solve this problem, an iterated three-phase heuristic is introduced. The first phase completes the partially specified requests, the second phase solves a standard pickup and delivery problem, the third phase changes parameters of the objective function and the process iterates. Computational results on a set of 1,000 test instances are presented.

Suggested Citation

  • Nordsieck, Niklas & Buer, Tobias & Schönberger, Jörn, 2016. "A three-phase heuristic for a multi-size container transport problem with partially specified requests," Bremen Computational Logistics Group Working Papers 5, University of Bremen, Computational Logistics Junior Research Group.
    • Handle: RePEc:zbw:bclgwp:5
    as

    Download full text from publisher

    File URL: https://www.econstor.eu/bitstream/10419/145291/1/866421971.pdf
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Jula, Hossein & Dessouky, Maged & Ioannou, Petros & Chassiakos, Anastasios, 2005. "Container movement by trucks in metropolitan networks: modeling and optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 41(3), pages 235-259, May.
    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. Kenneth Stoop & Mario Pickavet & Didier Colle & Pieter Audenaert, 2024. "The dynamic stochastic container drayage problem with truck appointment scheduling," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 46(3), pages 953-985, September.
    2. Imai, Akio & Nishimura, Etsuko & Current, John, 2007. "A Lagrangian relaxation-based heuristic for the vehicle routing with full container load," European Journal of Operational Research, Elsevier, vol. 176(1), pages 87-105, January.
    3. 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.
    4. Regnier-Coudert, Olivier & McCall, John & Ayodele, Mayowa & Anderson, Steven, 2016. "Truck and trailer scheduling in a real world, dynamic and heterogeneous context," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 93(C), pages 389-408.
    5. 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).
    6. Xue, Zhaojie & Zhang, Canrong & Lin, Wei-Hua & Miao, Lixin & Yang, Peng, 2014. "A tabu search heuristic for the local container drayage problem under a new operation mode," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 62(C), pages 136-150.
    7. Zhang, Ruiyou & Lu, Jye-Chyi & Wang, Dingwei, 2014. "Container drayage problem with flexible orders and its near real-time solution strategies," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 61(C), pages 235-251.
    8. Xuhui Yu & Yin Feng & Cong He & Chang Liu, 2024. "Modeling and Optimization of Container Drayage Problem with Empty Container Constraints across Multiple Inland Depots," Sustainability, MDPI, vol. 16(12), pages 1-32, June.
    9. Benantar, A. & Abourraja, M.N. & Boukachour, J. & Boudebous, D. & Duvallet, C., 2020. "On the integration of container availability constraints into daily drayage operations arising in France: Modelling and optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 140(C).
    10. 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).
    11. Wang, Naiyu & Meng, Qiang & Zhang, Canrong, 2023. "A branch-price-and-cut algorithm for the local container drayage problem with controllable vehicle interference," Transportation Research Part B: Methodological, Elsevier, vol. 178(C).
    12. Lu Zhen & Wenya Lv & Zheyi Tan & Bin Dong, 2022. "Container Transportation Scheduling Between Port Yards and the Hinterland in Yunfeng," Interfaces, INFORMS, vol. 52(3), pages 250-266, May.
    13. Miao, Hongzhi & Li, Jiawei & Li, Jiangchen & Gan, Zuoxian & Li, Xinwei & Jia, Hongfei & Zheng, Jianfeng, 2025. "Complexity learning-driven route planning accelerating automated electric truck deployments in semi-open port logistics," Energy, Elsevier, vol. 338(C).
    14. Zhang, Di & Jin, Jian Gang & Zhang, Yanfei, 2025. "Multi-shift drayage planning for batches of containers: A Branch-and-Benders-and-Price algorithm," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 199(C).
    15. Wang, Wen Fei & Yun, Won Young, 2013. "Scheduling for inland container truck and train transportation," International Journal of Production Economics, Elsevier, vol. 143(2), pages 349-356.
    16. Jennifer A. Pazour & Lucas C. Neubert, 2013. "Routing and Scheduling of Cross-Town Drayage Operations at J.B. Hunt Transport," Interfaces, INFORMS, vol. 43(2), pages 117-129, April.
    17. Yujian Song & Yuting Zhang & Wanli Wang & Ming Xue, 2023. "A Branch and Price Algorithm for the Drop-and-Pickup Container Drayage Problem with Empty Container Constraints," Sustainability, MDPI, vol. 15(7), pages 1-28, March.
    18. Cui, Haipeng & Chen, Shukai & Chen, Rui & Meng, Qiang, 2022. "A two-stage hybrid heuristic solution for the container drayage problem with trailer reposition," European Journal of Operational Research, Elsevier, vol. 299(2), pages 468-482.
    19. Jia, Shuai & Cui, Haipeng & Chen, Rui & Meng, Qiang, 2022. "Dynamic container drayage with uncertain request arrival times and service time windows," Transportation Research Part B: Methodological, Elsevier, vol. 166(C), pages 237-258.
    20. Etsuko Nishimura & Stratos Papadimitriou & Koichi Shintani & Akio Imai, 2025. "Environmental challenge of vehicle dispatching in marine container drayage," Annals of Operations Research, Springer, vol. 351(1), pages 1049-1107, August.

    More about this item

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    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:zbw:bclgwp:5. 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: ZBW - Leibniz Information Centre for Economics (email available below). General contact details of provider: https://edirc.repec.org/data/fwbrede.html .

    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.