A 0-1 linear programming formulation for the Berth Assignment Problem

Abstract : —The Berth Allocation Problem (BAP) is the problem of allocating berthing spaces and scheduling container vessels on these spaces so as to minimize total weighted time. We study a version of BAP in which containers are moved between vessels and berth space is abundant. Thus, the problem reduces to optimally assign vessels to berths. We call it the Berth Assignment Problem (BASP). (BASP) is an NP-Complete problem. We formulate it as a non standard Quadratic Assignment Problem, from which a 0-1 linear formulation is derived. Some valid inequalities of the resulting integer programming model are found. Numerical results are shown. Index Terms—Integer Linear Programming, Valid Inequalities, Quadratic Assignment Problem
Document type :
Conference papers
Complete list of metadatas

Contributor : Bibliothèque Universitaire Déposants Hal-Avignon <>
Submitted on : Wednesday, May 18, 2016 - 1:48:48 PM
Last modification on : Saturday, August 17, 2019 - 12:14:02 AM



Serigne Gueye, Sophie Michel, Adnan Yassine. A 0-1 linear programming formulation for the Berth Assignment Problem. 4th International Conference on Logistics , May 2011, Hammamet, Tunisia. ⟨10.1109/LOGISTIQUA.2011.5939402⟩. ⟨hal-01317473⟩



Record views