IDEAS home Printed from https://ideas.repec.org/p/zbw/bclgwp/5.html
   My bibliography  Save this paper

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. Zolfagharinia, Hossein & Haughton, Michael, 2018. "The importance of considering non-linear layover and delay costs for local truckers," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 109(C), pages 331-355.
    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. Shiri, Samaneh & Huynh, Nathan, 2016. "Optimization of drayage operations with time-window constraints," International Journal of Production Economics, Elsevier, vol. 176(C), pages 7-20.
    7. You, Jintao & Wang, Yuan & Xue, Zhaojie, 2023. "An exact algorithm for the multi-trip container drayage problem with truck platooning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 175(C).
    8. 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.
    9. 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.
    10. Lai, Michela & Crainic, Teodor Gabriel & Di Francesco, Massimo & Zuddas, Paola, 2013. "An heuristic search for the routing of heterogeneous trucks with single and double container loads," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 56(C), pages 108-118.
    11. Chen, Rui & Jia, Shuai & Meng, Qiang, 2023. "Dynamic container drayage booking and routing decision support approach for E-commerce platforms," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 177(C).
    12. 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.
    13. Moreno-Quintero, Eric & Fowkes, Tony & Watling, David, 2013. "Modelling planner–carrier interactions in road freight transport: Optimisation of road maintenance costs via overloading control," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 50(C), pages 68-83.
    14. Roberto Aringhieri & Maurizio Bruglieri & Federico Malucelli & Maddalena Nonato, 2018. "A Special Vehicle Routing Problem Arising in the Optimization of Waste Disposal: A Real Case," Transportation Science, INFORMS, vol. 52(2), pages 277-299, March.
    15. Zhang, Ruiyou & Yun, Won Young & Moon, Il Kyeong, 2011. "Modeling and optimization of a container drayage problem with resource constraints," International Journal of Production Economics, Elsevier, vol. 133(1), pages 351-359, September.
    16. Lange, Ann-Kathrin & Nellen, Nicole & Jahn, Carlos, 2022. "Truck appointment systems: How can they be improved and what are their limits?," Chapters from the Proceedings of the Hamburg International Conference of Logistics (HICL), in: Kersten, Wolfgang & Jahn, Carlos & Blecker, Thorsten & Ringle, Christian M. (ed.), Changing Tides: The New Role of Resilience and Sustainability in Logistics and Supply Chain Management – Innovative Approaches for the Shift to a New , volume 33, pages 615-655, Hamburg University of Technology (TUHH), Institute of Business Logistics and General Management.
    17. 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).
    18. 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).
    19. 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.
    20. 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.

    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.