Loading…

Bunker fuel cost and freight revenue optimization for a single liner shipping service

•We consider bunker fuel cost and freight revenue jointly and the optimization is more detailed and precise than other studies. Our study can provide specific strategy about sailing, bunkering and loading for a single shipping liner service.•In view of the nonlinearity of the original model, we give...

Full description

Saved in:
Bibliographic Details
Published in:Computers & operations research 2019-11, Vol.111, p.67-83
Main Authors: Wang, Sainan, Gao, Suixiang, Tan, Tunzi, Yang, Wenguo
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c357t-d58c7305b29845dfad16ccad4b9190ac96cffa204338a5c13ae259f7ae0c9c123
cites cdi_FETCH-LOGICAL-c357t-d58c7305b29845dfad16ccad4b9190ac96cffa204338a5c13ae259f7ae0c9c123
container_end_page 83
container_issue
container_start_page 67
container_title Computers & operations research
container_volume 111
creator Wang, Sainan
Gao, Suixiang
Tan, Tunzi
Yang, Wenguo
description •We consider bunker fuel cost and freight revenue jointly and the optimization is more detailed and precise than other studies. Our study can provide specific strategy about sailing, bunkering and loading for a single shipping liner service.•In view of the nonlinearity of the original model, we give a mixed-integer linear programming model and prove that it can provide feasible solutions for the original nonlinear model.•The case study demonstrates our model can indeed obtain good quality solutions. This paper aims to maximize the freight revenue minus bunker fuel cost for a single liner shipping service. This optimization contains the determination of the sailing speeds, bunkering strategy, and shipment strategy. We first formulate this optimization problem as a mixed-integer nonlinear programming model and then make some transformations to linearize the nonlinear terms. The transformed model is a mixed-integer linear programming model and provides an upper bound for the original model. We then construct another mixed-integer linear programming model and prove that its any optimal solution can be transformed into a feasible solution of the original model. In case studies, the proposed models are applied to two real liner service routes and the computational results demonstrate the efficiency and effectiveness of our solution method. Some insights from numerical experiments are provided in the end.
doi_str_mv 10.1016/j.cor.2019.06.003
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_2287979037</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0305054819301637</els_id><sourcerecordid>2287979037</sourcerecordid><originalsourceid>FETCH-LOGICAL-c357t-d58c7305b29845dfad16ccad4b9190ac96cffa204338a5c13ae259f7ae0c9c123</originalsourceid><addsrcrecordid>eNp9kE1LxDAQhoMouK7-AG8Bz635aJsGT7r4BQteXPAWsulkN7Xb1KRd0F9vlvXsXAaG95kZHoSuKckpodVtmxsfckaozEmVE8JP0IzWgmeiKj9O0YxwUmakLOpzdBFjS1IJRmdo9TD1nxCwnaDDxscR677BNoDbbEccYA_9BNgPo9u5Hz0632PrA9Y4un7TAe5cn-i4dcOQBjhC2DsDl-jM6i7C1V-fo9XT4_viJVu-Pb8u7peZ4aUYs6asjUiPrZmsi7KxuqGVMbop1pJKoo2sjLWakYLzWpeGcg2slFZoIEYayvgc3Rz3DsF_TRBH1fop9OmkYqwWUkjCRUrRY8oEH2MAq4bgdjp8K0rUwZ5qVbKnDvYUqVSyl5i7IwPp_b2DoKJx0BtoXAAzqsa7f-hf0Hh4yg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2287979037</pqid></control><display><type>article</type><title>Bunker fuel cost and freight revenue optimization for a single liner shipping service</title><source>ScienceDirect Freedom Collection 2022-2024</source><creator>Wang, Sainan ; Gao, Suixiang ; Tan, Tunzi ; Yang, Wenguo</creator><creatorcontrib>Wang, Sainan ; Gao, Suixiang ; Tan, Tunzi ; Yang, Wenguo</creatorcontrib><description>•We consider bunker fuel cost and freight revenue jointly and the optimization is more detailed and precise than other studies. Our study can provide specific strategy about sailing, bunkering and loading for a single shipping liner service.•In view of the nonlinearity of the original model, we give a mixed-integer linear programming model and prove that it can provide feasible solutions for the original nonlinear model.•The case study demonstrates our model can indeed obtain good quality solutions. This paper aims to maximize the freight revenue minus bunker fuel cost for a single liner shipping service. This optimization contains the determination of the sailing speeds, bunkering strategy, and shipment strategy. We first formulate this optimization problem as a mixed-integer nonlinear programming model and then make some transformations to linearize the nonlinear terms. The transformed model is a mixed-integer linear programming model and provides an upper bound for the original model. We then construct another mixed-integer linear programming model and prove that its any optimal solution can be transformed into a feasible solution of the original model. In case studies, the proposed models are applied to two real liner service routes and the computational results demonstrate the efficiency and effectiveness of our solution method. Some insights from numerical experiments are provided in the end.</description><identifier>ISSN: 0305-0548</identifier><identifier>EISSN: 1873-765X</identifier><identifier>EISSN: 0305-0548</identifier><identifier>DOI: 10.1016/j.cor.2019.06.003</identifier><language>eng</language><publisher>New York: Elsevier Ltd</publisher><subject>Bunker fuel cost ; Bunkering ; Bunkers (fuel) ; Feasibility studies ; Freight revenue ; Fuels ; Integer programming ; Integers ; Linear programming ; Liner shipping service ; Mathematical programming ; Nonlinear programming ; Operations research ; Optimization ; Production scheduling ; Revenue ; Sailing ; Sailing speed ; Shipment ; Shipping ; Shipping industry ; Upper bounds</subject><ispartof>Computers &amp; operations research, 2019-11, Vol.111, p.67-83</ispartof><rights>2019 Elsevier Ltd</rights><rights>Copyright Pergamon Press Inc. Nov 2019</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c357t-d58c7305b29845dfad16ccad4b9190ac96cffa204338a5c13ae259f7ae0c9c123</citedby><cites>FETCH-LOGICAL-c357t-d58c7305b29845dfad16ccad4b9190ac96cffa204338a5c13ae259f7ae0c9c123</cites><orcidid>0000-0002-8195-2139</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,780,784,27924,27925</link.rule.ids></links><search><creatorcontrib>Wang, Sainan</creatorcontrib><creatorcontrib>Gao, Suixiang</creatorcontrib><creatorcontrib>Tan, Tunzi</creatorcontrib><creatorcontrib>Yang, Wenguo</creatorcontrib><title>Bunker fuel cost and freight revenue optimization for a single liner shipping service</title><title>Computers &amp; operations research</title><description>•We consider bunker fuel cost and freight revenue jointly and the optimization is more detailed and precise than other studies. Our study can provide specific strategy about sailing, bunkering and loading for a single shipping liner service.•In view of the nonlinearity of the original model, we give a mixed-integer linear programming model and prove that it can provide feasible solutions for the original nonlinear model.•The case study demonstrates our model can indeed obtain good quality solutions. This paper aims to maximize the freight revenue minus bunker fuel cost for a single liner shipping service. This optimization contains the determination of the sailing speeds, bunkering strategy, and shipment strategy. We first formulate this optimization problem as a mixed-integer nonlinear programming model and then make some transformations to linearize the nonlinear terms. The transformed model is a mixed-integer linear programming model and provides an upper bound for the original model. We then construct another mixed-integer linear programming model and prove that its any optimal solution can be transformed into a feasible solution of the original model. In case studies, the proposed models are applied to two real liner service routes and the computational results demonstrate the efficiency and effectiveness of our solution method. Some insights from numerical experiments are provided in the end.</description><subject>Bunker fuel cost</subject><subject>Bunkering</subject><subject>Bunkers (fuel)</subject><subject>Feasibility studies</subject><subject>Freight revenue</subject><subject>Fuels</subject><subject>Integer programming</subject><subject>Integers</subject><subject>Linear programming</subject><subject>Liner shipping service</subject><subject>Mathematical programming</subject><subject>Nonlinear programming</subject><subject>Operations research</subject><subject>Optimization</subject><subject>Production scheduling</subject><subject>Revenue</subject><subject>Sailing</subject><subject>Sailing speed</subject><subject>Shipment</subject><subject>Shipping</subject><subject>Shipping industry</subject><subject>Upper bounds</subject><issn>0305-0548</issn><issn>1873-765X</issn><issn>0305-0548</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2019</creationdate><recordtype>article</recordtype><recordid>eNp9kE1LxDAQhoMouK7-AG8Bz635aJsGT7r4BQteXPAWsulkN7Xb1KRd0F9vlvXsXAaG95kZHoSuKckpodVtmxsfckaozEmVE8JP0IzWgmeiKj9O0YxwUmakLOpzdBFjS1IJRmdo9TD1nxCwnaDDxscR677BNoDbbEccYA_9BNgPo9u5Hz0632PrA9Y4un7TAe5cn-i4dcOQBjhC2DsDl-jM6i7C1V-fo9XT4_viJVu-Pb8u7peZ4aUYs6asjUiPrZmsi7KxuqGVMbop1pJKoo2sjLWakYLzWpeGcg2slFZoIEYayvgc3Rz3DsF_TRBH1fop9OmkYqwWUkjCRUrRY8oEH2MAq4bgdjp8K0rUwZ5qVbKnDvYUqVSyl5i7IwPp_b2DoKJx0BtoXAAzqsa7f-hf0Hh4yg</recordid><startdate>20191101</startdate><enddate>20191101</enddate><creator>Wang, Sainan</creator><creator>Gao, Suixiang</creator><creator>Tan, Tunzi</creator><creator>Yang, Wenguo</creator><general>Elsevier Ltd</general><general>Pergamon Press Inc</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope><orcidid>https://orcid.org/0000-0002-8195-2139</orcidid></search><sort><creationdate>20191101</creationdate><title>Bunker fuel cost and freight revenue optimization for a single liner shipping service</title><author>Wang, Sainan ; Gao, Suixiang ; Tan, Tunzi ; Yang, Wenguo</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c357t-d58c7305b29845dfad16ccad4b9190ac96cffa204338a5c13ae259f7ae0c9c123</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2019</creationdate><topic>Bunker fuel cost</topic><topic>Bunkering</topic><topic>Bunkers (fuel)</topic><topic>Feasibility studies</topic><topic>Freight revenue</topic><topic>Fuels</topic><topic>Integer programming</topic><topic>Integers</topic><topic>Linear programming</topic><topic>Liner shipping service</topic><topic>Mathematical programming</topic><topic>Nonlinear programming</topic><topic>Operations research</topic><topic>Optimization</topic><topic>Production scheduling</topic><topic>Revenue</topic><topic>Sailing</topic><topic>Sailing speed</topic><topic>Shipment</topic><topic>Shipping</topic><topic>Shipping industry</topic><topic>Upper bounds</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wang, Sainan</creatorcontrib><creatorcontrib>Gao, Suixiang</creatorcontrib><creatorcontrib>Tan, Tunzi</creatorcontrib><creatorcontrib>Yang, Wenguo</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science 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><jtitle>Computers &amp; operations research</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wang, Sainan</au><au>Gao, Suixiang</au><au>Tan, Tunzi</au><au>Yang, Wenguo</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Bunker fuel cost and freight revenue optimization for a single liner shipping service</atitle><jtitle>Computers &amp; operations research</jtitle><date>2019-11-01</date><risdate>2019</risdate><volume>111</volume><spage>67</spage><epage>83</epage><pages>67-83</pages><issn>0305-0548</issn><eissn>1873-765X</eissn><eissn>0305-0548</eissn><abstract>•We consider bunker fuel cost and freight revenue jointly and the optimization is more detailed and precise than other studies. Our study can provide specific strategy about sailing, bunkering and loading for a single shipping liner service.•In view of the nonlinearity of the original model, we give a mixed-integer linear programming model and prove that it can provide feasible solutions for the original nonlinear model.•The case study demonstrates our model can indeed obtain good quality solutions. This paper aims to maximize the freight revenue minus bunker fuel cost for a single liner shipping service. This optimization contains the determination of the sailing speeds, bunkering strategy, and shipment strategy. We first formulate this optimization problem as a mixed-integer nonlinear programming model and then make some transformations to linearize the nonlinear terms. The transformed model is a mixed-integer linear programming model and provides an upper bound for the original model. We then construct another mixed-integer linear programming model and prove that its any optimal solution can be transformed into a feasible solution of the original model. In case studies, the proposed models are applied to two real liner service routes and the computational results demonstrate the efficiency and effectiveness of our solution method. Some insights from numerical experiments are provided in the end.</abstract><cop>New York</cop><pub>Elsevier Ltd</pub><doi>10.1016/j.cor.2019.06.003</doi><tpages>17</tpages><orcidid>https://orcid.org/0000-0002-8195-2139</orcidid></addata></record>
fulltext fulltext
identifier ISSN: 0305-0548
ispartof Computers & operations research, 2019-11, Vol.111, p.67-83
issn 0305-0548
1873-765X
0305-0548
language eng
recordid cdi_proquest_journals_2287979037
source ScienceDirect Freedom Collection 2022-2024
subjects Bunker fuel cost
Bunkering
Bunkers (fuel)
Feasibility studies
Freight revenue
Fuels
Integer programming
Integers
Linear programming
Liner shipping service
Mathematical programming
Nonlinear programming
Operations research
Optimization
Production scheduling
Revenue
Sailing
Sailing speed
Shipment
Shipping
Shipping industry
Upper bounds
title Bunker fuel cost and freight revenue optimization for a single liner shipping service
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-29T09%3A28%3A27IST&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=Bunker%20fuel%20cost%20and%20freight%20revenue%20optimization%20for%20a%20single%20liner%20shipping%20service&rft.jtitle=Computers%20&%20operations%20research&rft.au=Wang,%20Sainan&rft.date=2019-11-01&rft.volume=111&rft.spage=67&rft.epage=83&rft.pages=67-83&rft.issn=0305-0548&rft.eissn=1873-765X&rft_id=info:doi/10.1016/j.cor.2019.06.003&rft_dat=%3Cproquest_cross%3E2287979037%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c357t-d58c7305b29845dfad16ccad4b9190ac96cffa204338a5c13ae259f7ae0c9c123%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2287979037&rft_id=info:pmid/&rfr_iscdi=true