Greedy Algorithm Research Articles

On approximating partial scenario set cover

The Partial Scenario Set Cover problem (PSSC) generalizes the Partial Set Cover problem, which is itself a generalization of the classical Set Cover problem. We are given a finite ground set Q, a collection S of subsets of Q to choose from, each of which is associated with a nonnegative cost, and a second collection U of subsets of Q of which a given number l must be covered. The task is to choose a minimum cost sub-collection from S that covers at least l sets from U. PSSC is motivated by an application for locating emergency doctors.We present two approximation approaches. The first one combines LP-based rounding with a greedy consideration of the scenarios. The other is a variant of the greedy set cover algorithm, and in each iteration tries to minimize the ratio of cost to number of newly covered scenarios. We show that this subproblem, which we call Dense Scenario Set Cover (DSSC), is itself as hard to approximate as Set Cover and NP-hard, even when there is only a single scenario and all sets contain at most three elements. Furthermore, we consider a special case of DSSC where the sets are pairwise disjoint and show that in this case DSSC can be solved in polynomial time. We also provide an approximation for the general case, which we use as a subroutine in the greedy algorithm to obtain an approximation for PSSC.

Linear Monotonic Inter-electrode Associations as Quantitative EEG for Alcoholism Diagnosis

Alcohol use disorders (AUDs) are associated with alterations in EEG patterns that reflect underlying neural dysfunctions, such as impaired cognitive processing, reduced neural connectivity, and disrupted brain rhythms. These EEG alterations can be indicative of several brain disorders, including cognitive deficits, mood disorders, and neurodegenerative diseases, which are often exacerbated by chronic alcohol abuse. Cognitive impairment in alcoholic subjects is caused due to altered functional connectivity between brain regions that can be quantified using statistical measures such as correlation. This paper proposes novel Quantitative EEG (QEEG) features comprising the band-wise absolute value of inter-electrode correlations as a measure of brain functional connectivity to classify alcoholic and non-alcoholic EEG. The EEG signal is first decomposed into five frequency sub-bands. In each sub-band, the absolute value of the linear Pearson product-moment correlation coefficient is computed between time-series EEG recorded by electrode pairs placed over different brain regions. To reduce the dimensionality of the feature vector, an ensemble feature selection approach is adopted, utilizing ANOVA and Chi-square, in conjunction with greedy forward feature selection wrapper algorithm. Four classifiers, namely SVM, KNN, ANN and RF are utilized for the classification. Among them, the SVM classifier achieves the best classification accuracies of 100% on validation with test data and 99.58% on cross-validation with train data, respectively.

Feature selection via robust weighted score for high dimensional binary class-imbalanced gene expression data

In this paper, a robust weighted score for unbalanced data (ROWSU) is proposed for selecting the most discriminative features for high dimensional gene expression binary classification with class-imbalance problem. The method addresses one of the most challenging problems of highly skewed class distributions in gene expression datasets that adversely affect the performance of classification algorithms. First, the training dataset is balanced by synthetically generating data points from minority class observations. Second, a minimum subset of genes is selected using a greedy search approach. Third, a novel weighted robust score, where the weights are computed by support vectors, is introduced to obtain a refined set of genes. The highest scoring genes based on this approach are combined with the minimum subset of genes selected by the greedy search approach to form the final set of genes. The novel method ensures the selection of the most discriminative genes, even in the presence of skewed class distribution, thereby improving the performance of the classifiers. The performance of the proposed ROWSU method is evaluated on 7 gene expression datasets. Classification accuracy, sensitivity and F1-score are used as performance metrics to compare the proposed ROWSU algorithm with several other state-of-the-art methods. Boxplots and stability plots are also constructed for a better understanding of the results. The results show that the proposed method outperforms the existing feature selection procedures based on classification performance from k nearest neighbors (kNN) and random forest (RF) classifiers.

Maximizing influence via link prediction in evolving networks

Influence Maximization (IM), targeting the optimal selection of k seed nodes to maximize potential information dissemination in prospectively social networks, garners pivotal interest in diverse realms like viral marketing and political discourse dissemination. Despite receiving substantial scholarly attention, prevailing research predominantly addresses the IM problem within the confines of existing networks, thereby neglecting the dynamic evolutionary character of social networks. An inevitable requisite arises to explore the IM problem in social networks of future contexts, which is imperative for certain application scenarios. In this light, we introduce a novel problem, Influence Maximization in Future Networks (IMFN), aimed at resolving the IM problem within an anticipated future network framework. We establish that the IMFN problem is NP-hard and advocate a prospective solution framework, employing judiciously selected link prediction methods to forecast the future network, and subsequently applying a greedy algorithm to select the k most influential nodes. Moreover, we present SCOL (Sketch-based Cost-effective lazy forward selection algorithm Optimized with Labeling technique), a well-designed algorithm to accelerate the query of our IMFN problem. Extensive experimental results, rooted in five real-world datasets, are provided, affirming the efficacy and efficiency of the proffered solution and algorithms.

An Improved Iterated Greedy Algorithm for Solving Collaborative Helicopter Rescue Routing Problem with Time Window and Limited Survival Time

Research on helicopter dispatching has received considerable attention, particularly in relation to post-disaster rescue operations. The survival chances of individuals trapped in emergency situations decrease as time passes, making timely helicopter dispatch crucial for successful rescue missions. Therefore, this study investigates a collaborative helicopter rescue routing problem with time window and limited survival time constraints, solving it using an improved iterative greedy (IIG) algorithm. In the proposed algorithm, a heuristic initialization strategy is designed to generate an efficient and feasible initial solution. Then, a feasible-first destruction-construction strategy is applied to enhance the algorithm’s exploration ability. Next, a problem-specific local search strategy is developed to improve the algorithm’s local search effectiveness. In addition, the simulated annealing (SA) method is integrated as an acceptance criterion to avoid the algorithm from getting trapped in local optima. Finally, to evaluate the efficacy of the proposed IIG, 56 instances were generated based on Solomon instances and used for simulation tests. A comparative analysis was conducted against six efficient algorithms from the existing studies. The experimental results demonstrate that the proposed algorithm performs well in solving the post-disaster rescue helicopter routing problem.

Greedy selection of optimal location of sensors for uncertainty reduction in seismic moment tensor inversion

We address an optimal sensor placement problem through Bayesian experimental design for seismic full waveform inversion for the recovery of the associated moment tensor. The objective is that of optimally choosing the location of the sensors (stations) from which to collect the observed data. The Shannon expected information gain is used as the objective function to search for the optimal network of sensors. A closed form for such objective is available due to the linear structure of the forward problem, as well as the Gaussian modeling of the observational errors and prior distribution. The resulting problem being inherently combinatorial, a greedy algorithm is deployed to sequentially select the sensor locations that form the best network for learning the moment tensor. Numerical results are presented to display the optimal network of sensors and how the uncertainty in the inferred seismic moment tensor contracts. The scenario of full three-dimensional velocity models or unknown earthquake source locations is treated as nuisance uncertainty, contributing to the overall uncertainty without being the focus of the inversion. This is addressed using a consensus approach over a set of realizations of the nuisance parameter. We analyzed the resulting network of stations for the moment tensor inversion under model misspecification, which reflects realistic data-generating processes.

Lead Battery Reverse Logistics Center Location Model and Simulation Analysis Based on Genetic Algorithm and Greedy Algorithm

Lead Battery Reverse Logistics Center Location Model and Simulation Analysis Based on Genetic Algorithm and Greedy Algorithm

Stepwise Alternating Direction Implicit Method of the Three Dimensional Convective-Diffusion Equation

A stepwise alternating direction implicit method of the three dimensional convective-diffusion equation is considered in this paper. We constructed an implicit difference scheme and analyzes it's truncation error, convergence and stabilities. The theoretical and numerical analysis shows that the implicit difference scheme is unconditional stable. Then the Greedy Algorithm is proposed to solve the numerical solution on x,y and z axis separately by using implicit difference scheme and the numerical solution is convergent theoretically, however with no physical meaning. The Stepwise Alternating Direction Implicit Method (SADIM) is proposed, which uses the implicit difference scheme in this paper. Using Sauls scheme to pretreat the initial-boundary condition before iterating, thus eliminate the numerical oscillation caused by discontinuous initial boundary conditions. This SADIM is at least six ordered convergent, and is one of high ordered numerical methods for three dimensional problem. Our implicit difference scheme is more ideal than the standard Galerkin centered on finite difference scheme, quicker than SOR iteration method. The convergence of our implicit scheme is better than finite element method, characteristic line method, and mesh-less method. Our method eliminates the numerical oscillation caused by the convection dominant, resists the dispersion effectively and addresses dissipation caused by diffusion dominant.The implicit difference scheme has good theoretical and practical value.

Sensor placement for optimal aerodynamic data fusion

Aircraft design is recently evolving towards a digital twin representation that involves many heterogeneous data sources. The aerodynamic development of aircraft usually incorporates data from computational fluid dynamics simulations, wind tunnel testing, and flight tests. All of these data sources have their advantages and disadvantages, which can optimally be combined using data fusion methods. However, the quality of the data fusion result strongly depends on the experimental design, i.e. the placement of discrete sensors. Therefore, an optimized sensor placement is essential for data fusion applications, as the number of sensors is limited. This work presents a sensor placement strategy for the widely used Gappy proper orthogonal decomposition data fusion methodology. The sensor placement relies on a Bayesian formulation of the data fusion, allowing accurate error estimates. Based on the Bayesian posterior, a utility function characterizes the quality of the fused result by quantifying the expected information gain for the proper orthogonal decomposition coefficients. As the optimization of the sensor locations involves a complex combinatorial problem, we introduce an efficient genetic algorithm for this task. The method is demonstrated on a two-dimensional airfoil and the NASA Common Research Model with synthetic measurement errors. For both test cases, an optimal sensor placement results in smaller reconstruction errors than a conventional layout. The Bayesian approach leads, in most cases, to more accurate reconstructions and is more versatile than other well-established sensor placement methods. The proposed genetic algorithm finds better optima with significantly fewer function evaluations than the widely used greedy algorithms.

A Robust Newton Iteration Method for Mixed-Cell-Height Circuit Legalization Under Technology and Region Constraints

The evolution of advanced technology nodes has prompted a shift toward mixed-cell-height circuit design, while the introduction of technology and fence region constraints further increases the complexity of placement. In this article, we innovatively transform the mixed-cell-height circuit legalization problem into a generalized absolute value equation (GAVE) and propose a novel and effective robust Newton (RN) iteration method to address the challenge of the legalization problem. 1 First, the window-based cell insertion technique is applied to obtain the initial cell row allocation and cell order, and the cells are allocated to the matching region based on the R-tree structure. Then, the legalization problem of cells within the region is transformed into a GAVE, and an RN iteration method is proposed to solve the GAVE. Finally, the maximum displacement cells and technology violation cells are optimized based on a greedy method. Experimental results confirm the efficiency and robustness of the proposed method compared with the state-of-the-art methods.

A Machine Learning-Based Framework for Estimating Fragility Parameters in RC/MR Frames Considering Seismic, Structural, and Site Attributes

ABSTRACT This study investigates applying machine learning (ML) algorithms to estimate seismic fragility curves of reinforced concrete moment-resisting frames. The goal is to achieve computationally efficient estimations while maintaining accuracy compared to traditional methods. Various multi-classification algorithms are explored for this purpose. A greedy search method identifies key fragility features (structure period, soil shear wave velocity, ground motion intensity). Analysis shows that the decision tree method strikes an optimal balance between accuracy and speed. ML-based fragility curves closely align with analytical results, with area ratios under 10%, mean absolute error (MAE) below 0.06, and root mean square error (RMSE) below 0.082.

A cost-efficient content distribution optimization model for fog-based content delivery networks

The massive data demand requires content distribution networks (CDNs) to use evolving techniques for efficient content distribution with guaranteed quality of service (QoS). The distributed fog-based CDN model, with optimal fog node placements, is a suggested aproach by researchers to meet this demand. While many studies have focused on improving QoS by optimizing fog node placement, they have rarely considered the impact on content distribution, affected by placement, usage changes, and delivery rates. Therefore, the practical approach to fog node placement for CDN services must examine its impact on content distribution. Further, current research on fog-based CDN lacks formal methods to address key challenges: R1) strategic placement of fog nodes to process end-user requests; R2) construction of a content distribution path with guaranteed QoS; R3) cost minimization of building a fog-based CDN model. We construct this as a joint optimization problem by considering four parameters: geographical regions, open public Wi-Fi access points (OPWAPs) locations, QoS, and cost to achieve research objectives R1–R3. As a solution, we propose a dual-step framework. First, a heuristic for optimal fog node placement based on geographic regions and OPWAP locations is proposed. Second, we propose two algorithms, Greedy Performance-based Node Selection (GPDS) and Greedy Fog Node Selection algorithm (GFNSA), for selecting fog nodes, minimizing the cost of building a fog-based CDN while achieving optimal content distribution paths. The results demonstrate that the proposed methods outperform the baseline techniques and provide near-optimal solutions to the problem.

A Data-driven Race Strategy Tool for Olympic Sailing Competitions

_ Venue-specific training has, over the years, proven to be a key asset for sailing teams performing at major championships and at the Olympics. A comprehensive understanding of the environmental features and possible weather scenarios in an outdoor sport like sailing can provide athletes with a significant strategic advantage. At the same time, GPS tracking is becoming a readily available technology that athletes use both in training and during races to analyse their own and their competitor's performance. This work couples environmental and meteorological data with GPS tracks for Olympic sailing classes, linking weather features with strategic decisions on the race track. We propose a greedy algorithm to search for an optimal route based on weather forecasts to present the best strategy prior to the race. Our results show the potential of this approach to provide valuable decision support for athletes in Olympic sailing competitions, demonstrated for the 470 Olympic class. Keywords Olympic sailing; path planning; data-driven methods; meteorology; A* algorithm

MISAO: A Multi-Strategy Improved Snow Ablation Optimizer for Unmanned Aerial Vehicle Path Planning

The snow ablation optimizer (SAO) is a meta-heuristic technique used to seek the best solution for sophisticated problems. In response to the defects in the SAO algorithm, which has poor search efficiency and is prone to getting trapped in local optima, this article suggests a multi-strategy improved (MISAO) snow ablation optimizer. It is employed in the unmanned aerial vehicle (UAV) path planning issue. To begin with, the tent chaos and elite reverse learning initialization strategies are merged to extend the diversity of the population; secondly, a greedy selection method is deployed to retain superior alternative solutions for the upcoming iteration; then, the Harris hawk (HHO) strategy is introduced to enhance the exploitation capability, which prevents trapping in partial ideals; finally, the red-tailed hawk (RTH) is adopted to perform the global exploration, which, enhances global optimization capability. To comprehensively evaluate MISAO’s optimization capability, a battery of digital optimization investigations is executed using 23 test functions, and the results of the comparative analysis show that the suggested algorithm has high solving accuracy and convergence velocity. Finally, the effectiveness and feasibility of the optimization path of the MISAO algorithm are demonstrated in the UAV path planning project.

Order-sensitive competitive revenue maximization for viral marketing in social networks

The Competitive Influence Maximization (CIM) problem is a critical issue in viral marketing, focusing on selecting a set of influential individuals, known as seed users, for competitors to maximize their revenue. These seed users have significant sway in social networks and serve as valuable marketing resources provided by the platform. They are often displayed in a certain order launched by the platform and the potential information hidden in the order can profoundly affect the final marketing outcomes. However, current CIM research predominantly emphasizes designing effective algorithms for seed selection while ignoring the impact of the seed order launched by the platform. Therefore, this paper focuses on identifying the optimal seed order to maximize platform revenue in a competitive market environment. Specifically, we introduce a new problem called Order-Sensitive Competitive Revenue Maximization (OSCRM) to investigate the CIM problem from a new practical perspective. We prove the problem to be NP-hard and present a simple greedy algorithm with a 1/3-approximate ratio. To address it more efficiently, we further propose an enhanced greedy algorithm called GMST. This algorithm leverages the maximum spanning tree (MST) and achieves a 1/2-approximate ratio. Extensive experiments on four real-world datasets demonstrate the effectiveness of our proposed GMST algorithm.

Energy-efficient multi-objective distributed assembly permutation flowshop scheduling by Q-learning based meta-heuristics

This study addresses energy-efficient multi-objective distributed assembly permutation flowshop scheduling problems with minimisation of maximum completion time, mean of earliness and tardiness, and total carbon emission simultaneously. A mathematical model is introduced to describe the concerned problems. Five meta-heuristics are employed and improved, including the artificial bee colony, genetic algorithms, particle swarm optimization, iterated greedy algorithms, and Jaya algorithms. To improve the quality of solutions, five critical path-based neighborhood structures are designed. Q-learning, a value-based reinforcement learning algorithm that learns an optimal strategy by repeatedly interacting with the environment, is embedded into meta-heuristics. The Q-learning guides algorithms intelligently select appropriate neighborhood structures in the iterative process. Then, two machine speed adjustment strategies are developed to further optimize the obtained solutions. Finally, extensive experimental results show that the Jaya algorithm with Q-learning has the best performance for solving the considered problems.

Optimized structural inspection path planning for automated unmanned aerial systems

Automation in Unmanned Aerial Systems (UAS)-based structural inspections has gained significant traction given the scale and complexity of infrastructure. A core problem in UAS-based inspection is electing an optimal flight path to achieve the mission objectives while minimizing flight time. This paper presents an effective two-stage method that guarantees coverage as a constraint to ensure damage detectability, while minimizing path length as an objective. A genetic algorithm first determines viewpoint positions, and a greedy algorithm calculates the camera poses, as opposed to directly optimizing all degrees of freedom (DOF) simultaneously. A sensitivity analysis demonstrates the range of applicability and superiority of this formulation over direct 5-DOF optimization by at least 30 % shorter path length. Applied examples, including focused and partial space inspections, are also presented, demonstrating the flexibility of the proposed method to meet real-world requirements. The results highlight the feasibility of the approach and contribute to incorporating automation into UAS-based structural inspections.

Hypergraph-Based Influence Maximization in Online Social Networks

Influence maximization in online social networks is used to select a set of influential seed nodes to maximize the influence spread under a given diffusion model. However, most existing proposals have huge computational costs and only consider the dyadic influence relationship between two nodes, ignoring the higher-order influence relationships among multiple nodes. It limits the applicability and accuracy of existing influence diffusion models in real complex online social networks. To this end, in this paper, we present a novel information diffusion model by introducing hypergraph theory to determine the most influential nodes by jointly considering adjacent influence and higher-order influence relationships to improve diffusion efficiency. We mathematically formulate the influence maximization problem under higher-order influence relationships in online social networks. We further propose a hypergraph sampling greedy algorithm (HSGA) to effectively select the most influential seed nodes. In the HSGA, a random walk-based influence diffusion method and a Monte Carlo-based influence approximation method are devised to achieve fast approximation and calculation of node influences. We conduct simulation experiments on six real datasets for performance evaluations. Simulation results demonstrate the effectiveness and efficiency of the HSGA, and the HSGA has a lower computational cost and higher seed selection accuracy than comparison mechanisms.

Differences in Advanced Therapeutic Modalities for Overactive Bladder in the United States by Race

ObjectiveTo investigate the impact of race on prescription patterns of therapies for OAB. MethodsThe TriNetX Diamond network was queried to identify adult females with a diagnosis of urinary urgency incontinence (UUI) or OAB, excluding those with stress incontinence or mixed incontinence. Treatments were defined as behavioral, medical, or minimally invasive in accordance with American Urological Association (AUA) guidelines. Propensity score matching for multiple covariates was performed using the greedy nearest-neighbor algorithm. Cox proportional hazards regression analysis was employed to compare the matched cohorts. Rates of treatment by three-digit zip codes were compared through chi-square tests or Fisher’s exact tests and geographic distribution maps were generated via STATA 17.0. ResultsWe identified 2,687,316 adult females diagnosed with OAB; 767,159 identified as White and 108,464 as Black. Within these cohorts, 16.6% of Black patients and 20.4% of White patients received OAB treatment. Twenty-six-point three percent of US zip-codes contained data for both White and Black patients, and in all these zip codes, White patients received significantly higher rates of prescriptions compared to Black patients. After propensity-score matching, significant differences in prescriptions persisted between the two groups with White patients exhibiting higher rates of any prescription. ConclusionsOur results demonstrate a significantly lower rate of prescriptions of medical and minimally invasive therapies for Black women. These racial differences in prescription of advanced therapeutic modalities for OAB may not be secondary to diagnosis but are likely secondary to prescribing disparities. Further research is needed to understand these differences.

Task scheduling in cloud computing based on grey wolf optimization with a new encoding mechanism

Task scheduling in the cloud computing still remains challenging in terms of performance. Several evolutionary-derived algorithms have been proposed to solve or alleviate this problem. However, evolutionary algorithms have good exploration ability, but the performance drops significantly in high dimensions. To address this issue, considering the characteristic of task scheduling in cloud computing (i.e. all task-VM mappings are 1-dimensional and have the same search range), we propose a task scheduling algorithm based on grey wolf optimization using a new encoding mechanism (GWOEM) in this work. Through this new encoding mechanism, greedy and evolutionary algorithms are rationally integrated in GWOEM. Besides, based on the new mechanism, the dimension of search space is reduced to 1 and the key parameter (i.e., the population size) is eliminated. We apply the proposed GWOEM to the Google Cloud Jobs dataset (GoCJ) and demonstrate better performance than the prior state of the art in terms of makespan.