Development of Rational Rail Network Topology for High-Speed and Conventional Trains Based on Bacterial Foraging Optimization

  • Abstract
  • Keywords
  • References
  • PDF
  • Abstract

    Development of projects on higher speeds of passenger trains on the world railways requires investigation into the balanced combination of routes for high-speed and conventional trains considering railway network topology. The objective of the study is consideration of railway network peculiarities regarding transportation demand by designing a mathematical model to find an optimal passenger train flow distribution. In order to formalize the process of a simultaneous search for the rail passenger network topology and determination of the most probable distribution within the formed train flow network for high-speed and conventional trains it has been proposed to use a criterion as a system entropy adapted to the rail passenger-oriented transportation. The concept of entropy is based on isomorphism in systems, which allows monitoring and implementing the link between a micro and macro level in the passenger transportation system. To solve the mathematical model the authors have used an optimization method based on Bacterial Foraging Optimization (BFO). The implementation of the mathematical model based on BFO will make it possible to theoretically substantiate the efficiency of existing and promising projects on higher speeds of passenger trains on the rail transport regarding adaptation of the network topology to transportation demand.



  • Keywords

    Bacterial Foraging Optimization; high-speed train; network topology; passenger transportation planning; railway transport.

  • References

      [1] Wardrop JC (1952), ”Some Theoretical Aspects of Road Traffic Research”, Proceedings, Institution of Civil Engineers Part 2, 9, 325-378.

      [2] Drezner Z & Wesolowsky G (2003), ”Network design: Selection and Design of Links and Facility Location”, Transportation Research Part A, 37, 241-256.

      [3] Garrison WL & Souleyrette RR (1996), ”Transportation, Innovation, and Development: The Companion Innovation Hypothesis”, Logistics and Transportation Review, 32, 5-37.

      [4] Krugman P. (1996), “The Self-Organizing Economy”, Blackwell, Malden, 53–100.

      [5] Helbing D, Keltsch J & Molnár P (1997), ”Modeling the evolution of human trail systems”, Nature, 388(6637), 47-50.

      [6] Newman M. (2003), ”The structure and function of complex networks”, SIAM Review, 45, 167-256,

      [7] Wang L, Li-min Jia, Yong Qin, Jie Xu & Wen-ting Mo (2011), ”A two-layer optimization model for high-speed railway line planning”, Journal of Zhejiang University-SCIENCE A, 12(12), 902-912.

      [8] Butko T, Prokhorchenko A & Zhurba O (2010), ”Modelling of distribution of passenger traffic on trains on the basis of swarm intelligence”, Eastern-European Journal of Enterprise Technologies, 2/4(44), 44-47. available online:, last visit:22.05.2018

      [9] Xin Qi & Jian Xiong,Optimization method of passenger train plan based on stop schedule plan for passenger dedicated line”, 2012 2nd International Conference on Uncertainty Reasoning and Knowledge Engineering, IEEE, (2012), pp: 204-207,

      [10] Wilson AJ (1969), ”Entropy maximizing models in the theory of trip distributions, mode split and route split”, J. Transp. Econ. Policy, 3, 108-126.

      [11] Yen JY (1971), ”Finding the K shortest loopless path in a network”, Management Science, 17, 712-716.

      [12] Liu Y & Passino KM, (2002), ”Biomimicry of Social Foraging Bacteria for Distributed Optimization: Models, Principles, and Emergent Behaviors”, Journal of Optimization Theory and Applications, 3(115), 603-628,

      [13] Passino KM (2002), ”Biomimicry of bacterial foraging for distributed optimization and control”, IEEE Control System Magazine, 3(22), 52-67.

      [14] Stephen L Campbell, Jean-Philippe Chancelier & Ramine Nikoukhah, Modeling and Simulation in Scilab/Scicos. New York: Springer, (2006).




Article ID: 19790
DOI: 10.14419/ijet.v7i4.3.19790

Copyright © 2012-2015 Science Publishing Corporation Inc. All rights reserved.