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

Robust Optimization Model and Algorithm for Railway Freight Center Location Problem in Uncertain Environment

1School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
2Integrated Transport Research Center, China Academy of Transportation Sciences, Beijing 100029, China

Received 11 July 2014; Accepted 5 October 2014; Published 4 November 2014

Academic Editor: Xiaobei Jiang

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. 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 Zentralblatt MATH · View at MathSciNet · View at Scopus
  2. 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 · View at Scopus
  3. 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
  4. 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 · View at Scopus
  5. I. Racunica and L. Wynter, “Optimal location of intermodal freight hubs,” Transportation Research Part B: Methodological, vol. 39, no. 5, pp. 453–477, 2005. View at Publisher · View at Google Scholar · View at Scopus
  6. J. S. 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 · View at Scopus
  7. Z. J. M. Shen, R. L. Zhan, and J. W. Zhang, “The reliable facility location problem: formulations, heuristics, and approximation algorithms,” INFORMS Journal on Computing, vol. 23, no. 3, pp. 470–482, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. Y. F. Yin, S. M. Madanat, and X. Y. Lu, “Robust improvement schemes for road networks under demand uncertainty,” European Journal of Operational Research, vol. 198, no. 2, pp. 470–479, 2009. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  9. C. S. Yu and H. L. Li, “A robust optimization model for stochastic logistic problems,” International Journal of Production Economics, vol. 64, no. 1–3, pp. 385–397, 2000. View at Publisher · View at Google Scholar · View at Scopus
  10. A. M. C. A. Koster, M. Kutschka, and C. Raack, “Robust network design: formulations, valid inequalities, and computations,” Networks, vol. 61, no. 2, pp. 128–149, 2013. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. O. Solyal, J. F. Cordeau, and G. Laporte, “Robust inventory routing under demand uncertainty,” Transportation Science, vol. 46, no. 3, pp. 327–340, 2012. View at Publisher · View at Google Scholar · View at Scopus
  12. C. C. Lu, S. W. Lin, and K. C. Ying, “Robust scheduling on a single machine to minimize total flow time,” Computers and Operations Research, vol. 39, no. 7, pp. 1682–1691, 2012. View at Publisher · View at Google Scholar · View at Scopus
  13. B. H. Wang and S. W. He, “Robust optimization model and algorithm for logistics center location and allocation under uncertain environment,” Journal of Transportation Systems Engineering and Information Technology, vol. 9, no. 2, pp. 69–74, 2009. View at Google Scholar · View at Scopus
  14. Y. Sun, R. Song, and S. W. He, “Robust optimization for transit timetable design under stochastic demand,” Systems Engineering-Theory & Practice, vol. 13, no. 5, pp. 986–992, 2011. View at Google Scholar
  15. Y. N. Guo, D. W. Xiao, S. G. Zhang, and J. Cheng, “Multi-spectral remote sensing images classification method based on adaptive immune clonal selection culture algorithm,” in Advanced Intelligent Computing, vol. 6838 of Lecture Notes in Computer Science, pp. 319–326, Springer, Berlin, Germany, 2012. View at Publisher · View at Google Scholar
  16. H. U. Berna and K. K. Sadan, “A review of clonal selection algorithm and its applications,” Artificial Intelligence Review, vol. 36, no. 2, pp. 117–138, 2011. View at Publisher · View at Google Scholar · View at Scopus
  17. R. S. Li, A. Mita, and J. Zhou, “Feasibility study of parameter identification method based on symbolic time series analysis and adaptive immune clonal selection algorithm,” Open Journal of Civil Engineering, vol. 4, no. 2, pp. 198–205, 2012. View at Google Scholar
  18. D. Y. Li and Y. Du, Artificial Intelligence with Uncertainty, National Defence Industry Press, Beijing, China, 2005.