Planejamento de atracação de navios por meio de um modelo matemático para o problema de alocação de berços contínuos com descontinuidade do cais

Brazilian ports handle 927 million tons of cargo/year representing 94% of exports. This paper presents a mathematical model that aims to contribute to the planning of berthing of ships in ports, especially those that have the characteristic of having discontinuities along the wharf or caused by expansion of a passage that was wider than the rest or the port has two margins. The proposed model was called the Continuous Berth Allocation Problem with Discontinuity of Pier (PABC-DC) and was applied in the public terminals at the Port of Vitoria (Victory Commercial Wharf and Terminal CODESA). The model was solved in CPLEX 12.6 with real data of Port of Vitoria. The model results compared with the results of manual planning done by the port always showed always a reduction in the total time that the ships spent at the port, reaching up 8.7% reduction.

[1]  Lixin Tang,et al.  Dynamically scheduling ships to multiple continuous berth spaces in an iron and steel complex , 2009, Int. Trans. Oper. Res..

[2]  Stefan Voß,et al.  Operations research at container terminals: a literature update , 2007, OR Spectr..

[3]  C. Briano,et al.  MODELS FOR SUPPORT MARITIME LOGISTICS : A CASE STUDY FOR IMPROVING TERMINAL PLANNING , 2005 .

[4]  Edward Tsang,et al.  Novel constraints satisfaction models for optimization problems in container terminals , 2013 .

[5]  Akio Imai,et al.  BERTH ALLOCATION IN A CONTAINER PORT: USING A CONTINUOUS LOCATION SPACE APPROACH , 2005 .

[6]  Chung-Piaw Teo,et al.  Berth Allocation Planning Optimization in Container Terminals , 2008 .

[7]  Kwok Kee Wei,et al.  Supply chain analysis : a handbook on the interaction of information, system and optimization , 2008 .

[8]  Michel Bierlaire,et al.  Optimization at Container Terminals: Status, Trends and Perspectives (revised version) , 2007 .

[9]  Kay Chen Tan,et al.  A multi-objective evolutionary algorithm for berth allocation in a container port , 2007, 2007 IEEE Congress on Evolutionary Computation.

[10]  Andrew Lim.  An Effective Ship Berthing Algorithm , 1999, IJCAI.

[11]  Michel Bierlaire,et al.  Real Time Recovery in Berth Allocation Problem in Bulk Ports , 2012 .

[12]  Akio Imai,et al.  Berth allocation at indented berths for mega-containerships , 2007, Eur. J. Oper. Res..

[13]  Zuhua Jiang,et al.  A berth allocation strategy using heuristics algorithm and simulation optimisation , 2008, Int. J. Comput. Appl. Technol..

[14]  Yusin Lee,et al.  An optimization heuristic for the berth scheduling problem , 2009, Eur. J. Oper. Res..

[15]  Yongpei Guan,et al.  The berth allocation problem: models and solution methods , 2004, OR Spectr..

[16]  Chung-lun Li,et al.  Scheduling with multiple-job-on-one-processor pattern , 1998 .

[17]  Kap Hwan Kim,et al.  A crane scheduling method for port container terminals , 2004, Eur. J. Oper. Res..

[18]  Christian Bierwirth,et al.  A survey of berth allocation and quay crane scheduling problems in container terminals , 2010, Eur. J. Oper. Res..

[19]  Michel Bierlaire,et al.  Exact and heuristic methods to solve the berth allocation problem in bulk ports , 2013 .

[20]  Chung-Lun Li,et al.  A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis , 2002, Oper. Res. Lett..

[21]  Gilbert Laporte,et al.  Models and Tabu Search Heuristics for the Berth-Allocation Problem , 2005, Transp. Sci..

[22]  Yasmine Abouelseoud,et al.  A heuristics-based solution to the continuous berth allocation and crane assignment problem , 2013 .

[23]  Akio Imai,et al.  Berth allocation planning in the public berth system by genetic algorithms , 2001, Eur. J. Oper. Res..

[24]  Kap Hwan Kim,et al.  Berth scheduling for container terminals by using a sub-gradient optimization technique , 2002, J. Oper. Res. Soc..

[25]  Rommert Dekker,et al.  Operations research supports container handling , 2001 .

[26]  S. R. Seyedalizadeh Ganji,et al.  Analysis of the continuous berth allocation problem in container ports using a genetic algorithm , 2010 .

[27]  Andrew Lim,et al.  A stochastic beam search for the berth allocation problem , 2007, Decis. Support Syst..

[28]  Andrew Lim,et al.  The berth planning problem , 1998, Oper. Res. Lett..

[29]  Andrew Lim,et al.  Combining various algorithms to solve the ship berthing problem , 2000, Proceedings 12th IEEE Internationals Conference on Tools with Artificial Intelligence. ICTAI 2000.

[30]  Akio Imai,et al.  The Dynamic Berth Allocation Problem for a Container Port , 2001 .

[31]  Christian Bierwirth,et al.  A fast heuristic for quay crane scheduling with interference constraints , 2009, J. Sched..

[32]  Gerald G. Brown,et al.  Optimizing Submarine Berthing with a Persistence Incentive , 1997 .

[33]  Stefan Voß,et al.  Container terminal operation and operations research - a classification and literature review , 2004, OR Spectr..

[34]  Iris F. A. Vis,et al.  Transshipment of containers at a container terminal: An overview , 2003, Eur. J. Oper. Res..

[35]  Andrew Lim,et al.  Ant Colony Optimization for the Ship Berthing Problem , 1999, ASIAN.

[36]  김갑환,et al.  A Mathematical Model and a Heuristic Algorithm for Berth Planning , 2000 .

[37]  Gerald G. Brown,et al.  Optimizing Ship Berthing , 1994 .

[38]  Kay Chen Tan,et al.  Multi-objective and prioritized berth allocation in container ports , 2010, Ann. Oper. Res..

[39]  Chung-Piaw Teo,et al.  Berth management in container terminal: the template design problem , 2006, OR Spectr..

[40]  Kap Hwan Kim,et al.  A scheduling method for Berth and Quay cranes , 2003, OR Spectr..

[41]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[42]  Kap Hwan Kim,et al.  Berth scheduling by simulated annealing , 2003 .