Technical Brief

Computing Schemes for Longitudinal Train Dynamics: Sequential, Parallel and Hybrid

[+] Author and Article Information
Qing Wu

Centre for Railway Engineering,
Central Queensland University,
Rockhampton, QLD 4701, Australia
e-mail: q.wu@cqu.edu.au

Colin Cole

Centre for Railway Engineering,
Central Queensland University,
Rockhampton, QLD 4701, Australia
e-mail: c.cole@cqu.edu.au

Contributed by the Design Engineering Division of ASME for publication in the JOURNAL OF COMPUTATIONAL AND NONLINEAR DYNAMICS. Manuscript received October 4, 2014; final manuscript received February 1, 2015; published online April 16, 2015. Assoc. Editor: Dan Negrut.

J. Comput. Nonlinear Dynam 10(6), 064502 (Nov 01, 2015) (4 pages) Paper No: CND-14-1233; doi: 10.1115/1.4029716 History: Received October 04, 2014; Revised February 01, 2015; Online April 16, 2015

Conventionally, force elements in longitudinal train dynamics (LTD) are determined sequentially. Actually, all these force elements are independent from each other, i.e., determination of each one does not require inputs from others. This independent feature makes LTD feasible for parallel computing. A parallel scheme has been proposed and compared with the conventional sequential scheme in regard to computational efficiency. The parallel scheme is tested as not suitable for LTD; computing time of the parallel scheme is about 165% of the sequential scheme on a four-CPU personal computer (PC). A modified parallel scheme named the hybrid scheme was then proposed. The computing time of the hybrid scheme is only 70% of the sequential scheme. The other advantage of the hybrid scheme is that only two processors are required, which means the hybrid scheme can be implemented on PCs.

Copyright © 2015 by ASME
Your Session has timed out. Please sign back in to continue.


Evans, J., and Berg, M., 2009, “Challenges in Simulation of Rail Vehicle Dynamics,” Veh. Syst. Dyn., 47(8), pp. 1023–1048. [CrossRef]
Wu, Q., Luo, S., and Cole, C., 2014, “Longitudinal Dynamics and Energy Analysis for Heavy Haul Trains,” J. Mod. Transp., 22(3), pp. 127–136. [CrossRef]
Wu, Q., Cole, C., and Spiryagin, M., 2014, “Methodology for Optimization of Friction Draft Gear Design,” ASME Paper No. DETC2014-34162. [CrossRef]
Negrut, D., Serban, R., Mazhar, H., and Heyn, T., 2014, “Parallel Computing in Multibody System Dynamics: Why, When and How,” ASME J. Comput. Nonlinear Dyn., 9(4), p. 041007. [CrossRef]
Kogut, J., and Ciurej, H., 2010, “A Vehicle-Track-Soil Dynamic Interaction Problem in Sequential and Parallel Formulation,” Int. J. Appl. Math. Comput. Sci., 20(2), pp. 295–303. [CrossRef]
Diedrichs, B., 2003, “On Computational Fluid Dynamics Modelling of Crosswind Effects for High-Speed Rolling Stock,” Proc. Inst. Mech. Eng. Part F J. Rail Rapid Transit, 217(3), pp. 203–226. [CrossRef]
Eberhard, P., Dignath, F., and Kubler, L., 2003, “Parallel Evolutionary Optimization of Multibody Systems With Application to Railway Dynamics,” Multibody Syst. Dyn., 9(2), pp. 143–164. [CrossRef]
Wu, Q., Spiryagin, M., and Cole, C., “Advanced Dynamic Modelling for Friction Draft Gears,” Veh. Syst. Dyn. (published online 1/30/2015) [CrossRef]
Balaji, P., Bland, W., Gropp, W., Latham, R., Lu, H., Pena, A., Raffenetti, K., Thakur, R., and Zhang, J., 2014, “MPICH User's Guide, Version 3.1.1,” Mathematics and Computer Science Division Argonne National Laboratory, Argonne (IL). Available at: http://www.mpich.org/static/downloads/3.1.1/mpich-3.1.1-userguide.pdf


Grahic Jump Location
Fig. 6

Computing schemes: (a) sequential, (b) parallel and (c) hybrid. PM: numerical solver and simulation environment initialization; Br: organizing process broadcasts information and parallelized processes receive information; Ga: parallelized processes send information and organizing process gathers information.

Grahic Jump Location
Fig. 5

Computing load analysis

Grahic Jump Location
Fig. 4

Train control information

Grahic Jump Location
Fig. 2

Force elements in LTD

Grahic Jump Location
Fig. 1

Schematic for (a) sequential computing and (b) parallel computing. P1, P2: independent processes; CO: communication procedures; PM: indispensable organizing process.

Grahic Jump Location
Fig. 7

Computational efficiency



Some tools below are only available to our subscribers or users with an online account.

Related Content

Customize your page view by dragging and repositioning the boxes below.

Related Journal Articles
Related eBook Content
Topic Collections

Sorry! You do not have access to this content. For assistance or to subscribe, please contact us:

  • TELEPHONE: 1-800-843-2763 (Toll-free in the USA)
  • EMAIL: asmedigitalcollection@asme.org
Sign In