A Branch and Cut algorithm for the container shipping network design problem

Publication: Research - peer-reviewJournal article – Annual report year: 2011

View graph of relations

The network design problem in liner shipping is of increasing importance in a strongly competitive market where potential cost reductions can influence market share and profits significantly. In this paper the network design and fleet assignment problems are combined into a mixed integer linear programming model minimizing the overall cost. To better reflect the real-life situation we take into account the cost of transhipment, a heterogeneous fleet, route dependant capacities, and butterfly routes. To the best of our knowledge it is the first time an exact solution method to the problem considers transhipment cost. The problem is solved with branch-and-cut using clover and transhipment inequalities. Computational results are reported for instances with up to 15 ports.
Original languageEnglish
JournalFlexible Services and Manufacturing Journal
Publication date2012
Volume24
Journal number3
Pages349-374
DOIs
StatePublished
CitationsWeb of Science® Times Cited: 13

Keywords

  • containers, transhipment, liner shipping, branch and cut
Download as:
Download as PDF
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
PDF
Download as HTML
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
HTML
Download as Word
Select render style:
APAAuthorCBEHarvardMLAStandardVancouverShortLong
Word

ID: 5814250