Search

The fast, convenient, and accurate determination of railroad cars' load mass is critical to ensure safety and allow asset counting in railway infrastructure. In this paper, we propose a method for modeling the mechanical deformations that occur in the rail web under the influence of a static load transmitted through a railway wheel. According to the proposed method, a railroad car's weight can be determined from the rail deformation values. A solid model of a track section, including a railroad tie, rail, and wheel, is developed, and a multi-physics simulation technique that allows for the determination of the values of deformations and mechanical stresses in the strain gauge installation areas is presented. The influence of the loaded mass, the temperature of the rail, and the wheel position relative to the strain gauge location is considered. We also consider the possibility of using artificial neural networks to determine railroad cars' weight without specifying the coordinates of the wheel position. The effect of noise in the data on the accuracy of determining the railroad car weight is considered. [ABSTRACT FROM AUTHOR]

This paper addresses Very large‐scale integration (VLSI) placement optimization, which is important because of the rapid development of VLSI design technologies. The goal of this study is to develop a hybrid algorithm for VLSI placement. The proposed algorithm includes a sequential combination of a genetic algorithm and an evolutionary algorithm. It is commonly known that local search algorithms, such as random forest, hill climbing, and variable neighborhoods, can be effectively applied to NP‐hard problem‐solving. They provide improved solutions, which are obtained after a global search. The scientific novelty of this research is based on the development of systems, principles, and methods for creating a hybrid (combined) placement algorithm. The principal difference in the proposed algorithm is that it obtains a set of alternative solutions in parallel and then selects the best one. Nonstandard genetic operators, based on problem knowledge, are used in the proposed algorithm. An investigational study shows an objective‐function improvement of 13%. The time complexity of the hybrid placement algorithm is O(N2). [ABSTRACT FROM AUTHOR]