Hybrid Contact Search Algorithm for Wheel/Rail Contact Problems

Author(s):  
Hiroyuki Sugiyama ◽  
Yoshihiro Suda

In this investigation, the on-line and off-line hybrid contact algorithm for modeling wheel/rail contact problems is developed based on the elastic contact formulation. In the tabular contact search used in existing specialized railroad vehicle dynamics codes, contact points are predicted using an assumption of rigid contacts. For this reason, the contact points can be different from those predicted by the on-line based contact search used in general elastic contact formulations. The difference in the contact point becomes significant when flange contacts that have large contact angles are considered. In the hybrid algorithm developed in this investigation, the off-line tabular search is used for treating tread contacts, while the on-line iterative search is used for treating flange contacts. By so doing, a computationally efficient procedure is achieved while keeping accurate predictions of contact points on the wheel flange. Furthermore, the use of the proposed hybrid algorithm can eliminate the use of time-consuming on-line search procedures for the second points of contact as well. Since the location of second points of contact is pre-computed in the contact geometry analysis, the occurrence of two-point contact can be predicted using the look-up table in a straightforward manner. For the two-point contact scenarios encountered in curve negotiations, the online search is used for flange contacts, while the off-line search is used for tread contacts simultaneously. The on-line one-point contact search is also important for flange climb scenarios. It is demonstrated by several numerical examples that the proposed hybrid contact search algorithm can be effectively used for modeling wheel/rail contacts in the analysis of general multibody railroad vehicle systems.

Author(s):  
Hiroyuki Sugiyama ◽  
Yoshihiro Suda

In this investigation, contact search algorithms for the analysis of wheel/rail contact problems are discussed, and the on-line and off-line hybrid contact search method is developed for multibody railroad vehicle dynamics simulations using the elastic contact formulation. In the hybrid algorithm developed in this investigation, the off-line search that can be effectively used for the tread contact is switched to the on-line search when the contact point is jumped to the flange region. In the two-point contact scenarios encountered in curve negotiations, the on-line search is used for both tread and flange contacts to determine the two-point contact configuration. By so doing, contact points on the flange region given by the off-line tabular search are never used, but rather used as an initial estimate for the online iterative procedure for improving the numerical convergence. Furthermore, the continual on-line detection of the second point of contact is replaced with a simple table look-up. It is demonstrated by several numerical examples that include flange climb and curve negotiation scenarios that the proposed hybrid contact search algorithm can be effectively used for modeling wheel/rail contacts in the analysis of general multibody railroad vehicle dynamics.


Author(s):  
Shunpei Yamashita ◽  
Hiroyuki Sugiyama

In this investigation, a numerical procedure for wheel/rail contact problems in the analysis of curve negotiation of railroad vehicles is developed using constraint/elastic contact approach. In particular, this work focuses on the flange contact detection algorithm using the two-point look-up contact table and the switching algorithm from the elastic to constraint contact for the flange climb simulation. The two-point look-up contact table is used for the contact search of the second point of contact modeled using the elastic contact, while the constraint contact is used for the first point of contact on the wheel tread. Furthermore, in the flange climb simulation using the constraint contact formulation, loss of a tread contact modeled using the constraint contact occurs. Therefore, the elastic contact used for modeling the flange contact in the two-point contact state needs to be switched to the constraint contact as soon as loss of the tread contact occurs. For this reason, if the Lagrange multiplier associated with the contact constraint becomes greater than or equal to zero, the elastic contact used for the flange is switched to the constraint contact. The computational algorithm for the proposed switching algorithm is also presented. Several numerical examples are presented in order to demonstrate the use of the numerical procedure developed in this investigation for modeling the two-point tread/flange contact as well as the flange climb behavior. Numerical results are in good agreement with those of the existing fully elastic contact formulation. Furthermore, it is shown that significant reduction in CPU time is achieved using the numerical procedure developed in this investigation.


Author(s):  
Hiroyuki Sugiyama ◽  
Takuto Sekiguchi ◽  
Ryosuke Matsumura ◽  
Shunpei Yamashita ◽  
Yoshihiro Suda

In this investigation, a numerical procedure that can be used for solving complex wheel/rail contact problems in turnout is proposed. In particular, a combined nodal and non-conformal contact approach is developed such that significant jumps in contact points are detected using the nodal search, while the exact location of contact point is then determined with continuous surface parameterizations using non-conformal contact equations. With this combined nodal and non-conformal contact approach for the contact geometry analysis of vehicle/turnout interactions, multiple look-up contact tables can be generated in an efficient way without losing accuracy. Since detailed contact search is performed offline to obtain look-up contact tables, significant changes in contact points in turnout can be efficiently predicted online with tabular data to be interpolated in a standard way. Several numerical examples are presented in order to demonstrate the use of the numerical procedure developed in this investigation.


2014 ◽  
Vol 8 (1) ◽  
pp. 218-221 ◽  
Author(s):  
Ping Hu ◽  
Zong-yao Wang

We propose a non-monotone line search combination rule for unconstrained optimization problems, the corresponding non-monotone search algorithm is established and its global convergence can be proved. Finally, we use some numerical experiments to illustrate the new combination of non-monotone search algorithm’s effectiveness.


2021 ◽  
Vol 63 (4) ◽  
pp. 1669-1686
Author(s):  
Jiajia Li ◽  
Weihong Zhang ◽  
Cao Niu ◽  
Tong Gao

2006 ◽  
Vol 14 (2) ◽  
pp. 223-253 ◽  
Author(s):  
Frédéric Lardeux ◽  
Frédéric Saubion ◽  
Jin-Kao Hao

This paper presents GASAT, a hybrid algorithm for the satisfiability problem (SAT). The main feature of GASAT is that it includes a recombination stage based on a specific crossover and a tabu search stage. We have conducted experiments to evaluate the different components of GASAT and to compare its overall performance with state-of-the-art SAT algorithms. These experiments show that GASAT provides very competitive results.


Sign in / Sign up

Export Citation Format

Share Document