A Lagrangian Relaxation based Heuristic for the Static Berth Allocation Problem using the Cutting Plane Method. 567. Page 4. Figure 1: Cutting Plane Method ...

Dive into the research topics of 'A lagrangian relaxation based heuristic for the static berth allocation problem using the cutting plane method'. Together they ...

S. Simrin A., N. Alkawaleet N. and H. Diabat A.. A Lagrangian Relaxation based Heuristic for the Static Berth Allocation Problem using the Cutting Plane Method.

Since the SBAP is a non-deterministic polynomial-time (NP) problem, we applied a Lagrangian Relaxation heuristic technique with the application of cutting plane ...

A Lagrangian Relaxation based Heuristic for the Static Berth Allocation Problem using the Cutting Plane Method. Authors: A. S. Simrin, N. N. Alkawaleet and ...

Apr 25, 2024 · A Lagrangian Relaxation based Heuristic for the Static Berth Allocation Problem using the Cutting Plane Method. ICEIS (1) 2013: 565-569. [+] ...

A.S. Simrin, N.N. Alkawaleet and A.H. Diabat, A Lagrangian Relaxation based Heuristic for the Static Berth Allocation Problem using the Cutting Plane Method ...

Lagrangian relaxation performs better than GAMS in terms of time. For larger problems, GAMS is not able to obtain optimal solutions. However, the Lagrangian ...

Apr 20, 2024 · Computational outcomes are also presented for the suggested Lagrangian relaxation. Diabat implements Lagrangian relaxation in their model.

In [23] the authors study the static case of the BAP and develop a Lagrangian relaxation heuristic with the application of cutting planes, given that it is a ...