IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v192y2009i1p105-115.html
   My bibliography  Save this article

Truck dock assignment problem with operational time constraint within crossdocks

Author

Listed:
  • Miao, Zhaowei
  • Lim, Andrew
  • Ma, Hong

Abstract

In this paper, we consider a truck dock assignment problem with an operational time constraint in crossdocks where the number of trucks exceeds the number of docks available. The problem feasibility is affected by three factors: the arrival and departure time window of each truck, the operational time for cargo shipment among the docks, and the total capacity available to the crossdock. The objective is to find an optimal assignment of trucks that minimizes the operational cost of the cargo shipments and the total number of unfulfilled shipments at the same time. We combine the above two objectives into one term: the total cost, a sum of the total dock operational cost and the penalty cost for all the unfulfilled shipments. The problem is then formulated as an integer programming (IP) model. We find that as the problem size grows, the IP model size quickly expands to an extent that the ILOG CPLEX Solver can hardly manage. Therefore, two meta-heuristic approaches, Tabu Search (TS) and genetic algorithm (GA), are proposed. Computational experiments are conducted, showing that meta-heuristics, especially the Tabu search, dominate the CPLEX Solver in nearly all test cases adapted from industrial applications.

Suggested Citation

  • Miao, Zhaowei & Lim, Andrew & Ma, Hong, 2009. "Truck dock assignment problem with operational time constraint within crossdocks," European Journal of Operational Research, Elsevier, vol. 192(1), pages 105-115, January.
  • Handle: RePEc:eee:ejores:v:192:y:2009:i:1:p:105-115
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(07)00939-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    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. Bruce Hoppe & Éva Tardos, 2000. "The Quickest Transshipment Problem," Mathematics of Operations Research, INFORMS, vol. 25(1), pages 36-62, February.
    2. Yu, Wooyeon & Egbelu, Pius J., 2008. "Scheduling of inbound and outbound trucks in cross docking systems with temporary storage," European Journal of Operational Research, Elsevier, vol. 184(1), pages 377-396, January.
    3. H Ding & A Lim & B Rodrigues & Y Zhu, 2004. "New heuristics for over-constrained flight to gate assignments," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 55(7), pages 760-768, July.
    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. Gelareh, Shahin & Monemi, Rahimeh Neamatian & Semet, Frédéric & Goncalves, Gilles, 2016. "A branch-and-cut algorithm for the truck dock assignment problem with operational time constraints," European Journal of Operational Research, Elsevier, vol. 249(3), pages 1144-1152.
    2. Yuya Higashikawa & Naoki Katoh, 2019. "A Survey on Facility Location Problems in Dynamic Flow Networks," The Review of Socionetwork Strategies, Springer, vol. 13(2), pages 163-208, October.
    3. Mohammad Amin Amani & Mohammad Mahdi Nasiri, 2023. "A novel cross docking system for distributing the perishable products considering preemption: a machine learning approach," Journal of Combinatorial Optimization, Springer, vol. 45(5), pages 1-32, July.
    4. Saurabh Amin & Patrick Jaillet & Haripriya Pulyassary & Manxi Wu, 2023. "Market Design for Capacity Sharing in Networks," Papers 2307.03994, arXiv.org, revised Nov 2024.
    5. Dorndorf, Ulrich & Drexl, Andreas & Nikulin, Yury & Pesch, Erwin, 2005. "Flight gate scheduling: State-of-the-art and recent developments," Manuskripte aus den Instituten für Betriebswirtschaftslehre der Universität Kiel 584, Christian-Albrechts-Universität zu Kiel, Institut für Betriebswirtschaftslehre.
    6. Gaudioso, Manlio & Monaco, Maria Flavia & Sammarra, Marcello, 2021. "A Lagrangian heuristics for the truck scheduling problem in multi-door, multi-product Cross-Docking with constant processing time," Omega, Elsevier, vol. 101(C).
    7. Şeker, Merve & Noyan, Nilay, 2012. "Stochastic optimization models for the airport gate assignment problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 48(2), pages 438-459.
    8. Ulrich Dorndorf & Florian Jaehn & Erwin Pesch, 2017. "Flight gate assignment and recovery strategies with stochastic arrival and departure times," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 65-93, January.
    9. Maxim A. Dulebenets, 2018. "A Diploid Evolutionary Algorithm for Sustainable Truck Scheduling at a Cross-Docking Facility," Sustainability, MDPI, vol. 10(5), pages 1-23, April.
    10. Berghman, Lotte & Leus, Roel, 2015. "Practical solutions for a dock assignment problem with trailer transportation," European Journal of Operational Research, Elsevier, vol. 246(3), pages 787-799.
    11. Ismaila Abderhamane Ndiaye & Emmanuel Neron & Antoine Jouglet, 2017. "Macroscopic evacuation plans for natural disasters," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 39(1), pages 231-272, January.
    12. Urmila Pyakurel & Tanka Nath Dhamala, 2017. "Continuous Dynamic Contraflow Approach for Evacuation Planning," Annals of Operations Research, Springer, vol. 253(1), pages 573-598, June.
    13. Dulebenets, Maxim A., 2019. "A Delayed Start Parallel Evolutionary Algorithm for just-in-time truck scheduling at a cross-docking facility," International Journal of Production Economics, Elsevier, vol. 212(C), pages 236-258.
    14. Fatma Essghaier & Hamid Allaoui & Gilles Goncalves, 2021. "Truck to door assignment in a shared cross-dock under uncertainty," Post-Print hal-04066589, HAL.
    15. Afonso Vaz de Oliveira & Carina M. Oliveira Pimentel & Radu Godina & João Carlos de Oliveira Matias & Susana M. Palavra Garrido, 2022. "Improvement of the Logistics Flows in the Receiving Process of a Warehouse," Logistics, MDPI, vol. 6(1), pages 1-23, March.
    16. Ladier, Anne-Laure & Alpan, Gülgün, 2016. "Cross-docking operations: Current research versus industry practice," Omega, Elsevier, vol. 62(C), pages 145-162.
    17. Boysen, Nils & Emde, Simon & Hoeck, Michael & Kauderer, Markus, 2015. "Part logistics in the automotive industry: Decision problems, literature review and research agenda," European Journal of Operational Research, Elsevier, vol. 242(1), pages 107-120.
    18. Fateme Heidari & Seyed Hessameddin Zegordi & Reza Tavakkoli-Moghaddam, 2018. "Modeling truck scheduling problem at a cross-dock facility through a bi-objective bi-level optimization approach," Journal of Intelligent Manufacturing, Springer, vol. 29(5), pages 1155-1170, June.
    19. Saeid Rezaei & Amirsaman Kheirkhah, 2018. "A comprehensive approach in designing a sustainable closed-loop supply chain network using cross-docking operations," Computational and Mathematical Organization Theory, Springer, vol. 24(1), pages 51-98, March.
    20. Ulrich Dorndorf & Florian Jaehn & Erwin Pesch, 2008. "Modelling Robust Flight-Gate Scheduling as a Clique Partitioning Problem," Transportation Science, INFORMS, vol. 42(3), pages 292-301, August.

    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:ejores:v:192:y:2009:i:1:p:105-115. 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/eor .

    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.