A matheuristic for the liner shipping network design problem

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

Standard

A matheuristic for the liner shipping network design problem. / Brouer, Berit Dangaard; Desaulniers, Guy.

Electronic Proceedings of LOGMS 2012. Universität Bremen, 2012.

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

Harvard

Brouer, BD & Desaulniers, G 2012, 'A matheuristic for the liner shipping network design problem'. in Electronic Proceedings of LOGMS 2012. Universität Bremen.

APA

Brouer, B. D., & Desaulniers, G. (2012). A matheuristic for the liner shipping network design problem. In Electronic Proceedings of LOGMS 2012. Universität Bremen.

CBE

Brouer BD, Desaulniers G. 2012. A matheuristic for the liner shipping network design problem. In Electronic Proceedings of LOGMS 2012. Universität Bremen.

MLA

Vancouver

Brouer BD, Desaulniers G. A matheuristic for the liner shipping network design problem. In Electronic Proceedings of LOGMS 2012. Universität Bremen. 2012.

Author

Brouer, Berit Dangaard; Desaulniers, Guy / A matheuristic for the liner shipping network design problem.

Electronic Proceedings of LOGMS 2012. Universität Bremen, 2012.

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

Bibtex

@inbook{894991fd288b4a9596a72977fc07a8d6,
title = "A matheuristic for the liner shipping network design problem",
publisher = "Universität Bremen",
author = "Brouer, {Berit Dangaard} and Guy Desaulniers",
year = "2012",
booktitle = "Electronic Proceedings of LOGMS 2012",

}

RIS

TY - GEN

T1 - A matheuristic for the liner shipping network design problem

A1 - Brouer,Berit Dangaard

A1 - Desaulniers,Guy

AU - Brouer,Berit Dangaard

AU - Desaulniers,Guy

PB - Universität Bremen

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

KW - Liner shipping

KW - Matheuristic

KW - Network design

KW - Mathematical programming

BT - Electronic Proceedings of LOGMS 2012

T2 - Electronic Proceedings of LOGMS 2012

ER -