Sequencing Storage and Retrieval Requests in a Container Block with Multiple Open Locations

Amir Gharehgozli; Yugang Yu; Rene de Koster; Shaofu Du

doi:10.1016/j.tre.2019.03.008

Sequencing Storage and Retrieval Requests in a Container Block with Multiple Open Locations

Amir Gharehgozli
, Yugang Yu^*
, Rene de Koster
, Shaofu Du

^*Corresponding author for this work

Department of Technology and Operations Management

Research output: Contribution to journal › Article › Academic › peer-review

25 Citations (Scopus)

Abstract

We study the integrated problem of allocating containers and scheduling a yard crane in a block with multiple input/output (I/O) points. The crane moves each storage container from an I/O point to a location selected from a set of open locations. A location may be suitable to stack different containers. The crane moves retrieval containers from retrieval locations to I/O points. The objective is to minimize the total travel time. We model the problem as a generalized asymmetric traveling salesman problem with overlapping sets of open locations. A three-phase solution method and heuristic algorithm are developed to solve the problem.

Original language	English
Pages (from-to)	261-284
Number of pages	24
Journal	Transportation Research. Part E, The Logistics and Transportation Review
Volume	125
DOIs	https://doi.org/10.1016/j.tre.2019.03.008
Publication status	Published - May 2019

Research programs

RSM LIS

Access to Document

10.1016/j.tre.2019.03.008

Sequencing storage and retrieval requests in a container block with multiple open locationsFinal published version, 2.15 MBLicence: Article 25fa Dutch Copyright Act

Cite this

@article{d34f09a7313541bcbbd06096c3e0f69d,

title = "Sequencing Storage and Retrieval Requests in a Container Block with Multiple Open Locations",

abstract = "We study the integrated problem of allocating containers and scheduling a yard crane in a block with multiple input/output (I/O) points. The crane moves each storage container from an I/O point to a location selected from a set of open locations. A location may be suitable to stack different containers. The crane moves retrieval containers from retrieval locations to I/O points. The objective is to minimize the total travel time. We model the problem as a generalized asymmetric traveling salesman problem with overlapping sets of open locations. A three-phase solution method and heuristic algorithm are developed to solve the problem.",

author = "Amir Gharehgozli and Yugang Yu and \{de Koster\}, Rene and Shaofu Du",

year = "2019",

month = may,

doi = "10.1016/j.tre.2019.03.008",

language = "English",

volume = "125",

pages = "261--284",

journal = "Transportation Research. Part E, The Logistics and Transportation Review",

issn = "1366-5545",

publisher = "Elsevier Ltd.",

}

TY - JOUR

T1 - Sequencing Storage and Retrieval Requests in a Container Block with Multiple Open Locations

AU - Gharehgozli, Amir

AU - Yu, Yugang

AU - de Koster, Rene

AU - Du, Shaofu

PY - 2019/5

Y1 - 2019/5

N2 - We study the integrated problem of allocating containers and scheduling a yard crane in a block with multiple input/output (I/O) points. The crane moves each storage container from an I/O point to a location selected from a set of open locations. A location may be suitable to stack different containers. The crane moves retrieval containers from retrieval locations to I/O points. The objective is to minimize the total travel time. We model the problem as a generalized asymmetric traveling salesman problem with overlapping sets of open locations. A three-phase solution method and heuristic algorithm are developed to solve the problem.

AB - We study the integrated problem of allocating containers and scheduling a yard crane in a block with multiple input/output (I/O) points. The crane moves each storage container from an I/O point to a location selected from a set of open locations. A location may be suitable to stack different containers. The crane moves retrieval containers from retrieval locations to I/O points. The objective is to minimize the total travel time. We model the problem as a generalized asymmetric traveling salesman problem with overlapping sets of open locations. A three-phase solution method and heuristic algorithm are developed to solve the problem.

UR - https://doi.org/10.1016/j.tre.2019.03.008

U2 - 10.1016/j.tre.2019.03.008

DO - 10.1016/j.tre.2019.03.008

M3 - Article

SN - 1366-5545

VL - 125

SP - 261

EP - 284

JO - Transportation Research. Part E, The Logistics and Transportation Review

JF - Transportation Research. Part E, The Logistics and Transportation Review

ER -

Sequencing Storage and Retrieval Requests in a Container Block with Multiple Open Locations

Abstract

Research programs

Access to Document

Other files and links

Fingerprint

Cite this