Enhancing online yard crane scheduling through a two-stage rollout memetic genetic programming
Over the past decade, the surge in global container port throughput has heightened the demand for terminal efficiency, with the container yard operations being central to the overall port performance. However, the unpredictable arrival of external trucks poses significant challenges for yard cranes...
Gespeichert in:
Veröffentlicht in: | Memetic computing 2024, Vol.16 (3), p.467-489 |
---|---|
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 | 489 |
---|---|
container_issue | 3 |
container_start_page | 467 |
container_title | Memetic computing |
container_volume | 16 |
creator | Jin, Chenwei Bai, Ruibin Zhou, Yuyang Chen, Xinan Tan, Leshan |
description | Over the past decade, the surge in global container port throughput has heightened the demand for terminal efficiency, with the container yard operations being central to the overall port performance. However, the unpredictable arrival of external trucks poses significant challenges for yard cranes which must simultaneously schedule operations for both internal and external tasks. Traditional yard crane scheduling methods often rely on outdated assumptions that fail to account for the dynamic impact of external tasks. In response, container terminals increasingly model the yard crane scheduling as an online problem. A notable advancement in online scheduling is the online rollout method, which evaluates the decisions based on the potential outcomes of their future rollout schedules rather than immediate priorities. Although this method outperforms the previous approach, it faces two main issues: the rollout simulation is time consuming, and decisions based solely on objective value of rollout schedules may not align with long-term scheduling objectives. To overcome these limitations, we have developed a two-stage adaptive rollout decision model. In the first stage, less desirable tasks are dynamically filtered out to reduce the number of rollout simulations required, while the second stage employs a genetic programming evolved evaluation function to infuse more refined forward-looking insights into the scheduling process. This approach has proven to significantly enhance yard scheduling efficiency and performance, as confirmed by experimental validation. Given the dynamic nature of yard crane operations, we believe this method could be beneficially applied to other dynamic scheduling contexts. |
doi_str_mv | 10.1007/s12293-024-00424-4 |
format | Article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_3104475847</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3104475847</sourcerecordid><originalsourceid>FETCH-LOGICAL-c314t-2e04d62b60757f13d6dbd8732f455add0e0630cbe857cc13d2c203768c5da5473</originalsourceid><addsrcrecordid>eNp9UMtKAzEUDaJg0f6Aq4Dr0ZvXZLqUUh9QcKNbQ5pkHmUmqckM0r83bUV33sU9F-55wEHohsAdAZD3iVC6YAVQXgDwvPkZmpGqFMWCLuj5713xSzRPaQt5GJUVJzP0sfKt9qbzDQ6-77zDex0tNlHnM5nW2ak_PMc2hqlpscbjVyjSqBuHY-j7MI14cIMbO4Mb54-4i6GJehiy7hpd1LpPbv6DV-j9cfW2fC7Wr08vy4d1YRjhY0EdcFvSTQlSyJowW9qNrSSjNRdCWwsOSgZm4yohjcl_aigwWVZGWC24ZFfo9uSbsz8nl0a1DVP0OVIxApxLUR1Z9MQyMaQUXa12sRt03CsC6lClOlWpcpXqWKXiWcROopTJvnHxz_of1TcWOncV</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>3104475847</pqid></control><display><type>article</type><title>Enhancing online yard crane scheduling through a two-stage rollout memetic genetic programming</title><source>SpringerLink Journals</source><creator>Jin, Chenwei ; Bai, Ruibin ; Zhou, Yuyang ; Chen, Xinan ; Tan, Leshan</creator><creatorcontrib>Jin, Chenwei ; Bai, Ruibin ; Zhou, Yuyang ; Chen, Xinan ; Tan, Leshan</creatorcontrib><description>Over the past decade, the surge in global container port throughput has heightened the demand for terminal efficiency, with the container yard operations being central to the overall port performance. However, the unpredictable arrival of external trucks poses significant challenges for yard cranes which must simultaneously schedule operations for both internal and external tasks. Traditional yard crane scheduling methods often rely on outdated assumptions that fail to account for the dynamic impact of external tasks. In response, container terminals increasingly model the yard crane scheduling as an online problem. A notable advancement in online scheduling is the online rollout method, which evaluates the decisions based on the potential outcomes of their future rollout schedules rather than immediate priorities. Although this method outperforms the previous approach, it faces two main issues: the rollout simulation is time consuming, and decisions based solely on objective value of rollout schedules may not align with long-term scheduling objectives. To overcome these limitations, we have developed a two-stage adaptive rollout decision model. In the first stage, less desirable tasks are dynamically filtered out to reduce the number of rollout simulations required, while the second stage employs a genetic programming evolved evaluation function to infuse more refined forward-looking insights into the scheduling process. This approach has proven to significantly enhance yard scheduling efficiency and performance, as confirmed by experimental validation. Given the dynamic nature of yard crane operations, we believe this method could be beneficially applied to other dynamic scheduling contexts.</description><identifier>ISSN: 1865-9284</identifier><identifier>EISSN: 1865-9292</identifier><identifier>DOI: 10.1007/s12293-024-00424-4</identifier><language>eng</language><publisher>Berlin/Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applications of Mathematics ; Artificial Intelligence ; Bioinformatics ; Complex Systems ; Computer aided scheduling ; Containers ; Control ; Cranes ; Decisions ; Engineering ; Genetic algorithms ; Mathematical and Computational Engineering ; Mechatronics ; Performance evaluation ; Priority scheduling ; Regular Research Paper ; Robotics ; Schedules ; Scheduling ; Task scheduling ; Transport buildings, stations and terminals</subject><ispartof>Memetic computing, 2024, Vol.16 (3), p.467-489</ispartof><rights>The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><cites>FETCH-LOGICAL-c314t-2e04d62b60757f13d6dbd8732f455add0e0630cbe857cc13d2c203768c5da5473</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/s12293-024-00424-4$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s12293-024-00424-4$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,776,780,27901,27902,41464,42533,51294</link.rule.ids></links><search><creatorcontrib>Jin, Chenwei</creatorcontrib><creatorcontrib>Bai, Ruibin</creatorcontrib><creatorcontrib>Zhou, Yuyang</creatorcontrib><creatorcontrib>Chen, Xinan</creatorcontrib><creatorcontrib>Tan, Leshan</creatorcontrib><title>Enhancing online yard crane scheduling through a two-stage rollout memetic genetic programming</title><title>Memetic computing</title><addtitle>Memetic Comp</addtitle><description>Over the past decade, the surge in global container port throughput has heightened the demand for terminal efficiency, with the container yard operations being central to the overall port performance. However, the unpredictable arrival of external trucks poses significant challenges for yard cranes which must simultaneously schedule operations for both internal and external tasks. Traditional yard crane scheduling methods often rely on outdated assumptions that fail to account for the dynamic impact of external tasks. In response, container terminals increasingly model the yard crane scheduling as an online problem. A notable advancement in online scheduling is the online rollout method, which evaluates the decisions based on the potential outcomes of their future rollout schedules rather than immediate priorities. Although this method outperforms the previous approach, it faces two main issues: the rollout simulation is time consuming, and decisions based solely on objective value of rollout schedules may not align with long-term scheduling objectives. To overcome these limitations, we have developed a two-stage adaptive rollout decision model. In the first stage, less desirable tasks are dynamically filtered out to reduce the number of rollout simulations required, while the second stage employs a genetic programming evolved evaluation function to infuse more refined forward-looking insights into the scheduling process. This approach has proven to significantly enhance yard scheduling efficiency and performance, as confirmed by experimental validation. Given the dynamic nature of yard crane operations, we believe this method could be beneficially applied to other dynamic scheduling contexts.</description><subject>Applications of Mathematics</subject><subject>Artificial Intelligence</subject><subject>Bioinformatics</subject><subject>Complex Systems</subject><subject>Computer aided scheduling</subject><subject>Containers</subject><subject>Control</subject><subject>Cranes</subject><subject>Decisions</subject><subject>Engineering</subject><subject>Genetic algorithms</subject><subject>Mathematical and Computational Engineering</subject><subject>Mechatronics</subject><subject>Performance evaluation</subject><subject>Priority scheduling</subject><subject>Regular Research Paper</subject><subject>Robotics</subject><subject>Schedules</subject><subject>Scheduling</subject><subject>Task scheduling</subject><subject>Transport buildings, stations and terminals</subject><issn>1865-9284</issn><issn>1865-9292</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><recordid>eNp9UMtKAzEUDaJg0f6Aq4Dr0ZvXZLqUUh9QcKNbQ5pkHmUmqckM0r83bUV33sU9F-55wEHohsAdAZD3iVC6YAVQXgDwvPkZmpGqFMWCLuj5713xSzRPaQt5GJUVJzP0sfKt9qbzDQ6-77zDex0tNlHnM5nW2ak_PMc2hqlpscbjVyjSqBuHY-j7MI14cIMbO4Mb54-4i6GJehiy7hpd1LpPbv6DV-j9cfW2fC7Wr08vy4d1YRjhY0EdcFvSTQlSyJowW9qNrSSjNRdCWwsOSgZm4yohjcl_aigwWVZGWC24ZFfo9uSbsz8nl0a1DVP0OVIxApxLUR1Z9MQyMaQUXa12sRt03CsC6lClOlWpcpXqWKXiWcROopTJvnHxz_of1TcWOncV</recordid><startdate>2024</startdate><enddate>2024</enddate><creator>Jin, Chenwei</creator><creator>Bai, Ruibin</creator><creator>Zhou, Yuyang</creator><creator>Chen, Xinan</creator><creator>Tan, Leshan</creator><general>Springer Berlin Heidelberg</general><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>2024</creationdate><title>Enhancing online yard crane scheduling through a two-stage rollout memetic genetic programming</title><author>Jin, Chenwei ; Bai, Ruibin ; Zhou, Yuyang ; Chen, Xinan ; Tan, Leshan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c314t-2e04d62b60757f13d6dbd8732f455add0e0630cbe857cc13d2c203768c5da5473</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Applications of Mathematics</topic><topic>Artificial Intelligence</topic><topic>Bioinformatics</topic><topic>Complex Systems</topic><topic>Computer aided scheduling</topic><topic>Containers</topic><topic>Control</topic><topic>Cranes</topic><topic>Decisions</topic><topic>Engineering</topic><topic>Genetic algorithms</topic><topic>Mathematical and Computational Engineering</topic><topic>Mechatronics</topic><topic>Performance evaluation</topic><topic>Priority scheduling</topic><topic>Regular Research Paper</topic><topic>Robotics</topic><topic>Schedules</topic><topic>Scheduling</topic><topic>Task scheduling</topic><topic>Transport buildings, stations and terminals</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Jin, Chenwei</creatorcontrib><creatorcontrib>Bai, Ruibin</creatorcontrib><creatorcontrib>Zhou, Yuyang</creatorcontrib><creatorcontrib>Chen, Xinan</creatorcontrib><creatorcontrib>Tan, Leshan</creatorcontrib><collection>CrossRef</collection><jtitle>Memetic computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Jin, Chenwei</au><au>Bai, Ruibin</au><au>Zhou, Yuyang</au><au>Chen, Xinan</au><au>Tan, Leshan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Enhancing online yard crane scheduling through a two-stage rollout memetic genetic programming</atitle><jtitle>Memetic computing</jtitle><stitle>Memetic Comp</stitle><date>2024</date><risdate>2024</risdate><volume>16</volume><issue>3</issue><spage>467</spage><epage>489</epage><pages>467-489</pages><issn>1865-9284</issn><eissn>1865-9292</eissn><abstract>Over the past decade, the surge in global container port throughput has heightened the demand for terminal efficiency, with the container yard operations being central to the overall port performance. However, the unpredictable arrival of external trucks poses significant challenges for yard cranes which must simultaneously schedule operations for both internal and external tasks. Traditional yard crane scheduling methods often rely on outdated assumptions that fail to account for the dynamic impact of external tasks. In response, container terminals increasingly model the yard crane scheduling as an online problem. A notable advancement in online scheduling is the online rollout method, which evaluates the decisions based on the potential outcomes of their future rollout schedules rather than immediate priorities. Although this method outperforms the previous approach, it faces two main issues: the rollout simulation is time consuming, and decisions based solely on objective value of rollout schedules may not align with long-term scheduling objectives. To overcome these limitations, we have developed a two-stage adaptive rollout decision model. In the first stage, less desirable tasks are dynamically filtered out to reduce the number of rollout simulations required, while the second stage employs a genetic programming evolved evaluation function to infuse more refined forward-looking insights into the scheduling process. This approach has proven to significantly enhance yard scheduling efficiency and performance, as confirmed by experimental validation. Given the dynamic nature of yard crane operations, we believe this method could be beneficially applied to other dynamic scheduling contexts.</abstract><cop>Berlin/Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/s12293-024-00424-4</doi><tpages>23</tpages><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | ISSN: 1865-9284 |
ispartof | Memetic computing, 2024, Vol.16 (3), p.467-489 |
issn | 1865-9284 1865-9292 |
language | eng |
recordid | cdi_proquest_journals_3104475847 |
source | SpringerLink Journals |
subjects | Applications of Mathematics Artificial Intelligence Bioinformatics Complex Systems Computer aided scheduling Containers Control Cranes Decisions Engineering Genetic algorithms Mathematical and Computational Engineering Mechatronics Performance evaluation Priority scheduling Regular Research Paper Robotics Schedules Scheduling Task scheduling Transport buildings, stations and terminals |
title | Enhancing online yard crane scheduling through a two-stage rollout memetic genetic programming |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-20T08%3A34%3A31IST&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=Enhancing%20online%20yard%20crane%20scheduling%20through%20a%20two-stage%20rollout%20memetic%20genetic%20programming&rft.jtitle=Memetic%20computing&rft.au=Jin,%20Chenwei&rft.date=2024&rft.volume=16&rft.issue=3&rft.spage=467&rft.epage=489&rft.pages=467-489&rft.issn=1865-9284&rft.eissn=1865-9292&rft_id=info:doi/10.1007/s12293-024-00424-4&rft_dat=%3Cproquest_cross%3E3104475847%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=3104475847&rft_id=info:pmid/&rfr_iscdi=true |