Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2015 (2015), Article ID 781907, 12 pages
http://dx.doi.org/10.1155/2015/781907
Research Article

Migrating Birds Optimization for the Seaside Problems at Maritime Container Terminals

Department of Computer and Systems Engineering, University of La Laguna, 38271 La Laguna, Spain

Received 13 March 2015; Revised 25 May 2015; Accepted 27 May 2015

Academic Editor: Wei Fang

Copyright © 2015 Eduardo Lalla-Ruiz et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. L. Nicoletti, A. Chiurco, C. Arango, and R. Diaz, “Hybrid approach for container terminals performances evaluation and analysis,” International Journal of Simulation and Process Modelling, vol. 9, no. 1-2, pp. 104–112, 2014. View at Publisher · View at Google Scholar · View at Scopus
  2. C. Expósito-Izquierdo, E. Lalla-Ruiz, B. Melián Batista, and J. M. Moreno-Vega, “Optimization of container terminal problems: an integrated solution approach,” in Computer Aided Systems Theory—EUROCAST 2013, R. Moreno-Díaz, F. Pichler, and A. Quesada-Arencibia, Eds., vol. 8111 of Lecture Notes in Computer Science, pp. 324–331, Springer, Berlin, Germany, 2013. View at Google Scholar
  3. H.-J. Yeo, “Competitiveness of Asian container terminals,” The Asian Journal of Shipping and Logistics, vol. 26, no. 2, pp. 225–246, 2010. View at Publisher · View at Google Scholar · View at Scopus
  4. C. Bierwirth and F. Meisel, “A survey of berth allocation and quay crane scheduling problems in container terminals,” European Journal of Operational Research, vol. 202, no. 3, pp. 615–627, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  5. J.-F. Cordeau, G. Laporte, P. Legato, and L. Moccia, “Models and tabu search heuristics for the berth-allocation problem,” Transportation Science, vol. 39, no. 4, pp. 526–538, 2005. View at Publisher · View at Google Scholar · View at Scopus
  6. E. Duman, M. Uysal, and A. F. Alkaya, “Migrating birds optimization: a new metaheuristic approach and its performance on quadratic assignment problem,” Information Sciences, vol. 217, pp. 65–77, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  7. C. Bierwirth and F. Meisel, “A fast heuristic for quay crane scheduling with interference constraints,” Journal of Scheduling, vol. 12, no. 4, pp. 345–360, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  8. C. Expósito-Izquierdo, J. L. González-Velarde, B. Melián-Batista, and J. M. Moreno-Vega, “Hybrid estimation of distribution algorithm for the quay crane scheduling problem,” Applied Soft Computing Journal, vol. 13, no. 10, pp. 4063–4076, 2013. View at Publisher · View at Google Scholar · View at Scopus
  9. A. Imai, E. Nishimura, and S. Papadimitriou, “The dynamic berth allocation problem for a container port,” Transportation Research Part B: Methodological, vol. 35, no. 4, pp. 401–417, 2001. View at Publisher · View at Google Scholar · View at Scopus
  10. E. Lalla-Ruiz, B. Melián-Batista, and J. Marcos Moreno-Vega, “Artificial intelligence hybrid heuristic based on tabu search for the dynamic berth allocation problem,” Engineering Applications of Artificial Intelligence, vol. 25, no. 6, pp. 1132–1141, 2012. View at Publisher · View at Google Scholar · View at Scopus
  11. K. Buhrkal, S. Zuglian, S. Ropke, J. Larsen, and R. Lusby, “Models for the discrete berth allocation problem: a computational comparison,” Transportation Research Part E: Logistics and Transportation Review, vol. 47, no. 4, pp. 461–473, 2011. View at Publisher · View at Google Scholar · View at Scopus
  12. R. M. de Oliveira, G. R. Mauri, and L. A. N. Lorena, “Clustering search for the berth allocation problem,” Expert Systems with Applications, vol. 39, no. 5, pp. 5499–5505, 2012. View at Google Scholar
  13. C.-J. Ting, K.-C. Wu, and H. Chou, “Particle swarm optimization algorithm for the berth allocation problem,” Expert Systems with Applications, vol. 41, no. 4, pp. 1543–1550, 2014. View at Publisher · View at Google Scholar · View at Scopus
  14. E. Lalla-Ruiz and S. Voß, “Popmusic as a matheuristic for the berth allocation problem,” Annals of Mathematics and Artificial Intelligence, pp. 1–17, 2014. View at Publisher · View at Google Scholar
  15. F. Meisel and C. Bierwirth, “A unified approach for the evaluation of quay crane scheduling models and algorithms,” Computers & Operations Research, vol. 38, no. 3, pp. 683–693, 2011. View at Publisher · View at Google Scholar · View at Scopus
  16. K. H. Kim and Y.-M. Park, “A crane scheduling method for port container terminals,” European Journal of Operational Research, vol. 156, no. 3, pp. 752–768, 2004. View at Publisher · View at Google Scholar · View at Scopus
  17. M. Sammarra, J.-F. Cordeau, G. Laporte, and M. F. Monaco, “A tabu search heuristic for the quay crane scheduling problem,” Journal of Scheduling, vol. 10, no. 4-5, pp. 327–336, 2007. View at Publisher · View at Google Scholar · View at Scopus
  18. P. Legato, R. Trunfio, and F. Meisel, “Modeling and solving rich quay crane scheduling problems,” Computers & Operations Research, vol. 39, no. 9, pp. 2063–2078, 2012. View at Publisher · View at Google Scholar · View at Scopus
  19. C. F. Daganzo, “The crane scheduling problem,” Transportation Research Part B: Methodological, vol. 23, no. 3, pp. 159–175, 1989. View at Publisher · View at Google Scholar · View at Scopus