Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2012 (2012), Article ID 602153, 13 pages
http://dx.doi.org/10.1155/2012/602153
Research Article

Study on the Stochastic Chance-Constrained Fuzzy Programming Model and Algorithm for Wagon Flow Scheduling in Railway Bureau

Traffic and Transportation School, Lanzhou Jiaotong University, Lanzhou 730070, China

Received 15 May 2012; Revised 13 August 2012; Accepted 15 August 2012

Academic Editor: Wuhong Wang

Copyright © 2012 Bin Liu. 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. O. Gulbroden, “Optimal planning of marshalling yard by operation research,” ROCEEDINGS of the Symposium on the use of Cybernetics on the Railways, pp. 226–233, 1963. View at Google Scholar
  2. S. Yager, F. ESaccomanno, and Q. Shi, “An efficient sequencing model for humping in a railway,” Transportation Research A, vol. 17, pp. 251–262, 1988. View at Google Scholar
  3. M. Carey and S. Carville, “Scheduling and platforming trains at busy complex stations,” Transportation Research Part A, vol. 37, no. 3, pp. 195–224, 2003. View at Publisher · View at Google Scholar · View at Scopus
  4. R. M. Lentink, P. J. Fioole, L. G. Kroon, and C. Woudy, Applying Operations Research Techniques to Planning Train Shunting, John Wiley & Sons, Hoboken, NJ, USA, 2006.
  5. P. Marton, J. Maue, and M. Nunkesser, “An improved train classification procedure for the hump Yard Lausanne Triage,” in Proceedings of the 9th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS'09), September 2009.
  6. C. G. Wang, “Study on wagon-flow allocating problem in a marshalling station by using calculating method on-table,” Journal of the China Railway Society, vol. 24, no. 4, pp. 1–5, 2002. View at Google Scholar · View at Scopus
  7. S. He, Optimization for railway hub work plan—study on model and algorithm of work plan for railway marshalling station and daily and shift plan for railway hub [Ph.D. thesis], Southwest jiaotong university, 1996.
  8. S. He, R. Song, and S. S. Chaudhry, “Fuzzy dispatching model and genetic algorithms for railyards operations,” European Journal of Operational Research, vol. 124, no. 2, pp. 307–331, 2000. View at Publisher · View at Google Scholar · View at Scopus
  9. S. He, R. Song, and S. S. Chaudhry, “An integrated dispatching model for rail yards operations,” Computers and Operations Research, vol. 30, no. 7, pp. 939–966, 2003. View at Publisher · View at Google Scholar · View at Scopus
  10. T. Liu, S. W. He, B. H. Wang, and J. An, “Stochastic chance constrained programming model and solution of marshalling station dispatching plan,” Journal of the China Railway Society, vol. 29, no. 4, pp. 12–17, 2007. View at Google Scholar · View at Scopus
  11. H. D. Li, S. W. He, R. Song, and L. Zheng, “Stochastic dependent-chance programming model and algorithm for stage plan of marshalling station,” Journal of Transportation Systems Engineering and Information Technology, vol. 10, no. 1, pp. 128–133, 2010. View at Google Scholar · View at Scopus
  12. H. Li, S. He, B. H. Wang et al., “Survey of stage plan for railway marshalling station,” Journal of the China Railway Society, vol. 33, no. 8, pp. 13–22, 2011. View at Google Scholar
  13. B. Liu, Theory and Practice of Uncertain Programming, Physica, Heidelberg, Germany, 2002.
  14. E. Dahlhaus, P. Horak, M. Miller, and J. F. Ryan, “The train marshalling problem,” Discrete Applied Mathematics, vol. 103, no. 1–3, pp. 41–54, 2000. View at Publisher · View at Google Scholar
  15. M. Dorigo and T. Stutzle, Ant Colony Optimization, The MIT Press, Cambridge, Mass, USA, 2004.
  16. M. Gen and R. Cheng, Genetic Algorithms and Engineering Optimization, John Wiley & Sons, 2000.
  17. W. J. Gutjahr, “A Converging ACO Algorithm for Stochastic Combinatorial Optimization,” in Proceedings of the Stochastic Algorithms: Foundations and Applications (SAGA '03), A. Al-Brecht and K. Steinhoefl, Eds., vol. 9 of Springer LNCS 2827, pp. 10–25, 2003.
  18. J. Wu, Research on improved performance of ant colony algorithm by genetic algorithm [M.S. thesis], Taiyuan University of Technology, 2007.
  19. Y. Jing and C. G. Wang, “Model and algorithm of dynamic wagon-flow allocating in a marshalling yard under uncertainty conditions,” Journal of the China Railway Society, vol. 32, no. 4, pp. 8–12, 2010. View at Publisher · View at Google Scholar · View at Scopus