Solving the container relocation problem by an improved greedy look-ahead heuristic
•Investigate the container relocation problem, which is a classic problem in container operations in terminals.•Develop a greedy look-ahead heuristic to solve the problem.•Combine a greedy-based framework with a tree search procedure.•Limit the look-ahead tree by the depth and width parameters.•Prov...
Gespeichert in:
Veröffentlicht in: | European journal of operational research 2015-02, Vol.240 (3), p.837-847 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 847 |
---|---|
container_issue | 3 |
container_start_page | 837 |
container_title | European journal of operational research |
container_volume | 240 |
creator | Jin, Bo Zhu, Wenbin Lim, Andrew |
description | •Investigate the container relocation problem, which is a classic problem in container operations in terminals.•Develop a greedy look-ahead heuristic to solve the problem.•Combine a greedy-based framework with a tree search procedure.•Limit the look-ahead tree by the depth and width parameters.•Provide high-quality solutions in a short runtime, especially for large-scale instances.
The container relocation problem (CRP) is one of the most crucial issues for container terminals. In a single bay, containers belonging to multiple groups should be retrieved by an equipped yard crane in accordance with their retrieval priorities. An operation of the crane can either relocate a container from the top of a stack to another within the bay, or remove a container with the highest retrieval priority among all remaining containers. The objective of the CRP is to find an optimized operation plan for the crane with the fewest number of container relocations. This paper proposes an improved greedy look-ahead heuristic for the CRP and conducts experiments on four existing data sets. The experimental results show that the proposed approach is able to provide better solutions for large-scale instances in shorter runtime, compared to the up-to-date approaches in the recent literature. |
doi_str_mv | 10.1016/j.ejor.2014.07.038 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_1609317418</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0377221714006043</els_id><sourcerecordid>3455756901</sourcerecordid><originalsourceid>FETCH-LOGICAL-c565t-ca1450518e7ea3dc3352a6d33de6ac0db32edd82fd0008ef79b9d46f2046c6633</originalsourceid><addsrcrecordid>eNp9kE1LAzEQhoMoWD_-gKeA510nyW6yBS9S_IKCh-o5pMlsm3W7qcm20H9vSj17GgbeZ-blIeSOQcmAyYeuxC7EkgOrSlAliOaMTFijeCEbCedkAkKpgnOmLslVSh0AsJrVE7JYhH7vhxUd10htGEbjB4w0Yh-sGX0Y6DaGZY8bujxQM1C_yfseHV1FRHegfQjfhVmjcXSNu-jT6O0NuWhNn_D2b16Tr5fnz9lbMf94fZ89zQtby3osrGFVDTVrUKERzgpRcyOdEA6lseCWgqNzDW9dbttgq6bLqatky6GSVkohrsn96W6u9LPDNOou7OKQX2omYSqYqliTU_yUsjGkFLHV2-g3Jh40A32Upzt9lKeP8jQoneVl6PEEYe6_9xh1sh4Hi85HtKN2wf-H_wI7w3kU</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1609317418</pqid></control><display><type>article</type><title>Solving the container relocation problem by an improved greedy look-ahead heuristic</title><source>Elsevier ScienceDirect Journals Complete</source><creator>Jin, Bo ; Zhu, Wenbin ; Lim, Andrew</creator><creatorcontrib>Jin, Bo ; Zhu, Wenbin ; Lim, Andrew</creatorcontrib><description>•Investigate the container relocation problem, which is a classic problem in container operations in terminals.•Develop a greedy look-ahead heuristic to solve the problem.•Combine a greedy-based framework with a tree search procedure.•Limit the look-ahead tree by the depth and width parameters.•Provide high-quality solutions in a short runtime, especially for large-scale instances.
The container relocation problem (CRP) is one of the most crucial issues for container terminals. In a single bay, containers belonging to multiple groups should be retrieved by an equipped yard crane in accordance with their retrieval priorities. An operation of the crane can either relocate a container from the top of a stack to another within the bay, or remove a container with the highest retrieval priority among all remaining containers. The objective of the CRP is to find an optimized operation plan for the crane with the fewest number of container relocations. This paper proposes an improved greedy look-ahead heuristic for the CRP and conducts experiments on four existing data sets. The experimental results show that the proposed approach is able to provide better solutions for large-scale instances in shorter runtime, compared to the up-to-date approaches in the recent literature.</description><identifier>ISSN: 0377-2217</identifier><identifier>EISSN: 1872-6860</identifier><identifier>DOI: 10.1016/j.ejor.2014.07.038</identifier><identifier>CODEN: EJORDT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Container relocation problem ; Cranes & hoists ; Heuristic ; Heuristics ; Logistics ; Operations research ; Optimization techniques ; Relocation ; Studies ; Transportation ; Transportation terminals</subject><ispartof>European journal of operational research, 2015-02, Vol.240 (3), p.837-847</ispartof><rights>2014 Elsevier B.V.</rights><rights>Copyright Elsevier Sequoia S.A. Feb 1, 2015</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c565t-ca1450518e7ea3dc3352a6d33de6ac0db32edd82fd0008ef79b9d46f2046c6633</citedby><cites>FETCH-LOGICAL-c565t-ca1450518e7ea3dc3352a6d33de6ac0db32edd82fd0008ef79b9d46f2046c6633</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/j.ejor.2014.07.038$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,780,784,3550,27924,27925,45995</link.rule.ids></links><search><creatorcontrib>Jin, Bo</creatorcontrib><creatorcontrib>Zhu, Wenbin</creatorcontrib><creatorcontrib>Lim, Andrew</creatorcontrib><title>Solving the container relocation problem by an improved greedy look-ahead heuristic</title><title>European journal of operational research</title><description>•Investigate the container relocation problem, which is a classic problem in container operations in terminals.•Develop a greedy look-ahead heuristic to solve the problem.•Combine a greedy-based framework with a tree search procedure.•Limit the look-ahead tree by the depth and width parameters.•Provide high-quality solutions in a short runtime, especially for large-scale instances.
The container relocation problem (CRP) is one of the most crucial issues for container terminals. In a single bay, containers belonging to multiple groups should be retrieved by an equipped yard crane in accordance with their retrieval priorities. An operation of the crane can either relocate a container from the top of a stack to another within the bay, or remove a container with the highest retrieval priority among all remaining containers. The objective of the CRP is to find an optimized operation plan for the crane with the fewest number of container relocations. This paper proposes an improved greedy look-ahead heuristic for the CRP and conducts experiments on four existing data sets. The experimental results show that the proposed approach is able to provide better solutions for large-scale instances in shorter runtime, compared to the up-to-date approaches in the recent literature.</description><subject>Container relocation problem</subject><subject>Cranes & hoists</subject><subject>Heuristic</subject><subject>Heuristics</subject><subject>Logistics</subject><subject>Operations research</subject><subject>Optimization techniques</subject><subject>Relocation</subject><subject>Studies</subject><subject>Transportation</subject><subject>Transportation terminals</subject><issn>0377-2217</issn><issn>1872-6860</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><recordid>eNp9kE1LAzEQhoMoWD_-gKeA510nyW6yBS9S_IKCh-o5pMlsm3W7qcm20H9vSj17GgbeZ-blIeSOQcmAyYeuxC7EkgOrSlAliOaMTFijeCEbCedkAkKpgnOmLslVSh0AsJrVE7JYhH7vhxUd10htGEbjB4w0Yh-sGX0Y6DaGZY8bujxQM1C_yfseHV1FRHegfQjfhVmjcXSNu-jT6O0NuWhNn_D2b16Tr5fnz9lbMf94fZ89zQtby3osrGFVDTVrUKERzgpRcyOdEA6lseCWgqNzDW9dbttgq6bLqatky6GSVkohrsn96W6u9LPDNOou7OKQX2omYSqYqliTU_yUsjGkFLHV2-g3Jh40A32Upzt9lKeP8jQoneVl6PEEYe6_9xh1sh4Hi85HtKN2wf-H_wI7w3kU</recordid><startdate>20150201</startdate><enddate>20150201</enddate><creator>Jin, Bo</creator><creator>Zhu, Wenbin</creator><creator>Lim, Andrew</creator><general>Elsevier B.V</general><general>Elsevier Sequoia S.A</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>7TB</scope><scope>8FD</scope><scope>FR3</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20150201</creationdate><title>Solving the container relocation problem by an improved greedy look-ahead heuristic</title><author>Jin, Bo ; Zhu, Wenbin ; Lim, Andrew</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c565t-ca1450518e7ea3dc3352a6d33de6ac0db32edd82fd0008ef79b9d46f2046c6633</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Container relocation problem</topic><topic>Cranes & hoists</topic><topic>Heuristic</topic><topic>Heuristics</topic><topic>Logistics</topic><topic>Operations research</topic><topic>Optimization techniques</topic><topic>Relocation</topic><topic>Studies</topic><topic>Transportation</topic><topic>Transportation terminals</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Jin, Bo</creatorcontrib><creatorcontrib>Zhu, Wenbin</creatorcontrib><creatorcontrib>Lim, Andrew</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>European journal of operational research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Jin, Bo</au><au>Zhu, Wenbin</au><au>Lim, Andrew</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Solving the container relocation problem by an improved greedy look-ahead heuristic</atitle><jtitle>European journal of operational research</jtitle><date>2015-02-01</date><risdate>2015</risdate><volume>240</volume><issue>3</issue><spage>837</spage><epage>847</epage><pages>837-847</pages><issn>0377-2217</issn><eissn>1872-6860</eissn><coden>EJORDT</coden><abstract>•Investigate the container relocation problem, which is a classic problem in container operations in terminals.•Develop a greedy look-ahead heuristic to solve the problem.•Combine a greedy-based framework with a tree search procedure.•Limit the look-ahead tree by the depth and width parameters.•Provide high-quality solutions in a short runtime, especially for large-scale instances.
The container relocation problem (CRP) is one of the most crucial issues for container terminals. In a single bay, containers belonging to multiple groups should be retrieved by an equipped yard crane in accordance with their retrieval priorities. An operation of the crane can either relocate a container from the top of a stack to another within the bay, or remove a container with the highest retrieval priority among all remaining containers. The objective of the CRP is to find an optimized operation plan for the crane with the fewest number of container relocations. This paper proposes an improved greedy look-ahead heuristic for the CRP and conducts experiments on four existing data sets. The experimental results show that the proposed approach is able to provide better solutions for large-scale instances in shorter runtime, compared to the up-to-date approaches in the recent literature.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.ejor.2014.07.038</doi><tpages>11</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0377-2217 |
ispartof | European journal of operational research, 2015-02, Vol.240 (3), p.837-847 |
issn | 0377-2217 1872-6860 |
language | eng |
recordid | cdi_proquest_journals_1609317418 |
source | Elsevier ScienceDirect Journals Complete |
subjects | Container relocation problem Cranes & hoists Heuristic Heuristics Logistics Operations research Optimization techniques Relocation Studies Transportation Transportation terminals |
title | Solving the container relocation problem by an improved greedy look-ahead heuristic |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-25T11%3A20%3A19IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Solving%20the%20container%20relocation%20problem%20by%20an%20improved%20greedy%20look-ahead%20heuristic&rft.jtitle=European%20journal%20of%20operational%20research&rft.au=Jin,%20Bo&rft.date=2015-02-01&rft.volume=240&rft.issue=3&rft.spage=837&rft.epage=847&rft.pages=837-847&rft.issn=0377-2217&rft.eissn=1872-6860&rft.coden=EJORDT&rft_id=info:doi/10.1016/j.ejor.2014.07.038&rft_dat=%3Cproquest_cross%3E3455756901%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1609317418&rft_id=info:pmid/&rft_els_id=S0377221714006043&rfr_iscdi=true |