Title: Work planning optimisation in ports: a simplex application

Authors: Iñigo L. Ansorena

Addresses: Technical University of Madrid, C/ Profesor Aranguren s/n, Madrid 28040, Spain

Abstract: This paper presents an optimisation of the work plan at the gate of Barcelona container terminal (also known as TCB). The optimisation problem is formulated in accordance with the average traffic flow as a linear programming (LP) problem. Constraints of the LP problem are based on the data collected at the gate of TCB. The LP problem is solved by simplex algorithm and the solution includes: First, the value of the objective function (that is the feasible solution that minimises the number of clerks at the gate throughout a day); and second, the value, contribution to the objective, reduced cost, and range of optimality for each decision variable. Once the optimal solution has been achieved a sensitivity analysis is developed. The methodological procedure presented in this paper is general enough to be applied to any other container terminal.

Keywords: ports; queues; trucks; container terminal; gate; linear programming; simplex; scheduling; optimisation; clerks; productivity; work planning; application.

DOI: 10.1504/IJMOR.2019.096985

International Journal of Mathematics in Operational Research, 2019 Vol.14 No.1, pp.146 - 155

Received: 23 Mar 2017
Accepted: 29 Aug 2017
Published online: 14 Dec 2018 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article