Search Operations Research Articles

Penetrating Barriers: Noncontact Measurement of Vital Bio Signs Using Radio Frequency Technology.

The noninvasive measurement and sensing of vital bio signs, such as respiration and cardiopulmonary parameters, has become an essential part of the evaluation of a patient's physiological condition. The demand for new technologies that facilitate remote and noninvasive techniques for such measurements continues to grow. While previous research has made strides in the continuous monitoring of vital bio signs using lasers, this paper introduces a novel technique for remote noncontact measurements based on radio frequencies. Unlike laser-based methods, this innovative approach offers the advantage of penetrating through walls and tissues, enabling the measurement of respiration and heart rate. Our method, diverging from traditional radar systems, introduces a unique sensing concept that enables the detection of micro-movements in all directions, including those parallel to the antenna surface. The main goal of this work is to present a novel, simple, and cost-effective measurement tool capable of indicating changes in a subject's condition. By leveraging the unique properties of radio frequencies, this technique allows for the noninvasive monitoring of vital bio signs without the need for physical contact or invasive procedures. Moreover, the ability to penetrate barriers such as walls and tissues opens new possibilities for remote monitoring in various settings, including home healthcare, hospital environments, and even search and rescue operations. In order to validate the effectiveness of this technique, a series of experiments were conducted using a prototype device. The results demonstrated the feasibility of accurately measuring respiration patterns and heart rate remotely, showcasing the potential for real-time monitoring of a patient's physiological parameters. Furthermore, the simplicity and low-cost nature of the proposed measurement tool make it accessible to a wide range of users, including healthcare professionals, caregivers, and individuals seeking to monitor their own health.

ERABiLNet: enhanced residual attention with bidirectional long short-term memory

Alzheimer’s Disease (AD) causes slow death in brain cells due to shrinkage of brain cells which is more prevalent in older people. In most cases, the symptoms of AD are mistaken as age-related stresses. The most widely utilized method to detect AD is Magnetic Resonance Imaging (MRI). Along with Artificial Intelligence (AI) techniques, the efficacy of identifying diseases related to the brain has become easier. But, the identical phenotype makes it challenging to identify the disease from the neuro-images. Hence, a deep learning method to detect AD at the beginning stage is suggested in this work. The newly implemented “Enhanced Residual Attention with Bi-directional Long Short-Term Memory (Bi-LSTM) (ERABi-LNet)” is used in the detection phase to identify the AD from the MRI images. This model is used for enhancing the performance of the Alzheimer’s detection in scale of 2–5%, minimizing the error rates, increasing the balance of the model, so that the multi-class problems are supported. At first, MRI images are given to “Residual Attention Network (RAN)”, which is specially developed with three convolutional layers, namely atrous, dilated and Depth-Wise Separable (DWS), to obtain the relevant attributes. The most appropriate attributes are determined by these layers, and subjected to target-based fusion. Then the fused attributes are fed into the “Attention-based Bi-LSTM”. The final outcome is obtained from this unit. The detection efficiency based on median is 26.37% and accuracy is 97.367% obtained by tuning the parameters in the ERABi-LNet with the help of Modified Search and Rescue Operations (MCDMR-SRO). The obtained results are compared with ROA-ERABi-LNet, EOO-ERABi-LNet, GTBO-ERABi-LNet and SRO-ERABi-LNet respectively. The ERABi_LNet thus provides enhanced accuracy and other performance metrics compared to such deep learning models. The proposed method has the better sensitivity, specificity, F1-Score and False Positive Rate compared with all the above mentioned competing models with values such as 97.49%.97.84%,97.74% and 2.616 respective;y. This ensures that the model has better learning capabilities and provides lesser false positives with balanced prediction.

Adaptive large neighborhood search for drayage routing problems involving longer combination vehicles

Longer combination vehicles (LCVs)—tractor-trailer combinations with two or more trailers—can move more cargo per trip than standard trucks, potentially reducing costs and emissions. Acknowledging this, the drayage industry has recently launched initiatives to increase the adoption of LCVs, aiming to mitigate supply chain issues. This paper aims to support these kinds of initiatives by tackling drayage routing problems involving LCVs and further aspects, such as heterogeneous truck fleets, containers of any size and cargo category, and compatibility constraints based on the containers’ sizes and loads. As solution method, we propose an adaptive large neighborhood search (ALNS) heuristic, whose search operators account for aspects such as truck/container compatibility and load configurations specific to each truck. The proposed ALNS heuristic also incorporates a novel acceptance criterion that seeks to escape local optima while allowing for revisiting the current best solution and avoiding search stagnation. Through a series of benchmark tests against a state-of-the-art exact approach, we show that the proposed ALNS heuristic can consistently find high-quality solutions for a wide range of instances while, in some cases, cutting runtimes from hours or even days to a few minutes. We also show that the proposed acceptance criterion enables improved performance. Finally, we use the proposed ALNS heuristic to derive managerial insights into the savings delivered by different types of LCVs in drayage operations.

Deep reinforcement learning assisted memetic scheduling of drones for railway catenary deicing

Icy rainfall and snowfall in 2024 Spring Festival struck the high-speed railway catenary systems and caused serious traffic disruptions in central and eastern China. Deicing drones are an effective method in response to these freezing events due to their fast speed and high environmental tolerance. However, the large disaster-affected area and the large scale and complexity of catenary networks make deicing drone scheduling a very difficult problem. In this paper, we formulate two versions of deicing drone scheduling problem, one for single drone scheduling and the other for multiple drone scheduling. Unlike most existing vehicle/drone routing problems, our problem aims to minimize the total negative effect caused by the freezing events on train operations, which reflects the prime concern of the decision-maker and is highly complex. To efficiently solve the problem, we propose a reinforcement learning assisted memetic optimization algorithm, which integrates global mutation and a set of neighborhood search operators adaptively selected by deep reinforcement learning. Computational results on real-world problem instances demonstrate its significant performance advantages over selected popular optimization algorithms in the literature.

A Review of Multi-UAV Task Allocation Algorithms for a Search and Rescue Scenario

Unmanned aerial vehicles (UAVs) play a crucial role in enhancing search and rescue (SAR) operations by accessing inaccessible areas, accomplishing challenging tasks, and providing real-time monitoring and modeling in situations where human presence is unsafe. Multi-UAVs can collaborate more efficiently and cost-effectively than a single large UAV for performing SAR operations. In multi-UAV systems, task allocation (TA) is a critical and complex process involving cooperative decision making and control to minimize the time and energy consumption of UAVs for task completion. This paper offers an exhaustive review of both static and dynamic TA algorithms, confidently assessing their strengths, weaknesses, and limitations. It provides valuable insights into addressing research questions related to specific UAV operations in SAR. The paper rigorously discusses outstanding issues and challenges and confidently presents potential directions for the future development of task assignment algorithms. Finally, it confidently highlights the challenges of multi-UAV dynamic TA methods for SAR. This work is crucial for gaining a comprehensive understanding of multi-UAV dynamic TA algorithms and confidently emphasizes critical open issues and research gaps for future SAR research and development, ensuring that readers feel informed and knowledgeable.

Bi-Directional and Operand-Controllable In-Memory Computing for Boolean Logic and Search Operations with Row and Column Directional SRAM (RC-SRAM).

The von Neumann architecture is no longer sufficient for handling large-scale data. In-memory computing has emerged as the potent method for breaking through the memory bottleneck. A new 10T SRAM bitcell with row and column control lines called RC-SRAM is proposed in this article. The architecture based on RC-SRAM can achieve bi-directional and operand-controllable logic-in-memory and search operations through different signal configurations, which can comprehensively respond to various occasions and needs. Moreover, we propose threshold-controlled logic gates for sensing, which effectively reduces the circuit area and improves accuracy. We validate the RC-SRAM with a 28 nm CMOS technology, and the results show that the circuits are not only full featured and flexible for customization but also have a significant increase in the working frequency. At VDD = 0.9 V and T = 25 °C, the bi-directional search frequency is up to 775 MHz and 567 MHz, and the speeds for row and column Boolean logic reach 759 MHz and 683 MHz.

Circumstances and Pathological Findings in Civilian Helicopter-Related Fatalities.

Helicopters are used worldwide in a range of commercial and private industries and are particularly useful in northern Australia due to the sparse population scattered over large distances with remote regions difficult to access by any other means of transport. Nine civilian helicopter-related fatalities were reported to the Northern Territory coroner between January 2004 and December 2023. The victims were all male (age range, 34-74 years; mean, 52 years). All fatal crashes occurred in remote areas, the majority on cattle stations. Pilots were the sole occupants in 5/9 incidents; in 4 incidents, there were injured survivors. All fatal incidents involved Robinson piston engine helicopters (Robinson R44 models in 2 incidents and Robinson R22 models in the remaining 7). Scene investigations, postmortem examinations, and ancillary investigations were frequently hampered by decomposition of the remains, resulting from difficult search operations and delayed location, retrieval, and storage. Head injuries were present in all cases with chest and spinal injuries in more than half. Integrated assessment of injuries with toxicological and aviation investigations facilitated understanding of the crash dynamics.

Single-objective and multi-objective mixed-variable grey wolf optimizer for joint feature selection and classifier parameter tuning

Feature selection plays an essential role in data preprocessing, which can extract valuable information from extensive data, thereby enhancing the performance of machine learning classification. However, existing feature selection methods primarily focus on selecting feature subsets without considering the impact of classifier parameters on the optimal subset. Different from these works, this paper considers jointly optimizing the feature subset and classifier parameters to minimize the number of features and achieve a low classification error rate. Since feature selection is an optimization problem with binary solution space while classifier parameters involve both continuous and discrete variables, our formulated problem becomes a complex multi-objective mixed-variable problem. To address this challenge, we consider a single-objective optimization method and a multi-objective optimization approach. Specifically, in the single-objective optimization method, we adopt the linear weight method to convert our multiple objectives into a fitness function and then propose a mixed-variable grey wolf optimizer (MGWO) to optimize the function. The proposed MGWO introduces Chaos-Faure initialization, Log convergence factor adjustment, and optimal solution adaptive update operators to enhance its adaptability and balance the global and local search of the algorithm. Subsequently, an improved multi-objective grey wolf optimizer (IMOGWO) is introduced to directly address the problem. The proposed IMOGWO introduces improved initialization, local search, and binary variable mutation operators to balance its exploration and exploitation abilities, making it more suitable for our mixed-variable problem. Extensive simulation results show that our MGWO and IMOGWO outperform recent and classic baselines. Moreover, we also find that jointly optimizing classifier parameters can significantly improve classification accuracy.

Adaptive and low-cost resource synchronization based on data distribution service in high dynamic networks

In disaster-stricken areas monitoring, management, search, and rescue operations, unmanned aerial vehicles (UAVs) play a crucial role in disaster management and emergency communication due to their high mobility. To efficiently coordinate and plan UAVs and their carried sensor and base station resources, synchronization is essential to establish consistency, laying the foundation for high-level demands. In such scenarios, synchronization relies on request–response (RR) or publish–subscribe (PS) forms of information exchange. Existing research in the field typically focuses on higher-level applications and selects either RR or PS synchronization, thereby overlooking the potential advantages that could be gained from combining both methods to meet synchronization requirements. We propose a resource synchronization method based on the Data Distribution Service (DDS) and a linear time complexity subscription mechanism tailored to specific query demands, which considers the pros and cons of the above two information exchange forms and the bottom-layer network topology. Experimental results using open-source simulation tools demonstrate that the proposed method adapts to scene requirements and decreases bandwidth by at least 21.2% and packet rate by at least 3.7% compared to different baseline methods across three topologies, while satisfying delay and query success rate requirements. Furthermore, the method maintains robust performance in the face of dynamic changes in network topology, showcasing its robustness.

Enhanced Multi-Strategy Slime Mould Algorithm for Global Optimization Problems.

In order to further improve performance of the Slime Mould Algorithm, the Enhanced Multi-Strategy Slime Mould Algorithm (EMSMA) is proposed in this paper. There are three main modifications to SMA. Firstly, a leader covariance learning strategy is proposed to replace the anisotropic search operator in SMA to ensure that the agents can evolve in a better direction during the optimization process. Secondly, the best agent is further modified with an improved non-monopoly search mechanism to boost the algorithm's exploitation and exploration capabilities. Finally, a random differential restart mechanism is developed to assist SMA in escaping from local optimality and increasing population diversity when it is stalled. The impacts of three strategies are discussed, and the performance of EMSMA is evaluated on the CEC2017 suite and CEC2022 test suite. The numerical and statistical results show that EMSMA has excellent performance on both test suites and is superior to the SMA variants such as DTSMA, ISMA, AOSMA, LSMA, ESMA, and MSMA in terms of convergence accuracy, convergence speed, and stability.

A double-layer Q-learning driven memetic algorithm for integrated scheduling of procurement, production and maintenance with distributed resources

The existing research on integrated production scheduling typically focuses on activities related to both production and post-production (e.g., operation and maintenance), with limited consideration for simultaneously integrating pre-production activities (e.g., raw material procurement). However, achieving the equilibrium between the manufacturer and the demander for intelligent manufacturing systems requires the optimal scheduling solution that integrates both pre-production and post-production activities. Inspired by this, we investigate a novel integrated scheduling problem that concurrently considers raw material procurement, production scheduling and equipment maintenance (abbreviated as SIPPM). A mixed-integer linear programming model is developed to simultaneously minimize the total costs for the manufacturer and the demander. Furthermore, a double-layer Q-learning driven memetic algorithm (DQMA) is proposed to solve the SIPPM. In DQMA, a well-tailored three-layer hybrid encoding method is presented for chromosome representation. The global search of DQMA employs three crossover and three mutation operators. Moreover, a knowledge-based local search operator with six methods, guided by an effective double-layer Q-learning structure, is devised to enhance local exploitation capabilities. The superiority of DQMA is verified through comparison with three popular multi-objective optimization algorithms on 108 newly established benchmark instances. The proposed integrated scheduling mode is proven to be more effective than two separated scheduling modes without considering raw material procurement.

Multiple Unmanned Aerial Vehicle (multi-UAV) Reconnaissance and Search with Limited Communication Range Using Semantic Episodic Memory in Reinforcement Learning

Unmanned Aerial Vehicles (UAVs) have garnered widespread attention in reconnaissance and search operations due to their low cost and high flexibility. However, when multiple UAVs (multi-UAV) collaborate on these tasks, a limited communication range can restrict their efficiency. This paper investigates the problem of multi-UAV collaborative reconnaissance and search for static targets with a limited communication range (MCRS-LCR). To address communication limitations, we designed a communication and information fusion model based on belief maps and modeled MCRS-LCR as a multi-objective optimization problem. We further reformulated this problem as a decentralized partially observable Markov decision process (Dec-POMDP). We introduced episodic memory into the reinforcement learning framework, proposing the CNN-Semantic Episodic Memory Utilization (CNN-SEMU) algorithm. Specifically, CNN-SEMU uses an encoder–decoder structure with a CNN to learn state embedding patterns influenced by the highest returns. It extracts semantic features from the high-dimensional map state space to construct a smoother memory embedding space, ultimately enhancing reinforcement learning performance by recalling the highest returns of historical states. Extensive simulation experiments demonstrate that in reconnaissance and search tasks of various scales, CNN-SEMU surpasses state-of-the-art multi-agent reinforcement learning methods in episodic rewards, search efficiency, and collision frequency.

Multi-Task Multi-Objective Evolutionary Search Based on Deep Reinforcement Learning for Multi-Objective Vehicle Routing Problems with Time Windows

The vehicle routing problem with time windows (VRPTW) is a widely studied combinatorial optimization problem in supply chains and logistics within the last decade. Recent research has explored the potential of deep reinforcement learning (DRL) as a promising solution for the VRPTW. However, the challenge of addressing the VRPTW with many conflicting objectives (MOVRPTW) still remains for DRL. The MOVRPTW considers five conflicting objectives simultaneously: minimizing the number of vehicles required, the total travel distance, the travel time of the longest route, the total waiting time for early arrivals, and the total delay time for late arrivals. To tackle the MOVRPTW, this study introduces the MTMO/DRP-AT, a multi-task multi-objective evolutionary search algorithm, by making full use of both DRL and the multitasking mechanism. In the MTMO/DRL-AT, a two-objective MOVRPTW is constructed as an assisted task, with the objectives being to minimize the total travel distance and the travel time of the longest route. Both the main task and the assisted task are simultaneously solved in a multitasking scenario. Each task is decomposed into scalar optimization subproblems, which are then solved by an attention model trained using DRL. The outputs of these trained models serve as the initial solutions for the MTMO/DRL-AT. Subsequently, the proposed algorithm incorporates knowledge transfer and multiple local search operators to further enhance the quality of these promising solutions. The simulation results on real-world benchmarks highlight the superior performance of the MTMO/DRL-AT compared to several other algorithms in solving the MOVRPTW.

Post-Processing Maritime Wind Forecasts from the European Centre for Medium-Range Weather Forecasts around the Korean Peninsula Using Support Vector Regression and Principal Component Analysis

Accurate wind data are crucial for successful search and rescue (SAR) operations on the sea surface in maritime accidents, as survivors or debris tend to drift with the wind. As maritime accidents frequently occur outside the range of wind stations, SAR operations heavily rely on wind forecasts generated by numerical models. However, numerical models encounter delays in generating results due to spin-up issues, and their predictions can sometimes exhibit inherent biases caused by geographical factors. To overcome these limitations, we reviewed the observations for the first 24 h of the 72-hour forecast from the ECMWF and then post-processed the forecast for the remaining 48 h. By effectively reducing the dimensionality of input variables comprising observation and forecast data using principal component analysis, we improved wind predictions with support vector regression. Our model achieved an average RMSE improvement of 16.01% compared to the original forecast from the ECMWF. Furthermore, it achieved an average RMSE improvement of 5.42% for locations without observation data by employing a model trained on data from the nearest wind station and then applying an adaptive weighting scheme to the output of that model.

Towards Understanding Cat Vocalizations: A Novel Cat Sound Classification Model Based on Vision Transformers

Animal sound perception systems are highly developed compared to humans, crucial for survival in natural environments, with some species possessing specialized sensory capabilities such as vision, hearing, touch, and environmental awareness. Understanding animal sounds not only aids in their own communication and survival but also benefits humans in various fields including security, natural disaster prediction, ecological research, bioacoustics, precision agriculture, and search and rescue operations. Motivated by this fact, this study investigated the classification of cat sounds using deep learning models based on Vision Transformer (ViT) and Convolutional Neural Network (CNN) architectures. Cat vocalizations, represented as mel-spectrograms, were classified using models trained on a diverse dataset of cat sounds. Experimental results demonstrated the superiority of the proposed model based on Microsoft’s BERT Pre-Training of Image Transformers (BEiT) over the state-of-the-art as it obtained an exceptional accuracy of 96.95%. Additionally, it was observed that the proposed models based on ViT outperformed CNN-based models, highlighting the efficacy of transformer architectures in capturing complex patterns within audio data. These findings underscore the potential of ViT architectures in decoding animal communication systems and advancing wildlife conservation efforts.

Evaluation of hydroelectrolytic, energetic supplementation, and clinical laboratory parameters in search and rescue dogs

Establishing methods and actions to improve performance and reduce changes during physical activity is essential in search and rescue dogs. Studying the changes in search and rescue dogs during working activities and how to correct them can help improve their performance and avoid complications. Six healthy adult dogs, which had participated in search and rescue operations for at least one year, were used. Animals had no evidence of clinical disease nor received any supplement or medication prior to the assessment. Dogs were evaluated before, during, and after exercise and submitted to volume replacement with mineral water (T1) and hydroelectrolytic supplementation (T2). Body temperature (BT), parameters of hydration (body weight, erythrogram, and total protein (TP)), energy indicators (glucose, lactate), electrolytes (K+, Na+, Cl-, P+, Ca2+, Mg2+), and hormone levels (cortisol, aldosterone, insulin) were determined. After exercise, isotonic dehydration was detected in both treatments, accompanied by erythrocytosis and weight loss. During the recovery phase, in both treatments, dogs presented a significant increase in BT and lactate and a significant decrease in insulin, TP, and P+. BT and lactate increased after exercise and returned to basal upon recovery. Insulin decreased after exercise without changes in glucose. The maintenance of cortisol indicated the adjustability of dogs to environmental stimuli and stress resistance, and aldosterone did not change during exercise. Both volume replacement with water or hydroelectrolytic and energetic supplementation can correct the isotonic dehydration exhibited by dogs.

Drone Arc Routing Problems and Metaheuristic Solution Approach

The drone arc routing problem (DARP) is one of the arc routing problems (ARPs) that has been studied by researchers recently. Unlike traditional ARPs, drones can travel directly between any two points in the graph. Due to the flexibility of drones, it is possible to use edges not defined in the graphs when deadheading the edges. This advantage of drones makes this problem more challenging than any other ARP. With this study, the energy capacities of drones are considered in a DARP. Thus, a novel DARP called the drone arc routing problem with deadheading demand (DARP-DD) is addressed in this study. Drone capacities are used both when servicing the edges and when deadheading the edges in the DARP-DD. A special case of the DARP-DD, called the multiple service drone arc routing problem with deadheading demand (MS-DARP-DD), is also discussed, where some critical required edges may need to be served more than once. To solve these challenging problems, a simulated annealing algorithm is used, and the components of the algorithm are designed. Additionally, novel neighbor search operators are developed in this study. The computational results show that the proposed algorithm and its components are effective and useful in solving the DARP-DD and MS-DARP-DD.

A Knee-Guided Evolutionary Algorithm for Multi-Objective Air Traffic Flow Management

Air traffic flow management plays a crucial role in efficient aviation. Most existing studies assume the flight speed as constant throughout the trip, leading to ineffective fixed-speed schedules. To address this issue, we propose a new problem model, which allows variable speed control to improve the flexibility and maneuverability of the management. In addition, we consider two conflicting objectives, which are minimizing the total flight delays and conflicts between flights, where the conflicts depend on the flight 4D trajectories (3D position plus time). To solve this new challenging problem, we propose a novel multi-objective evolutionary algorithm with new problem-specific individual representation and search operators. Specifically, the multi-chromosomes encoding scheme is designed to adapt to different types of operations. Then, to search the huge search space effectively, we develop a hybrid crossover operator that recombines the parents based on their flight routes. Furthermore, to balance the exploration and exploitation, we develop a new mutation strategy to utilize the heterogeneous search potential of different individuals. For exploitation, the knee individual in the Pareto front is improved by a new time shift operator for exploitation, and other non-dominated solutions are mutated by fixed-route mutation. For exploration, the dominated solutions are mutated randomly. To verify the effectiveness, we compare it with the real air traffic flow management schedules and the state-of-the-art algorithms on a range of real-world air traffic datasets. Extensive results show that the proposed algorithm can significantly outperform the baselines in generating safe and efficient 4D trajectories.

A self-learning particle swarm optimization for bi-level assembly scheduling of material-sensitive orders

In modern assembly production, maximizing fulfillment becomes challenging amid resource scarcity and process unpredictability. This study addresses such issues with an effective approach to solving the integrated problem. This confluence presents a scenario where resource allocation mirrors a multidimensional knapsack and job sequencing corresponds to distributed assembly permutation flowshop scheduling, factoring in sequence-dependent setup times. Employing a mixed-integer mathematical model, we capture the configurations and objectives of the integrated problem. A special dual-level cooperative self-learning particle swarm optimization (SLPSO) metaheuristic is developed for improved hierarchical decision-making. Adaptive learning is harnessed to guide dynamic job selection under uncertainty, aiming for the highest total value. To minimize tardiness, a neighborhood search operator customizes sequences for each shop, considering changing setup times between jobs. Benchmark tests have been performed, showing that SLPSO surpasses established genetic algorithms and swarm techniques by 8%–15%. When implemented in an operational traditional pharmaceutical manufacturer, significant improvements were observed. The integrated structure harmonizes planning and scheduling stages, enhancing the algorithm via bidirectional feedback between decisions at various levels under uncertainty, thus providing guidance for real-world production.

Constraints from the neutron EDM on subleading effective operators for direct Dark Matter searches

Interactions between Dark Matter (DM) and nucleons relevant for direct search experiments can be organised in a model independent manner using a Galiliean invariant, non-relativistic effective field theory (NREFT). Here one expands the interactions in powers of the momentum transfer q→\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$ \\overrightarrow{q} $$\\end{document} and DM velocity v→\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$ \\overrightarrow{v} $$\\end{document}. This approach generates many operators. The potentially most important subleading operators are odd under T, and can thus only be present in a theory with CP violating interactions. We consider two such operators, called O\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$ \\mathcal{O} $$\\end{document}10 and O\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$ \\mathcal{O} $$\\end{document}11 in the literature, in simplified models with neutral spin−0 mediators; the couplings are chosen such that the coefficient of the leading spin independent (SI) operator, which survives for v→\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$ \\overrightarrow{v} $$\\end{document} → 0, vanishes at tree level. However, it is generically induced at the next order in perturbation theory. We perform a numerical comparison of the number of scattering events between interactions involving the T−odd operators and the corresponding loop induced SI contributions. We find that for “maximal” CP violation the former can dominate over the latter. However, in two of the three models we consider, an electric dipole moment of the neutron (nEDM) is induced at two-loop order. We find that the experimental bound on the nEDM typically leads to undetectably small rates induced by O\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$ \\mathcal{O} $$\\end{document}10. On the other hand, the model leading to a nonvanishing coefficient of O\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$ \\mathcal{O} $$\\end{document}11 does not induce an nEDM.