Ant colony optimization algorithms simulate ants moving from point to point on a graph and coordinate their actions, similar to ants laying down pheromones to strengthen a path as it is used more frequently. These ACO algorithms can be applied to the classic traveling salesman problem, which aims to determine the lowest-cost path through a given set of points on a graph. In this study, a novel multiple-colony system was developed that uses multiple simulated ant colonies to generate improved solutions to the traveling salesman problem.

In this work, the authors develop an algorithm that solves the problem of efficient space travel between planets. This is a problem that could soon be of relevance as mankind continues to expand its exploration of outer space, and potentially attempt to inhabit it.

Here, seeking to better understand the control algorithms used in autonomous vehicles, the authors compared the Stanley and pure pursuit control algorithms along with a new version of each. Unexpectedly, they found that no control algorithm offered optimal performance, but rather resulted in tradeoffs between the various ideal results.

Collisions of heavy ions, such as muons result in jets and noise. In high-energy particle physics, researchers use jets as crucial event-shaped observable objects to determine the properties of a collision. However, many ionic collisions result in large amounts of energy lost as noise, thus reducing the efficiency of collisions with heavy ions. The purpose of our study is to analyze the relationships between properties of muons in a dimuon collision to optimize conditions of dimuon collisions and minimize the noise lost. We used principles of Newtonian mechanics at the particle level, allowing us to further analyze different models. We used simple Python algorithms as well as linear regression models with tools such as sci-kit Learn, NumPy, and Pandas to help analyze our results. We hypothesized that since the invariant mass, the energy, and the resultant momentum vector are correlated with noise, if we constrain these inputs optimally, there will be scenarios in which the noise of the heavy-ion collision is minimized.

The authors use the Lanczos algorithm to computationally solve the Schrodinger equation for 2D potentials with a Python program

Here, seeking to identify an optimal method to classify tree species through remote sensing, the authors used a few machine learning algorithms to classify forest tree species through multispectral satellite imagery. They found the Random Forest algorithm to most accurately classify tree species, with the potential to improve model training and inference based on the inclusion of other tree properties.

Digital compasses are essential in technology that we use in our everyday lives: phones, vehicles, and more. Li and Liu address the accuracy of these devices by presenting a new algorithm for accurately calibrating low-cost magnetometers.

The authors looked at using genetic algorithms to look at the Indian labor market and what features might best explain any variation seen. They found that features such as economic growth and household consumption, among others, best explained variation.

Here, the authors investigated methods to reduce noise in audio composed of real-word sounds. They specifically used two spectral subtraction noise reduction algorithms: stationary and non-stationary finding notable differences in noise improvements depending on the noise sources.

Each year, over 100,000 patients die from Sudden Unexpected Death in Epilepsy (SUDEP). A reliable seizure warning system can help patients stay safe. This work presents a comprehensive, comparative analysis of three different signal processing algorithms for automated seizure/ictal detection. The experimental results show that the proposed methods can be effective for accurate automated seizure detection and monitoring in clinical care.