IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-319-42902-1_22.html
   My bibliography  Save this book chapter

A Tabu Search Based Heuristic Approach for the Dynamic Container Relocation Problem

In: Operations Research Proceedings 2015

Author

Listed:
  • Osman Karpuzoğlu

    (Galatasaray University)

  • M. Hakan Akyüz

    (Galatasaray University)

  • Temel Öncan

    (Galatasaray University)

Abstract

The container relocation problem (CRP) is concerned with clearing out a single yard-bay which contains a fixed number of containers each following a given pickup order so as to minimize the total number of relocations made during their retrieval process. In this work, we consider an extension of the CRP where containers are both received and retrieved at a single yard-bay named Dynamic Container Relocation Problem (DCRP). The arrival and departure sequences of containers are assumed to be known in advance. A tabu search based heuristic approach is proposed to solve the DCRP. Computational experiments are performed on an extensive set of randomly generated test instances from the literature. Our results show that the proposed algorithm is efficient and yields promising outcomes.

Suggested Citation

  • Osman Karpuzoğlu & M. Hakan Akyüz & Temel Öncan, 2017. "A Tabu Search Based Heuristic Approach for the Dynamic Container Relocation Problem," Operations Research Proceedings, in: Karl Franz Dörner & Ivana Ljubic & Georg Pflug & Gernot Tragler (ed.), Operations Research Proceedings 2015, pages 165-171, Springer.
    • Handle: RePEc:spr:oprchp:978-3-319-42902-1_22
    DOI: 10.1007/978-3-319-42902-1_22
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    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:spr:oprchp:978-3-319-42902-1_22. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.