DC FieldValueLanguage
dc.contributor.authorMaraš, Vladislaven
dc.contributor.authorLazić, Jasminaen
dc.contributor.authorDavidović, Tatjanaen
dc.contributor.authorMladenović, Nenaden
dc.date.accessioned2020-04-03T08:16:03Z-
dc.date.available2020-04-03T08:16:03Z-
dc.date.issued2013-05-29en
dc.identifier.issn1568-4946en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/262-
dc.description.abstractWe investigate the optimization of transport routes of barge container ships with the objective to maximize the profit of a shipping company. This problem consists of determining the upstream and downstream calling sequence and the number of loaded and empty containers transported between any two ports. We present a mixed integer linear programming (MILP) formulation for this problem. The problem is tackled by the commercial CPLEX MIP solver and improved variants of the existing MIP heuristics: Local Branching, Variable Neighborhood Branching and Variable Neighborhood Decomposition Search. It appears that our implementation of Variable Neighborhood Branching outperforms CPLEX MIP solver both regarding the solution quality and the computational time. All other studied heuristics provide results competitive with CPLEX MIP solver within a significantly shorter amount of time. Moreover, we present a detailed case study transportation analysis which illustrates how the proposed approach can be used by managers of barge shipping companies to make appropriate decisions and solve real life problems.en
dc.publisherElsevier-
dc.relationMathematical Modelas and Optimization Methods on Large-Scale Systems-
dc.relationTransport system integration models-
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.relationGraph theory and mathematical programming with applications in chemistry and computer science-
dc.relation.ispartofApplied Soft Computing Journalen
dc.subjectBarge container ships | Empty containers 0-1 mixed integer programming | Meta-heuristics | Routingen
dc.titleRouting of barge container ships by mixed-integer programming heuristicsen
dc.typeArticleen
dc.identifier.doi10.1016/j.asoc.2013.03.003en
dc.identifier.scopus2-s2.0-84878117839en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage3515en
dc.relation.lastpage3528en
dc.relation.issue8en
dc.relation.volume13en
dc.description.rankM21-
item.openairetypeArticle-
item.fulltextNo Fulltext-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.orcid0000-0001-9561-5339-
crisitem.author.orcid0000-0001-6655-0409-
crisitem.project.funderNIH-
crisitem.project.funderNSF-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/174010e.php-
crisitem.project.projectURLhttp://www.mi.sanu.ac.rs/novi_sajt/research/projects/174033e.php-
crisitem.project.fundingProgramDirectorate for Engineering-
crisitem.project.fundingProgramNATIONAL INSTITUTE ON DRUG ABUSE-
crisitem.project.fundingProgramDirectorate for Computer & Information Science & Engineering-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/Directorate for Engineering/1740103-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NIH/NATIONAL INSTITUTE ON DRUG ABUSE/1R21DA036024-01-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/null/7360270-
crisitem.project.openAireinfo:eu-repo/grantAgreement/NSF/Directorate for Computer & Information Science & Engineering/1740333-
Show simple item record

SCOPUSTM   
Citations

32
checked on May 8, 2024

Page view(s)

71
checked on May 8, 2024

Google ScholarTM

Check

Altmetric

Altmetric


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