Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 246791, 12 pages
http://dx.doi.org/10.1155/2014/246791
Research Article

Synthetic Optimization Model and Algorithm for Railway Freight Center Station Location and Wagon Flow Organization Problem

1School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
2MOE Key Laboratory for Urban Transportation Complex Systems Theory and Technology, Beijing Jiaotong University, Beijing 100044, China
3Integrated Transport Research Center, China Academy of Transportation Sciences, Beijing 100029, China

Received 27 November 2013; Revised 8 April 2014; Accepted 10 April 2014; Published 11 May 2014

Academic Editor: X. Zhang

Copyright © 2014 Xing-cai Liu 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. C. Toregas, R. Swain, C. ReVelle, and L. Bergman, “The location of emergency service facilities,” Operations Research, vol. 19, no. 6, pp. 1363–1373, 1971. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  2. O. Kariv and S. L. Hakimi, “An algorithmic approach to network location problems. I. The p-centers,” SIAM Journal on Applied Mathematics, vol. 37, no. 3, pp. 513–538, 1979. View at Publisher · View at Google Scholar · View at MathSciNet
  3. O. Kariv and S. L. Hakimi, “An algorithmic approach to network location problems. II. The p-medians,” SIAM Journal on Applied Mathematics, vol. 37, no. 3, pp. 539–560, 1979. View at Publisher · View at Google Scholar · View at MathSciNet
  4. S. L. Hakimi, “Optimum locations of switching centers and the absolute centers and medians of a graph,” Operations Research, vol. 12, no. 3, pp. 450–459, 1964. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  5. A. Caprara, M. Fischetti, and P. Toth, “A heuristic method for the set covering problem,” Operations Research, vol. 47, no. 5, pp. 730–743, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  6. J. F. Campbell, “Hub location and the p-hub median problem,” Operations Research, vol. 44, no. 6, pp. 923–935, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  7. J. F. Campbell, A. T. Ernst, and M. Krishnamoorthy, Facility Location: Applications and Theory, Springer, New York, NY, USA, 2002.
  8. D. Skorin-Kapov, J. Skorin-Kapov, and M. O'Kelly, “Tight linear programming relaxations of uncapacitated p-hub median problems,” European Journal of Operational Research, vol. 94, no. 3, pp. 582–593, 1996. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  9. M. E. O'Kelly, “The location of interacting hub facilities,” Transportation Science, vol. 20, no. 2, pp. 92–106, 1986. View at Publisher · View at Google Scholar · View at Scopus
  10. M. E. O'Kelly, “A quadratic integer program for the location of interacting hub facilities,” European Journal of Operational Research, vol. 32, no. 3, pp. 393–404, 1987. View at Publisher · View at Google Scholar · View at MathSciNet
  11. M. E. O'Kelly and D. L. Bryan, “Hub location with flow economies of scale,” Transportation Research B: Methodological, vol. 32, no. 8, pp. 605–616, 1998. View at Google Scholar · View at Scopus
  12. I. Racunica and L. Wynter, “Optimal location of intermodal freight hubs,” Transportation Research B: Methodological, vol. 39, no. 5, pp. 453–477, 2005. View at Publisher · View at Google Scholar · View at Scopus
  13. V. Batanović, D. Petrović, and R. Petrović, “Fuzzy logic based algorithms for maximum covering location problems,” Information Sciences, vol. 179, no. 1-2, pp. 120–129, 2009. View at Publisher · View at Google Scholar
  14. J. Sáez-Aguado and P. C. Trandafir, “Some heuristic methods for solving p-median problems with a coverage constraint,” European Journal of Operational Research, vol. 220, no. 2, pp. 320–327, 2012. View at Publisher · View at Google Scholar · View at MathSciNet
  15. I. Contreras, J. F. Cordeau, and G. Laporte, “The dynamic uncapacitated hub location problem,” Transportation Science, vol. 45, no. 1, pp. 18–32, 2011. View at Publisher · View at Google Scholar · View at Scopus
  16. I. Correia, S. Nickel, and F. Saldanha-da-Gama, “Single-assignment hub location problems with multiple capacity levels,” Transportation Research B: Methodological, vol. 44, no. 8-9, pp. 1047–1066, 2010. View at Publisher · View at Google Scholar · View at Scopus
  17. L. D. Bodin, B. L. Golden, A. D. Schuster, and W. Romig, “A model for the blocking of trains,” Transportation Research B. Methodological, vol. 14, no. 1-2, pp. 115–120, 1980. View at Publisher · View at Google Scholar · View at MathSciNet
  18. D. R. Martinelli and H. Teng, “Optimization of railway operations using neural networks,” Transportation Research C: Emerging Technologies, vol. 4, no. 1, pp. 33–49, 1996. View at Publisher · View at Google Scholar · View at Scopus
  19. H. N. Newton, C. Barnhart, and P. H. Vance, “Constructing railroad blocking plans to minimize handling costs,” Transportation Science, vol. 32, no. 4, pp. 330–345, 1998. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  20. C. Barnhart, H. Jin, and P. H. Vance, “Railroad blocking: a network design application,” Operations Research, vol. 48, no. 4, pp. 603–614, 2000. View at Publisher · View at Google Scholar · View at Scopus
  21. R. Fukasawa, M. V. P. de Aragão, O. Porto, and E. Uchoa, “Solving the freight car flow problem to optimality,” Electronic Notes in Theoretical Computer Science, vol. 66, no. 6, pp. 42–52, 2002. View at Publisher · View at Google Scholar · View at Scopus
  22. J. Woxenius, “Alternative transport network designs and their implications for intermodal transshipment technologies,” European Transport, vol. 35, pp. 27–45, 2007. View at Google Scholar
  23. S. J. Jeong, C. G. Lee, and J. H. Bookbinder, “The European freight railway system as a hub-and-spoke network,” Transportation Research A: Policy and Practice, vol. 41, no. 6, pp. 523–536, 2007. View at Publisher · View at Google Scholar · View at Scopus
  24. K. C. Jha, R. K. Ahuja, and G. Şahin, “New approaches for solving the block-to-train assignment problem,” Networks, vol. 51, no. 1, pp. 48–62, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  25. M. H. Keaton, “Designing optimal railroad operating plans: lagrangian relaxation and heuristic approaches,” Transportation Research B, vol. 23, no. 6, pp. 415–431, 1989. View at Publisher · View at Google Scholar · View at Scopus
  26. H. L. Wu, “Study on the organization scheme for through trains from car loading localities,” Journal of the China Railway Society, vol. 9, no. 4, pp. 17–26, 1987. View at Google Scholar
  27. B. L. Lin, S. N. Zhu, D. Y. Shi, and S. W. He, “The optimal model of the direct train formation plan for loading area,” China Railway Science, vol. 16, no. 2, pp. 108–114, 1995. View at Google Scholar
  28. X. M. Cao, B. L. Lin, and H. X. Yan, “Optimization of direct freight train service in the loading place,” Journal of the China Railway Society, vol. 28, no. 4, pp. 6–11, 2006. View at Google Scholar · View at Scopus
  29. X. M. Cao, B. L. Lin, H. X. Liu, and H. X. Yan, “Optimization of car flow organization in nonstop train loading base,” Journal of the China Railway Society, vol. 29, no. 1, pp. 16–20, 2007. View at Google Scholar · View at Scopus
  30. F. Glover, E. Taillard, and E. Taillard, “A user's guide to tabu search,” Annals of Operations Research, vol. 41, no. 1, pp. 1–28, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  31. F. Glover and S. Hanafi, “Tabu search and finite convergence,” Discrete Applied Mathematics, vol. 119, no. 1-2, pp. 3–36, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  32. L. N. de Castro and F. J. von Zuben, “The clonal selection algorithm with engineering application,” in Proceedings of GFCCO, Workshop on Artificial Immune Systems and Their Application, pp. 36–37, Las Vegas, Nev, USA, 2000.
  33. L. N. de Castro and F. J. von Zuben, “The clonal selection algorithm with engineering applications,” in Proceedings of the GECC, pp. 36–37, 2000.
  34. A. Adnan, “Clonal selection algorithm with operator multiplicity,” IEEE Transactions on Evolutionary Computation, vol. 2, no. 2, pp. 1909–1915, 2004. View at Google Scholar