Search

Boosting the rail freight modal share is an ambitious target in Europe and North America. Yards, where freight trains are arranged, can be crucial in realizing this target by reliable dispatching to the network. This paper predicts freight train departures by developing a simulation‐assisted machine learning model with two concepts: general (adding all predictors at once) and step‐wise (adding predictors as they become available in sub‐yard operations) for hump yards with the conventional layout to provide a generalized model for European and North American contexts. The developed model is a decision tree algorithm, validated via 10‐fold cross‐validation. The model's performance on three data sets—a real‐world European yard, a baseline simulation, and an ultimate randomness simulation for a comparable North American yard—shows a respective R2$R^2$ of 0.90, 0.87, and 0.70. Step‐wise inclusion of the predictors results differently for the real‐world and simulation data. The global feature importance highlights maximum planned length, departure weekday, the number of arriving trains, and minimum arrival deviation as key predictors for the real‐world data. For the simulation data, the most significant predictors are departure yard predictors, the number of arriving trains, and the maximum hump duration. Additionally, utilization rates—except for the receiving yard—enhance the predictions. [ABSTRACT FROM AUTHOR]

Summary: This paper presents an extended version of Deeper, a search‐based simulation‐integrated test solution that generates failure‐revealing test scenarios for testing a deep neural network‐based lane‐keeping system. In the newly proposed version, we utilize a new set of bio‐inspired search algorithms, genetic algorithm (GA), (μ+λ) and (μ,λ) evolution strategies (ES), and particle swarm optimization (PSO), that leverage a quality population seed and domain‐specific crossover and mutation operations tailored for the presentation model used for modeling the test scenarios. In order to demonstrate the capabilities of the new test generators within Deeper, we carry out an empirical evaluation and comparison with regard to the results of five participating tools in the cyber‐physical systems testing competition at SBST 2021. Our evaluation shows the newly proposed test generators in Deeper not only represent a considerable improvement on the previous version but also prove to be effective and efficient in provoking a considerable number of diverse failure‐revealing test scenarios for testing an ML‐driven lane‐keeping system. They can trigger several failures while promoting test scenario diversity, under a limited test time budget, high target failure severity, and strict speed limit constraints. [ABSTRACT FROM AUTHOR]

Artificial intelligence in manufacturing systems is currently most used for quality control and predictive maintenance. In the lock industry, quality control of final assembled cylinder lock is still done by hand, wearing out the operators' wrists and introducing subjectivity which negatively affects reliability. Studies have shown that quality control can be automated using machine-learning to analyse torque measurements from the locks. The resulting performance of the approach depends on the dimensionality and size of the training dataset but unfortunately, the process of gathering data can be expensive so the amount collected data should therefore be minimized with respect to an acceptable performance measure. The dimensionality can be reduced with a method called Principal Component Analysis and the training dataset size can be estimated by repeated testing of the algorithms with smaller datasets of different sizes, which then can be used to extrapolate the expected performance for larger datasets. The purpose of this study is to evaluate the state-of-the-art methods to predict and minimize the needed sample size for commonly used machine-learning algorithms to reach an acceptable anomaly detection accuracy using torque measurements from locks. The results show that the learning curve with the best fit to the training data does not always give the best predictions. Instead, performance depends on the amount of data used to create the curve and the particular machine-learning algorithm used. Overall, the exponential and power-law functions gave the most reliable predictions and the use of principal component analysis greatly reduced the learning effort for the machine-learning algorithms. With torque measurements from 50-150 locks, we predicted a detection accuracy of over 95% while the current method of using the human tactile sense gives only 16% accuracy. [ABSTRACT FROM AUTHOR]

The importance of efficient software testing procedures is driven by an ever increasing system complexity as well as global competition. In the particular case of manual test cases at the system integration level, where thousands of test cases may be executed before release, time must be well spent in order to test the system as completely and as efficiently as possible. Automating a subset of the manual test cases, i.e, translating the manual instructions to automatically executable code, is one way of decreasing the test effort. It is further common that test cases exhibit similarities, which can be exploited through reuse when automating a test suite. In this paper, we investigate the potential for reducing test effort by ordering the test cases before such automation, given that we can reuse already automated parts of test cases. In our analysis, we investigate several approaches for prioritization in a case study at a large Swedish vehicular manufacturer. The study analyzes the effects with respect to test effort, on four projects with a total of 3919 integration test cases constituting 35,180 test steps, written in natural language. The results show that for the four projects considered, the difference in expected manual effort between the best and the worst order found is on average 12 percentage points. The results also show that our proposed prioritization method is nearly as good as more resource demanding meta-heuristic approaches at a fraction of the computational time. Based on our results, we conclude that the order of automation is important when the set of test cases contain similar steps (instructions) that cannot be removed, but are possible to reuse. More precisely, the order is important with respect to how quickly the manual test execution effort decreases for a set of test cases that are being automated. [ABSTRACT FROM AUTHOR]

Increasing the modal share of the single wagonload transport in Europe requires improving the reliability and predictability of freight trains running between the yards. In this paper, we propose a novel machine learning-assisted macro simulation framework to increase the predictability of yard departures and arrivals. Machine learning is applied through a random forest algorithm to implement a yard departure prediction model. Our yard departure prediction approach is less complex compared to previous yard simulation approaches, and provides an accuracy level of 92% in predictions. Then, departure predictions assist a macro simulation network model (PROTON) to predict arrivals to the succeeding yards. We tested this framework using data from a stretch between two main yards in Sweden; our experiments show that the current framework performs better than the timetable and a basic machine learning arrival prediction model by R 2 of 0.48 and a mean absolute error of 35 minutes. Our current results indicate that combination of approaches, including yard and network interactions, can yield competitive results for complex yard arrival time prediction tasks which can assist yard operators and infrastructure managers in yard re-planning processes and yard-network coordination respectively. • Machine learning-assisted macro simulation for yard departure and arrival predictions • A model framework to include yard and network interactions • Application of random forest algorithm for yard departure prediction [ABSTRACT FROM AUTHOR]