IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v62y2024i4p1262-1276.html
   My bibliography  Save this article

On solving the cross-dock door assignment problem

Author

Listed:
  • Laureano F. Escudero
  • M. Araceli Garín
  • Aitziber Unzueta

Abstract

A class of strong lower bounds on the solution value of a Linearised Integer Programming reformulation is introduced for the binary quadratic optimisation model to assign origin and destination nodes to strip and stack doors, resp., in a cross-dock infrastructure. The goal is to minimise the transportation cost of the commodities to be handled at the cross-dock. Strip- and stack-related decomposition submodels are developed by taking benefit of the Integer Linearisation Property that appears in the new model. A linear search heuristic is also provided for obtaining feasible solutions by exploiting the special structure of the problem. We present an extensive computational study on a testbed of 55 instances to show that the proposed joint scheme for lower bounding and feasible solution providing is very efficient. The results obtained by our proposal are similar to those obtained by CPLEX in the 50 instances taken from the literature, but usually the time is much smaller for the large instances. The comparison with CPLEX is particularly good for the new five largest instances, which make it very promising for its application in real-life cases.

Suggested Citation

  • Laureano F. Escudero & M. Araceli Garín & Aitziber Unzueta, 2024. "On solving the cross-dock door assignment problem," International Journal of Production Research, Taylor & Francis Journals, vol. 62(4), pages 1262-1276, February.
    • Handle: RePEc:taf:tprsxx:v:62:y:2024:i:4:p:1262-1276
    DOI: 10.1080/00207543.2023.2180307
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2023.2180307
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2023.2180307?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.

    More about this item

    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:taf:tprsxx:v:62:y:2024:i:4:p:1262-1276. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.