Artificial intelligence hybrid heuristic based on tabu search for the dynamic berth allocation problem

@article{LallaRuiz2012ArtificialIH,
  title={Artificial intelligence hybrid heuristic based on tabu search for the dynamic berth allocation problem},
  author={Eduardo Lalla-Ruiz and Bel{\'e}n Meli{\'a}n-Batista and J. Marcos Moreno-Vega},
  journal={Eng. Appl. of AI},
  year={2012},
  volume={25},
  pages={1132-1141}
}
This paper considers the Dynamic Berth Allocation Problem, in which vessels are assigned to discrete positions in berths. This problem, whose goal is to minimize the total time the vessels stay at the port, constitutes one of the most important processes at any containers terminal. We propose a hybrid metaheuristic that combines Tabu Search with Path Relinking, TSþPR. The results reached by this hybrid algorithm are compared with the optimal values given by the best mathematical model that… CONTINUE READING
Highly Cited
This paper has 22 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 13 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Models for the discrete berth allocation problem: a computational comparison

  • K. Buhrkal, S. Zuglian, S. Ropke, J. Larsen, R. Lusby
  • Transp. Res. E
  • 2011
Highly Influential
16 Excerpts

The simultaneous berth and quay crane allocation problem

  • A. Imai, H. C. Chen, E. Nishimura, S. Papadimitriou
  • Transp. Res. E Logistics Transp. Rev
  • 2008
Highly Influential
4 Excerpts

Berthing ships at a multi - user container terminal with a limited quay capacity

  • V. M. D. Silva, A. S. Coelho, S. F. Mayerle
  • Investigac - ~ ao Oper .
  • 2008
2 Excerpts

Similar Papers

Loading similar papers…