New solution approaches for the train load planning problem
The present paper faces the train load planning problem in container terminals. The problem consists of assigning containers to rail wagons while maximizing the total priority of the containers loaded and minimizing the number of rehandles executed in the terminal yard. Two different heuristic appro...
Gespeichert in:
| Veröffentlicht in: | EURO Journal on Transportation and Logistics 2019-09, Vol.8 (3), p.299-325 |
|---|---|
| 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 | 325 |
|---|---|
| container_issue | 3 |
| container_start_page | 299 |
| container_title | EURO Journal on Transportation and Logistics |
| container_volume | 8 |
| creator | Ambrosino, Daniela Caballini, Claudia |
| description | The present paper faces the train load planning problem in container terminals. The problem consists of assigning containers to rail wagons while maximizing the total priority of the containers loaded and minimizing the number of rehandles executed in the terminal yard. Two different heuristic approaches, based on an innovative way to compute weight limitations and on two 0/1 integer programming models, are proposed and compared on the basis of specific key performance indicators. The heuristic approaches are compared using random generated instances based on real-world data. An extensive computational analysis has been performed. |
| doi_str_mv | 10.1007/s13676-018-0127-x |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2282561304</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S2192437620300534</els_id><sourcerecordid>2282561304</sourcerecordid><originalsourceid>FETCH-LOGICAL-c443t-b8798c079e592594043ad319dd35d819c8892721870e7dc54001f8f57a668c773</originalsourceid><addsrcrecordid>eNp9kEtLAzEUhYMoWGp_gLuA69E8Jxm6kuILim50HdIk00amyZhMtf57U0Z018Xl3sX5zuEeAC4xusYIiZuMaS3qCmFZhohqfwImBDekYlSy079b1OdglrNfIY5ryhjnEzB_dl8wx243-Big7vsUtdm4DNuY4LBxcEjaB9hFbWHf6RB8WMMiWnVuewHOWt1lN_vdU_B2f_e6eKyWLw9Pi9tlZRijQ7WSopEGicbxhvCGIUa1pbixlnIrcWOkbIggWArkhDWcIYRb2XKh61oaIegUXI2-Jfdj5_Kg3uMuhRKpCJGE15gWzynAo8qkmHNyreqT3-r0rTBSh5rUWJMqNalDTWpfGDIyuWjD2qV_52PQfIRc-fnTFygb74Jx1idnBmWjP0L_AOPWfGI</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2282561304</pqid></control><display><type>article</type><title>New solution approaches for the train load planning problem</title><source>EZB-FREE-00999 freely available EZB journals</source><source>Alma/SFX Local Collection</source><source>SpringerLink Journals - AutoHoldings</source><creator>Ambrosino, Daniela ; Caballini, Claudia</creator><creatorcontrib>Ambrosino, Daniela ; Caballini, Claudia</creatorcontrib><description>The present paper faces the train load planning problem in container terminals. The problem consists of assigning containers to rail wagons while maximizing the total priority of the containers loaded and minimizing the number of rehandles executed in the terminal yard. Two different heuristic approaches, based on an innovative way to compute weight limitations and on two 0/1 integer programming models, are proposed and compared on the basis of specific key performance indicators. The heuristic approaches are compared using random generated instances based on real-world data. An extensive computational analysis has been performed.</description><identifier>ISSN: 2192-4376</identifier><identifier>EISSN: 2192-4384</identifier><identifier>DOI: 10.1007/s13676-018-0127-x</identifier><language>eng</language><publisher>Berlin/Heidelberg: Elsevier B.V</publisher><subject>0/1 integer linear programming ; Business and Management ; Containers ; Integer programming ; Load configurations ; Loads (forces) ; Logistics ; Management Science ; Manufacturing cells ; Mathematical programming ; Operations Research ; Operations Research/Decision Theory ; Optimization ; Research Paper ; Slot weight limitations ; Train load planning problem ; Transport buildings, stations and terminals</subject><ispartof>EURO Journal on Transportation and Logistics, 2019-09, Vol.8 (3), p.299-325</ispartof><rights>2018 THE AUTHORS. Published by Elsevier on behalf of the Association of European Operational Research Societies (EURO).</rights><rights>Springer-Verlag GmbH Germany, part of Springer Nature and EURO - The Association of European Operational Research Societies 2018</rights><rights>Copyright Springer Nature B.V. 2019</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c443t-b8798c079e592594043ad319dd35d819c8892721870e7dc54001f8f57a668c773</citedby><cites>FETCH-LOGICAL-c443t-b8798c079e592594043ad319dd35d819c8892721870e7dc54001f8f57a668c773</cites><orcidid>0000-0003-1318-2571</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/s13676-018-0127-x$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s13676-018-0127-x$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,777,781,27905,27906,41469,42538,51300</link.rule.ids></links><search><creatorcontrib>Ambrosino, Daniela</creatorcontrib><creatorcontrib>Caballini, Claudia</creatorcontrib><title>New solution approaches for the train load planning problem</title><title>EURO Journal on Transportation and Logistics</title><addtitle>EURO J Transp Logist</addtitle><description>The present paper faces the train load planning problem in container terminals. The problem consists of assigning containers to rail wagons while maximizing the total priority of the containers loaded and minimizing the number of rehandles executed in the terminal yard. Two different heuristic approaches, based on an innovative way to compute weight limitations and on two 0/1 integer programming models, are proposed and compared on the basis of specific key performance indicators. The heuristic approaches are compared using random generated instances based on real-world data. An extensive computational analysis has been performed.</description><subject>0/1 integer linear programming</subject><subject>Business and Management</subject><subject>Containers</subject><subject>Integer programming</subject><subject>Load configurations</subject><subject>Loads (forces)</subject><subject>Logistics</subject><subject>Management Science</subject><subject>Manufacturing cells</subject><subject>Mathematical programming</subject><subject>Operations Research</subject><subject>Operations Research/Decision Theory</subject><subject>Optimization</subject><subject>Research Paper</subject><subject>Slot weight limitations</subject><subject>Train load planning problem</subject><subject>Transport buildings, stations and terminals</subject><issn>2192-4376</issn><issn>2192-4384</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><recordid>eNp9kEtLAzEUhYMoWGp_gLuA69E8Jxm6kuILim50HdIk00amyZhMtf57U0Z018Xl3sX5zuEeAC4xusYIiZuMaS3qCmFZhohqfwImBDekYlSy079b1OdglrNfIY5ryhjnEzB_dl8wx243-Big7vsUtdm4DNuY4LBxcEjaB9hFbWHf6RB8WMMiWnVuewHOWt1lN_vdU_B2f_e6eKyWLw9Pi9tlZRijQ7WSopEGicbxhvCGIUa1pbixlnIrcWOkbIggWArkhDWcIYRb2XKh61oaIegUXI2-Jfdj5_Kg3uMuhRKpCJGE15gWzynAo8qkmHNyreqT3-r0rTBSh5rUWJMqNalDTWpfGDIyuWjD2qV_52PQfIRc-fnTFygb74Jx1idnBmWjP0L_AOPWfGI</recordid><startdate>20190901</startdate><enddate>20190901</enddate><creator>Ambrosino, Daniela</creator><creator>Caballini, Claudia</creator><general>Elsevier B.V</general><general>Springer Berlin Heidelberg</general><general>Elsevier Limited</general><scope>6I.</scope><scope>AAFTH</scope><scope>AAYXX</scope><scope>CITATION</scope><orcidid>https://orcid.org/0000-0003-1318-2571</orcidid></search><sort><creationdate>20190901</creationdate><title>New solution approaches for the train load planning problem</title><author>Ambrosino, Daniela ; Caballini, Claudia</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c443t-b8798c079e592594043ad319dd35d819c8892721870e7dc54001f8f57a668c773</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>0/1 integer linear programming</topic><topic>Business and Management</topic><topic>Containers</topic><topic>Integer programming</topic><topic>Load configurations</topic><topic>Loads (forces)</topic><topic>Logistics</topic><topic>Management Science</topic><topic>Manufacturing cells</topic><topic>Mathematical programming</topic><topic>Operations Research</topic><topic>Operations Research/Decision Theory</topic><topic>Optimization</topic><topic>Research Paper</topic><topic>Slot weight limitations</topic><topic>Train load planning problem</topic><topic>Transport buildings, stations and terminals</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Ambrosino, Daniela</creatorcontrib><creatorcontrib>Caballini, Claudia</creatorcontrib><collection>ScienceDirect Open Access Titles</collection><collection>Elsevier:ScienceDirect:Open Access</collection><collection>CrossRef</collection><jtitle>EURO Journal on Transportation and Logistics</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Ambrosino, Daniela</au><au>Caballini, Claudia</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>New solution approaches for the train load planning problem</atitle><jtitle>EURO Journal on Transportation and Logistics</jtitle><stitle>EURO J Transp Logist</stitle><date>2019-09-01</date><risdate>2019</risdate><volume>8</volume><issue>3</issue><spage>299</spage><epage>325</epage><pages>299-325</pages><issn>2192-4376</issn><eissn>2192-4384</eissn><abstract>The present paper faces the train load planning problem in container terminals. The problem consists of assigning containers to rail wagons while maximizing the total priority of the containers loaded and minimizing the number of rehandles executed in the terminal yard. Two different heuristic approaches, based on an innovative way to compute weight limitations and on two 0/1 integer programming models, are proposed and compared on the basis of specific key performance indicators. The heuristic approaches are compared using random generated instances based on real-world data. An extensive computational analysis has been performed.</abstract><cop>Berlin/Heidelberg</cop><pub>Elsevier B.V</pub><doi>10.1007/s13676-018-0127-x</doi><tpages>27</tpages><orcidid>https://orcid.org/0000-0003-1318-2571</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 2192-4376 |
| ispartof | EURO Journal on Transportation and Logistics, 2019-09, Vol.8 (3), p.299-325 |
| issn | 2192-4376 2192-4384 |
| language | eng |
| recordid | cdi_proquest_journals_2282561304 |
| source | EZB-FREE-00999 freely available EZB journals; Alma/SFX Local Collection; SpringerLink Journals - AutoHoldings |
| subjects | 0/1 integer linear programming Business and Management Containers Integer programming Load configurations Loads (forces) Logistics Management Science Manufacturing cells Mathematical programming Operations Research Operations Research/Decision Theory Optimization Research Paper Slot weight limitations Train load planning problem Transport buildings, stations and terminals |
| title | New solution approaches for the train load planning problem |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-19T15%3A43%3A15IST&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=New%20solution%20approaches%20for%20the%20train%20load%20planning%20problem&rft.jtitle=EURO%20Journal%20on%20Transportation%20and%20Logistics&rft.au=Ambrosino,%20Daniela&rft.date=2019-09-01&rft.volume=8&rft.issue=3&rft.spage=299&rft.epage=325&rft.pages=299-325&rft.issn=2192-4376&rft.eissn=2192-4384&rft_id=info:doi/10.1007/s13676-018-0127-x&rft_dat=%3Cproquest_cross%3E2282561304%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=2282561304&rft_id=info:pmid/&rft_els_id=S2192437620300534&rfr_iscdi=true |