A matheuristic for the liner shipping network design problem

Publication: Research - peer-reviewArticle in proceedings – Annual report year: 2012

Documents

View graph of relations

We present a matheuristic, an integer programming based heuristic, for the Liner Shipping Network Design Problem. The heuristic applies a greedy construction heuristic based on an interpretation of the liner shipping network design problem as a multiple quadratic knapsack problem. The construction heuristic is combined with an improvement heuristic with a neighborhood defined by the solution space of a mixed integer program. The mixed integer program optimizes the removal and insertion of several port calls on a liner shipping service. The objective function is based on evaluation functions for revenue and transshipment of cargo along with in/decrease of vessel- and operational cost for the current solution. The evaluation functions may be used by heuristics in general to evaluate changes to a network design without solving a large scale multicommodity flow problem.
Original languageEnglish
Title of host publicationElectronic Proceedings of LOGMS 2012
Number of pages12
PublisherUniversität Bremen
Publication date2012
StatePublished

Conference

ConferenceThe second International Conference on Logistics and Maritime Systems
CountryGermany
CityBremen
Period22/08/1224/08/12

Keywords

  • Liner shipping, Matheuristic, Network design, Mathematical programming
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

Download statistics

No data available

ID: 10144923