Berth scheduling by simulated annealing
The objective of the berth-scheduling problem is to determine the berthing times and positions of containerships in port container terminals. Every vessel requires a specific amount of space in a wharf for a predetermined length of time to unload and load containers. In this study, a mixed-integer-l...
Gespeichert in:
| Veröffentlicht in: | Transportation research. Part B: methodological 2003-07, Vol.37 (6), p.541-560 |
|---|---|
| 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 | 560 |
|---|---|
| container_issue | 6 |
| container_start_page | 541 |
| container_title | Transportation research. Part B: methodological |
| container_volume | 37 |
| creator | Kim, Kap Hwan Moon, Kyung Chan |
| description | The objective of the berth-scheduling problem is to determine the berthing times and positions of containerships in port container terminals. Every vessel requires a specific amount of space in a wharf for a predetermined length of time to unload and load containers. In this study, a mixed-integer-linear-programming (MIP) model was formulated for the berth-scheduling problem. The simulated annealing algorithm was applied to the berth-scheduling problem to find near-optimal solutions. Experimental results showed that the simulated annealing algorithm obtains solutions that are similar to the optimal solutions found by the MIP model. |
| doi_str_mv | 10.1016/S0191-2615(02)00027-9 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_27802680</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0191261502000279</els_id><sourcerecordid>27802680</sourcerecordid><originalsourceid>FETCH-LOGICAL-c518t-a64d5ba995482ad63508388b7f5c8e2a9daeb2e4b491aecf0b651d66191dda063</originalsourceid><addsrcrecordid>eNqFkEtLAzEUhYMoWKs_QejG12I0j0kmsxItPim4UNfhTnLHRqbTmkwL_femD-rSxcmF8J3LuYeQU0avGWXq5p2ykmVcMXlJ-RWllBdZuUd6TBdlxoUq9klvhxySoxi_EyRyynrk4h5DNx5EO0Y3b3z7NaiWg-gn8wY6dANoW4TV9zE5qKGJeLKdffL5-PAxfM5Gb08vw7tRZiXTXQYqd7KCspS55uCUkFQLrauillYjh9IBVhzzKi8ZoK1ppSRzSqV0zgFVok_ON3tnYfozx9iZiY8WmwZanM6j4YWmXGmaQLkBbZjGGLA2s-AnEJaGUbOqxaxrMaubDeVmXYspk-914ws4Q7szIWIXoI2VWRgBokjPMomnntLwSSppliRzZqSiZtxN0rKzbVqIFpo6bbA-_iXJC8G4Eom73XCYqlt4DCZaj61F5wPazrip_yf2L2-xjqE</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>27802680</pqid></control><display><type>article</type><title>Berth scheduling by simulated annealing</title><source>RePEc</source><source>Elsevier ScienceDirect Journals</source><creator>Kim, Kap Hwan ; Moon, Kyung Chan</creator><creatorcontrib>Kim, Kap Hwan ; Moon, Kyung Chan</creatorcontrib><description>The objective of the berth-scheduling problem is to determine the berthing times and positions of containerships in port container terminals. Every vessel requires a specific amount of space in a wharf for a predetermined length of time to unload and load containers. In this study, a mixed-integer-linear-programming (MIP) model was formulated for the berth-scheduling problem. The simulated annealing algorithm was applied to the berth-scheduling problem to find near-optimal solutions. Experimental results showed that the simulated annealing algorithm obtains solutions that are similar to the optimal solutions found by the MIP model.</description><identifier>ISSN: 0191-2615</identifier><identifier>EISSN: 1879-2367</identifier><identifier>DOI: 10.1016/S0191-2615(02)00027-9</identifier><identifier>CODEN: TRBMDY</identifier><language>eng</language><publisher>Kidlington: Elsevier Ltd</publisher><subject>Applied sciences ; Berth scheduling ; Buildings. Public works ; Container terminals ; Exact sciences and technology ; Ground, air and sea transportation, marine construction ; Hydraulic constructions ; Marine and water way transportation and traffic ; Mixed-integer-programming ; Port facilities and coastal structures. Lighthouses and beacons ; Simulated annealing ; Transportation planning, management and economics</subject><ispartof>Transportation research. Part B: methodological, 2003-07, Vol.37 (6), p.541-560</ispartof><rights>2003 Elsevier Science Ltd</rights><rights>2003 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c518t-a64d5ba995482ad63508388b7f5c8e2a9daeb2e4b491aecf0b651d66191dda063</citedby><cites>FETCH-LOGICAL-c518t-a64d5ba995482ad63508388b7f5c8e2a9daeb2e4b491aecf0b651d66191dda063</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0191261502000279$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,3994,27901,27902,65306</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=14731263$$DView record in Pascal Francis$$Hfree_for_read</backlink><backlink>$$Uhttp://econpapers.repec.org/article/eeetransb/v_3a37_3ay_3a2003_3ai_3a6_3ap_3a541-560.htm$$DView record in RePEc$$Hfree_for_read</backlink></links><search><creatorcontrib>Kim, Kap Hwan</creatorcontrib><creatorcontrib>Moon, Kyung Chan</creatorcontrib><title>Berth scheduling by simulated annealing</title><title>Transportation research. Part B: methodological</title><description>The objective of the berth-scheduling problem is to determine the berthing times and positions of containerships in port container terminals. Every vessel requires a specific amount of space in a wharf for a predetermined length of time to unload and load containers. In this study, a mixed-integer-linear-programming (MIP) model was formulated for the berth-scheduling problem. The simulated annealing algorithm was applied to the berth-scheduling problem to find near-optimal solutions. Experimental results showed that the simulated annealing algorithm obtains solutions that are similar to the optimal solutions found by the MIP model.</description><subject>Applied sciences</subject><subject>Berth scheduling</subject><subject>Buildings. Public works</subject><subject>Container terminals</subject><subject>Exact sciences and technology</subject><subject>Ground, air and sea transportation, marine construction</subject><subject>Hydraulic constructions</subject><subject>Marine and water way transportation and traffic</subject><subject>Mixed-integer-programming</subject><subject>Port facilities and coastal structures. Lighthouses and beacons</subject><subject>Simulated annealing</subject><subject>Transportation planning, management and economics</subject><issn>0191-2615</issn><issn>1879-2367</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2003</creationdate><recordtype>article</recordtype><sourceid>X2L</sourceid><recordid>eNqFkEtLAzEUhYMoWKs_QejG12I0j0kmsxItPim4UNfhTnLHRqbTmkwL_femD-rSxcmF8J3LuYeQU0avGWXq5p2ykmVcMXlJ-RWllBdZuUd6TBdlxoUq9klvhxySoxi_EyRyynrk4h5DNx5EO0Y3b3z7NaiWg-gn8wY6dANoW4TV9zE5qKGJeLKdffL5-PAxfM5Gb08vw7tRZiXTXQYqd7KCspS55uCUkFQLrauillYjh9IBVhzzKi8ZoK1ppSRzSqV0zgFVok_ON3tnYfozx9iZiY8WmwZanM6j4YWmXGmaQLkBbZjGGLA2s-AnEJaGUbOqxaxrMaubDeVmXYspk-914ws4Q7szIWIXoI2VWRgBokjPMomnntLwSSppliRzZqSiZtxN0rKzbVqIFpo6bbA-_iXJC8G4Eom73XCYqlt4DCZaj61F5wPazrip_yf2L2-xjqE</recordid><startdate>20030701</startdate><enddate>20030701</enddate><creator>Kim, Kap Hwan</creator><creator>Moon, Kyung Chan</creator><general>Elsevier Ltd</general><general>Elsevier</general><scope>IQODW</scope><scope>DKI</scope><scope>X2L</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>8FD</scope><scope>FR3</scope><scope>KR7</scope></search><sort><creationdate>20030701</creationdate><title>Berth scheduling by simulated annealing</title><author>Kim, Kap Hwan ; Moon, Kyung Chan</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c518t-a64d5ba995482ad63508388b7f5c8e2a9daeb2e4b491aecf0b651d66191dda063</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2003</creationdate><topic>Applied sciences</topic><topic>Berth scheduling</topic><topic>Buildings. Public works</topic><topic>Container terminals</topic><topic>Exact sciences and technology</topic><topic>Ground, air and sea transportation, marine construction</topic><topic>Hydraulic constructions</topic><topic>Marine and water way transportation and traffic</topic><topic>Mixed-integer-programming</topic><topic>Port facilities and coastal structures. Lighthouses and beacons</topic><topic>Simulated annealing</topic><topic>Transportation planning, management and economics</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Kim, Kap Hwan</creatorcontrib><creatorcontrib>Moon, Kyung Chan</creatorcontrib><collection>Pascal-Francis</collection><collection>RePEc IDEAS</collection><collection>RePEc</collection><collection>CrossRef</collection><collection>Technology Research Database</collection><collection>Engineering Research Database</collection><collection>Civil Engineering Abstracts</collection><jtitle>Transportation research. Part B: methodological</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Kim, Kap Hwan</au><au>Moon, Kyung Chan</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Berth scheduling by simulated annealing</atitle><jtitle>Transportation research. Part B: methodological</jtitle><date>2003-07-01</date><risdate>2003</risdate><volume>37</volume><issue>6</issue><spage>541</spage><epage>560</epage><pages>541-560</pages><issn>0191-2615</issn><eissn>1879-2367</eissn><coden>TRBMDY</coden><abstract>The objective of the berth-scheduling problem is to determine the berthing times and positions of containerships in port container terminals. Every vessel requires a specific amount of space in a wharf for a predetermined length of time to unload and load containers. In this study, a mixed-integer-linear-programming (MIP) model was formulated for the berth-scheduling problem. The simulated annealing algorithm was applied to the berth-scheduling problem to find near-optimal solutions. Experimental results showed that the simulated annealing algorithm obtains solutions that are similar to the optimal solutions found by the MIP model.</abstract><cop>Kidlington</cop><pub>Elsevier Ltd</pub><doi>10.1016/S0191-2615(02)00027-9</doi><tpages>20</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0191-2615 |
| ispartof | Transportation research. Part B: methodological, 2003-07, Vol.37 (6), p.541-560 |
| issn | 0191-2615 1879-2367 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_27802680 |
| source | RePEc; Elsevier ScienceDirect Journals |
| subjects | Applied sciences Berth scheduling Buildings. Public works Container terminals Exact sciences and technology Ground, air and sea transportation, marine construction Hydraulic constructions Marine and water way transportation and traffic Mixed-integer-programming Port facilities and coastal structures. Lighthouses and beacons Simulated annealing Transportation planning, management and economics |
| title | Berth scheduling by simulated annealing |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T14%3A28%3A03IST&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=Berth%20scheduling%20by%20simulated%20annealing&rft.jtitle=Transportation%20research.%20Part%20B:%20methodological&rft.au=Kim,%20Kap%20Hwan&rft.date=2003-07-01&rft.volume=37&rft.issue=6&rft.spage=541&rft.epage=560&rft.pages=541-560&rft.issn=0191-2615&rft.eissn=1879-2367&rft.coden=TRBMDY&rft_id=info:doi/10.1016/S0191-2615(02)00027-9&rft_dat=%3Cproquest_cross%3E27802680%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=27802680&rft_id=info:pmid/&rft_els_id=S0191261502000279&rfr_iscdi=true |