Semi-liner Shipping Service Design

Semi-liner shipping transports various types of cargo, such as containers, break-bulk cargo, and heavy-lift project cargo, between different ports. Similar to liner shipping, semi-liner shipping publishes shipping routes for customers’ reference. However, it does not strictly follow the published ro...

Full description

Saved in:
Bibliographic Details
Published inTransportation science Vol. 54; no. 5; pp. 1288 - 1306
Main Authors Wang, Yadong, Meng, Qiang
Format Journal Article
LanguageEnglish
Published Baltimore INFORMS 01.09.2020
Institute for Operations Research and the Management Sciences
Subjects
Online AccessGet full text
ISSN0041-1655
1526-5447
DOI10.1287/trsc.2019.0939

Cover

Abstract Semi-liner shipping transports various types of cargo, such as containers, break-bulk cargo, and heavy-lift project cargo, between different ports. Similar to liner shipping, semi-liner shipping publishes shipping routes for customers’ reference. However, it does not strictly follow the published route and usually makes some adjustments for each ship voyage by adding some port calls to transport more cargo considering the excess ship capacity. This study first proposes the semi-liner shipping service design (SLSSD) problem that aims to maximize the shipping profit by determining a shipping route subject to the potential adjustments. The proposed SLSSD problem is subsequently formulated as a two-stage stochastic mixed integer programming model with integer recourse variables. The first stage determines the visit sequence of a set of compulsory ports under shipping demand uncertainty. The second stage decides whether to add or remove some ports in the route in view of the realized shipping demand for each ship voyage. To effectively solve the model, two decomposition methods are developed, namely, the stage decomposition method and the scenario decomposition method, that decompose the problem by stage and demand scenario, respectively. In addition, two novel acceleration techniques are also provided to expedite the scenario decomposition method. Numerical experiments reveal satisfactory efficiency of these two methods to solve the semi-liner shipping service design problem, especially the scenario decomposition method, which is generally better than the stage decomposition method and can be thousands of times faster than the classic branch-and-cut algorithm.
AbstractList Semi-liner shipping transports various types of cargo, such as containers, break-bulk cargo, and heavy-lift project cargo, between different ports. Similar to liner shipping, semi-liner shipping publishes shipping routes for customers’ reference. However, it does not strictly follow the published route and usually makes some adjustments for each ship voyage by adding some port calls to transport more cargo considering the excess ship capacity. This study first proposes the semi-liner shipping service design (SLSSD) problem that aims to maximize the shipping profit by determining a shipping route subject to the potential adjustments. The proposed SLSSD problem is subsequently formulated as a two-stage stochastic mixed integer programming model with integer recourse variables. The first stage determines the visit sequence of a set of compulsory ports under shipping demand uncertainty. The second stage decides whether to add or remove some ports in the route in view of the realized shipping demand for each ship voyage. To effectively solve the model, two decomposition methods are developed, namely, the stage decomposition method and the scenario decomposition method, that decompose the problem by stage and demand scenario, respectively. In addition, two novel acceleration techniques are also provided to expedite the scenario decomposition method. Numerical experiments reveal satisfactory efficiency of these two methods to solve the semi-liner shipping service design problem, especially the scenario decomposition method, which is generally better than the stage decomposition method and can be thousands of times faster than the classic branch-and-cut algorithm.
Author Meng, Qiang
Wang, Yadong
Author_xml – sequence: 1
  givenname: Yadong
  surname: Wang
  fullname: Wang, Yadong
  organization: School of Economics and Management, Nanjing University of Science and Technology, 210094 Nanjing, China
– sequence: 2
  givenname: Qiang
  orcidid: 0000-0003-4507-8947
  surname: Meng
  fullname: Meng, Qiang
  organization: Department of Civil and Environmental Engineering, National University of Singapore, Singapore 117576;, Institute of Operations Research and Analytics, National University of Singapore, Singapore 119077
BookMark eNqFkE1LAzEQhoNUsK1ePRc9Z5187uYo9RMKHqrnkM0mNaXNrslW8N-7Sz0J4mGYy_vMOzwzNIltdAhdEigIrcqbPmVbUCCqAMXUCZoSQSUWnJcTNAXgBBMpxBma5bwFIKIkYoqu1m4f8C5Elxbr99B1IW4Wa5c-g3WLO5fDJp6jU2922V387Dl6e7h_XT7h1cvj8_J2hS1jZY8NKFWDNLyWpfM1Nw1roBmKnLSVtPXwFPXEKSO9NEz6qqK2IQ0jVKphPJuj6-PdLrUfB5d7vW0PKQ6VmnIBpaIAckgVx5RNbc7Jed2lsDfpSxPQowc9etCjBz16GAD-C7ChN31oY59M2P2N4SMWom_TPv9X8w1-_3GR
CitedBy_id crossref_primary_10_1016_j_ejor_2020_09_032
crossref_primary_10_1287_trsc_2023_0278
crossref_primary_10_1016_j_tre_2022_102919
crossref_primary_10_1016_j_ejor_2024_01_035
crossref_primary_10_1016_j_trb_2021_10_014
crossref_primary_10_1016_j_trb_2021_02_008
crossref_primary_10_1016_j_trb_2022_11_011
crossref_primary_10_1111_poms_14022
crossref_primary_10_1016_j_tre_2021_102365
crossref_primary_10_1016_j_trb_2024_102929
crossref_primary_10_1080_00207543_2024_2403116
Cites_doi 10.1016/j.cor.2003.11.012
10.1287/trsc.2017.0808
10.1016/j.trb.2018.08.016
10.1016/0167-6377(93)90002-X
10.1016/j.tre.2016.03.010
10.1016/j.tre.2019.06.010
10.1287/trsc.2013.0471
10.1016/j.cor.2013.08.014
10.1016/j.cor.2013.11.018
10.1016/j.cor.2012.06.011
10.1287/trsc.1070.0205
10.1287/trsc.25.3.201
10.1287/trsc.1100.0317
10.1287/trsc.1030.0036
10.1016/S0377-2217(01)00110-2
10.1016/j.trb.2014.11.008
10.1007/s13676-013-0039-8
10.1287/trsc.2015.0625
10.1287/ijoc.2016.0695
10.1016/j.trb.2015.10.003
10.1016/j.tre.2015.01.005
10.1016/j.ejor.2012.12.002
10.1016/j.trc.2014.12.010
10.1016/j.orl.2004.03.007
10.1057/mel.2009.5
10.1287/trsc.2013.0461
10.1016/j.trc.2010.05.001
10.1016/j.trb.2013.06.012
10.1080/0308883042000259819
10.1016/S0377-2217(99)00272-6
10.1016/j.ejor.2016.12.005
ContentType Journal Article
Copyright Copyright Institute for Operations Research and the Management Sciences Sep/Oct 2020
Copyright_xml – notice: Copyright Institute for Operations Research and the Management Sciences Sep/Oct 2020
DBID AAYXX
CITATION
8BJ
FQK
JBE
DOI 10.1287/trsc.2019.0939
DatabaseName CrossRef
International Bibliography of the Social Sciences (IBSS)
International Bibliography of the Social Sciences
International Bibliography of the Social Sciences
DatabaseTitle CrossRef
International Bibliography of the Social Sciences (IBSS)
DatabaseTitleList
CrossRef
International Bibliography of the Social Sciences (IBSS)
DeliveryMethod fulltext_linktorsrc
Discipline Economics
Engineering
EISSN 1526-5447
EndPage 1306
ExternalDocumentID 10_1287_trsc_2019_0939
trsc20190939
Genre Research Articles
GroupedDBID 08R
123
1AW
29Q
3V.
4
4.4
4S
7WY
88I
8FE
8FG
8FL
8V8
AAPBV
ABBHK
ABDBF
ABFLS
ABJCF
ABPTK
ABUWG
ACFWO
ACGOD
ACHQT
ACIWK
ACNCT
ADULT
AENEX
AEUPB
AFFNX
AFKRA
AKVCP
ALMA_UNASSIGNED_HOLDINGS
ARCSS
AZQEC
BENPR
BEZIV
BGLVJ
BIPZW
BPHCQ
BXSLM
CS3
DU5
DWQXO
EAD
EAP
EBA
EBR
EBS
EBU
EDO
EJD
EMK
EPL
EST
ESX
FRNLG
GNUQQ
GROUPED_ABI_INFORM_COMPLETE
GROUPED_ABI_INFORM_RESEARCH
HCIFZ
HVGLF
H~9
I-F
IAO
IEA
IOF
ITC
JPL
JSODD
JST
K6
K60
L6V
M0C
M2P
M7S
MV1
N95
NB9
NIEAY
P2P
PQEST
PQQKQ
PQUKI
PRINS
PROAC
PTHSS
REX
RPU
SA0
TAE
TH9
TN5
TUS
WH7
X
XI7
Y99
ZY4
-~X
.-4
.DC
18M
2AX
2XV
AADHG
AAVDF
AAYXX
ABXSQ
ACDEK
ACGFO
ADAAO
AEGXH
AEMOZ
AEOZU
AHIZY
AHQJS
AIAGR
BAAKF
CCPQU
CITATION
EBE
EBO
IPSME
JAAYA
JBMMH
JENOY
JHFFW
JKQEH
JLEZI
JLXEF
K1G
K6~
LPU
PHGZM
PHGZT
PQBIZ
PQBZA
PQGLB
PUEGO
8BJ
FQK
JBE
ID FETCH-LOGICAL-c337t-a099b06a4b67efb4ad3d0d001e6c86cb0932f1e9a6f6a36f882cd1d31269126f3
ISSN 0041-1655
IngestDate Tue Sep 30 07:40:32 EDT 2025
Wed Oct 01 02:34:25 EDT 2025
Thu Apr 24 22:57:27 EDT 2025
Wed Jan 06 02:47:46 EST 2021
IsPeerReviewed true
IsScholarly true
Issue 5
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c337t-a099b06a4b67efb4ad3d0d001e6c86cb0932f1e9a6f6a36f882cd1d31269126f3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0003-4507-8947
PQID 2450792006
PQPubID 37963
PageCount 19
ParticipantIDs crossref_primary_10_1287_trsc_2019_0939
informs_primary_10_1287_trsc_2019_0939
crossref_citationtrail_10_1287_trsc_2019_0939
proquest_journals_2450792006
ProviderPackageCode Y99
RPU
NIEAY
CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2020-09-01
PublicationDateYYYYMMDD 2020-09-01
PublicationDate_xml – month: 09
  year: 2020
  text: 2020-09-01
  day: 01
PublicationDecade 2020
PublicationPlace Baltimore
PublicationPlace_xml – name: Baltimore
PublicationTitle Transportation science
PublicationYear 2020
Publisher INFORMS
Institute for Operations Research and the Management Sciences
Publisher_xml – name: INFORMS
– name: Institute for Operations Research and the Management Sciences
References B20
B21
B22
B23
B24
B25
B26
B27
B28
B29
B30
B31
B10
B32
B11
B33
B12
B34
B13
B35
B14
B15
B16
B17
B18
B19
B1
B2
B3
B4
B5
B6
B7
B8
B9
Ahuja RK (B2) 1993; 1
References_xml – ident: B12
– ident: B9
– ident: B35
– ident: B14
– ident: B10
– ident: B3
– ident: B20
– ident: B1
– ident: B27
– ident: B7
– ident: B5
– ident: B29
– ident: B25
– ident: B23
– ident: B21
– ident: B18
– ident: B16
– ident: B31
– ident: B33
– ident: B8
– ident: B11
– ident: B13
– ident: B2
– ident: B26
– ident: B4
– ident: B28
– ident: B6
– ident: B24
– ident: B22
– ident: B17
– ident: B32
– ident: B15
– ident: B30
– ident: B34
– ident: B19
– ident: B8
  doi: 10.1016/j.cor.2003.11.012
– ident: B25
  doi: 10.1287/trsc.2017.0808
– ident: B33
  doi: 10.1016/j.trb.2018.08.016
– ident: B14
  doi: 10.1016/0167-6377(93)90002-X
– ident: B35
  doi: 10.1016/j.tre.2016.03.010
– ident: B16
  doi: 10.1016/j.tre.2019.06.010
– ident: B5
  doi: 10.1287/trsc.2013.0471
– ident: B29
  doi: 10.1016/j.cor.2013.08.014
– ident: B19
  doi: 10.1016/j.cor.2013.11.018
– ident: B26
  doi: 10.1016/j.cor.2012.06.011
– ident: B1
  doi: 10.1287/trsc.1070.0205
– ident: B21
  doi: 10.1287/trsc.25.3.201
– volume: 1
  volume-title: Network Flows: Theory, Algorithms, and Applications
  year: 1993
  ident: B2
– ident: B12
  doi: 10.1287/trsc.1100.0317
– ident: B6
  doi: 10.1287/trsc.1030.0036
– ident: B11
  doi: 10.1016/S0377-2217(01)00110-2
– ident: B15
  doi: 10.1016/j.trb.2014.11.008
– ident: B28
  doi: 10.1007/s13676-013-0039-8
– ident: B34
  doi: 10.1287/trsc.2015.0625
– ident: B4
  doi: 10.1287/ijoc.2016.0695
– ident: B30
  doi: 10.1016/j.trb.2015.10.003
– ident: B13
  doi: 10.1016/j.tre.2015.01.005
– ident: B7
  doi: 10.1016/j.ejor.2012.12.002
– ident: B10
  doi: 10.1016/j.trc.2014.12.010
– ident: B22
  doi: 10.1016/j.orl.2004.03.007
– ident: B3
  doi: 10.1057/mel.2009.5
– ident: B17
  doi: 10.1287/trsc.2013.0461
– ident: B18
  doi: 10.1016/j.trc.2010.05.001
– ident: B23
  doi: 10.1016/j.trb.2013.06.012
– ident: B9
  doi: 10.1080/0308883042000259819
– ident: B24
  doi: 10.1016/S0377-2217(99)00272-6
– ident: B20
  doi: 10.1016/j.ejor.2016.12.005
SSID ssj0015715
Score 2.3432112
Snippet Semi-liner shipping transports various types of cargo, such as containers, break-bulk cargo, and heavy-lift project cargo, between different ports. Similar to...
SourceID proquest
crossref
informs
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1288
SubjectTerms Adjustment
Algorithms
Cargo capacity
Cargo ships
Container ships
Containers
Customers
Decomposition
Demand
Integer programming
integer recourse variable
Mixed integer
Ports
Route selection
scenario decomposition
Sea transport
semi-liner
Service design
Shipping
Shipping industry
shipping service design
stochastic integer programming
Uncertainty
Title Semi-liner Shipping Service Design
URI https://www.proquest.com/docview/2450792006
Volume 54
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVEBS
  databaseName: Business Source Ultimate
  customDbUrl:
  eissn: 1526-5447
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0015715
  issn: 0041-1655
  databaseCode: AKVCP
  dateStart: 19670201
  isFulltext: true
  titleUrlDefault: https://search.ebscohost.com/login.aspx?authtype=ip,uid&profile=ehost&defaultdb=bsu
  providerName: EBSCOhost
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3db9MwELegE2I8IBigbQwUITQekEvjOE78WA2qwmAMdUPjyYoTextiXWnDC3895_icpmJ8PjSqHCsfd-f7yvl3hDxN0yq2SQVhiRYF5WKQ0LzSObXC2MSw1LIGXf_dgRgf8zcn6UlocY-7S2rdL79fua_kf7gKY8BXt0v2HzjbXhQG4D_wF47AYTj-FY8n5uKcOj9x_nxy1iAtnIbFD4qkLc343DFLjbvd8Bxt3zKj7lf9p6K6RGvW4PL60Q8gRafdDAGEg6EECqPGturAFS6-n5k5FtmF2r62VnNZcRM0SzdhOOCupbQH1e0bVJdM0JR7zMygTz0oNMpN2lGOYArzK7U2c3mPUT1fOEzJWPYH0gMcrcJjj4cTdfhypN6-PtjfnX2lrnOY-8KObVSukzWWCcF6ZG24_3HvsP2WlGbYxwKfH6E74aYvVm-54prc8MC1i59sdON4HN0htzFiiIae_XfJNTPdIDfDhvLFBrnVwZS8R54shSIKQhGhUEReKO6T49Gro70xxUYYtEySrKYFuPF6IAquRWas5kUFq6uCVzOizEWp4eGZjY0shBVFIixETWUVV0nMhISfTR6Q3vRyajZJlEK4LYyWcQmecMa5BCdGytLB8GeFzM0WoYEGqkSUeNes5Ity0SLQTDmaKUcz5Wi2RZ6182ceH-WXM3eRpH-cuBMornCxLRTjELhIl__a_v3ph2R9uQZ2SK-efzOPwG-s9WMUjB_kLm3V
linkProvider EBSCOhost
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Semi-liner+Shipping+Service+Design&rft.jtitle=Transportation+science&rft.au=Wang%2C+Yadong&rft.au=Meng%2C+Qiang&rft.date=2020-09-01&rft.pub=Institute+for+Operations+Research+and+the+Management+Sciences&rft.issn=0041-1655&rft.eissn=1526-5447&rft.volume=54&rft.issue=5&rft.spage=1288&rft_id=info:doi/10.1287%2Ftrsc.2019.0939&rft.externalDBID=HAS_PDF_LINK
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0041-1655&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0041-1655&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0041-1655&client=summon