A Base Integer Programming Model and Benchmark Suite for Liner-Shipping Network Design

The liner-shipping network design problem is to create a set of nonsimple cyclic sailing routes for a designated fleet of container vessels that jointly transports multiple commodities. The objective is to maximize the revenue of cargo transport while minimizing the costs of operation. The potential...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Transportation science 2014-05, Vol.48 (2), p.281-312
Hauptverfasser: Brouer, Berit D., Alvarez, J. Fernando, Plum, Christian E. M., Pisinger, David, Sigurd, Mikkel M.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 312
container_issue 2
container_start_page 281
container_title Transportation science
container_volume 48
creator Brouer, Berit D.
Alvarez, J. Fernando
Plum, Christian E. M.
Pisinger, David
Sigurd, Mikkel M.
description The liner-shipping network design problem is to create a set of nonsimple cyclic sailing routes for a designated fleet of container vessels that jointly transports multiple commodities. The objective is to maximize the revenue of cargo transport while minimizing the costs of operation. The potential for making cost-effective and energy-efficient liner-shipping networks using operations research (OR) is huge and neglected. The implementation of logistic planning tools based upon OR has enhanced performance of airlines, railways, and general transportation companies, but within the field of liner shipping, applications of OR are scarce. We believe that access to domain knowledge and data is a barrier for researchers to approach the important liner-shipping network design problem. The purpose of the benchmark suite and the paper at hand is to provide easy access to the domain and the data sources of liner shipping for OR researchers in general. We describe and analyze the liner-shipping domain applied to network design and present a rich integer programming model based on services that constitute the fixed schedule of a liner shipping company. We prove the liner-shipping network design problem to be strongly NP-hard. A benchmark suite of data instances to reflect the business structure of a global liner shipping network is presented. The design of the benchmark suite is discussed in relation to industry standards, business rules, and mathematical programming. The data are based on real-life data from the largest global liner-shipping company, Maersk Line, and supplemented by data from several industry and public stakeholders. Computational results yielding the first best known solutions for six of the seven benchmark instances is provided using a heuristic combining tabu search and heuristic column generation.
doi_str_mv 10.1287/trsc.2013.0471
format Article
fullrecord <record><control><sourceid>gale_cross</sourceid><recordid>TN_cdi_gale_infotracmisc_A370444524</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><galeid>A370444524</galeid><jstor_id>43666638</jstor_id><sourcerecordid>A370444524</sourcerecordid><originalsourceid>FETCH-LOGICAL-c639t-9dde460a34cabf8767a2e035cec10824ff85b71db7a3f1fe73574171eaaa053a3</originalsourceid><addsrcrecordid>eNqFks9rHCEcxaU00G3aa28FoZceOlsddZw9btJfgU1aSNuruM7XWbczulWHkP--DilNWxaioCCf99DnQ-gFJUtat_Jtjsksa0LZknBJH6EFFXVTCc7lY7QghNOKNkI8QU9T2hNChaRigb6v8ZlOgC98hh4i_hJDH_U4Ot_jy9DBgLXv8Bl4sxt1_IGvJ5cB2xDxxnmI1fXOHQ4zfAX5JhTgHSTX-2foxOohwfPf-yn69uH91_NP1ebzx4vz9aYyDVvlatV1wBuiGTd6a1vZSF0DYcKAoaStubWt2ErabaVmllqQTEhOJQWtNRFMs1P0-s73EMPPCVJWo0sGhkF7CFNStGkZaclK0oK--g_dhyn6cjtVgirMqqRzT_V6AOW8DTlqM5uqNZOEcy5qXqjqCNVDSUQPwYN15fgffnmEL7OD0Zmjgjd_CbZTKmGnspRsdzn1ekrpqL-JIaUIVh2iK_91qyhRcznUXA41l0PN5SiCl3eCfcoh_qE5a8pg7f0D57vGMT3k9wtjb8Jt</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>1528099655</pqid></control><display><type>article</type><title>A Base Integer Programming Model and Benchmark Suite for Liner-Shipping Network Design</title><source>Informs</source><source>EBSCOhost Business Source Complete</source><source>JSTOR Archive Collection A-Z Listing</source><creator>Brouer, Berit D. ; Alvarez, J. Fernando ; Plum, Christian E. M. ; Pisinger, David ; Sigurd, Mikkel M.</creator><creatorcontrib>Brouer, Berit D. ; Alvarez, J. Fernando ; Plum, Christian E. M. ; Pisinger, David ; Sigurd, Mikkel M.</creatorcontrib><description>The liner-shipping network design problem is to create a set of nonsimple cyclic sailing routes for a designated fleet of container vessels that jointly transports multiple commodities. The objective is to maximize the revenue of cargo transport while minimizing the costs of operation. The potential for making cost-effective and energy-efficient liner-shipping networks using operations research (OR) is huge and neglected. The implementation of logistic planning tools based upon OR has enhanced performance of airlines, railways, and general transportation companies, but within the field of liner shipping, applications of OR are scarce. We believe that access to domain knowledge and data is a barrier for researchers to approach the important liner-shipping network design problem. The purpose of the benchmark suite and the paper at hand is to provide easy access to the domain and the data sources of liner shipping for OR researchers in general. We describe and analyze the liner-shipping domain applied to network design and present a rich integer programming model based on services that constitute the fixed schedule of a liner shipping company. We prove the liner-shipping network design problem to be strongly NP-hard. A benchmark suite of data instances to reflect the business structure of a global liner shipping network is presented. The design of the benchmark suite is discussed in relation to industry standards, business rules, and mathematical programming. The data are based on real-life data from the largest global liner-shipping company, Maersk Line, and supplemented by data from several industry and public stakeholders. Computational results yielding the first best known solutions for six of the seven benchmark instances is provided using a heuristic combining tabu search and heuristic column generation.</description><identifier>ISSN: 0041-1655</identifier><identifier>EISSN: 1526-5447</identifier><identifier>DOI: 10.1287/trsc.2013.0471</identifier><language>eng</language><publisher>Baltimore: INFORMS</publisher><subject>Analysis ; Canals ; Capacity costs ; Carbon footprint ; Consumption ; Costs ; Economic aspects ; Freight ; Freight forwarding ; Heuristic ; Heuristics ; Integer programming ; Liner shipping ; Logistics ; Management ; Mathematical optimization ; Mathematical programming ; network design ; Port capacity ; Ports ; Sailing ; Sea transport ; Shipment of goods ; Shipping industry ; Stakeholder ; Studies ; Transport costs ; Transport infrastructure ; Transport planning ; Transportation demand ; Transportation planning ; Transshipment</subject><ispartof>Transportation science, 2014-05, Vol.48 (2), p.281-312</ispartof><rights>Copyright © 2014 Institute for Operations Research and the Management Sciences</rights><rights>COPYRIGHT 2014 Institute for Operations Research and the Management Sciences</rights><rights>Copyright Institute for Operations Research and the Management Sciences May 2014</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c639t-9dde460a34cabf8767a2e035cec10824ff85b71db7a3f1fe73574171eaaa053a3</citedby><cites>FETCH-LOGICAL-c639t-9dde460a34cabf8767a2e035cec10824ff85b71db7a3f1fe73574171eaaa053a3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://www.jstor.org/stable/pdf/43666638$$EPDF$$P50$$Gjstor$$H</linktopdf><linktohtml>$$Uhttps://pubsonline.informs.org/doi/full/10.1287/trsc.2013.0471$$EHTML$$P50$$Ginforms$$H</linktohtml><link.rule.ids>314,780,784,803,3692,27924,27925,58017,58250,62616</link.rule.ids></links><search><creatorcontrib>Brouer, Berit D.</creatorcontrib><creatorcontrib>Alvarez, J. Fernando</creatorcontrib><creatorcontrib>Plum, Christian E. M.</creatorcontrib><creatorcontrib>Pisinger, David</creatorcontrib><creatorcontrib>Sigurd, Mikkel M.</creatorcontrib><title>A Base Integer Programming Model and Benchmark Suite for Liner-Shipping Network Design</title><title>Transportation science</title><description>The liner-shipping network design problem is to create a set of nonsimple cyclic sailing routes for a designated fleet of container vessels that jointly transports multiple commodities. The objective is to maximize the revenue of cargo transport while minimizing the costs of operation. The potential for making cost-effective and energy-efficient liner-shipping networks using operations research (OR) is huge and neglected. The implementation of logistic planning tools based upon OR has enhanced performance of airlines, railways, and general transportation companies, but within the field of liner shipping, applications of OR are scarce. We believe that access to domain knowledge and data is a barrier for researchers to approach the important liner-shipping network design problem. The purpose of the benchmark suite and the paper at hand is to provide easy access to the domain and the data sources of liner shipping for OR researchers in general. We describe and analyze the liner-shipping domain applied to network design and present a rich integer programming model based on services that constitute the fixed schedule of a liner shipping company. We prove the liner-shipping network design problem to be strongly NP-hard. A benchmark suite of data instances to reflect the business structure of a global liner shipping network is presented. The design of the benchmark suite is discussed in relation to industry standards, business rules, and mathematical programming. The data are based on real-life data from the largest global liner-shipping company, Maersk Line, and supplemented by data from several industry and public stakeholders. Computational results yielding the first best known solutions for six of the seven benchmark instances is provided using a heuristic combining tabu search and heuristic column generation.</description><subject>Analysis</subject><subject>Canals</subject><subject>Capacity costs</subject><subject>Carbon footprint</subject><subject>Consumption</subject><subject>Costs</subject><subject>Economic aspects</subject><subject>Freight</subject><subject>Freight forwarding</subject><subject>Heuristic</subject><subject>Heuristics</subject><subject>Integer programming</subject><subject>Liner shipping</subject><subject>Logistics</subject><subject>Management</subject><subject>Mathematical optimization</subject><subject>Mathematical programming</subject><subject>network design</subject><subject>Port capacity</subject><subject>Ports</subject><subject>Sailing</subject><subject>Sea transport</subject><subject>Shipment of goods</subject><subject>Shipping industry</subject><subject>Stakeholder</subject><subject>Studies</subject><subject>Transport costs</subject><subject>Transport infrastructure</subject><subject>Transport planning</subject><subject>Transportation demand</subject><subject>Transportation planning</subject><subject>Transshipment</subject><issn>0041-1655</issn><issn>1526-5447</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2014</creationdate><recordtype>article</recordtype><sourceid>N95</sourceid><recordid>eNqFks9rHCEcxaU00G3aa28FoZceOlsddZw9btJfgU1aSNuruM7XWbczulWHkP--DilNWxaioCCf99DnQ-gFJUtat_Jtjsksa0LZknBJH6EFFXVTCc7lY7QghNOKNkI8QU9T2hNChaRigb6v8ZlOgC98hh4i_hJDH_U4Ot_jy9DBgLXv8Bl4sxt1_IGvJ5cB2xDxxnmI1fXOHQ4zfAX5JhTgHSTX-2foxOohwfPf-yn69uH91_NP1ebzx4vz9aYyDVvlatV1wBuiGTd6a1vZSF0DYcKAoaStubWt2ErabaVmllqQTEhOJQWtNRFMs1P0-s73EMPPCVJWo0sGhkF7CFNStGkZaclK0oK--g_dhyn6cjtVgirMqqRzT_V6AOW8DTlqM5uqNZOEcy5qXqjqCNVDSUQPwYN15fgffnmEL7OD0Zmjgjd_CbZTKmGnspRsdzn1ekrpqL-JIaUIVh2iK_91qyhRcznUXA41l0PN5SiCl3eCfcoh_qE5a8pg7f0D57vGMT3k9wtjb8Jt</recordid><startdate>20140501</startdate><enddate>20140501</enddate><creator>Brouer, Berit D.</creator><creator>Alvarez, J. Fernando</creator><creator>Plum, Christian E. M.</creator><creator>Pisinger, David</creator><creator>Sigurd, Mikkel M.</creator><general>INFORMS</general><general>Transportation Science &amp; Logistic Society of the Institute for Operations Research and Management Sciences</general><general>Institute for Operations Research and the Management Sciences</general><scope>AAYXX</scope><scope>CITATION</scope><scope>N95</scope><scope>XI7</scope><scope>8BJ</scope><scope>FQK</scope><scope>JBE</scope></search><sort><creationdate>20140501</creationdate><title>A Base Integer Programming Model and Benchmark Suite for Liner-Shipping Network Design</title><author>Brouer, Berit D. ; Alvarez, J. Fernando ; Plum, Christian E. M. ; Pisinger, David ; Sigurd, Mikkel M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c639t-9dde460a34cabf8767a2e035cec10824ff85b71db7a3f1fe73574171eaaa053a3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2014</creationdate><topic>Analysis</topic><topic>Canals</topic><topic>Capacity costs</topic><topic>Carbon footprint</topic><topic>Consumption</topic><topic>Costs</topic><topic>Economic aspects</topic><topic>Freight</topic><topic>Freight forwarding</topic><topic>Heuristic</topic><topic>Heuristics</topic><topic>Integer programming</topic><topic>Liner shipping</topic><topic>Logistics</topic><topic>Management</topic><topic>Mathematical optimization</topic><topic>Mathematical programming</topic><topic>network design</topic><topic>Port capacity</topic><topic>Ports</topic><topic>Sailing</topic><topic>Sea transport</topic><topic>Shipment of goods</topic><topic>Shipping industry</topic><topic>Stakeholder</topic><topic>Studies</topic><topic>Transport costs</topic><topic>Transport infrastructure</topic><topic>Transport planning</topic><topic>Transportation demand</topic><topic>Transportation planning</topic><topic>Transshipment</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Brouer, Berit D.</creatorcontrib><creatorcontrib>Alvarez, J. Fernando</creatorcontrib><creatorcontrib>Plum, Christian E. M.</creatorcontrib><creatorcontrib>Pisinger, David</creatorcontrib><creatorcontrib>Sigurd, Mikkel M.</creatorcontrib><collection>CrossRef</collection><collection>Gale Business: Insights</collection><collection>Business Insights: Essentials</collection><collection>International Bibliography of the Social Sciences (IBSS)</collection><collection>International Bibliography of the Social Sciences</collection><collection>International Bibliography of the Social Sciences</collection><jtitle>Transportation science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Brouer, Berit D.</au><au>Alvarez, J. Fernando</au><au>Plum, Christian E. M.</au><au>Pisinger, David</au><au>Sigurd, Mikkel M.</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Base Integer Programming Model and Benchmark Suite for Liner-Shipping Network Design</atitle><jtitle>Transportation science</jtitle><date>2014-05-01</date><risdate>2014</risdate><volume>48</volume><issue>2</issue><spage>281</spage><epage>312</epage><pages>281-312</pages><issn>0041-1655</issn><eissn>1526-5447</eissn><abstract>The liner-shipping network design problem is to create a set of nonsimple cyclic sailing routes for a designated fleet of container vessels that jointly transports multiple commodities. The objective is to maximize the revenue of cargo transport while minimizing the costs of operation. The potential for making cost-effective and energy-efficient liner-shipping networks using operations research (OR) is huge and neglected. The implementation of logistic planning tools based upon OR has enhanced performance of airlines, railways, and general transportation companies, but within the field of liner shipping, applications of OR are scarce. We believe that access to domain knowledge and data is a barrier for researchers to approach the important liner-shipping network design problem. The purpose of the benchmark suite and the paper at hand is to provide easy access to the domain and the data sources of liner shipping for OR researchers in general. We describe and analyze the liner-shipping domain applied to network design and present a rich integer programming model based on services that constitute the fixed schedule of a liner shipping company. We prove the liner-shipping network design problem to be strongly NP-hard. A benchmark suite of data instances to reflect the business structure of a global liner shipping network is presented. The design of the benchmark suite is discussed in relation to industry standards, business rules, and mathematical programming. The data are based on real-life data from the largest global liner-shipping company, Maersk Line, and supplemented by data from several industry and public stakeholders. Computational results yielding the first best known solutions for six of the seven benchmark instances is provided using a heuristic combining tabu search and heuristic column generation.</abstract><cop>Baltimore</cop><pub>INFORMS</pub><doi>10.1287/trsc.2013.0471</doi><tpages>32</tpages><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 0041-1655
ispartof Transportation science, 2014-05, Vol.48 (2), p.281-312
issn 0041-1655
1526-5447
language eng
recordid cdi_gale_infotracmisc_A370444524
source Informs; EBSCOhost Business Source Complete; JSTOR Archive Collection A-Z Listing
subjects Analysis
Canals
Capacity costs
Carbon footprint
Consumption
Costs
Economic aspects
Freight
Freight forwarding
Heuristic
Heuristics
Integer programming
Liner shipping
Logistics
Management
Mathematical optimization
Mathematical programming
network design
Port capacity
Ports
Sailing
Sea transport
Shipment of goods
Shipping industry
Stakeholder
Studies
Transport costs
Transport infrastructure
Transport planning
Transportation demand
Transportation planning
Transshipment
title A Base Integer Programming Model and Benchmark Suite for Liner-Shipping Network Design
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-23T09%3A15%3A18IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-gale_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Base%20Integer%20Programming%20Model%20and%20Benchmark%20Suite%20for%20Liner-Shipping%20Network%20Design&rft.jtitle=Transportation%20science&rft.au=Brouer,%20Berit%20D.&rft.date=2014-05-01&rft.volume=48&rft.issue=2&rft.spage=281&rft.epage=312&rft.pages=281-312&rft.issn=0041-1655&rft.eissn=1526-5447&rft_id=info:doi/10.1287/trsc.2013.0471&rft_dat=%3Cgale_cross%3EA370444524%3C/gale_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=1528099655&rft_id=info:pmid/&rft_galeid=A370444524&rft_jstor_id=43666638&rfr_iscdi=true