Efficient Search Algorithm Research Articles

Efficient Latent-based Scoring Function Search for N-ary Relational Knowledge Bases

Designing a proper scoring function is the key to ensuring the excellent performance of knowledge base (KB) embedding. Recently, the scoring function search method introduces the automated machine learning technique to design the data-aware scoring function for the given binary relational data (a.k.a. knowledge graph, KG), which can consistently achieve good performance on different data sets. However, the current data-aware search method is still not as good as desired. First, the existing model can only search scoring functions on the given binary relational data, which is a special form of N-ary relational KBs. Second, observing that existing scoring functions can exhibit distinct performance on different semantic patterns, we are motivated to explore such semantics by searching pattern-aware scoring functions. Unfortunately, it is hard to extend existing search approaches to the scenarios of N-ary and pattern-aware due to the search efficiency and effectiveness issues. In this paper, we propose latent-based factors to model relational patterns and an efficient search algorithm on the N-ary scenario, i.e., efficient LA tent-based SCO ring function search for N-ary relational KBs (LASCO). The empirical results of LASCO on binary and N-ary relational data sets demonstrate that the proposed method can efficiently search pattern-aware scoring functions, and achieve better embedding performance than advanced baselines.

An Efficient Large Neighborhood Search Algorithm for Multi-level Constellation Scheduling Problem

An Efficient Large Neighborhood Search Algorithm for Multi-level Constellation Scheduling Problem

Efficient Search Algorithms for Identifying Synergistic Associations in High-Dimensional Datasets.

In recent years, there has been a notably increased interest in the study of multivariate interactions and emergent higher-order dependencies. This is particularly evident in the context of identifying synergistic sets, which are defined as combinations of elements whose joint interactions result in the emergence of information that is not present in any individual subset of those elements. The scalability of frameworks such as partial information decomposition (PID) and those based on multivariate extensions of mutual information, such as O-information, is limited by combinational explosion in the number of sets that must be assessed. In order to address these challenges, we propose a novel approach that utilises stochastic search strategies in order to identify synergistic triplets within datasets. Furthermore, the methodology is extensible to larger sets and various synergy measures. By employing stochastic search, our approach circumvents the constraints of exhaustive enumeration, offering a scalable and efficient means to uncover intricate dependencies. The flexibility of our method is illustrated through its application to two epidemiological datasets: The Young Finns Study and the UK Biobank Nuclear Magnetic Resonance (NMR) data. Additionally, we present a heuristic for reducing the number of synergistic sets to analyse in large datasets by excluding sets with overlapping information. We also illustrate the risks of performing a feature selection before assessing synergistic information in the system.

A risk-averse latency location-routing problem with stochastic travel times

In this paper, a latency location-routing problem with stochastic travel times is investigated. The problem is cast as a two-stage stochastic program. The ex-ante decision comprises the location of the depots. The ex-post decision regards the routing, which adapts to the observed travel times. A risk-averse decision-maker is assumed, which is conveyed by adopting the latency CVaRα as the objective function. The problem is formulated mathematically. An efficient multi-start variable neighborhood search algorithm is proposed for tackling the problem when uncertainty is captured by a finite set of scenarios. This procedure is then embedded into a sampling mechanism so that realistic instances of the problem can be tackled, namely when the travel times are represented by random vectors with an infinite support. An extensive computational analysis is conducted to assess the methodological developments proposed and the relevance of capturing uncertainty in the problem. Additional insights include the impact of the risk level in the solutions.

Solving Optimal Power Flow Using New Efficient Hybrid Jellyfish Search and Moth Flame Optimization Algorithms

This paper presents a new optimization technique based on the hybridization of two meta-heuristic methods, Jellyfish Search (JS) and Moth Flame Optimizer (MFO), to solve the Optimal Power Flow (OPF) problem. The JS algorithm offers good exploration capacity but lacks performance in its exploitation mechanism. To improve its efficiency, we combined it with the Moth Flame Optimizer, which has proven its ability to exploit good solutions in the search area. This hybrid algorithm combines the advantages of both algorithms. The performance and precision of the hybrid optimization approach (JS-MFO) were investigated by minimizing well-known mathematical benchmark functions and by solving the complex OPF problem. The OPF problem was solved by optimizing non-convex objective functions such as total fuel cost, total active transmission losses, total gas emission, total voltage deviation, and the voltage stability index. Two test systems, the IEEE 30-bus network and the Mauritanian RIM 27-bus transmission network, were considered for implementing the JS-MFO approach. Experimental tests of the JS, MFO, and JS-MFO algorithms on eight well-known benchmark functions, the IEEE 30-bus, and the Mauritanian RIM 27-bus system were conducted. For the IEEE 30-bus test system, the proposed hybrid approach provides a percent cost saving of 11.4028%, a percent gas emission reduction of 14.38%, and a percent loss saving of 50.60% with respect to the base case. For the RIM 27-bus system, JS-MFO achieved a loss percent saving of 50.67% and percent voltage reduction of 62.44% with reference to the base case. The simulation results using JS-MFO and obtained with the MATLAB 2009b software were compared with those of JS, MFO, and other well-known meta-heuristics cited in the literature. The comparison report proves the superiority of the JS-MFO method over JS, MFO, and other competing meta-heuristics in solving difficult OPF problems.

Data-driven dynamic police patrolling: An efficient Monte Carlo tree search

Crime is responsible for major financial losses and serious harm to the well-being of individuals, and, hence, a crucial task of police operations is effective patrolling. Yet, in existing decision models aimed at police operations, microscopic routing decisions from patrolling are not considered, and, furthermore, the objective is limited to surrogate metrics (e.g., response time) instead of crime prevention. In this paper, we thus formalize the decision problem of dynamic police patrolling as a Markov decision process that models microscopic routing decisions, so that the expected number of prevented crimes are maximized. We experimentally show that standard solution approaches for our decision problem are not scalable to real-world settings. As a remedy, we present a tailored and highly efficient Monte Carlo tree search algorithm. We then demonstrate our algorithm numerically using real-world crime data from Chicago and show that the decision-making by our algorithm offers significant improvements for crime prevention over patrolling tactics from current practice. Informed by our results, we finally discuss implications for improving the patrolling tactics in police operations.

A Stochastic Drone-Scheduling Problem with Uncertain Energy Consumption

In this paper, we present a stochastic drone-scheduling problem where the energy consumption of drones between any two nodes is uncertain. Considering uncertain energy consumption as opposed to deterministic energy consumption can effectively enhance the safety of drone flights. To address this issue, we developed a two-stage stochastic programming model with recourse cost, and we employed a fixed-sample sampling strategy based on Monte Carlo simulation to characterize uncertain variables, followed by the design of an efficient variable neighborhood search algorithm to solve the model. Case study results indicate the superiority of our algorithm over genetic algorithms. Additionally, a comparison between deterministic and stochastic models suggests that considering the uncertainty in energy consumption can significantly enhance the average returns of unmanned aerial vehicle scheduling systems.

An efficient social network search algorithm for optimal dispatch problems in isolated microgrids incorporating renewable energy sources

An efficient social network search algorithm for optimal dispatch problems in isolated microgrids incorporating renewable energy sources

Multi-compartment waste collection vehicle routing problem with bin washer

This paper introduces a new variant of the Multi-Compartment Waste Collection Problem (MC-WCP), which we call the MC-WCP with Bin Washer (MC-WCP-BW). The problem involves a fleet of compressed refuse collection trucks equipped with a bin washer, which compresses each waste type in the corresponding compartment of the vehicle. The vehicles can also wash the bins. Separation sites and water refilling stations are considered in the problem. A subset of the bins must be washed when emptied, which is not mandatory for the others. The problem is modeled using a mixed-integer linear programming formulation incorporating multiple visits to separation sites and water refilling stations. An efficient Hybrid Variable Neighborhood Search (HVNS) algorithm is developed and evaluated on a set of instances from the literature and newly generated instances. Computational experiments show that our proposed algorithm can identify solutions of better quality in a shorter computational time, as compared with the current state-of-the-art algorithms. The potential benefits of the compaction operation under several scenarios are also examined via extensive analyses.

A Local Search Algorithm with Vertex Weighting Strategy and Two-Level Configuration Checking for the Minimum Connected Dominating Set Problem.

The minimum connected dominating set problem is a combinatorial optimization problem with a wide range of applications in many fields. We propose an efficient local search algorithm to solve this problem. In this work, first, we adopt a new initial solution construction method based on three simplification rules. This method can reduce the size of the original graph and thus obtain a high-quality initial solution. Second, we propose an approach based on a two-level configuration checking strategy and a tabu strategy to reduce the cycling problem. Third, we introduce a perturbation strategy and a vertex weighting strategy to help the algorithm be able to jump out of the local optimum effectively. Fourth, we combine the scoring functions Cscore and Mscore with the aforementioned strategies to propose effective methods for selecting vertices. These methods assist the algorithm in selecting vertices that are suitable for addition to or removal from the current candidate solution. Finally, we verify the performance advantages of the local search algorithm by comparing it with existing optimal heuristic algorithms on two sets of instances. The experimental results show that the algorithm exhibits better performance on two sets of classical instances.

A novel single-parameter continuously differentiable filled function for global optimization

ABSTRACT The filled function approach is an effective global optimization method. The properties of the filled function directly affect the efficiency of the algorithm and have been discussed by many scholars, resulting in various new forms of filled functions. However, most of existing filled functions are not continuously differentiable and have parameters that are difficult to adjust. To remedy this problem, a new continuously differentiable filled function with an easily adjustable parameter is constructed. According to the theoretical analysis of the filled function, a new easy-to-implement filled function algorithm is designed utilizing the efficient local search algorithm based on gradient information. Numerical experiments show that the proposed filled function algorithm is a feasible and effective global optimization algorithm with less computational cost.

Stitched vision transformer for age-related macular degeneration detection using retinal optical coherence tomography images.

Age-related macular degeneration (AMD) is an eye disease that leads to the deterioration of the central vision area of the eye and can gradually result in vision loss in elderly individuals. Early identification of this disease can significantly impact patient treatment outcomes. Furthermore, given the increasing elderly population globally, the importance of automated methods for rapidly monitoring at-risk individuals and accurately diagnosing AMD is growing daily. One standard method for diagnosing AMD is using optical coherence tomography (OCT) images as a non-invasive imaging technology. In recent years, numerous deep neural networks have been proposed for the classification of OCT images. Utilizing pre-trained neural networks can speed up model deployment in related tasks without compromising accuracy. However, most previous methods overlook the feasibility of leveraging pre-existing trained networks to search for an optimal architecture for AMD staging on a new target dataset. In this study, our objective was to achieve an optimal architecture in the efficiency-accuracy trade-off for classifying retinal OCT images. To this end, we employed pre-trained medical vision transformer (MedViT) models. MedViT combines convolutional and transformer neural networks, explicitly designed for medical image classification. Our approach involved pre-training two distinct MedViT models on a source dataset with labels identical to those in the target dataset. This pre-training was conducted in a supervised manner. Subsequently, we evaluated the performance of the pre-trained MedViT models for classifying retinal OCT images from the target Noor Eye Hospital (NEH) dataset into the normal, drusen, and choroidal neovascularization (CNV) classes in zero-shot settings and through five-fold cross-validation. Then, we proposed a stitching approach to search for an optimal model from two MedViT family models. The proposed stitching method is an efficient architecture search algorithm known as stitchable neural networks. Stitchable neural networks create a candidate model in search space for each pair of stitchable layers by inserting a linear layer between them. A pair of stitchable layers consists of layers, each selected from one input model. While stitchable neural networks had previously been tested on more extensive and general datasets, this study demonstrated that stitching networks could also be helpful in smaller medical datasets. The results of this approach indicate that when pre-trained models were available for OCT images from another dataset, it was possible to achieve a model in 100 epochs with an accuracy of over 94.9% in classifying images from the NEH dataset. The results of this study demonstrate the efficacy of stitchable neural networks as a fine-tuning method for OCT image classification. This approach not only leads to higher accuracy but also considers architecture optimization at a reasonable computational cost.

CSO-DQN: Circle Search Optimization-based Deep Q-Learning Network for Intrusion Detection System in Cloud Environment

In general, the attackers probably create security-related threats from diverse insecure applications. These attackers execute various nasty activities like establishing hidden rootkit processes, hindering host-based security systems, changing the characteristics of applications, etc. The attackers utilize compromised tenant virtual machines for producing attacks with minor changes to avoid accurate prediction. To deal with these shortcomings, we proposed an efficient novel Deep Q-learning network-based circle search (DQL-CS) algorithm to detect intrusion in a cloud environment. The dataset is pre-processed initially by employing the Term Frequency-Inverse Document Frequency (TF-IDF) approach, which sequentially organizes normal and intrusion traces, and then the collected feature sequences are extracted using n-gram sampling. This process makes the classifier enhance the detection and classification performance. Followed by the extraction process, the classification process is executed using the proposed Deep Q-learning network-based circle search (DQL-CS) algorithm. The proposed DQL-CS algorithm accurately identifies and categorizes the attacks as two different classes normal and malevolent. Then the applications generating the malicious behavior are examined by the cloud admin using an alert generation system and are isolated automatically. The developed intrusion detection system is evaluated using three different malware databases such as the UNM dataset, windows malware dataset, and KDD99 dataset as the input. The accuracy rate of the UNM dataset of the proposed DQL-CS method is higher than other conventional approaches.

Combinatorial optimization methods for yarn dyeing planning

AbstractManaging yarn dyeing processes is one of the most challenging problems in the textile industry due to its computational complexity. This process combines characteristics of multidimensional knapsack, bin packing, and unrelated parallel machine scheduling problems. Multiple customer orders need to be combined as batches and assigned to different shifts of a limited number of machines. However, several practical factors such as physical attributes of customer orders, dyeing machine eligibility conditions like flotte, color type, chemical recipe, and volume capacity of dye make this problem significantly unique. Furthermore, alongside its economic aspects, minimizing the waste of natural resources during the machine changeover and energy are sustainability concerns of the problem. The contradictory nature of these two makes the planning problem multi-objective, which adds another complexity for planners. Hence, in this paper, we first propose a novel mathematical model for this scientifically highly challenging yet very practical problem from the textile industry. Then we propose Adaptive Large Neighbourhood Search (ALNS) algorithms to solve industrial-size instances of the problem. Our computational results show that the proposed algorithm provides near-optimal solutions in very short computational times. This paper provides significant contributions to flexible manufacturing research, including a mixed-integer programming model for a novel industrial problem, providing an effective and efficient adaptive large neighborhood search algorithm for delivering high-quality solutions quickly, and addressing the inefficiencies of manual scheduling in textile companies; reducing a time-consuming planning task from hours to minutes.

Two-stage stochastic optimization of virtual power plant with wind power and uncertain demand

ABSTRACT The virtual power plant (VPP) has been recognized as an effective way to facilitate penetration of renewable and distributed energy resources in electricity markets. This paper introduces an adaptive curtailment strategy for a VPP comprising a wind power plant and uncertain demand, and explores the economic advantage of adaptively adjusting wind power curtailment. A two-stage stochastic model is proposed to deal with the uncertainties in wind power generation (WPG), load demand and market prices. In the model, the bid decision is made in the face of uncertainties in the first stage, while the control (curtailment) decision is made based on realized uncertain parameters in the second stage. This paper provides the closed-form optimal curtailment decision and characterizes the optimal bid decision. An efficient binary search algorithm is developed for optimizing the bid decision. By using a distribution-free approach, we show that as the prediction accuracy of WPG improves, the optimal bid decision converges toward the expected minimal power exchange, leading to a decrease in expected operational cost with diminishing marginal return. Numerical experiments based on real-world data demonstrate that compared with the existing greedy strategy and coordinated strategy, the proposed model can decrease the expected operational cost up to 16.9% and 11.0%, respectively.

Compression after impact (CAI) failure mechanisms and damage evolution in large composite laminates: High-fidelity simulation and experimental study

This study focuses on developing and validating a high-fidelity finite element model for predicting damage evolution and residual strength in fiber-reinforced composite panels. Impact and compression after impact (CAI) tests were conducted at both barely visible impact damage (BVID) and clearly visible impact damage (CVID) levels. The ASTM D7137 standard 100 mm × 150 mm CAI coupons were inadequate to cover the range of experimental studies required for model validation. Therefore, larger 254 mm × 304.8 mm laminates were investigated under two CAI testing conditions: one a scaled-up version of ASTM standard coupon, and the other with additional anti-buckling support plates to reduce unsupported areas to 127 mm × 177.8 mm. The model captured inter- and intra-laminar failure modes, including fiber breakage, splitting, kinking, pull-out, and crushing as well as matrix cracking, delamination, and their interactions. This was achieved by cohesive zone modeling technique and enhancement of the LaRC05 failure criteria through modeling the fiber damage evolution and utilizing an efficient search algorithm to determine the matrix fracture plane and fiber kink band angle. This study underscores the efficacy of the high-fidelity modeling approach in accurately predicting both impact damage and CAI strength in typical aircraft impact damage scenarios. Additionally, it provides insights into complex CAI failure mechanisms and energy release associated with various damage modes and highlights the effect of global buckling on the failure behavior and compressive strength of composite laminates. Furthermore, it shows that the proposed fixture with support plates is suitable for testing a broader range of impact scenarios without experiencing global buckling.

An efficient multi-objective adaptive large neighborhood search algorithm for solving a disassembly line balancing model considering idle rate, smoothness, labor cost, and energy consumption

The concept of green manufacturing emphasizes the importance of product disassembly in achieving energy-efficient recycling and remanufacturing operations. Disassembly line balancing (DLB) is a critical component of the product disassembly process, wherein a set of tasks must be allocated to workstations for disassembly. This study proposes a multi-objective DLB model that aims to minimize multiple conflicting objectives simultaneously including idle rate, smoothness, labor cost, and energy consumption. A key innovation of this study involves the creation of a tailored adaptive large neighborhood search (ALNS) algorithm which is one of the first studies in the literature on product disassembly algorithms. The developed ALNS employs efficient construction and destruction heuristics to solve the proposed multi-objective DLB problem. The ALNS algorithm aims to destroy and repair solutions effectively, while a local search procedure helps it escape from local optimum solutions. The provided DLB model is effectively solved by applying the proposed ALNS algorithm to the disassembly process of a turbine reducer. The obtained results from this application serve as a compelling demonstration of the efficiency and effectiveness of the proposed approach. Furthermore, comparisons conducted with various state-of-the-art algorithms using small and large instance sets consistently highlight the superiority of the proposed ALNS approach.

FaissMolLib: An efficient and easy deployable tool for ligand-based virtual screening

Virtual screening-based molecular similarity and fingerprint are crucial in drug design, target prediction, and ADMET prediction, aiding in identifying potential hits and optimizing lead compounds. However, challenges such as lack of comprehensive open-source molecular fingerprint databases and efficient search methods for virtual screening are prevalent. To address these issues, we introduce FaissMolLib, an open-source virtual screening tool that integrates 2.8 million compounds from ChEMBL and ZINC databases. Notably, FaissMolLib employs the highly efficient Faiss search algorithm, outperforming the Tanimoto algorithm in identifying similar molecules with its tighter clustering in scatter plots and lower mean, standard deviation, and variance in key molecular properties. This feature enables FaissMolLib to screen 2.8 million compounds in just 0.05 seconds, offering researchers an efficient, easily deployable solution for virtual screening on laptops and building unique compound databases. This significant advancement holds great potential for accelerating drug discovery efforts and enhancing chemical data analysis. FaissMolLib is freely available at http://liuhaihan.gnway.cc:80. The code and dataset of FaissMolLib are freely available at https://github.com/Superhaihan/FiassMolLib.

Efficient numerical implementation of limit equilibrium method for stability analysis of unsaturated soil slopes using Gaussian integral

Unsaturated soil is widely distributed around the world but less considered in design due to the absence of a convenient analysis method in practice. The Morgenstern–Price (MP) method incorporating the extended Mohr–Coulomb shear strength equation provides a reliable approach to evaluate slope stability in such conditions. However, this method is time-consuming due to the need for a tedious trial-and-error process in determining the scaling factor, which involves complex iterations during each trial. Furthermore, since the relatively complicated nature of unsaturated soil, a dense slice division is necessary to obtain reliable results, making the analysis even more cumbersome. In this paper, an improved MP method for unsaturated soil slope stability analysis is presented, which eliminates the need for a dense slice mesh by employing only a few strategically placed Gauss points along the slip surface. Moreover, the trial-and-error process for determining the scaling factor with the corresponding complex iterations is replaced by an efficient search algorithm with a more concise iteration process, resulting in a more convenient implementation of the proposed method. Extensive examples are provided to validate the effectiveness of the proposed improved MP method, indicating its potential as an accurate and efficient analysis method for unsaturated soil slopes in practical application and relative study involving repetitive analyses.

Collaborative resource allocation-based differential evolution for solving numerical optimization problems

Differential evolution (DE) is an efficient and powerful population-based search algorithm for solving numerical optimization problems in continuous spaces. It has been proven that multi-strategy DE algorithms are more effective than single-strategy DE algorithms in addressing benchmark and real-world problems. However, most multi-strategy DE variants focus on maintaining population diversity and balancing exploitation and exploration, ignoring the dynamic allocation of computational resources. Moreover, the success of these algorithms often depends on additional designed techniques, leading to increased computational complexity. In this paper, the Collaborative Resource Allocation-based Differential Evolution (CRADE) is introduced. It involves a collaborative resource allocation mechanism that utilizes the historical performance ranking of three mutation strategies to automatically allocate computational resources to various subpopulations during the search process. The parameter adaptation technique is used to adjust the associated control parameters of different mutation strategies. As a result, the most efficient mutation strategy consumes the majority of computational resources at different search stages to mitigate inefficient search under constrained resources. The performance of CRADE is evaluated on the well-known CEC2013 benchmark function set. The paper also investigates its application in the parameter identification of photovoltaic solar cells and modules. The overall results show that CRADE exhibits superior and competitive performance compared to other state-of-the-art algorithms. Consequently, CRADE has emerged as a novel and effective approach for addressing numerical optimization problems, distinguished by its excellence, practicality, and unwavering reliability.