An intermodal transport network planning algorithm using dynamic programming—A case study: from Busan to Rotterdam in intermodal freight routing
This paper presents a dynamic programming algorithm to draw optimal intermodal freight routing with regard to international logistics of container cargo for export and import. This study looks into the characteristics of intermodal transport using multi-modes, and presents a Weighted Constrained Sho...
Gespeichert in:
| Veröffentlicht in: | Applied intelligence (Dordrecht, Netherlands) Netherlands), 2012-04, Vol.36 (3), p.529-541 |
|---|---|
| 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 | 541 |
|---|---|
| container_issue | 3 |
| container_start_page | 529 |
| container_title | Applied intelligence (Dordrecht, Netherlands) |
| container_volume | 36 |
| creator | Cho, Jae Hyung Kim, Hyun Soo Choi, Hyung Rim |
| description | This paper presents a dynamic programming algorithm to draw optimal intermodal freight routing with regard to international logistics of container cargo for export and import. This study looks into the characteristics of intermodal transport using multi-modes, and presents a Weighted Constrained Shortest Path Problem (WCSPP) model. This study draws Pareto optimal solutions that can simultaneously meet two objective functions by applying the Label Setting algorithm, a type of Dynamic Programming algorithms, after setting the feasible area. To improve the algorithm performance, pruning rules have also been presented. The algorithm is applied to real transport paths from Busan to Rotterdam, as well as to large-scale cases. This study quantitatively measures the savings in both transport cost and time by comparing single transport modes with intermodal transport paths. Last, this study applies a mathematical model and MADM model to the multiple Pareto optimal solutions to estimate the solutions. |
| doi_str_mv | 10.1007/s10489-010-0223-6 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_940970297</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2618851961</sourcerecordid><originalsourceid>FETCH-LOGICAL-c315t-b516cb9aad174e43d743ca708eb57110ed0a45286ffa6a3fa612c41e2c7356883</originalsourceid><addsrcrecordid>eNp1Uc1q3DAQFqWBbjd5gNxE725GlmzZuW1C8wMLgdJAbmLWlr3erKWtJBP21ofIpTc_ix8lT1ItG9pTDzPDDN8Pw0fIOYOvDEBeeAaiKBNgkECa8iT_QGYskzyRopQfyQzKVCR5Xj59Ip-93wAA58Bm5PfC0M4E7Xpb45YGh8bvrAvU6PBi3TPdbdGYzrQUt611XVj3dPBxn8Z6b7DvKrpztnXY9_H49ut1MY0Vek19GOr9JW2c7afxavBopjHYafxuQ3SrMV47c6i_3o3TXbsO1NkhRK1TctLg1uuz9zknjzffflzfJcuH2_vrxTKpOMtCsspYXq1KxJpJoQWvpeAVSij0KpOMga4BRZYWedNgjjw2llaC6bSSPMuLgs_Jl6Nu_OPnoH1QGzs4Ey1VKaCUkJYygtgRVDnrvdON2rmuR7dXDNQhAHUMQMUA1CEAlUdOeuT4iDWtdv-E_0_6A8eKk6Q</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>940970297</pqid></control><display><type>article</type><title>An intermodal transport network planning algorithm using dynamic programming—A case study: from Busan to Rotterdam in intermodal freight routing</title><source>SpringerLink Journals - AutoHoldings</source><creator>Cho, Jae Hyung ; Kim, Hyun Soo ; Choi, Hyung Rim</creator><creatorcontrib>Cho, Jae Hyung ; Kim, Hyun Soo ; Choi, Hyung Rim</creatorcontrib><description>This paper presents a dynamic programming algorithm to draw optimal intermodal freight routing with regard to international logistics of container cargo for export and import. This study looks into the characteristics of intermodal transport using multi-modes, and presents a Weighted Constrained Shortest Path Problem (WCSPP) model. This study draws Pareto optimal solutions that can simultaneously meet two objective functions by applying the Label Setting algorithm, a type of Dynamic Programming algorithms, after setting the feasible area. To improve the algorithm performance, pruning rules have also been presented. The algorithm is applied to real transport paths from Busan to Rotterdam, as well as to large-scale cases. This study quantitatively measures the savings in both transport cost and time by comparing single transport modes with intermodal transport paths. Last, this study applies a mathematical model and MADM model to the multiple Pareto optimal solutions to estimate the solutions.</description><identifier>ISSN: 0924-669X</identifier><identifier>EISSN: 1573-7497</identifier><identifier>DOI: 10.1007/s10489-010-0223-6</identifier><language>eng</language><publisher>Boston: Springer US</publisher><subject>Airlines ; Algorithms ; Artificial Intelligence ; Case studies ; Computer Science ; Cost control ; Dynamic programming ; Intermodal transportation ; Logistics ; Machines ; Manufacturing ; Mechanical Engineering ; Network management systems ; Pareto optimum ; Processes ; Schedules ; Surcharges</subject><ispartof>Applied intelligence (Dordrecht, Netherlands), 2012-04, Vol.36 (3), p.529-541</ispartof><rights>Springer Science+Business Media, LLC 2010</rights><rights>Springer Science+Business Media, LLC 2012</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c315t-b516cb9aad174e43d743ca708eb57110ed0a45286ffa6a3fa612c41e2c7356883</citedby><cites>FETCH-LOGICAL-c315t-b516cb9aad174e43d743ca708eb57110ed0a45286ffa6a3fa612c41e2c7356883</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-010-0223-6$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/s10489-010-0223-6$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>314,776,780,27901,27902,41464,42533,51294</link.rule.ids></links><search><creatorcontrib>Cho, Jae Hyung</creatorcontrib><creatorcontrib>Kim, Hyun Soo</creatorcontrib><creatorcontrib>Choi, Hyung Rim</creatorcontrib><title>An intermodal transport network planning algorithm using dynamic programming—A case study: from Busan to Rotterdam in intermodal freight routing</title><title>Applied intelligence (Dordrecht, Netherlands)</title><addtitle>Appl Intell</addtitle><description>This paper presents a dynamic programming algorithm to draw optimal intermodal freight routing with regard to international logistics of container cargo for export and import. This study looks into the characteristics of intermodal transport using multi-modes, and presents a Weighted Constrained Shortest Path Problem (WCSPP) model. This study draws Pareto optimal solutions that can simultaneously meet two objective functions by applying the Label Setting algorithm, a type of Dynamic Programming algorithms, after setting the feasible area. To improve the algorithm performance, pruning rules have also been presented. The algorithm is applied to real transport paths from Busan to Rotterdam, as well as to large-scale cases. This study quantitatively measures the savings in both transport cost and time by comparing single transport modes with intermodal transport paths. Last, this study applies a mathematical model and MADM model to the multiple Pareto optimal solutions to estimate the solutions.</description><subject>Airlines</subject><subject>Algorithms</subject><subject>Artificial Intelligence</subject><subject>Case studies</subject><subject>Computer Science</subject><subject>Cost control</subject><subject>Dynamic programming</subject><subject>Intermodal transportation</subject><subject>Logistics</subject><subject>Machines</subject><subject>Manufacturing</subject><subject>Mechanical Engineering</subject><subject>Network management systems</subject><subject>Pareto optimum</subject><subject>Processes</subject><subject>Schedules</subject><subject>Surcharges</subject><issn>0924-669X</issn><issn>1573-7497</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNp1Uc1q3DAQFqWBbjd5gNxE725GlmzZuW1C8wMLgdJAbmLWlr3erKWtJBP21ofIpTc_ix8lT1ItG9pTDzPDDN8Pw0fIOYOvDEBeeAaiKBNgkECa8iT_QGYskzyRopQfyQzKVCR5Xj59Ip-93wAA58Bm5PfC0M4E7Xpb45YGh8bvrAvU6PBi3TPdbdGYzrQUt611XVj3dPBxn8Z6b7DvKrpztnXY9_H49ut1MY0Vek19GOr9JW2c7afxavBopjHYafxuQ3SrMV47c6i_3o3TXbsO1NkhRK1TctLg1uuz9zknjzffflzfJcuH2_vrxTKpOMtCsspYXq1KxJpJoQWvpeAVSij0KpOMga4BRZYWedNgjjw2llaC6bSSPMuLgs_Jl6Nu_OPnoH1QGzs4Ey1VKaCUkJYygtgRVDnrvdON2rmuR7dXDNQhAHUMQMUA1CEAlUdOeuT4iDWtdv-E_0_6A8eKk6Q</recordid><startdate>20120401</startdate><enddate>20120401</enddate><creator>Cho, Jae Hyung</creator><creator>Kim, Hyun Soo</creator><creator>Choi, Hyung Rim</creator><general>Springer US</general><general>Springer Nature B.V</general><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></search><sort><creationdate>20120401</creationdate><title>An intermodal transport network planning algorithm using dynamic programming—A case study: from Busan to Rotterdam in intermodal freight routing</title><author>Cho, Jae Hyung ; Kim, Hyun Soo ; Choi, Hyung Rim</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c315t-b516cb9aad174e43d743ca708eb57110ed0a45286ffa6a3fa612c41e2c7356883</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Airlines</topic><topic>Algorithms</topic><topic>Artificial Intelligence</topic><topic>Case studies</topic><topic>Computer Science</topic><topic>Cost control</topic><topic>Dynamic programming</topic><topic>Intermodal transportation</topic><topic>Logistics</topic><topic>Machines</topic><topic>Manufacturing</topic><topic>Mechanical Engineering</topic><topic>Network management systems</topic><topic>Pareto optimum</topic><topic>Processes</topic><topic>Schedules</topic><topic>Surcharges</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Cho, Jae Hyung</creatorcontrib><creatorcontrib>Kim, Hyun Soo</creatorcontrib><creatorcontrib>Choi, Hyung Rim</creatorcontrib><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><jtitle>Applied intelligence (Dordrecht, Netherlands)</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Cho, Jae Hyung</au><au>Kim, Hyun Soo</au><au>Choi, Hyung Rim</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>An intermodal transport network planning algorithm using dynamic programming—A case study: from Busan to Rotterdam in intermodal freight routing</atitle><jtitle>Applied intelligence (Dordrecht, Netherlands)</jtitle><stitle>Appl Intell</stitle><date>2012-04-01</date><risdate>2012</risdate><volume>36</volume><issue>3</issue><spage>529</spage><epage>541</epage><pages>529-541</pages><issn>0924-669X</issn><eissn>1573-7497</eissn><abstract>This paper presents a dynamic programming algorithm to draw optimal intermodal freight routing with regard to international logistics of container cargo for export and import. This study looks into the characteristics of intermodal transport using multi-modes, and presents a Weighted Constrained Shortest Path Problem (WCSPP) model. This study draws Pareto optimal solutions that can simultaneously meet two objective functions by applying the Label Setting algorithm, a type of Dynamic Programming algorithms, after setting the feasible area. To improve the algorithm performance, pruning rules have also been presented. The algorithm is applied to real transport paths from Busan to Rotterdam, as well as to large-scale cases. This study quantitatively measures the savings in both transport cost and time by comparing single transport modes with intermodal transport paths. Last, this study applies a mathematical model and MADM model to the multiple Pareto optimal solutions to estimate the solutions.</abstract><cop>Boston</cop><pub>Springer US</pub><doi>10.1007/s10489-010-0223-6</doi><tpages>13</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0924-669X |
| ispartof | Applied intelligence (Dordrecht, Netherlands), 2012-04, Vol.36 (3), p.529-541 |
| issn | 0924-669X 1573-7497 |
| language | eng |
| recordid | cdi_proquest_journals_940970297 |
| source | SpringerLink Journals - AutoHoldings |
| subjects | Airlines Algorithms Artificial Intelligence Case studies Computer Science Cost control Dynamic programming Intermodal transportation Logistics Machines Manufacturing Mechanical Engineering Network management systems Pareto optimum Processes Schedules Surcharges |
| title | An intermodal transport network planning algorithm using dynamic programming—A case study: from Busan to Rotterdam in intermodal freight routing |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T21%3A37%3A09IST&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=An%20intermodal%20transport%20network%20planning%20algorithm%20using%C2%A0dynamic%20programming%E2%80%94A%C2%A0case%20study:%20from%C2%A0Busan%C2%A0to%C2%A0Rotterdam%C2%A0in%C2%A0intermodal%20freight%20routing&rft.jtitle=Applied%20intelligence%20(Dordrecht,%20Netherlands)&rft.au=Cho,%20Jae%20Hyung&rft.date=2012-04-01&rft.volume=36&rft.issue=3&rft.spage=529&rft.epage=541&rft.pages=529-541&rft.issn=0924-669X&rft.eissn=1573-7497&rft_id=info:doi/10.1007/s10489-010-0223-6&rft_dat=%3Cproquest_cross%3E2618851961%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=940970297&rft_id=info:pmid/&rfr_iscdi=true |