Search Results (70)

The growing need for efficient and sustainable urban water management has accelerated the adoption of smart monitoring infrastructures based on wireless sensor networks (WSNs). This study proposes a connectivity-aware methodology for the optimal deployment of wireless sensor networks (WSNs) in smart water metering systems. The approach models the wireless sensors as nodes embedded in household water meters and determines the minimal yet sufficient set of Data Aggregation Points required to ensure complete network coverage and transmission reliability. A scalable and hierarchical topology is generated by integrating an enhanced minimum spanning tree algorithm with set covering techniques and geographic constraints, leading to a robust intermediate layer of aggregation nodes. These nodes are wirelessly linked to a single cellular base station, minimizing infrastructure costs while preserving communication quality. Simulation results on realistic urban layouts demonstrate that the proposed strategy reduces network fragmentation, improves energy efficiency, and simplifies routing paths compared to traditional ad hoc designs. The results offer a practical framework for deploying resilient and cost-effective smart water metering solutions in densely populated urban environments. Full article

The constrained bi-objective Minimum Spanning Tree (MST) problem is a fundamental challenge in network design, as it simultaneously requires minimizing both total edge weight and maximum hop distance under strict feasibility limits; however, most existing algorithms tend to emphasize one objective over the other, resulting in imbalanced solutions, limited Pareto fronts, or poor scalability on larger instances. To overcome these shortcomings, this study introduces a Hybrid MOCPO–AGE-MOEA algorithm that strategically combines the exploratory strength of Multi-Objective Crested Porcupines Optimization (MOCPO) with the exploitative refinement of the Adaptive Geometry-based Evolutionary Algorithm (AGE-MOEA), while a Kruskal-based repair operator is integrated to strictly enforce feasibility and preserve solution diversity. Moreover, through extensive experiments conducted on Euclidean graphs with 11–100 nodes, the hybrid consistently demonstrates superior performance compared with five state-of-the-art baselines, as it generates Pareto fronts up to four times larger, achieves nearly 20% reductions in hop counts, and delivers order-of-magnitude runtime improvements with near-linear scalability. Importantly, results reveal that allocating 85% of offspring to MOCPO exploration and 15% to AGE-MOEA exploitation yields the best balance between diversity, efficiency, and feasibility. Therefore, the Hybrid MOCPO–AGE-MOEA not only addresses critical gaps in constrained MST optimization but also establishes itself as a practical and scalable solution with strong applicability to domains such as software-defined networking, wireless mesh systems, and adaptive routing, where both computational efficiency and solution diversity are paramount Full article

The Minimum Spanning Tree (MST) problem addresses the challenge of identifying optimal network pathways for critical infrastructure systems, including transportation grids, communication backbones, power distribution networks, and reliability optimization frameworks. However, inherent uncertainties stemming from disruptive events demand robust analytical models for effective decision-making. This research introduces an uncertainty-theoretic framework to assess MST stability in uncertain network environments through novel constructs: lower set tolerance (LST) and dual lower set tolerance (DLST). Both LST and DLST provide quantifiable measures characterizing the resilience of element sets relative to edge-weighted MST configurations. LST captures the maximum simultaneous risk variation preserving current MST optimality, while DLST identifies the minimal variation required to invalidate it. We evaluate MST robustness by integrating uncertain reliability measures and risk factors, with emphasis on computational methods for set tolerance determination. To overcome computational hurdles in set tolerance derivation, we establish bounds and exact formulations within an uncertainty programming paradigm, offering enhanced efficiency compared with conventional re-optimization techniques. Full article

The Max+Sum Spanning Tree (MSST) problem, with applications in secure communication systems, seeks a spanning tree T minimizing ${max}_{e\in T}w\left(e\right)+{\sum }_{e\in T}c\left(e\right)$ on a given edge-weighted undirected network $G(V,E,c,w)$, where the sets V and E are the sets of vertices and edges, respectively. The functions c and w are defined on the edge set, representing transmission cost and verification delay in secure communication systems, respectively. This problem can be solved within $O\left(\right|E|log|V\left|\right)$ time. We investigate its interdiction (MSSTID) and improvement (MSSTIP) problems under the weighted $l_{\infty }$ norm. MSSTID seeks minimal edge weight adjustments (to either c or w) to degrade network performance by ensuring the optimal MSST’s weight is at least K, while MSSTIP similarly aims to enhance performance by making the optimal MSST’s weight at most K through minimal weight modifications. These problems naturally arise in adversarial and proactive performance enhancement scenarios, respectively, where network robustness or efficiency must be guaranteed through constrained resource allocation. We first establish their mathematical models. Subsequently, we analyze the properties of the optimal value to determine the relationship between the magnitude of a given number and the optimal value. Then, utilizing binary search methods and greedy techniques, we design four algorithms with time complexity $O\left(\right|E{|}^{2}log\left|V\right|)$ to solve the above problems by modifying w or c. Finally, numerical experiments are conducted to demonstrate the effectiveness of the algorithms. Full article

This paper presents a heuristic methodology for the optimal expansion of unbalanced three-phase distribution systems in rural areas, simultaneously addressing feeder routing and conductor sizing to minimize the total annualized cost—defined as the sum of investments in conductors and operational energy losses. The planning strategy explores two radial topological models: the Minimum Spanning Tree (MST) and the Steiner Tree (ST). The latter incorporates auxiliary nodes to reduce the total line length. For each topology, an initial conductor sizing is performed based on three-phase power flow calculations using Broyden’s method, capturing the unbalanced nature of the rural networks. These initial solutions are refined via four metaheuristic algorithms—the Chu–Beasley Genetic Algorithm (CBGA), Particle Swarm Optimization (PSO), the Sine–Cosine Algorithm (SCA), and the Grey Wolf Optimizer (GWO)—under a master–slave optimization framework. Numerical experiments on 15-, 25- and 50-node rural test systems show that the ST combined with GWO consistently achieves the lowest total costs—reducing expenditures by up to 70.63% compared to MST configurations—and exhibits superior robustness across all performance metrics, including best-, average-, and worst-case solutions, as well as standard deviation. Beyond its technical contributions, the proposed methodology supports the United Nations Sustainable Development Goals by promoting universal energy access (SDG 7), fostering cost-effective rural infrastructure (SDG 9), and contributing to reductions in urban–rural inequalities in electricity access (SDG 10). All simulations were implemented in MATLAB 2024a, demonstrating the practical viability and scalability of the method for planning rural distribution networks under unbalanced load conditions. Full article

Urban Air Mobility (UAM) is envisioned to revolutionize urban transportation by improving traffic efficiency and mitigating surface-level congestion. One of the fundamental challenges in implementing UAM systems lies in the optimal siting of vertiports, which requires a delicate balance among infrastructure construction costs, passenger access costs to their assigned vertiports, and the operational connectivity of the resulting vertiport network. This study develops an integrated mathematical model for vertiport location decision, aiming to minimize total system cost while ensuring UAM network connectivity among the selected vertiport locations. To efficiently solve the problem and improve solution quality, a hybrid genetic algorithm is developed by incorporating a Minimum Spanning Tree (MST)-based connectivity enforcement mechanism, a fundamental concept in graph theory that connects all nodes in a given network with minimal total link cost, enhanced by a greedy initialization strategy. The effectiveness of the proposed algorithm is demonstrated through numerical experiments conducted on both synthetic datasets and the real-world transportation network of New York City. The results show that the proposed hybrid methodology not only yields high-quality solutions but also significantly reduces computational time, enabling faster convergence. Overall, this study provides practical insights for UAM infrastructure planning by emphasizing demand-oriented vertiport siting and inter-vertiport connectivity, thereby contributing to both theoretical development and large-scale implementation in complex urban environments. Full article

In many applications, including underwater robotics, the coverage problem requires an autonomous vehicle to systematically explore a defined area while minimizing redundancy and avoiding obstacles. This paper investigates coverage path-planning strategies to enhance the efficiency of underwater gliders particularly in maximizing the probability of detecting a radioactive source while ensuring safe navigation. We evaluate three path-planning approaches: the Traveling Salesman Problem (TSP), Minimum Spanning Tree (MST), and the Optimal Control Problem (OCP). Simulations were conducted in MATLAB R2020a, comparing processing time, uncovered areas, path length, and traversal time. Results indicate that the OCP is preferable when traversal time is constrained, although it incurs significantly higher computational costs. Conversely, MST-based approaches provide faster but fewer optimal solutions. These findings offer insights into selecting appropriate algorithms based on mission priorities, balancing efficiency and computational feasbility. Full article

In this study, a prediction model was developed that considers the rainfall characteristics and damage characteristics of heavy rainfall disasters in Korea using machine learning models. Considering the damage characteristics of heavy rainfall disasters that occurred from 1999 to 2019 in 228 administrative districts in Korea, four types of total rainfall and five types of damage costs were selected to predict the total damage cost. The machine learning models selected for this study were Random Forest, K-Nearest Neighbors, Decision Tree, and eXtreme Gradient Boosting, and their accuracy was evaluated using $R^2$, EVS, and MAPE. The training period spanned from 1999 to 2015, while the evaluation period extended from 2016 to 2019. The Random Forest model emerged as the most effective model for predicting the total damage costs associated with heavy rainfall disasters, exhibiting an accuracy of 0.95 for $R^2$, 0.95 for EVS, and 0.05 for MAPE. It was observed that when the total damage costs are minimal, all models demonstrate high prediction capability. However, as the damage costs escalate, the prediction power experiences a decline due to the presence of errors. The machine learning prediction model for heavy rainfall disasters developed in this study has the potential to contribute to national efforts aimed at preventing and preparing for heavy rainfall disasters. Full article

Frogeye leaf spot on soybeans is traditionally considered as a southern disease in the United States but its impact in North Central USA has been rising in recent years. In this study, we investigated the population structure and mating type distribution in the C. sojina population from Indiana, USA. Based on 27 single nucleotide polymorphism markers, 49 multi-locus genotypes (MLGs) were identified in 234 isolates collected from 29 counties in Indiana in 2020. Bayesian analysis grouped the 49 MLGs into three clusters. This grouping was supported by principal coordinate analysis and, in large part, by the unweighted pair group method with arithmetic mean and minimal spanning tree. Only one mating-type idiomorph was found in each isolate and in each MLG. The MAT1-1 idiomorph was found in 22 MLGs and the MAT1-2 idiomorph was found in 27 MLGs. Based on clone-corrected data, the distribution of mating-type idiomorphs did not deviate significantly from 1:1 ratio in Indiana as a whole and in 22 out of 24 counties where two or more MLGs were found. Thirty MLGs contained QoI-resistant isolates and 22 MLGs contained QoI-sensitive isolates, with three MLGs containing both types of isolates. MLG1, the most common MLG with 90 isolates, contained mostly QoI-resistant isolates. Interestingly, MLG1 was also the dominant genotype in the Tennessee population collected in 2015, suggesting that MLG1 has been a dominant genotype in a wider region for many years. Based on the standard index of association ($\overline{r}$_d), the Indiana population as a whole was in significant linkage disequilibrium. However, in five out of 16 counties where three or more MLGs were found, the null hypothesis of linkage equilibrium was not rejected. Tests of linkage disequilibrium between locus pairs showed that 33.3% of locus pairs on the same contigs were in significant disequilibrium and 17.7% of locus pairs on different contigs were in significant disequilibrium. The possibility of a cryptic sexual stage was discussed. Full article

The pursuit of studying the quadratic minimum spanning tree (QMST) problem has captivated numerous academics because of its distinctive characteristic of taking into account the cost of interaction between pairs of edges. A QMST refers to the minimum spanning tree, which is a graph that is both acyclic and minimally connected. It also includes the interaction cost between a pair of edges in the minimum spanning tree. These interaction costs can occur between any pair of edges, whether they are adjacent or non-adjacent. In the QMST problem, our objective is to minimize both the cost of the edges and the cost of interactions. This eventually classifies the task as NP-hard. The interaction costs, sometimes referred to as quadratic costs, inherently exhibit a contradictory relationship with linear edge costs when solving a multi-objective problem that aims to minimize both linear and quadratic costs simultaneously. This study addresses the bi-objective adjacent only quadratic minimum spanning tree problem (AQMSTP) by incorporating the uncertain nature of the linear and quadratic costs associated with the problem. The focus is on the interaction costs between adjacent edges. Consequently, we have introduced a multi-objective problem called the uncertain adjacent only quadratic minimum spanning tree problem (mUAQMSTP) and formulated it using the uncertain chance-constrained programming technique. Afterwards, two MOEAs—non-dominated sorting genetic algorithm II (NSGAII) and duplicate elimination non-dominated sorting evolutionary algorithm (DENSEA)—and the traditional multi-objective solution approach, the global criterion method, are employed to solve the deterministic transformation of the model. Finally, we provide a suitable numerical illustration to substantiate our suggested framework. Full article

While the use of machine learning (ML) in automated real estate valuation is growing, research on stacking ML models into ensembles remains limited. In this paper, we propose a stacked ensemble model for valuing residential properties. By applying our models to a comprehensive dataset of residential real estate transactions from Jeju Island, spanning 2012 to 2021, we demonstrate that the predictive power of ML-based models can be enhanced. Our findings indicate that the stacked ensemble model, which combines predictions using ridge regression, outperforms all individual algorithms across multiple metrics. This model not only minimizes prediction errors but also provides the most stable and consistent results, as evidenced by the lowest standard deviation in both absolute errors and absolute percentage errors. Additionally, we employed the decision tree method to analyze the conditions under which specific features yield more accurate results or less reliable outcomes. It was observed that both the size and age of an apartment significantly impact prediction performance, with smaller and older complexes exhibiting lower accuracy and higher error rates. Full article

Structural properties of the currency market were examined with the use of topological networks. Relationships between currencies were analyzed by constructing minimal spanning trees (MSTs). The dissimilarities between time series of currency returns were measured in various ways: by applying Euclidean distance, Pearson’s linear correlation coefficient, Spearman’s rank correlation coefficient, Kendall’s coefficient, partial correlation, dynamic time warping measure, and Kullback–Leibler relative entropy. For the constructed MSTs, their topological characteristics were analyzed and conclusions were drawn regarding the influence of the dissimilarity measure used. It turned out that the strength of most types of correlations was highly dependent on the choice of the numeraire currency, while partial correlations were invariant in this respect. It can be stated that a network built on the basis of partial correlations provides a more adequate illustration of pairwise relationships in the foreign exchange market. The data for quotations of 37 of the most important world currencies and four precious metals in the period from 1 January 2019 to 31 December 2022 were used. The outbreak of the COVID-19 pandemic in 2020 and Russia’s invasion of Ukraine in 2022 triggered changes in the topology of the currency network. As a result of these crises, the average distances between tree nodes decreased and the centralization of graphs increased. Our results confirm that currencies are often pegged to other currencies due to countries’ geographic locations and economic ties. The detected structures can be useful in descriptions of the currency market, can help in constructing a stable portfolio of the foreign exchange rates, and can be a valuable tool in searching for economic factors influencing specific groups of countries. Full article

As an effective multicast application mechanism, the application layer multicast (ALM) determines the path of data transmission through a routing tree. In practical applications, multiple multicast sessions often occur simultaneously; however, few studies have considered this situation. A feasible solution is to sequentially optimize each co-existing ALM routing tree. However, this approach can lead to node congestion, and, even if the node out-degree reservation strategy is adopted, an optimal solution may not be obtained. In this study, to solve the problem of routing tree construction for multiple co-existing application layer multicast sessions, an optimization model that minimizes the overall delay and instability is constructed, and a one-off optimization method based on the discrete artificial fish swarm algorithm (DAFSA) is proposed. First, Steiner node sets corresponding to the multicast sessions are selected. Then, the routing trees for each multicast session are obtained through the improved spanning tree algorithm based on the complete graph composed of Steiner node sets. The experimental results show that the proposed method can simultaneously obtain multiple co-existing ALM routing trees with a low total delay and low instability. Even if the input is a single multicast session, it can lead to ALM routing trees with a lower delay and less instability than other algorithms, and the introduction of a penalty function can effectively avoid the problem of excessive replication and forwarding loads on some end-hosts. In addition, the proposed algorithm is insensitive to parameter changes and exhibits good stability and convergence properties for networks of different sizes. Full article

Olive trees have a unique reproductive pattern marked by biennial fruiting. This study examined the repercussions of alternate fruit bearing on the water relations of olive trees and the associated ecophysiological mechanisms. The experiment spanned two consecutive years: the “ON” year, characterized by a high crop load, and the “OFF” year, marked by minimal fruit production. Key ecophysiological parameters, including sap flow, stomatal conductance, and photosynthetic rate, were monitored in both years. Pre-dawn water potential was measured using continuous stem psychrometers and the pressure chamber technique. Biochemical analyses focused on non-structural carbohydrate concentrations (starch, sucrose, and mannitol) and olive leaves’ carbon-stable isotope ratio (δ¹³C). Results revealed a higher leaf gas exchange rate during the “ON” year, leading to an average 29.3% increase in water consumption and a 40.78% rise in the photosynthetic rate. Higher water usage during the “ON” year resulted in significantly lower (43.22% on average) leaf water potential. Sucrose and starch concentrations were also increased in the “ON” year, while there were no significant differences in mannitol concentration. Regarding the carbon-stable isotope ratio, leaves from the “OFF” year exhibited significantly higher δ¹³C values, suggesting a higher resistance to the CO₂ pathway from the atmosphere to carboxylation sites compared to the “ON” year plants. Full article

This paper presents a novel eight-step iterative algorithm for optimizing the layout of a neighborhood, focusing on the efficient allocation of houses to strategically placed facilities, herein referred to as ’points of interest’. The methodology integrates a mixed integer linear programming (MILP) approach with a heuristic algorithm to address a variant of the facility location problem combined with network design considerations. The algorithm begins by defining a set of geographic coordinates to represent houses within a predefined area. It then identifies key points of interest, forming the basis for subsequent connectivity and allocation analyses. The methodology’s core involves applying the Greedy algorithm to assign houses to the nearest points of interest, subject to capacity constraints. The method is followed by computing a Minimum Spanning Tree (MST) among these points to ensure efficient overall connectivity. The proposed algorithm’s iterative design is a key attribute. The most promising result of this approach is its ability to minimize the distance between houses and points of interest while optimizing the network’s total length. This dual optimization ensures a balanced distribution of houses and an efficient layout, making it particularly suitable for urban planning and infrastructure development. The paper’s findings demonstrate the algorithm’s effectiveness in creating a practical and efficient neighborhood layout, highlighting its potential application in large-scale urban planning and development projects. Full article