A GRASP-based metaheuristic for the Berth Allocation Problem and the Quay Crane Assignment Problem by managing vessel cargo holds
Container terminals are open systems that generally serve as a transshipment zone between vessels and land vehicles. These terminals carry out a large number of planning and scheduling tasks. In this paper, we consider the problem of scheduling a number of incoming vessels by assigning a berthing po...
Gespeichert in:
| Veröffentlicht in: | Applied intelligence (Dordrecht, Netherlands) Netherlands), 2014-03, Vol.40 (2), p.273-290 |
|---|---|
| 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 | 290 |
|---|---|
| container_issue | 2 |
| container_start_page | 273 |
| container_title | Applied intelligence (Dordrecht, Netherlands) |
| container_volume | 40 |
| creator | Rodriguez-Molins, Mario Salido, Miguel A. Barber, Federico |
| description | Container terminals are open systems that generally serve as a transshipment zone between vessels and land vehicles. These terminals carry out a large number of planning and scheduling tasks. In this paper, we consider the problem of scheduling a number of incoming vessels by assigning a berthing position, a berthing time, and a number of Quay Cranes to each vessel. This problem is known as the Berth Allocation Problem and the Quay Crane Assignment Problem. Holds of vessels are also managed in order to obtain a more realistic approach. Our aim is to minimize the total waiting time elapsed to serve all these vessels. In this paper, we deal with the above problems and propose an innovative metaheuristic approach. The results are compared against other allocation methods. |
| doi_str_mv | 10.1007/s10489-013-0462-4 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_1671619695</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1671619695</sourcerecordid><originalsourceid>FETCH-LOGICAL-c412t-ce733e4dd53dd9e255b0c857be480339b479cb7b828837a14b839fda394723ab3</originalsourceid><addsrcrecordid>eNqFkc2LFDEQxYMoOI7-Ad4CInhpzVd3kuM46CosuH6Bt5Ckq3t66e6sqW5hjv7nZpxlEUE81aF-71H1HiFPOXvJGdOvkDNlbMW4rJhqRKXukQ2vtay0svo-2TArVNU09ttD8gjxmjEmJeMb8nNHLz7tPl9VwSO0dILFH2DNAy5DpF3KdDkAfQ15OdDdOKbolyHN9CqnMMJE_dz-Bj6u_kj32c9Ad4hDP08wL3dUONLJz74f5p7-AEQYafS5T_SQxhYfkwedHxGe3M4t-fr2zZf9u-ryw8X7_e6yioqLpYqgpQTVtrVsWwuirgOLptYBlCm_2KC0jUEHI4yR2nMVjLRd66VVWkgf5Ja8OPve5PR9BVzcNGCEcSxXpxUdbzRvuG1s_X-0FiVPbZkt6LO_0Ou05rk84riypnCNUYXiZyrmhJihczd5mHw-Os7cqT937s-V_typP3fSPL919hj92JV044B3QmGEZqZksiXizGFZzT3kPy74p_kvmjiphg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1498209684</pqid></control><display><type>article</type><title>A GRASP-based metaheuristic for the Berth Allocation Problem and the Quay Crane Assignment Problem by managing vessel cargo holds</title><source>Springer Nature - Complete Springer Journals</source><creator>Rodriguez-Molins, Mario ; Salido, Miguel A. ; Barber, Federico</creator><creatorcontrib>Rodriguez-Molins, Mario ; Salido, Miguel A. ; Barber, Federico</creatorcontrib><description>Container terminals are open systems that generally serve as a transshipment zone between vessels and land vehicles. These terminals carry out a large number of planning and scheduling tasks. In this paper, we consider the problem of scheduling a number of incoming vessels by assigning a berthing position, a berthing time, and a number of Quay Cranes to each vessel. This problem is known as the Berth Allocation Problem and the Quay Crane Assignment Problem. Holds of vessels are also managed in order to obtain a more realistic approach. Our aim is to minimize the total waiting time elapsed to serve all these vessels. In this paper, we deal with the above problems and propose an innovative metaheuristic approach. The results are compared against other allocation methods.</description><identifier>ISSN: 0924-669X</identifier><identifier>EISSN: 1573-7497</identifier><identifier>DOI: 10.1007/s10489-013-0462-4</identifier><language>eng</language><publisher>Boston: Springer US</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Algorithms ; Allocations ; Applied sciences ; Artificial Intelligence ; Assignment problem ; Berthing ; Computer Science ; Computer science; control theory; systems ; Cranes ; Cranes & hoists ; Exact sciences and technology ; Ground, air and sea transportation, marine construction ; Inventory control, production control. Distribution ; Machines ; Manufacturing ; Marine and water way transportation and traffic ; Mechanical Engineering ; Open systems ; Operational research and scientific management ; Operational research. Management science ; Optimization techniques ; Planning ; Ports ; Processes ; Quays ; Scheduling ; Scheduling, sequencing ; Tasks ; Terminals ; Theoretical computing ; Vessels</subject><ispartof>Applied intelligence (Dordrecht, Netherlands), 2014-03, Vol.40 (2), p.273-290</ispartof><rights>Springer Science+Business Media New York 2013</rights><rights>2015 INIST-CNRS</rights><rights>Springer Science+Business Media New York 2014</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c412t-ce733e4dd53dd9e255b0c857be480339b479cb7b828837a14b839fda394723ab3</citedby><cites>FETCH-LOGICAL-c412t-ce733e4dd53dd9e255b0c857be480339b479cb7b828837a14b839fda394723ab3</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/s10489-013-0462-4$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10489-013-0462-4$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,776,780,27901,27902,41464,42533,51294</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=28270873$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Rodriguez-Molins, Mario</creatorcontrib><creatorcontrib>Salido, Miguel A.</creatorcontrib><creatorcontrib>Barber, Federico</creatorcontrib><title>A GRASP-based metaheuristic for the Berth Allocation Problem and the Quay Crane Assignment Problem by managing vessel cargo holds</title><title>Applied intelligence (Dordrecht, Netherlands)</title><addtitle>Appl Intell</addtitle><description>Container terminals are open systems that generally serve as a transshipment zone between vessels and land vehicles. These terminals carry out a large number of planning and scheduling tasks. In this paper, we consider the problem of scheduling a number of incoming vessels by assigning a berthing position, a berthing time, and a number of Quay Cranes to each vessel. This problem is known as the Berth Allocation Problem and the Quay Crane Assignment Problem. Holds of vessels are also managed in order to obtain a more realistic approach. Our aim is to minimize the total waiting time elapsed to serve all these vessels. In this paper, we deal with the above problems and propose an innovative metaheuristic approach. The results are compared against other allocation methods.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Algorithms</subject><subject>Allocations</subject><subject>Applied sciences</subject><subject>Artificial Intelligence</subject><subject>Assignment problem</subject><subject>Berthing</subject><subject>Computer Science</subject><subject>Computer science; control theory; systems</subject><subject>Cranes</subject><subject>Cranes & hoists</subject><subject>Exact sciences and technology</subject><subject>Ground, air and sea transportation, marine construction</subject><subject>Inventory control, production control. Distribution</subject><subject>Machines</subject><subject>Manufacturing</subject><subject>Marine and water way transportation and traffic</subject><subject>Mechanical Engineering</subject><subject>Open systems</subject><subject>Operational research and scientific management</subject><subject>Operational research. Management science</subject><subject>Optimization techniques</subject><subject>Planning</subject><subject>Ports</subject><subject>Processes</subject><subject>Quays</subject><subject>Scheduling</subject><subject>Scheduling, sequencing</subject><subject>Tasks</subject><subject>Terminals</subject><subject>Theoretical computing</subject><subject>Vessels</subject><issn>0924-669X</issn><issn>1573-7497</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNqFkc2LFDEQxYMoOI7-Ad4CInhpzVd3kuM46CosuH6Bt5Ckq3t66e6sqW5hjv7nZpxlEUE81aF-71H1HiFPOXvJGdOvkDNlbMW4rJhqRKXukQ2vtay0svo-2TArVNU09ttD8gjxmjEmJeMb8nNHLz7tPl9VwSO0dILFH2DNAy5DpF3KdDkAfQ15OdDdOKbolyHN9CqnMMJE_dz-Bj6u_kj32c9Ad4hDP08wL3dUONLJz74f5p7-AEQYafS5T_SQxhYfkwedHxGe3M4t-fr2zZf9u-ryw8X7_e6yioqLpYqgpQTVtrVsWwuirgOLptYBlCm_2KC0jUEHI4yR2nMVjLRd66VVWkgf5Ja8OPve5PR9BVzcNGCEcSxXpxUdbzRvuG1s_X-0FiVPbZkt6LO_0Ou05rk84riypnCNUYXiZyrmhJihczd5mHw-Os7cqT937s-V_typP3fSPL919hj92JV044B3QmGEZqZksiXizGFZzT3kPy74p_kvmjiphg</recordid><startdate>20140301</startdate><enddate>20140301</enddate><creator>Rodriguez-Molins, Mario</creator><creator>Salido, Miguel A.</creator><creator>Barber, Federico</creator><general>Springer US</general><general>Kluwer</general><general>Springer Nature B.V</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7SC</scope><scope>7WY</scope><scope>7WZ</scope><scope>7XB</scope><scope>87Z</scope><scope>8AL</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>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>L.-</scope><scope>L6V</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><scope>M0C</scope><scope>M0N</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>PSYQQ</scope><scope>PTHSS</scope><scope>Q9U</scope><scope>7TB</scope><scope>FR3</scope></search><sort><creationdate>20140301</creationdate><title>A GRASP-based metaheuristic for the Berth Allocation Problem and the Quay Crane Assignment Problem by managing vessel cargo holds</title><author>Rodriguez-Molins, Mario ; Salido, Miguel A. ; Barber, Federico</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c412t-ce733e4dd53dd9e255b0c857be480339b479cb7b828837a14b839fda394723ab3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Algorithms</topic><topic>Allocations</topic><topic>Applied sciences</topic><topic>Artificial Intelligence</topic><topic>Assignment problem</topic><topic>Berthing</topic><topic>Computer Science</topic><topic>Computer science; control theory; systems</topic><topic>Cranes</topic><topic>Cranes & hoists</topic><topic>Exact sciences and technology</topic><topic>Ground, air and sea transportation, marine construction</topic><topic>Inventory control, production control. Distribution</topic><topic>Machines</topic><topic>Manufacturing</topic><topic>Marine and water way transportation and traffic</topic><topic>Mechanical Engineering</topic><topic>Open systems</topic><topic>Operational research and scientific management</topic><topic>Operational research. Management science</topic><topic>Optimization techniques</topic><topic>Planning</topic><topic>Ports</topic><topic>Processes</topic><topic>Quays</topic><topic>Scheduling</topic><topic>Scheduling, sequencing</topic><topic>Tasks</topic><topic>Terminals</topic><topic>Theoretical computing</topic><topic>Vessels</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Rodriguez-Molins, Mario</creatorcontrib><creatorcontrib>Salido, Miguel A.</creatorcontrib><creatorcontrib>Barber, Federico</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Computer and Information Systems 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>Computing Database (Alumni Edition)</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>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>SciTech Premium Collection</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>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering 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><collection>ABI/INFORM Global</collection><collection>Computing 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>ProQuest One Psychology</collection><collection>Engineering Collection</collection><collection>ProQuest Central Basic</collection><collection>Mechanical & Transportation Engineering Abstracts</collection><collection>Engineering Research Database</collection><jtitle>Applied intelligence (Dordrecht, Netherlands)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Rodriguez-Molins, Mario</au><au>Salido, Miguel A.</au><au>Barber, Federico</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A GRASP-based metaheuristic for the Berth Allocation Problem and the Quay Crane Assignment Problem by managing vessel cargo holds</atitle><jtitle>Applied intelligence (Dordrecht, Netherlands)</jtitle><stitle>Appl Intell</stitle><date>2014-03-01</date><risdate>2014</risdate><volume>40</volume><issue>2</issue><spage>273</spage><epage>290</epage><pages>273-290</pages><issn>0924-669X</issn><eissn>1573-7497</eissn><abstract>Container terminals are open systems that generally serve as a transshipment zone between vessels and land vehicles. These terminals carry out a large number of planning and scheduling tasks. In this paper, we consider the problem of scheduling a number of incoming vessels by assigning a berthing position, a berthing time, and a number of Quay Cranes to each vessel. This problem is known as the Berth Allocation Problem and the Quay Crane Assignment Problem. Holds of vessels are also managed in order to obtain a more realistic approach. Our aim is to minimize the total waiting time elapsed to serve all these vessels. In this paper, we deal with the above problems and propose an innovative metaheuristic approach. The results are compared against other allocation methods.</abstract><cop>Boston</cop><pub>Springer US</pub><doi>10.1007/s10489-013-0462-4</doi><tpages>18</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0924-669X |
| ispartof | Applied intelligence (Dordrecht, Netherlands), 2014-03, Vol.40 (2), p.273-290 |
| issn | 0924-669X 1573-7497 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_1671619695 |
| source | Springer Nature - Complete Springer Journals |
| subjects | Algorithmics. Computability. Computer arithmetics Algorithms Allocations Applied sciences Artificial Intelligence Assignment problem Berthing Computer Science Computer science control theory systems Cranes Cranes & hoists Exact sciences and technology Ground, air and sea transportation, marine construction Inventory control, production control. Distribution Machines Manufacturing Marine and water way transportation and traffic Mechanical Engineering Open systems Operational research and scientific management Operational research. Management science Optimization techniques Planning Ports Processes Quays Scheduling Scheduling, sequencing Tasks Terminals Theoretical computing Vessels |
| title | A GRASP-based metaheuristic for the Berth Allocation Problem and the Quay Crane Assignment Problem by managing vessel cargo holds |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-10T20%3A28%3A35IST&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=A%20GRASP-based%20metaheuristic%20for%20the%20Berth%20Allocation%20Problem%20and%20the%20Quay%20Crane%20Assignment%20Problem%20by%20managing%20vessel%20cargo%20holds&rft.jtitle=Applied%20intelligence%20(Dordrecht,%20Netherlands)&rft.au=Rodriguez-Molins,%20Mario&rft.date=2014-03-01&rft.volume=40&rft.issue=2&rft.spage=273&rft.epage=290&rft.pages=273-290&rft.issn=0924-669X&rft.eissn=1573-7497&rft_id=info:doi/10.1007/s10489-013-0462-4&rft_dat=%3Cproquest_cross%3E1671619695%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=1498209684&rft_id=info:pmid/&rfr_iscdi=true |