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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of Mathematics in Operational Research
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
