Table of Contents Author Guidelines Submit a Manuscript
Computational Intelligence and Neuroscience
Volume 2016 (2016), Article ID 5804626, 11 pages
http://dx.doi.org/10.1155/2016/5804626
Research Article

Optimizing the Shunting Schedule of Electric Multiple Units Depot Using an Enhanced Particle Swarm Optimization Algorithm

1School of Traffic and Transportation, Beijing Jiaotong University, Beijing 100044, China
2Department of Transportation Science, KTH Royal Institute of Technology, Teknikringen 10, 10044 Stockholm, Sweden

Received 29 February 2016; Revised 2 May 2016; Accepted 9 May 2016

Academic Editor: Christian W. Dawson

Copyright © 2016 Jiaxi Wang 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. P. M. Jacobsen and D. Pisinger, “Train shunting at a workshop area,” Flexible Services and Manufacturing Journal, vol. 23, no. 2, pp. 156–180, 2011. View at Publisher · View at Google Scholar · View at Scopus
  2. Z.-K. Wang, T.-Y. Shi, W.-J. Zhang, and H. Wang, “Model and algorithm for optimized formulation of scheduled shunting operation plans of electric multiple units depots,” Journal of the China Railway Society, vol. 35, no. 8, pp. 1–9, 2013. View at Publisher · View at Google Scholar · View at Scopus
  3. X. Guo, R. Song, H. Li, S. Chen, and X. Liu, “Optimization of shunting operation plan of electric multiple unit running shed,” China Railway Science, vol. 37, no. 1, pp. 117–123, 2016. View at Google Scholar
  4. P. J. Zwaneveld, L. G. Kroon, H. E. Romeijn et al., “Routing trains through railway stations: model formulation and algorithms,” Transportation Science, vol. 30, no. 3, pp. 181–194, 1996. View at Publisher · View at Google Scholar · View at Scopus
  5. P. J. Zwaneveld, L. G. Kroon, and S. P. M. Van Hoesel, “Routing trains through a railway station based on a node packing model,” European Journal of Operational Research, vol. 128, no. 1, pp. 14–33, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  6. L. G. Kroon, H. E. Romeijn, and P. J. Zwaneveld, “Routing trains through railway stations: complexity issues,” European Journal of Operational Research, vol. 98, no. 3, pp. 485–498, 1997. View at Publisher · View at Google Scholar · View at Scopus
  7. D. De Luca Cardillo and N. Mione, “kL-list λ colouring of graphs,” European Journal of Operational Research, vol. 106, no. 1, pp. 160–164, 1998. View at Publisher · View at Google Scholar · View at Scopus
  8. A. Billionnet, “Using integer programming to solve the train-platforming problem,” Transportation Science, vol. 37, no. 2, pp. 213–222, 2003. View at Publisher · View at Google Scholar · View at Scopus
  9. M. Carey and S. Carville, “Scheduling and platforming trains at busy complex stations,” Transportation Research Part A: Policy and Practice, vol. 37, no. 3, pp. 195–224, 2003. View at Publisher · View at Google Scholar · View at Scopus
  10. M. Carey and I. Crawford, “Scheduling trains on a network of busy complex stations,” Transportation Research Part B: Methodological, vol. 41, no. 2, pp. 159–178, 2007. View at Publisher · View at Google Scholar · View at Scopus
  11. B. Cui, J. Ma, and P. Zhang, “An optimization algorithm for route dispatching in marshalling station,” China Railway Science, vol. 28, no. 2, pp. 100–104, 2007. View at Google Scholar · View at Scopus
  12. R. Lusby, J. Larsen, D. Ryan, and M. Ehrgott, “Routing trains through railway junctions: a new set-packing approach,” Transportation Science, vol. 45, no. 2, pp. 228–245, 2011. View at Publisher · View at Google Scholar · View at Scopus
  13. A. Caprara, L. Galli, and P. Toth, “Solution of the train platforming problem,” Transportation Science, vol. 45, no. 2, pp. 246–257, 2011. View at Publisher · View at Google Scholar · View at Scopus
  14. K. Liujiang, W. Jianjun, and S. Huijun, “Using simulated annealing in a bottleneck optimization model at railway stations,” Journal of Transportation Engineering, vol. 138, no. 11, pp. 1396–1402, 2012. View at Publisher · View at Google Scholar · View at Scopus
  15. J. J. Wu, L. J. Kang, H. J. Sun, and X. L. Jia, “Track allocation optimization in railway station: mean-variance model and case study,” Journal of Transportation Engineering-ASCE, vol. 139, no. 5, pp. 540–547, 2013. View at Publisher · View at Google Scholar · View at Scopus
  16. P. Sels, P. Vansteenwegen, T. Dewilde, D. Cattrysse, B. Waquet, and A. Joubert, “The train platforming problem: the infrastructure management company perspective,” Transportation Research Part B: Methodological, vol. 61, no. 1, pp. 55–72, 2014. View at Publisher · View at Google Scholar · View at Scopus
  17. W. Li, W. Wang, and S. Cheng, “Scheduling model and algorithm of using up-and-down lines on railway marshalling station,” Systems Engineering-Theory & Practice, vol. 6, pp. 75–78, 2000. View at Google Scholar
  18. Y. Zhang, D. Lei, and M. Liu, “Scheduling model and algorithm for track application in railway station,” China Railway Science, vol. 31, no. 2, pp. 96–100, 2010. View at Google Scholar · View at Scopus
  19. Y.-G. Zhang, D.-Y. Lei, B. Tang, and X.-Y. Wang, “Due windows scheduling model and algorithm of track utilization in railway passenger stations,” Journal of the China Railway Society, vol. 33, no. 1, pp. 1–7, 2011. View at Publisher · View at Google Scholar · View at Scopus
  20. R. Eberhart and J. Kennedy, “A new optimizer using particle swarm theory,” in Proceedings of the 6th International Symposium on Micro Machine and Human Science (MHS '95), pp. 39–43, Nagoya, Japan, October 1995. View at Scopus
  21. J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of the IEEE International Conference on Neural Networks, vol. 4, pp. 1942–1948, IEEE, Perth, Australia, 1995. View at Publisher · View at Google Scholar
  22. E. García-Gonzalo and J. L. Fernández-Martínez, “A brief historical review of particle swarm optimization (PSO),” Journal of Bioinformatics and Intelligent Control, vol. 1, no. 1, pp. 3–16, 2012. View at Publisher · View at Google Scholar
  23. B. B. Firouzi, M. S. Sadeghi, and T. Niknam, “A new hybrid algorithm based on PSO, SA, and K-means for cluster analysis,” International Journal of Innovative Computing, Information and Control, vol. 6, no. 7, pp. 3177–3192, 2010. View at Google Scholar · View at Scopus
  24. Y. Sun, M. Lang, D. Wang, and L. Liu, “A PSO-GRNN model for railway freight volume prediction: empirical study from China,” Journal of Industrial Engineering and Management, vol. 7, no. 2, pp. 413–433, 2014. View at Publisher · View at Google Scholar · View at Scopus
  25. X. Li, J. Xu, and Y. Yang, “A chaotic particle swarm optimization-based heuristic for market-oriented task-level scheduling in cloud workflow systems,” Computational Intelligence and Neuroscience, vol. 2015, Article ID 718689, 11 pages, 2015. View at Publisher · View at Google Scholar · View at Scopus