Model and heuristic for berth allocation in tidal bulk ports with stock level constraints

Computers and Industrial Engineering

Volumn 60, Issue 4, 2011, Pages 606-613

  Barros, Victor Hugo ^a   Costa, Tarcísio Souza ^a   Oliveira, Alexandre C M ^a   Lorena, Luiz A N ^b  

^a FEDERAL UNIVERSITY OF MARANHÃO   (Brazil)

^b INSTITUTO NACIONAL DE PESQUISAS ESPACIAIS   (Brazil)

Author keywords

Berth allocation problem; Integer linear programming; Tidal ports

Indexed keywords

BERTH ALLOCATION; BERTH ALLOCATION PROBLEM; BULK CARGO; COMMERCIAL SOLVERS; CONTINUOUS PROCESS; HIGH TIDES; INTEGER LINEAR PROGRAMMING; INTEGER LINEAR PROGRAMMING MODELS; PLANNING HORIZONS; PROBLEM INSTANCES; SHIPLOADERS; SPECIFIC LOCATION; STOCK LEVEL; TIDAL PORTS; TRANSNATIONAL ENTERPRISE; TRANSPORTATION PROBLEM;

DECISION MAKING; INTEGER PROGRAMMING; LINEAR PROGRAMMING; LOADING; PORT TERMINALS; SHIPS; TRANSFER CASES (VEHICLES); UNLOADING;

SIMULATED ANNEALING;

EID: 79952628713     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2010.12.018     Document Type: Article

References (16)

1. Companhia Vale do Rio Doce (Vale) (2008). < http://www.cvrd.com.br > 31.03.08.
2. J.F. Cordeau, G. Laporte, P. Legato, and L. Moccia Models and tabu search heuristics for the berth allocation problem Transportation Science 39 2005 526 538 (Pubitemid 41706012)
3. Y. Guan, W.Q. Xiao, R.K. Cheung, and C.L. Li A multiprocessor task scheduling model for berth allocation: heuristic and worst case analysis Operations Research Letters 30 2002 343 350 (Pubitemid 35167682)
4. H.O. Günther, and K.H. Kim Container terminals and automated transport systems: Logistics control issues and quantitative decision support 2005 Springer-Verlag Berlin
5. P. Hansen, C. Og̃uz, and N. Mladenovic Variable neighborhood search for minimum cost berth allocation European Journal of Operational Research 2007
6. Ilog (2006). ILOG CPLEX 10.0: user's manual. France: [s.n.], 478 p.
7. A. Imai, E. Nishimura, and S. Papadimitriou The dynamic berth allocation problem for a container port Transportation Research - B 35 4 2001 401 417
8. A. Imai, E. Nishimura, and S. Papadimitriou Berthing ships at a multi-user container terminal with a limited quay capacity Transportation Research Part E 2006
9. K.H. Kim, and K.C. Moon Berth scheduling by simulated annealing Transportation Science 37 6 2003 541 560 (Pubitemid 36580172)
10. S. Kirkpatrick, C.D. Gelatt, and M.P. Vecchi Optimization by Simulated Annealing Science. New Series 220 4598 1983 671 680
11. A. Lim The berth planning problem Operations Research Letters 22 1998 105 110 (Pubitemid 128458164)
12. L.L. Lorenzoni, H. Ahonen, and A.G. Alvarenga A multi-mode resource-constrained scheduling problem in the context of port operations Computers & Industrial Engineering 50 1 2006 55 65 (Pubitemid 43816786)
13. E. Nishimura, A. Imai, and S. Papadimitriou Berth allocation planning in the public berth system by genetic algorithms European Journal of Operational Research 131 2001 282 292 (Pubitemid 32271744)
14. Y.M. Park, and K.H. Kim A scheduling method for berth and quay cranes OR Spectrum 25 2003 1 23 (Pubitemid 38260021)
15. M. Pinedo Scheduling: Theory, algorithms and systems 1995 Prentice-Hall Englewood Cliffs, NJ
16. I.F.A. Vis, and R.D. Koster Transshipment of containers at a container terminal: An overview European Journal of Operational Research 147 2003 1 16