Table of Contents Author Guidelines Submit a Manuscript
Complexity
Volume 2017, Article ID 3717654, 14 pages
https://doi.org/10.1155/2017/3717654
Research Article

Application of Multiple-Population Genetic Algorithm in Optimizing the Train-Set Circulation Plan Problem

1Department of Transportation Management Engineering, School of Traffic and Transportation, Beijing Jiaotong University, Beijing, China
2Ministry of Education (MOE) Key Laboratory for Urban Transportation Complex System Theory and Technology, School of Traffic and Transportation, Beijing Jiaotong University, Beijing, China
3Department of Civil, Environmental, and Infrastructure Engineering, Volgenau School of Engineering, George Mason University, Fairfax, VA, USA
4Center for Advanced Transportation System Simulation, Department of Civil Environment Construction Engineering, University of Central Florida, Orlando, FL, USA

Correspondence should be addressed to Leishan Zhou; nc.ude.utjb@uohzhsl

Received 2 January 2017; Revised 5 April 2017; Accepted 28 May 2017; Published 2 July 2017

Academic Editor: Jose Egea

Copyright © 2017 Yu Zhou 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. National Bureau of Statistics of China, http://www.stats.gov.cn/.
  2. C. Sriram and A. Haghani, “An optimization model for aircraft maintenance scheduling and re-assignment,” Transportation Research Part A, vol. 37, no. 1, pp. 29–48, 2003. View at Publisher · View at Google Scholar · View at Scopus
  3. T. A. Feo and J. F. Bard, “Flight Scheduling and Maintenance Base Planning,” Management Science, vol. 35, no. 12, pp. 1415–1432, 1989. View at Publisher · View at Google Scholar
  4. N. M. Kabbani and B. W. Patty, “Aircraft routing at american airlines. Proceeding of the thirty-second annual symposium of AGIFORS,” Budapest, Hungary, 1992.
  5. R. Gopalan and K. T. Talluri, “The aircraft maintenance routing problem,” Operations Research, vol. 46, no. 2, pp. 260–271, 1998. View at Publisher · View at Google Scholar · View at Scopus
  6. Z. Liang, Y. Feng, X. Zhang, T. Wu, and W. A. Chaovalitwongse, “Robust weekly aircraft maintenance routing problem and the extension to the tail assignment problem,” Transportation Research Part B: Methodological, vol. 78, pp. 238–259, 2015. View at Publisher · View at Google Scholar · View at Scopus
  7. G. Desaulniers, J. Desrosiers, Y. Dumas et al., “Crew pairing at Air France,” European Journal of Operational Research, vol. 97, no. 2, pp. 245–259, 1997. View at Publisher · View at Google Scholar · View at Scopus
  8. J.-F. Cordeau, G. Stojković, F. Soumis, and J. Desrosiers, “Benders decomposition for simultaneous aircraft routing and crew scheduling,” Transportation Science, vol. 35, no. 4, pp. 375–388, 2001. View at Publisher · View at Google Scholar · View at Scopus
  9. A. Mercier, J.-F. Cordeau, and F. Soumis, “A computational study of Benders decomposition for the integrated aircraft routing and crew scheduling problem,” Computers & Operations Research, vol. 32, no. 6, pp. 1451–1476, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  10. L. Clarke, E. Johnson, G. Nemhauser, and Z. Zhu, “The aircraft rotation problem,” Annals of Operations Research, vol. 69, pp. 33–46, 1997. View at Publisher · View at Google Scholar · View at Scopus
  11. K. T. Talluri, “The four-day aircraft maintenance routing problem,” Transportation Science, vol. 32, no. 1, pp. 43–53, 1998. View at Publisher · View at Google Scholar · View at Scopus
  12. N. L. Boland, L. W. Clarke, and G. L. Nemhauser, “The asymmetric traveling salesman problem with replenishment arcs,” European Journal of Operational Research, vol. 123, no. 2, pp. 408–427, 2000. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  13. Z. Liang, W. A. Chaovalitwongse, H. C. Huang, and E. L. Johnson, “On a new rotation tour network model for aircraft maintenance routing problem,” Transportation Science, vol. 45, no. 1, pp. 109–120, 2011. View at Publisher · View at Google Scholar · View at Scopus
  14. Z. Liang and W. A. Chaovalitwongse, “A network-based model for the integrated weekly aircraft maintenance routing and fleet assignment problem,” Transportation Science, vol. 47, no. 4, pp. 493–507, 2013. View at Publisher · View at Google Scholar · View at Scopus
  15. P. Zhao, N. Tomii, P. N. Fukumura, and T. Sakeguchi, “An algorithm for train-set scheduling based on probabilistic local search,” Comput. In Rail, vol. 8, pp. 817–826, 2002. View at Google Scholar
  16. A. Schrijver, “Minimum circulation of railway stock,” CWI Quarterly, vol. 6, pp. 205–217, 1993. View at Google Scholar
  17. E. Abbink, B. van den Berg, L. Kroon, and M. Salomon, “Allocation of railway rolling stock for passenger trains,” Transportation Science, vol. 38, no. 1, pp. 33–41, 2004. View at Publisher · View at Google Scholar · View at Scopus
  18. M. Peeters and L. Kroon, “Circulation of railway rolling stock: a branch-and-price approach,” Computers and Operations Research, vol. 35, no. 2, pp. 538–556, 2008. View at Publisher · View at Google Scholar · View at Scopus
  19. A. Arianna, R. Groot, L. Kroon, and A. Schrijver, “Efficient circulation of railway rolling stock,” Transportation Science, vol. 40, no. 3, pp. 378–391, 2006. View at Publisher · View at Google Scholar · View at Scopus
  20. P. Fioole, L. Kroon, G. Maróti, and A. Schrijver, “A rolling stock circulation model for combining and splitting of passenger trains,” European Journal of Operational Research, vol. 174, no. 2, pp. 1281–1297, 2006. View at Publisher · View at Google Scholar · View at Scopus
  21. J. Brucker, J. L. Hunrik, and T. Rolfes, “Routing of railways carriages: a case study,” in Osnabrücker Schriften zur Mathematik, Reihe, p. 205, 1998. View at Google Scholar
  22. J.-F. Cordeau, G. Desaulniers, N. Lingaya, F. Soumis, and J. Desrosiers, “Simultaneous locomotive and car assignment at VIA Rail Canada,” Transportation Research Part B: Methodological, vol. 35, no. 8, pp. 767–787, 2001. View at Publisher · View at Google Scholar · View at Scopus
  23. J.-F. Cordeau, F. Soumis, and J. Desrosiers, “Benders decomposition approach for the locomotive and car assignment problem,” Transportation Science, vol. 34, no. 2, pp. 133–149, 2000. View at Publisher · View at Google Scholar · View at Scopus
  24. N. Lingaya, J.-F. Cordeau, G. Desaulniers, J. Desrosiers, and F. Soumis, “Operational car assignment at VIA Rail Canada,” Transportation Research Part B: Methodological, vol. 36, no. 9, pp. 755–778, 2002. View at Publisher · View at Google Scholar · View at Scopus
  25. V. Cacchiani, A. Caprara, and P. Toth, “Solving a real-world train-unit assignment problem,” Mathematical Programming, vol. 124, no. 1-2, Ser. B, pp. 207–231, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, Calif, USA, 1979. View at MathSciNet
  27. G. Maróti and L. Kroon, “Maintenance routing for train units: the interchange model,” Computers and Operations Research, vol. 34, no. 4, pp. 1121–1140, 2007. View at Publisher · View at Google Scholar · View at Scopus
  28. L. Cadarso and A. Marín, “Robust rolling stock in rapid transit networks,” Computers and Operations Research, vol. 38, no. 8, pp. 1131–1142, 2011. View at Publisher · View at Google Scholar · View at Scopus
  29. L. Cadarso and Á. Marín, “Improving robustness of rolling stock circulations in rapid transit networks,” Computers and Operations Research, vol. 51, pp. 146–159, 2014. View at Publisher · View at Google Scholar · View at Scopus
  30. S. Hong, K. M. Kim, K. Lee, and B. Hwan Park, “A pragmatic algorithm for the train-set routing: the case of Korea high-speed railway,” Omega, vol. 37, no. 3, pp. 637–645, 2009. View at Publisher · View at Google Scholar · View at Scopus
  31. P. Thorlacius, J. Larsen, and M. Laumanns, “An integrated rolling stock planning model for the Copenhagen suburban passenger railway,” Journal of Rail Transport Planning and Management, vol. 5, no. 4, pp. 240–262, 2015. View at Publisher · View at Google Scholar · View at Scopus
  32. L. J. Chen, “Application of genetic algorithm to electric multiple unit scheduling,” J. Transport. Engineer. Info, vol. 2, no. 7, pp. 67–71, 2009. View at Google Scholar
  33. L. Tong, L. Nie, and P. Zhao, “Application of ant colony algorithm in train-set scheduling problem,” Journal of Transportation Systems Engineering & Information Technology, vol. 9, no. 6, pp. 161–167, 2009. View at Google Scholar
  34. H. Li, B. M. Han, Q. Zhang, and R. Guo, “Research on optimization model and algorithm of EMU Circulation Plan,” Journal of the China Railway Society, vol. 35, no. 3, pp. 1–8, 2013. View at Google Scholar
  35. Y. Zhou, L. Zhou, and Y. Wang, “Using improved ant colony algorithm to investigate EMU circulation scheduling problem,” Discrete Dynamics in Nature and Society, vol. 2014, Article ID 767429, 2014. View at Publisher · View at Google Scholar · View at Scopus
  36. J. R. Miao, Y. Wang, and Z. X. Yang, “Research on the optimization of EMU circulation basedon optimized connecting network,” J. China Railw. Soc, vol. 32, no. 2, pp. 1–7, 2010. View at Google Scholar
  37. D. E. Goldberg, Genetic Algorithm in Search. Optimization and Machine Learning, Addision-Wesley, Reading (MA).
  38. J. Kim and P. Khosla, “A Multi-population Genetic Algorithm And Its Application To Design Of Manipulators,” in Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 279–286, Raleigh, NC. View at Publisher · View at Google Scholar
  39. S. H. Zegordi and M. A. Beheshti Nia, “A multi-population genetic algorithm for transportation scheduling,” Transportation Research Part E: Logistics and Transportation Review, vol. 45, no. 6, pp. 946–959, 2009. View at Publisher · View at Google Scholar · View at Scopus
  40. X. Gao, H. Yang, L. Lin, and P. Koo, “Wind turbine layout optimization using multi-population genetic algorithm and a case study in Hong Kong offshore,” Journal of Wind Engineering and Industrial Aerodynamics, vol. 139, pp. 89–99, 2015. View at Publisher · View at Google Scholar · View at Scopus
  41. A. Godio, “Multi Population Genetic Algorithm to estimate snow properties from GPR data,” Journal of Applied Geophysics, vol. 131, pp. 133–144, 2016. View at Publisher · View at Google Scholar · View at Scopus
  42. H. Pourvaziri and B. Naderi, “A hybrid multi-population genetic algorithm for the dynamic facility layout problem,” Applied Soft Computing Journal, vol. 24, pp. 457–469, 2014. View at Publisher · View at Google Scholar · View at Scopus