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

Osman Karpuzoğlu (), M. Hakan Akyüz () and Temel Öncan ()
Additional contact information
Osman Karpuzoğlu: Galatasaray University
M. Hakan Akyüz: Galatasaray University
Temel Öncan: Galatasaray University

A chapter in Operations Research Proceedings 2015, 2017, pp 165-171 from Springer

Abstract: 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.

Date: 2017
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-42902-1_22

Ordering information: This item can be ordered from
http://www.springer.com/9783319429021

DOI: 10.1007/978-3-319-42902-1_22

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().