Genetic algorithm based on conflict detecting for solving departure time domains of passenger trains

References

• Adenso-Diaz, B., Oliva González, M. and González-torre, P. 1999. On-line timetable rescheduling in regional train services, Transportation Research Part B, 33, 378–398.
   Google Scholar
• Aklsada, D. 1979. Study on Shinkansen train control-to maintain steady train operation, Journal of the Quarterly Reports of RTRI, 20, (2), 49–56.
   Google Scholar
• Amit, I. and Goldfarb, D. 1971. The timetable problem for railways, in Developments in operations research, (ed. Avi-Itzhak B.., 379–387; New York, Gordon and Breach.
   Google Scholar
• Bussieck, M. 1998. Optimal lines in public rail transport. . PhD thesis, Technische Universität Braunschweig..
   Google Scholar
• Carey, M. and Kwieeinski, A. 1994. Swapping the order of scheduled services to minimize expected costs of delays, Transportation Research, 28, (6), 409–428.
   Google Scholar
• Carey, M. and Lockwood, D. 1995. A model algorithms and strategy for train pathing, Journal of the Operational Research Society, 46, (8), 988–1005.
   Web of Science ®Google Scholar
• Chen, D. J. and Wu, K. T. 2012. Research on optimization model and algorithm of initial schedule of intercity passenger trains based on fuzzy sets, Journal of Software, 7, (1), 49–54.
   Google Scholar
• Chen, D. J., Lv, M. M. and Ni, S. Q. 2012. Optimization model and algorithm for departure time domain of passenger trains based on conflicts detecting and node important degree, Advanced Science Letters, 11, (5), 722–725.
   Google Scholar
• Chen, T. S., Mao, B. H. and He, Y. Q. 2006. Study on optimization of the departure time range of passenger trains, Journal of the China Railway Society, 28, (4), 12–16.
   Google Scholar
• Cheng, Y. 1998. Hybrid simulation for resolving resource conflicts in train traffic rescheduling, Computers in Industry, 35, 233–246.
   Web of Science ®Google Scholar
• Choi, I. C., Kim, S. I. and Kim, H. S. 2003. A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem, Computers and Operations Research, 30, 773–786.
   Web of Science ®Google Scholar
• Fan, B. and Weston, C. R. P. 2012. A comparison of algorithms for minimizing delay costs in disturbed railway traffic scenarios, Journal of Rail Transport Planning & Management, 2, (1), 223–233.
   Google Scholar
• Frank, O. 1965. Two-way traffic on a single line of railway, Operations Research, 14, 801–811.
   Web of Science ®Google Scholar
• Fu, Z. 1996a. Study on optimization method of passenger train operation plan, Journal of the China Railway Society, 18, (4), 10–17.
   Google Scholar
• Fu, Z. 1996b. Passenger trains operation plan method to optimize the number of passenger coaching stock, Journal of the China Railway Society, 18, (6), 6–13.
   Google Scholar
• Johanna, T. 2005. Computer-based decision support for railway traffic scheduling and dispatching: a review of models and algorithms, in 5th Workshop on Algorithmic Methods and Models for Optimization of Railways, 1–23.
   Google Scholar
• Johanna, T. 2006. Computer-based decision support for railway traffic scheduling and dispatching: a review of models and algorithms, in 5th Workshop on Algorithmic Methods and Models for Optimization of Railway, Dagstuhl, Germany, 659–681.
   Google Scholar
• Jovanovic, D. and Harker, P. T. 1991. Tactical scheduling of train operations: the SCAN I system, Transportation Science, 25, (1), 46–64.
   Web of Science ®Google Scholar
• Lee, Y. S. and Chen, C. Y. 2009. A heuristic for the train pathing and timetabling problem, Transportation Research Part B, 43, 837–851.
   Google Scholar
• Li, F., Gao, Z. Y., Li, K. P. and Yang, L. X. 2008. Efficient scheduling of railway traffic based on global information of train, Transportation Research Part B, 42, 1008–1030.
   Google Scholar
• Miguel, A., Salido, Federico Barber and Laura, I. 2012. Robustness for a single railway line: analytical and simulation methods, Expert Systems with Applications, 39, 13305–13327.
   Web of Science ®Google Scholar
• Ni, S. Q., Chen, D. J. and Lv, M. M. 2009. Research on optimization model of initial schedule of passenger trains based on improved genetic algorithm, Intelligent Computing Technology and Automation, 3, 273–276.
   Google Scholar
• Ni, S. Q., Lv, M. M., Chen, D. J. and Lv, H. X. 2012. Departure time domain optimization model of passenger trains based on heuristic algorithm, International Review on Computers and Software, 7, (4), 1755–1759.
   Google Scholar
• Ni, S. Q., Yang, M. L. and Peng, Q. Y. 1995. Research on the expert system for working out train graphs, Journal of Southwest Jiao Tong University, 30, (5), 550–556.
   Google Scholar
• Petersen, E. R. and Taylor, A. J. 1982. A structured model for rail line simulation and optimization, Transportation Science, 6, (2), 192–206.
   Google Scholar
• Serafini, P. and Ukovich, W. 1989. A mathematical model for periodic event scheduling problems, Journal of Discrete Mathematics, 2, (4), 550–581.
   Google Scholar
• Valentina, C. and Paolo, T. 2012. Nominal and robust train timetabling problems, European Journal of Operational Research, 219, 727–737.
   Web of Science ®Google Scholar
• Vansteenwegen, P. and Van Oudheusden, D. 2006. Developing railway timetables which guarantee a better service, European Journal of Operational Research, 173, 337–350.
   Web of Science ®Google Scholar
• Xu, R. H., Zhang, M. and Jiang, Z. B. 2008. Study on the first and last train departure time of city rail transit based on network operation coordination, Journal of the China Railway Society, 30, (2), 7–11.
   Google Scholar
• Zhang, Y. Z. and Yan, Y. S. 2010. Study on determination method of passenger off-line train reasonable departure range, Journal of LanZhou JiaoTong University, 3, 79–82.
   Google Scholar
• Zhou, X. S. and Zhong, M. 2005. Bicriteria train scheduling for high-speed passenger railroad planning applications, European Journal of Operational Research, 167, 752–771.
   Web of Science ®Google Scholar