DC FieldValueLanguage
dc.contributor.authorAlfandari, Laurenten
dc.contributor.authorDavidović, Tatjanaen
dc.contributor.authorFurini, Fabioen
dc.contributor.authorLjubić, Ivanaen
dc.contributor.authorMaraš, Vladislaven
dc.contributor.authorMartin, Sébastienen
dc.date.accessioned2020-04-03T08:16:01Z-
dc.date.available2020-04-03T08:16:01Z-
dc.date.issued2019-01-01en
dc.identifier.issn0305-0483en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/245-
dc.description.abstractThis paper addresses the problem of optimal planning of a liner service for a barge container shipping company. Given estimated weekly demands between pairs of ports, our goal is to determine the subset of ports to be called and the amount of containers to be shipped between each pair of ports, so as to maximize the profit of the shipping company. In order to save possible leasing or storage costs of empty containers at the respective ports, our approach takes into account the repositioning of empty containers. The line has to follow the outbound–inbound principle, starting from the port at the river mouth. We propose a novel integrated approach in which the shipping company can simultaneously optimize the route (along with repositioning of empty containers), the choice of the final port, length of the turnaround time and the size of its fleet. To solve this problem, a new mixed integer programming model is proposed. On the publicly available set of benchmark instances for barge container routing, we demonstrate that this model provides very tight dual bounds and significantly outperforms the existing approaches from the literature for splittable demands. We also show how to further improve this model by projecting out arc variables for modeling the shipping of empty containers. Our numerical study indicates that the latter model improves the computing times for the challenging case of unsplittable demands. We also study the impact of the turnaround time optimization on the total profit of the company.en
dc.publisherElsevier-
dc.relationCampus France-
dc.relationGraph theory and mathematical programming with applications in chemistry and computer science-
dc.relationSoftware development and national database for strategic management and development of transportation means and infrastructure in road, rail, air and inland waterways transport using the European transport network models-
dc.relationPavle Savić programme for years 2016/17-
dc.relation.ispartofOmega (United Kingdom)en
dc.subjectBarge Container Ship Routing | Empty container repositioning | Inland waterway transport | Integer linear programming | Liner shipping network designen
dc.titleTighter MIP models for Barge Container Ship Routingen
dc.typeArticleen
dc.identifier.doi10.1016/j.omega.2017.12.002en
dc.identifier.scopus2-s2.0-85038865329en
dc.relation.grantno36257TL-
dc.relation.grantno174033-
dc.relation.grantno36027-
dc.relation.grantno451-03-39/2016/09/09-
dc.relation.firstpage38en
dc.relation.lastpage54en
dc.relation.volume82en
dc.description.rankM21a-
item.cerifentitytypePublications-
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.orcid0000-0001-9561-5339-
crisitem.project.funderNSF-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/174033e.php-
crisitem.project.fundingProgramDirectorate for Computer & Information Science & Engineering-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/Directorate for Computer & Information Science & Engineering/1740333-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/null/7360270-
Show simple item record

SCOPUSTM   
Citations

27
checked on Jul 14, 2024

Page view(s)

75
checked on May 9, 2024

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.