MILP Model and a Rolling Horizon Algorithm for Crane Scheduling in a Hybrid Storage Container Terminal
This paper investigates the yard crane scheduling problem of a hybrid storage container terminal whose import containers and export containers are stored together in each block. The combination of containers improves the space utilization of a container terminal while it also creates new challenges...
Gespeichert in:
| Veröffentlicht in: | Mathematical problems in engineering 2019-01, Vol.2019 (2019), p.1-16 |
|---|---|
| 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 | 16 |
|---|---|
| container_issue | 2019 |
| container_start_page | 1 |
| container_title | Mathematical problems in engineering |
| container_volume | 2019 |
| creator | Yu, Kai Yang, Jingcheng |
| description | This paper investigates the yard crane scheduling problem of a hybrid storage container terminal whose import containers and export containers are stored together in each block. The combination of containers improves the space utilization of a container terminal while it also creates new challenges for the yard crane scheduling. To formulate this problem, we propose a mixed integer linear programming (MILP) model, which jointly optimizes trucks’ waiting costs and penalty costs caused by exceeding waiting time thresholds. Considering the NP-completeness of this scheduling problem, we develop an efficient rolling horizon algorithm based on some heuristics to reduce the computation time. Finally, computational studies are carried out to evaluate the performance of our method and the solutions obtained by CPLEX solver are used for benchmarking purposes. |
| doi_str_mv | 10.1155/2019/4739376 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2168844853</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2168844853</sourcerecordid><originalsourceid>FETCH-LOGICAL-c360t-7150e8f0e14a920808ae461cbb2160d4b611c05748e2eb87ac229b23571bafd33</originalsourceid><addsrcrecordid>eNqF0M9LwzAUB_AgCs7pzbMEPGpdXn606XEMdYMNxU3wVtI23TK6ZKYdMv96Mzvw6Ol9D5_3eHwRugbyACDEgBJIBzxhKUviE9QDEbNIAE9OQyaUR0DZxzm6aJo1IRQEyB6qZpPpK565UtdY2RIr_Obq2tglHjtvvp3Fw3oZUrva4Mp5PPLKajwvVrrc_TJjw854n3tT4nnrvFpqPHK2VcZqjxfab4xV9SU6q1Td6Kvj7KP3p8fFaBxNX54no-E0KlhM2igBQbSsiAauUkokkUrzGIo8pxCTkucxQEFEwqWmOpeJKihNc8pEArmqSsb66La7u_Xuc6ebNlu7nQ8PNFm4ICXnUhzUfacK75rG6yrberNRfp8ByQ5NZocms2OTgd91fGVsqb7Mf_qm0zoYXak_DWn4HNgPY3V7Tg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2168844853</pqid></control><display><type>article</type><title>MILP Model and a Rolling Horizon Algorithm for Crane Scheduling in a Hybrid Storage Container Terminal</title><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><source>Wiley-Blackwell Open Access Titles</source><source>Alma/SFX Local Collection</source><creator>Yu, Kai ; Yang, Jingcheng</creator><contributor>Sun, Ning ; Ning Sun</contributor><creatorcontrib>Yu, Kai ; Yang, Jingcheng ; Sun, Ning ; Ning Sun</creatorcontrib><description>This paper investigates the yard crane scheduling problem of a hybrid storage container terminal whose import containers and export containers are stored together in each block. The combination of containers improves the space utilization of a container terminal while it also creates new challenges for the yard crane scheduling. To formulate this problem, we propose a mixed integer linear programming (MILP) model, which jointly optimizes trucks’ waiting costs and penalty costs caused by exceeding waiting time thresholds. Considering the NP-completeness of this scheduling problem, we develop an efficient rolling horizon algorithm based on some heuristics to reduce the computation time. Finally, computational studies are carried out to evaluate the performance of our method and the solutions obtained by CPLEX solver are used for benchmarking purposes.</description><identifier>ISSN: 1024-123X</identifier><identifier>EISSN: 1563-5147</identifier><identifier>DOI: 10.1155/2019/4739376</identifier><language>eng</language><publisher>Cairo, Egypt: Hindawi Publishing Corporation</publisher><subject>Algorithms ; Automation ; Containers ; Cranes & hoists ; Genetic algorithms ; Informatics ; Integer programming ; Linear programming ; Literature reviews ; Mixed integer ; Operations research ; Ports ; Production scheduling ; Scheduling ; Transport buildings, stations and terminals ; Trucks</subject><ispartof>Mathematical problems in engineering, 2019-01, Vol.2019 (2019), p.1-16</ispartof><rights>Copyright © 2019 Kai Yu and Jingcheng Yang.</rights><rights>Copyright © 2019 Kai Yu and Jingcheng Yang. This is an open access article distributed under the Creative Commons Attribution License (the “License”), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License. https://creativecommons.org/licenses/by/4.0</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c360t-7150e8f0e14a920808ae461cbb2160d4b611c05748e2eb87ac229b23571bafd33</citedby><cites>FETCH-LOGICAL-c360t-7150e8f0e14a920808ae461cbb2160d4b611c05748e2eb87ac229b23571bafd33</cites><orcidid>0000-0002-9856-8918 ; 0000-0002-9760-7751</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><contributor>Sun, Ning</contributor><contributor>Ning Sun</contributor><creatorcontrib>Yu, Kai</creatorcontrib><creatorcontrib>Yang, Jingcheng</creatorcontrib><title>MILP Model and a Rolling Horizon Algorithm for Crane Scheduling in a Hybrid Storage Container Terminal</title><title>Mathematical problems in engineering</title><description>This paper investigates the yard crane scheduling problem of a hybrid storage container terminal whose import containers and export containers are stored together in each block. The combination of containers improves the space utilization of a container terminal while it also creates new challenges for the yard crane scheduling. To formulate this problem, we propose a mixed integer linear programming (MILP) model, which jointly optimizes trucks’ waiting costs and penalty costs caused by exceeding waiting time thresholds. Considering the NP-completeness of this scheduling problem, we develop an efficient rolling horizon algorithm based on some heuristics to reduce the computation time. Finally, computational studies are carried out to evaluate the performance of our method and the solutions obtained by CPLEX solver are used for benchmarking purposes.</description><subject>Algorithms</subject><subject>Automation</subject><subject>Containers</subject><subject>Cranes & hoists</subject><subject>Genetic algorithms</subject><subject>Informatics</subject><subject>Integer programming</subject><subject>Linear programming</subject><subject>Literature reviews</subject><subject>Mixed integer</subject><subject>Operations research</subject><subject>Ports</subject><subject>Production scheduling</subject><subject>Scheduling</subject><subject>Transport buildings, stations and terminals</subject><subject>Trucks</subject><issn>1024-123X</issn><issn>1563-5147</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><sourceid>RHX</sourceid><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GNUQQ</sourceid><recordid>eNqF0M9LwzAUB_AgCs7pzbMEPGpdXn606XEMdYMNxU3wVtI23TK6ZKYdMv96Mzvw6Ol9D5_3eHwRugbyACDEgBJIBzxhKUviE9QDEbNIAE9OQyaUR0DZxzm6aJo1IRQEyB6qZpPpK565UtdY2RIr_Obq2tglHjtvvp3Fw3oZUrva4Mp5PPLKajwvVrrc_TJjw854n3tT4nnrvFpqPHK2VcZqjxfab4xV9SU6q1Td6Kvj7KP3p8fFaBxNX54no-E0KlhM2igBQbSsiAauUkokkUrzGIo8pxCTkucxQEFEwqWmOpeJKihNc8pEArmqSsb66La7u_Xuc6ebNlu7nQ8PNFm4ICXnUhzUfacK75rG6yrberNRfp8ByQ5NZocms2OTgd91fGVsqb7Mf_qm0zoYXak_DWn4HNgPY3V7Tg</recordid><startdate>20190101</startdate><enddate>20190101</enddate><creator>Yu, Kai</creator><creator>Yang, Jingcheng</creator><general>Hindawi Publishing Corporation</general><general>Hindawi</general><general>Hindawi Limited</general><scope>ADJCN</scope><scope>AHFXO</scope><scope>RHU</scope><scope>RHW</scope><scope>RHX</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7TB</scope><scope>8FD</scope><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>CWDGH</scope><scope>DWQXO</scope><scope>FR3</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K7-</scope><scope>KR7</scope><scope>L6V</scope><scope>M7S</scope><scope>P5Z</scope><scope>P62</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><orcidid>https://orcid.org/0000-0002-9856-8918</orcidid><orcidid>https://orcid.org/0000-0002-9760-7751</orcidid></search><sort><creationdate>20190101</creationdate><title>MILP Model and a Rolling Horizon Algorithm for Crane Scheduling in a Hybrid Storage Container Terminal</title><author>Yu, Kai ; Yang, Jingcheng</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c360t-7150e8f0e14a920808ae461cbb2160d4b611c05748e2eb87ac229b23571bafd33</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Algorithms</topic><topic>Automation</topic><topic>Containers</topic><topic>Cranes & hoists</topic><topic>Genetic algorithms</topic><topic>Informatics</topic><topic>Integer programming</topic><topic>Linear programming</topic><topic>Literature reviews</topic><topic>Mixed integer</topic><topic>Operations research</topic><topic>Ports</topic><topic>Production scheduling</topic><topic>Scheduling</topic><topic>Transport buildings, stations and terminals</topic><topic>Trucks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Yu, Kai</creatorcontrib><creatorcontrib>Yang, Jingcheng</creatorcontrib><collection>الدوريات العلمية والإحصائية - e-Marefa Academic and Statistical Periodicals</collection><collection>معرفة - المحتوى العربي الأكاديمي المتكامل - e-Marefa Academic Complete</collection><collection>Hindawi Publishing Complete</collection><collection>Hindawi Publishing Subscription Journals</collection><collection>Hindawi Publishing Open Access</collection><collection>CrossRef</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</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>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>Middle East & Africa Database</collection><collection>ProQuest Central Korea</collection><collection>Engineering Research Database</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>Computer Science Database</collection><collection>Civil Engineering Abstracts</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Advanced Technologies & Aerospace Database</collection><collection>ProQuest Advanced Technologies & Aerospace Collection</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><jtitle>Mathematical problems in engineering</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Yu, Kai</au><au>Yang, Jingcheng</au><au>Sun, Ning</au><au>Ning Sun</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>MILP Model and a Rolling Horizon Algorithm for Crane Scheduling in a Hybrid Storage Container Terminal</atitle><jtitle>Mathematical problems in engineering</jtitle><date>2019-01-01</date><risdate>2019</risdate><volume>2019</volume><issue>2019</issue><spage>1</spage><epage>16</epage><pages>1-16</pages><issn>1024-123X</issn><eissn>1563-5147</eissn><abstract>This paper investigates the yard crane scheduling problem of a hybrid storage container terminal whose import containers and export containers are stored together in each block. The combination of containers improves the space utilization of a container terminal while it also creates new challenges for the yard crane scheduling. To formulate this problem, we propose a mixed integer linear programming (MILP) model, which jointly optimizes trucks’ waiting costs and penalty costs caused by exceeding waiting time thresholds. Considering the NP-completeness of this scheduling problem, we develop an efficient rolling horizon algorithm based on some heuristics to reduce the computation time. Finally, computational studies are carried out to evaluate the performance of our method and the solutions obtained by CPLEX solver are used for benchmarking purposes.</abstract><cop>Cairo, Egypt</cop><pub>Hindawi Publishing Corporation</pub><doi>10.1155/2019/4739376</doi><tpages>16</tpages><orcidid>https://orcid.org/0000-0002-9856-8918</orcidid><orcidid>https://orcid.org/0000-0002-9760-7751</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 1024-123X |
| ispartof | Mathematical problems in engineering, 2019-01, Vol.2019 (2019), p.1-16 |
| issn | 1024-123X 1563-5147 |
| language | eng |
| recordid | cdi_proquest_journals_2168844853 |
| source | Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals; Wiley-Blackwell Open Access Titles; Alma/SFX Local Collection |
| subjects | Algorithms Automation Containers Cranes & hoists Genetic algorithms Informatics Integer programming Linear programming Literature reviews Mixed integer Operations research Ports Production scheduling Scheduling Transport buildings, stations and terminals Trucks |
| title | MILP Model and a Rolling Horizon Algorithm for Crane Scheduling in a Hybrid Storage Container Terminal |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T17%3A14%3A06IST&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=MILP%20Model%20and%20a%20Rolling%20Horizon%20Algorithm%20for%20Crane%20Scheduling%20in%20a%20Hybrid%20Storage%20Container%20Terminal&rft.jtitle=Mathematical%20problems%20in%20engineering&rft.au=Yu,%20Kai&rft.date=2019-01-01&rft.volume=2019&rft.issue=2019&rft.spage=1&rft.epage=16&rft.pages=1-16&rft.issn=1024-123X&rft.eissn=1563-5147&rft_id=info:doi/10.1155/2019/4739376&rft_dat=%3Cproquest_cross%3E2168844853%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=2168844853&rft_id=info:pmid/&rfr_iscdi=true |