An integrated model for berth and yard planning in container terminals with multi-continuous berth layout
Discontinuities and sharp curves commonly exist in the berth layout of container terminals. To cope with these layout characteristics, traditional studies proposed discrete or hybrid modeling approaches. However, the drawback of these approaches is the low berth space utilization. In reality, berth...
Gespeichert in:
Veröffentlicht in: | Annals of operations research 2019-02, Vol.273 (1-2), p.409-431 |
---|---|
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 | 431 |
---|---|
container_issue | 1-2 |
container_start_page | 409 |
container_title | Annals of operations research |
container_volume | 273 |
creator | Ma, H. L. Chung, S. H. Chan, H. K. Cui, Li |
description | Discontinuities and sharp curves commonly exist in the berth layout of container terminals. To cope with these layout characteristics, traditional studies proposed discrete or hybrid modeling approaches. However, the drawback of these approaches is the low berth space utilization. In reality, berth space is a very scarce resource and the development of which usually involves huge investments. Accordingly, a high space utilization approach is usually indispensable to a container terminal. In the literature, continuous berth layout modeling approach is sophisticated to be good in space utilization. However, its application is limited to continuous layouts, but not for discontinuities. In other words, it is not applicable to many container terminals in reality. To fill this gap, this paper studies an integrated berth allocation and yard planning problem with discontinuities berth layout. A novel multi-continuous berth layout approach and a mixed integer linear programming are proposed to deal with this new problem. In addition, a Guided Neighborhood Search (GNS) is proposed to enhance the optimization efficiency. Experimental results show that the GNS significantly reduce computational time enabling the proposed algorithm to be applied in reality. In addition, the proposed approach increases the berth space utilization, and consequently reducing the waiting time of incoming vessels. Furthermore, by simultaneously integrating the berth position and yard storage position, the total travelling distance of containers is being minimized. As a result, the overall performance of the terminal is improved. |
doi_str_mv | 10.1007/s10479-017-2577-1 |
format | Article |
fullrecord | <record><control><sourceid>gale_proqu</sourceid><recordid>TN_cdi_proquest_journals_2169572106</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A570723867</galeid><sourcerecordid>A570723867</sourcerecordid><originalsourceid>FETCH-LOGICAL-c420t-668a2e610a6c0df81305d47915a29fcd2f0f4892b2dcc683e3ed2fe35cb126cc3</originalsourceid><addsrcrecordid>eNp1kV9rHCEUxaU00G2SD5A3oa81veqqM49LaNNCoC_ts7j-mRhmdKsOZb99XTaQBloEhevvXO65B6EbCrcUQH2qFLZqJEAVYUIpQt-gDRWKkZHz4S3aABNbIjiHd-h9rU8AQOkgNijuEo6p-amY5h1esvMzDrngvS_tEZvk8NEUhw-zSSmmqcPY5tRMTL7g5ssSk5kr_h07vaxzi-T0HdOa1_rcZDbHvLYrdBE66a-f30v088vnH3dfycP3-293uwditwwakXIwzEsKRlpwYaAchOvWqDBsDNaxAGE7jGzPnLVy4J77XvNc2D1l0lp-iT6c-x5K_rX62vRTXstpSM2oHPtOKMgXajKz1zGF3IqxS6xW74QCxfggVadu_0H14_wSu08fYq-_Enz8S7Bfa19T7VeN02Ork1lrfY3TM25LrrX4oA8lLqYcNQV9ylWfc9U9V33KVdOuYWdN7WyafHnx93_RH6qEpUY</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2169572106</pqid></control><display><type>article</type><title>An integrated model for berth and yard planning in container terminals with multi-continuous berth layout</title><source>Business Source Complete</source><source>SpringerLink Journals - AutoHoldings</source><creator>Ma, H. L. ; Chung, S. H. ; Chan, H. K. ; Cui, Li</creator><creatorcontrib>Ma, H. L. ; Chung, S. H. ; Chan, H. K. ; Cui, Li</creatorcontrib><description>Discontinuities and sharp curves commonly exist in the berth layout of container terminals. To cope with these layout characteristics, traditional studies proposed discrete or hybrid modeling approaches. However, the drawback of these approaches is the low berth space utilization. In reality, berth space is a very scarce resource and the development of which usually involves huge investments. Accordingly, a high space utilization approach is usually indispensable to a container terminal. In the literature, continuous berth layout modeling approach is sophisticated to be good in space utilization. However, its application is limited to continuous layouts, but not for discontinuities. In other words, it is not applicable to many container terminals in reality. To fill this gap, this paper studies an integrated berth allocation and yard planning problem with discontinuities berth layout. A novel multi-continuous berth layout approach and a mixed integer linear programming are proposed to deal with this new problem. In addition, a Guided Neighborhood Search (GNS) is proposed to enhance the optimization efficiency. Experimental results show that the GNS significantly reduce computational time enabling the proposed algorithm to be applied in reality. In addition, the proposed approach increases the berth space utilization, and consequently reducing the waiting time of incoming vessels. Furthermore, by simultaneously integrating the berth position and yard storage position, the total travelling distance of containers is being minimized. As a result, the overall performance of the terminal is improved.</description><identifier>ISSN: 0254-5330</identifier><identifier>EISSN: 1572-9338</identifier><identifier>DOI: 10.1007/s10479-017-2577-1</identifier><language>eng</language><publisher>New York: Springer US</publisher><subject>Anchorage (Navigation) ; Business and Management ; Combinatorics ; Computing time ; Container ports ; Containers ; Integer programming ; Layouts ; Linear programming ; Management ; Mathematical models ; Mixed integer ; Operations research ; Operations Research/Decision Theory ; OR in Transportation ; Theory of Computation ; Transport buildings, stations and terminals ; Utilization</subject><ispartof>Annals of operations research, 2019-02, Vol.273 (1-2), p.409-431</ispartof><rights>Springer Science+Business Media, LLC 2017</rights><rights>COPYRIGHT 2019 Springer</rights><rights>Annals of Operations Research is a copyright of Springer, (2017). All Rights Reserved.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c420t-668a2e610a6c0df81305d47915a29fcd2f0f4892b2dcc683e3ed2fe35cb126cc3</citedby><cites>FETCH-LOGICAL-c420t-668a2e610a6c0df81305d47915a29fcd2f0f4892b2dcc683e3ed2fe35cb126cc3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s10479-017-2577-1$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10479-017-2577-1$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,777,781,27905,27906,41469,42538,51300</link.rule.ids></links><search><creatorcontrib>Ma, H. L.</creatorcontrib><creatorcontrib>Chung, S. H.</creatorcontrib><creatorcontrib>Chan, H. K.</creatorcontrib><creatorcontrib>Cui, Li</creatorcontrib><title>An integrated model for berth and yard planning in container terminals with multi-continuous berth layout</title><title>Annals of operations research</title><addtitle>Ann Oper Res</addtitle><description>Discontinuities and sharp curves commonly exist in the berth layout of container terminals. To cope with these layout characteristics, traditional studies proposed discrete or hybrid modeling approaches. However, the drawback of these approaches is the low berth space utilization. In reality, berth space is a very scarce resource and the development of which usually involves huge investments. Accordingly, a high space utilization approach is usually indispensable to a container terminal. In the literature, continuous berth layout modeling approach is sophisticated to be good in space utilization. However, its application is limited to continuous layouts, but not for discontinuities. In other words, it is not applicable to many container terminals in reality. To fill this gap, this paper studies an integrated berth allocation and yard planning problem with discontinuities berth layout. A novel multi-continuous berth layout approach and a mixed integer linear programming are proposed to deal with this new problem. In addition, a Guided Neighborhood Search (GNS) is proposed to enhance the optimization efficiency. Experimental results show that the GNS significantly reduce computational time enabling the proposed algorithm to be applied in reality. In addition, the proposed approach increases the berth space utilization, and consequently reducing the waiting time of incoming vessels. Furthermore, by simultaneously integrating the berth position and yard storage position, the total travelling distance of containers is being minimized. As a result, the overall performance of the terminal is improved.</description><subject>Anchorage (Navigation)</subject><subject>Business and Management</subject><subject>Combinatorics</subject><subject>Computing time</subject><subject>Container ports</subject><subject>Containers</subject><subject>Integer programming</subject><subject>Layouts</subject><subject>Linear programming</subject><subject>Management</subject><subject>Mathematical models</subject><subject>Mixed integer</subject><subject>Operations research</subject><subject>Operations Research/Decision Theory</subject><subject>OR in Transportation</subject><subject>Theory of Computation</subject><subject>Transport buildings, stations and terminals</subject><subject>Utilization</subject><issn>0254-5330</issn><issn>1572-9338</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>N95</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNp1kV9rHCEUxaU00G2SD5A3oa81veqqM49LaNNCoC_ts7j-mRhmdKsOZb99XTaQBloEhevvXO65B6EbCrcUQH2qFLZqJEAVYUIpQt-gDRWKkZHz4S3aABNbIjiHd-h9rU8AQOkgNijuEo6p-amY5h1esvMzDrngvS_tEZvk8NEUhw-zSSmmqcPY5tRMTL7g5ssSk5kr_h07vaxzi-T0HdOa1_rcZDbHvLYrdBE66a-f30v088vnH3dfycP3-293uwditwwakXIwzEsKRlpwYaAchOvWqDBsDNaxAGE7jGzPnLVy4J77XvNc2D1l0lp-iT6c-x5K_rX62vRTXstpSM2oHPtOKMgXajKz1zGF3IqxS6xW74QCxfggVadu_0H14_wSu08fYq-_Enz8S7Bfa19T7VeN02Ork1lrfY3TM25LrrX4oA8lLqYcNQV9ylWfc9U9V33KVdOuYWdN7WyafHnx93_RH6qEpUY</recordid><startdate>20190201</startdate><enddate>20190201</enddate><creator>Ma, H. L.</creator><creator>Chung, S. H.</creator><creator>Chan, H. K.</creator><creator>Cui, Li</creator><general>Springer US</general><general>Springer</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>N95</scope><scope>3V.</scope><scope>7TA</scope><scope>7TB</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>88I</scope><scope>8AL</scope><scope>8AO</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>8FK</scope><scope>8FL</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>FR3</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JG9</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>KR7</scope><scope>L.-</scope><scope>L6V</scope><scope>M0C</scope><scope>M0N</scope><scope>M2P</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PTHSS</scope><scope>Q9U</scope></search><sort><creationdate>20190201</creationdate><title>An integrated model for berth and yard planning in container terminals with multi-continuous berth layout</title><author>Ma, H. L. ; Chung, S. H. ; Chan, H. K. ; Cui, Li</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c420t-668a2e610a6c0df81305d47915a29fcd2f0f4892b2dcc683e3ed2fe35cb126cc3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Anchorage (Navigation)</topic><topic>Business and Management</topic><topic>Combinatorics</topic><topic>Computing time</topic><topic>Container ports</topic><topic>Containers</topic><topic>Integer programming</topic><topic>Layouts</topic><topic>Linear programming</topic><topic>Management</topic><topic>Mathematical models</topic><topic>Mixed integer</topic><topic>Operations research</topic><topic>Operations Research/Decision Theory</topic><topic>OR in Transportation</topic><topic>Theory of Computation</topic><topic>Transport buildings, stations and terminals</topic><topic>Utilization</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ma, H. L.</creatorcontrib><creatorcontrib>Chung, S. H.</creatorcontrib><creatorcontrib>Chan, H. K.</creatorcontrib><creatorcontrib>Cui, Li</creatorcontrib><collection>CrossRef</collection><collection>Gale Business: Insights</collection><collection>ProQuest Central (Corporate)</collection><collection>Materials Business File</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest Pharma Collection</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies & Aerospace Collection</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>Materials Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>Civil Engineering Abstracts</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>ABI/INFORM Global</collection><collection>Computing Database</collection><collection>Science Database</collection><collection>Engineering Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><jtitle>Annals of operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ma, H. L.</au><au>Chung, S. H.</au><au>Chan, H. K.</au><au>Cui, Li</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An integrated model for berth and yard planning in container terminals with multi-continuous berth layout</atitle><jtitle>Annals of operations research</jtitle><stitle>Ann Oper Res</stitle><date>2019-02-01</date><risdate>2019</risdate><volume>273</volume><issue>1-2</issue><spage>409</spage><epage>431</epage><pages>409-431</pages><issn>0254-5330</issn><eissn>1572-9338</eissn><abstract>Discontinuities and sharp curves commonly exist in the berth layout of container terminals. To cope with these layout characteristics, traditional studies proposed discrete or hybrid modeling approaches. However, the drawback of these approaches is the low berth space utilization. In reality, berth space is a very scarce resource and the development of which usually involves huge investments. Accordingly, a high space utilization approach is usually indispensable to a container terminal. In the literature, continuous berth layout modeling approach is sophisticated to be good in space utilization. However, its application is limited to continuous layouts, but not for discontinuities. In other words, it is not applicable to many container terminals in reality. To fill this gap, this paper studies an integrated berth allocation and yard planning problem with discontinuities berth layout. A novel multi-continuous berth layout approach and a mixed integer linear programming are proposed to deal with this new problem. In addition, a Guided Neighborhood Search (GNS) is proposed to enhance the optimization efficiency. Experimental results show that the GNS significantly reduce computational time enabling the proposed algorithm to be applied in reality. In addition, the proposed approach increases the berth space utilization, and consequently reducing the waiting time of incoming vessels. Furthermore, by simultaneously integrating the berth position and yard storage position, the total travelling distance of containers is being minimized. As a result, the overall performance of the terminal is improved.</abstract><cop>New York</cop><pub>Springer US</pub><doi>10.1007/s10479-017-2577-1</doi><tpages>23</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0254-5330 |
ispartof | Annals of operations research, 2019-02, Vol.273 (1-2), p.409-431 |
issn | 0254-5330 1572-9338 |
language | eng |
recordid | cdi_proquest_journals_2169572106 |
source | Business Source Complete; SpringerLink Journals - AutoHoldings |
subjects | Anchorage (Navigation) Business and Management Combinatorics Computing time Container ports Containers Integer programming Layouts Linear programming Management Mathematical models Mixed integer Operations research Operations Research/Decision Theory OR in Transportation Theory of Computation Transport buildings, stations and terminals Utilization |
title | An integrated model for berth and yard planning in container terminals with multi-continuous berth layout |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-19T03%3A30%3A38IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_proqu&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=An%20integrated%20model%20for%20berth%20and%20yard%20planning%20in%20container%20terminals%20with%20multi-continuous%20berth%20layout&rft.jtitle=Annals%20of%20operations%20research&rft.au=Ma,%20H.%20L.&rft.date=2019-02-01&rft.volume=273&rft.issue=1-2&rft.spage=409&rft.epage=431&rft.pages=409-431&rft.issn=0254-5330&rft.eissn=1572-9338&rft_id=info:doi/10.1007/s10479-017-2577-1&rft_dat=%3Cgale_proqu%3EA570723867%3C/gale_proqu%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2169572106&rft_id=info:pmid/&rft_galeid=A570723867&rfr_iscdi=true |