Table of Contents Author Guidelines Submit a Manuscript
Discrete Dynamics in Nature and Society
Volume 2017 (2017), Article ID 9025482, 13 pages
https://doi.org/10.1155/2017/9025482
Research Article

Modelling and Metaheuristic for Gantry Crane Scheduling and Storage Space Allocation Problem in Railway Container Terminals

1School of Mechatronic Engineering, Southwest Petroleum University, Chengdu 610500, China
2School of Mechanical Engineering, Southwest Jiaotong University, Chengdu 610031, China

Correspondence should be addressed to Ming Zeng; moc.621@9021_mz

Received 12 April 2017; Accepted 23 October 2017; Published 20 November 2017

Academic Editor: J. R. Torregrosa

Copyright © 2017 Ming Zeng 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. M. Xu, L. Yang, X. Yang, and P. B. Zheng, “Study on technical development trend of railway container transport organization in China,” Railway Transport and Economy, vol. 34, no. 12, pp. 18–25, 2012. View at Google Scholar
  2. Railway Statistical Bulletin, Railway Administration of the People’s Republic of China, http://www.nra.gov.cn/xwzx/zlzx/hytj/201603/t20160303_21466.shtml.
  3. P. Guo, W. Cheng, and M. Zhang, “Simulation on the operation influence by external factors for railway container logistic center,” in Proceedings of the International Conference of Logistics Engineering and Management: Logistics for Sustained Economic Development—Infrastructure, Information, Integration (ICLEM '10), pp. 2915–2922, Chengdu, China, October 2010. View at Publisher · View at Google Scholar · View at Scopus
  4. T. Benna and M. Gronalt, “Generic Simulation for rail-road container Terminals,” in Proceedings of the Winter Simulation Conference, pp. 2656–2660, Miami, Fla, USA, December 2008. View at Publisher · View at Google Scholar · View at Scopus
  5. B. J. Jeong and K. H. Kim, “Scheduling operations of a rail crane and container deliveries between rail and port terminals,” Engineering Optimization, vol. 43, no. 6, pp. 597–613, 2011. View at Publisher · View at Google Scholar · View at Scopus
  6. L. Wang and X. Zhu, “Rail mounted gantry crane scheduling optimization in railway container terminal based on hybrid handling mode,” Computational Intelligence and Neuroscience, vol. 2014, Article ID 682486, 8 pages, 2014. View at Publisher · View at Google Scholar · View at Scopus
  7. L. Wang, X. Zhu, and Z. Xie, “Storage space allocation of inbound container in railway container terminal,” Mathematical Problems in Engineering, vol. 2014, Article ID 956536, 10 pages, 2014. View at Publisher · View at Google Scholar
  8. N. Boysen, F. Jaehn, and E. Pesch, “Scheduling freight trains in rail-rail transshipment yards,” Transportation Science, vol. 45, no. 2, pp. 199–211, 2011. View at Publisher · View at Google Scholar · View at Scopus
  9. 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
  10. D.-H. Lee, J. H. Chen, and J. X. Cao, “Quay crane scheduling for an indented berth,” Engineering Optimization, vol. 43, no. 9, pp. 985–998, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. N. Boysen, S. Emde, and M. Fliedner, “Determining crane areas for balancing workload among interfering and noninterfering cranes,” Naval Research Logistics (NRL), vol. 59, no. 8, pp. 656–662, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  12. Y. Zhu and A. Lim, “Crane scheduling with non-crossing constraint,” Journal of the Operational Research Society, vol. 57, no. 12, pp. 1464–1471, 2006. View at Publisher · View at Google Scholar · View at Scopus
  13. Y. Wang and K. H. Kim, “A quay crane scheduling algorithm considering the workload of yard cranes in a container yard,” Journal of Intelligent Manufacturing, vol. 22, no. 3, pp. 459–470, 2011. View at Publisher · View at Google Scholar · View at Scopus
  14. S. Nguyen, M. Zhang, M. Johnston, and K. Tan, “Hybrid evolutionary computation methods for quay crane scheduling problems,” Computers & Operations Research, vol. 40, no. 8, pp. 2083–2093, 2013. View at Publisher · View at Google Scholar · View at Scopus
  15. P. Legato and R. Trunfio, “A local branching-based algorithm for the quay crane scheduling problem under unidirectional schedules,” 4OR, vol. 12, no. 2, pp. 123–156, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  16. J. H. Chen, D.-H. Lee, and J. X. Cao, “Heuristics for quay crane scheduling at indented berth,” Transportation Research Part E: Logistics and Transportation Review, vol. 47, no. 6, pp. 1005–1020, 2011. View at Publisher · View at Google Scholar · View at Scopus
  17. O. Unsal and C. Oguz, “Constraint programming approach to quay crane scheduling problem,” Transportation Research Part E: Logistics and Transportation Review, vol. 59, pp. 108–122, 2013. View at Publisher · View at Google Scholar · View at Scopus
  18. 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, vol. 13, no. 10, pp. 4063–4076, 2013. View at Publisher · View at Google Scholar · View at Scopus
  19. R. I. Peterkofsky and C. F. Daganzo, “A branch and bound solution method for the crane scheduling problem,” Transportation Research Part B: Methodological, vol. 24, no. 3, pp. 159–172, 1990. View at Publisher · View at Google Scholar · View at Scopus
  20. A. Lim, B. Rodrigues, F. Xiao, and Y. Zhu, “Crane scheduling with spatial constraints,” Naval Research Logistics (NRL), vol. 51, no. 3, pp. 386–406, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  21. D. Lee, H. Q. Wang, and L. Miao, “Quay crane scheduling with non-interference constraints in port container terminals,” Transportation Research Part E: Logistics and Transportation Review, vol. 44, no. 1, pp. 124–135, 2008. View at Publisher · View at Google Scholar · View at Scopus
  22. 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
  23. M. H. Hakam, W. D. Solvang, and T. Hammervoll, “A genetic algorithm approach for quay crane scheduling with non-interference constraints at Narvik container terminal,” International Journal of Logistics Research and Applications, vol. 15, no. 4, pp. 269–281, 2012. View at Publisher · View at Google Scholar · View at Scopus
  24. M. Chlumecký, J. Buchtele, and K. Richta, “Application of random number generators in genetic algorithms to improve rainfall-runoff modelling,” Journal of Hydrology, vol. 553, pp. 350–355, 2017. View at Publisher · View at Google Scholar
  25. W. Su, H. Chen, F. Liu et al., “A novel comprehensive learning artificial bee colony optimizer for dynamic optimization biological problems,” Saudi Journal of Biological Sciences, vol. 24, no. 3, pp. 695–702, 2017. View at Publisher · View at Google Scholar · View at Scopus
  26. L. Cui, G. Li, X. Wang et al., “A ranking-based adaptive artificial bee colony algorithm for global numerical optimization,” Information Sciences, vol. 417, pp. 169–185, 2017. View at Publisher · View at Google Scholar
  27. M. S. Kiran, “Particle swarm optimization with a new update mechanism,” Applied Soft Computing, vol. 60, pp. 670–678, 2017. View at Publisher · View at Google Scholar
  28. F. Jiang, H. Xia, Q. Anh Tran, Q. Minh Ha, N. Quang Tran, and J. Hu, “A new binary hybrid particle swarm optimization with wavelet mutation,” Knowledge-Based Systems, vol. 130, pp. 90–101, 2017. View at Publisher · View at Google Scholar
  29. P. Bipin and P. Rao, “Linearization of high power amplifier using modified artificial bee colony and particle swarm optimization algorithm,” Procedia Technology, vol. 25, pp. 28–35, 2016. View at Publisher · View at Google Scholar
  30. Z. Li, W. Wang, Y. Yan, and Z. Li, “PS-ABC: A hybrid algorithm based on particle swarm and artificial bee colony for high-dimensional optimization problems,” Expert Systems with Applications, vol. 42, no. 22, pp. 8881–8895, 2015. View at Publisher · View at Google Scholar · View at Scopus
  31. M. S. Kıran and M. Gündüz, “A recombination-based hybridization of particle swarm optimization and artificial bee colony algorithm for continuous optimization problems,” Applied Soft Computing, vol. 13, no. 4, pp. 2188–2203, 2013. View at Publisher · View at Google Scholar · View at Scopus
  32. A. Diabat and E. Theodorou, “An integrated quay crane assignment and scheduling problem,” Computers & Industrial Engineering, vol. 73, pp. 115–123, 2014. View at Publisher · View at Google Scholar · View at Scopus
  33. M. F. Monaco and M. Sammarra, “Quay crane scheduling with time windows, one-way and spatial constraints,” International Journal of Shipping and Transport Logistics, vol. 3, no. 4, pp. 454–474, 2011. View at Publisher · View at Google Scholar · View at Scopus
  34. C. Expósito-Izquierdo, B. Melián-Batista, and J. M. Moreno-Vega, “Variable neighbourhood search for the quay crane scheduling problem,” in Proceedings of the 11th International Conference on Intelligent Systems Design and Applications (ISDA '11), pp. 463–468, November 2011.
  35. P. Legato, R. M. Mazza, and R. Trunfio, “Simulation-based optimization for discharge/loading operations at a maritime container terminal,” OR Spectrum, vol. 32, no. 3, pp. 543–567, 2010. View at Publisher · View at Google Scholar · View at Scopus
  36. B. Raa, W. Dullaert, and R. V. Schaeren, “An enriched model for the integrated berth allocation and quay crane assignment problem,” Expert Systems with Applications, vol. 38, no. 11, pp. 14136–14147, 2011. View at Publisher · View at Google Scholar · View at Scopus
  37. M. H. Elwany, I. Ali, and Y. Abouelseoud, “A heuristics-based solution to the continuous berth allocation and crane assignment problem,” Alexandria Engineering Journal, vol. 52, no. 4, pp. 671–677, 2013. View at Publisher · View at Google Scholar · View at Scopus
  38. Q. Zeng, Z. Yang, and X. Hu, “Disruption recovery model for berth and quay crane scheduling in container terminals,” Engineering Optimization, vol. 43, no. 9, pp. 967–983, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  39. L. Song, T. Cherrett, and W. Guan, “Study on berth planning problem in a container seaport: Using an integrated programming approach,” Computers & Industrial Engineering, vol. 62, no. 1, pp. 119–128, 2012. View at Publisher · View at Google Scholar · View at Scopus
  40. D.-H. Lee and H. Q. Wang, “Integrated discrete berth allocation and quay crane scheduling in port container terminals,” Engineering Optimization, vol. 42, no. 8, pp. 747–761, 2010. View at Publisher · View at Google Scholar · View at Scopus
  41. C. Zhang, J. Liu, Y. Wan, K. G. Murty, and R. J. Linn, “Storage space allocation in container terminals,” Transportation Research Part B: Methodological, vol. 37, no. 10, pp. 883–903, 2003. View at Publisher · View at Google Scholar · View at Scopus
  42. L. Chen and Z. Lu, “The storage location assignment problem for outbound containers in a maritime terminal,” International Journal of Production Economics, vol. 135, no. 1, pp. 73–80, 2012. View at Publisher · View at Google Scholar · View at Scopus
  43. M. Rodriguez-Molins, M. A. Salido, and F. Barber, “Intelligent planning for allocating containers in maritime terminals,” Expert Systems with Applications, vol. 39, no. 1, pp. 978–989, 2012. View at Publisher · View at Google Scholar · View at Scopus
  44. G. C. Silva, L. Bahiense, L. SatoruOchi, and P. O. Boaventura-Netto, “The dynamic space allocation problem: applying hybrid GRASP and Tabu search metaheuristics,” Computers & Operations Research, vol. 39, no. 3, pp. 671–677, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  45. M. Yu and X. Qi, “Storage space allocation models for inbound containers in an automatic container terminal,” European Journal of Operational Research, vol. 226, no. 1, pp. 32–45, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  46. P. Civicioglu, “Backtracking search optimization algorithm for numerical optimization problems,” Applied Mathematics and Computation, vol. 219, no. 15, pp. 8121–8144, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  47. P. Guo, W. Cheng, Z. Zhang, M. Zhang, and J. Liang, “Gantry crane scheduling with interference constraints in railway container terminals,” International Journal of Computational Intelligence Systems, vol. 6, no. 2, pp. 244–260, 2013. View at Publisher · View at Google Scholar · View at Scopus