Table of Contents Author Guidelines Submit a Manuscript
Computational Intelligence and Neuroscience
Volume 2014, Article ID 682486, 8 pages
http://dx.doi.org/10.1155/2014/682486
Research Article

Rail Mounted Gantry Crane Scheduling Optimization in Railway Container Terminal Based on Hybrid Handling Mode

School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China

Received 11 August 2014; Revised 6 October 2014; Accepted 7 October 2014; Published 4 November 2014

Academic Editor: Xiaobei Jiang

Copyright © 2014 Li Wang and Xiaoning Zhu. 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. C. F. Daganzo, “The crane scheduling problem,” Transportation Research B: Methodological, vol. 23, no. 3, pp. 159–175, 1989. View at Publisher · View at Google Scholar · View at Scopus
  2. R. I. Peterkofsky and C. F. Daganzo, “A branch and bound solution method for the crane scheduling problem,” Transportation Research Part B, vol. 24, no. 3, pp. 159–172, 1990. View at Publisher · View at Google Scholar · View at Scopus
  3. 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 Zentralblatt MATH · View at Scopus
  4. W. C. Ng and K. L. Mak, “Quay crane scheduling in container terminals,” Engineering Optimization, vol. 38, no. 6, pp. 723–737, 2006. View at Publisher · View at Google Scholar · View at Scopus
  5. D.-H. Lee, H. Q. Wang, and L. Miao, “Quay crane scheduling with non-interference constraints in port container terminals,” Transportation Research E: Logistics and Transportation Review, vol. 44, no. 1, pp. 124–135, 2008. View at Publisher · View at Google Scholar · View at Scopus
  6. 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
  7. J. H. Chen, D.-H. Lee, and M. Goh, “An effective mathematical formulation for the unidirectional cluster-based quay crane scheduling problem,” European Journal of Operational Research, vol. 232, no. 1, pp. 198–208, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. K. Hwan Kim and H. Bae Kim, “Segregating space allocation models for container inventories in port container terminals,” International Journal of Production Economics, vol. 59, no. 1–3, pp. 415–423, 1999. View at Publisher · View at Google Scholar · View at Scopus
  9. W. C. Ng and K. L. Mak, “Yard crane scheduling in port container terminals,” Applied Mathematical Modelling, vol. 29, no. 3, pp. 263–276, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  10. W. K. Li, Y. Wu, M. E. H. Petering, M. Goh, and R. D. Souza, “Discrete time model and algorithms for container yard crane scheduling,” European Journal of Operational Research, vol. 198, no. 1, pp. 165–172, 2009. View at Publisher · View at Google Scholar · View at Scopus
  11. D. Chang, Z. Jiang, W. Yan, and J. He, “Developing a dynamic rolling-horizon decision strategy for yard crane scheduling,” Advanced Engineering Informatics, vol. 25, no. 3, pp. 485–494, 2011. View at Publisher · View at Google Scholar · View at Scopus
  12. D.-H. Lee, J. Jin, and J. Chen, “Schedule template design and storage allocation for cyclically visiting feeders in container transshipment hubs,” Transportation Research Record, no. 2273, pp. 87–95, 2012. View at Publisher · View at Google Scholar · View at Scopus
  13. A. H. Gharehgozli, Y. Yu, R. de Koster, and J. T. Udding, “An exact method for scheduling a yard crane,” European Journal of Operational Research, vol. 235, no. 2, pp. 431–447, 2014. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  14. N. Boysen and M. Fliedner, “Determining crane areas in intermodal transshipment yards: the yard partition problem,” European Journal of Operational Research, vol. 204, no. 2, pp. 336–342, 2010. View at Publisher · View at Google Scholar · View at Scopus
  15. N. Boysen, M. Fliedner, and M. Kellner, “Determining fixed crane areas in rail-rail transshipment yards,” Transportation Research Part E: Logistics and Transportation Review, vol. 46, no. 6, pp. 1005–1016, 2010. View at Publisher · View at Google Scholar · View at Scopus
  16. A. V. Goodchild and C. F. Daganzo, “Double-cycling strategies for container ships and their effect on ship loading and unloading operations,” Transportation Science, vol. 40, no. 4, pp. 473–483, 2006. View at Publisher · View at Google Scholar · View at Scopus
  17. A. V. Goodchild and C. F. Daganzo, “Crane double cycling in container ports: planning methods and evaluation,” Transportation Research B: Methodological, vol. 41, no. 8, pp. 875–891, 2007. View at Publisher · View at Google Scholar · View at Scopus
  18. S. H. Chung and K. L. Choy, “A modified genetic algorithm for quay crane scheduling operations,” Expert Systems with Applications, vol. 39, no. 4, pp. 4213–4221, 2012. View at Publisher · View at Google Scholar · View at Scopus