Constraints Of Problem Research Articles

Robust Semi-Infinite Interval Equilibrium Problem Involving Data Uncertainty: Optimality Conditions and Duality

In this paper, we model uncertainty in both the objective function and the constraints for the robust semi-infinite interval equilibrium problem involving data uncertainty. We particularize these conditions for the robust semi-infinite mathematical programming problem with interval-valued functions by extending the results from the literature. We introduce the dual robust version of the above problem, prove the Mond–Weir-type weak and strong duality theorems, and illustrate our results with an example.

Symmetry classification and enumeration of square-tile sikku kolams

Pulli kolam is an ancient mathematical art form that is still practiced today in south India by over a quarter million people. ‘Pulli’ in the Tamizh language means ‘dots’. A specific type of pulli kolam is sikku kolam where a series of dots are placed using rice flour and lines are drawn around them following three simple rules. Here we focus on sikku kolams assembled from square tiles. Kolams are classified by their point group symmetry and formulae are derived for counting the number of kolams of each symmetry type. Some interesting constraint problems are posed that could help formulate new games based on this elegant art form.

Sustainable Water Management Solutions for Urban Areas

The management of water resources is a serious concern in urban areas because of the effects of climate change, aging infrastructure, and rapid population increase. This essay examines the vital significance of sustainable water management in urban settings, emphasizing cutting-edge frameworks for policy and technology that can improve water resilience and efficiency. Successful strategies, such as demand management and diversification of the water supply, are demonstrated by case studies like Windhoek, Namibia. In order to solve the intricate and interrelated problems of urban water scarcity, infrastructure constraints, and environmental repercussions, the essay emphasizes integrated water resources management (IWRM) as a crucial technique that incorporates multidisciplinary viewpoints. In order to guarantee a sustainable urban water future, the importance of inclusive policies and governance is also covered, highlighting the necessity of cooperative and flexible problemsolving techniques.

Multi-Static Radar System Deployment Within a Non-Connected Region Utilising Particle Swarm Optimization

This paper is mainly devoted to studying the deployment problem of a multi-static radar system (MSRS) within a non-connected deployment region using multi-objective particle swarm optimization (MOPSO). By modeling and reformulating the problem, it can be represented as a multi-objective mixed integer programming (MOMIP), which eliminates the need for additional constraints. To enhance the algorithm performance, integer variables and continuous ones are treated separately employing multiple velocity formulas. The velocity formulas for integer variables are modified using the sigmoid function and genetic operation, leading to the proposal of two MSRS deployment algorithms, namely MOPSO-Sigmoid and MOPSO-Gene. To evaluate the performance of the proposed algorithms, they are compared with two existing MOPSO-based algorithms. The first algorithm is the MSRS deployment algorithm for the non-connected deployment region that addresses the additional constraint problem model. The second algorithm is based on an existing conventional MOPSO algorithm and addresses the equivalent MOMIP problem model. A numerical study demonstrates that MOPSO-Sigmoid and MOPSO-Gene exhibit promising efficiency and effectiveness.

Optical circuit switched three-stage twisted-folded Clos-network design model guaranteeing admissible blocking probability

Some data center networks have already started to use optical circuit switching (OCS) with potential performance benefits, including high capacity, low latency, and energy efficiency. This paper addresses a switching network design to maximize the network radix, i.e., the number of terminals connected to the network under the condition that a specified number of identical switches with the size N×N and the maximum admissible blocking probability are given. Previous work presented a two-stage twisted and folded Clos network (TF-Clos) with a blocking probability guarantee for OCS, which has a larger network radix than TF-Clos with a strict-sense non-blocking condition. Expanding the number of stages allows for enhancing the network radix. This paper proposes a model designing an OCS three-stage TF-Clos structure with a blocking probability guarantee to increase the network radix compared to the two-stage TF-Clos. We formulate the problem of obtaining the network configuration that maximizes the network radix as an optimization problem. We conduct an algorithm based on an exhaustive search to obtain a feasible solution satisfying the constraints of the optimization problem. This algorithm identifies the structure with the largest network radix in non-increasing order to avoid unnecessary searches. Numerical results show that the proposed model achieves a larger network radix than the two-stage model.

A two-layer strategy for sustainable energy management of microgrid clusters with embedded energy storage system and demand-side flexibility provision

The intermittent nature of renewable energy generation and the fluctuating demands pose persistent challenges in microgrid operations. In response, stakeholders and operators have turned to clustering the geographically adjacent microgrids as a solution. In this context, this paper introduces a novel two-layer energy management strategy for microgrid clusters, utilizing demand-side flexibility and the capabilities of shared battery energy storage (SBES) to minimize operational costs and emissions, while ensuring a spinning reserve within individual microgrids to prevent load-shedding. In the lower layer, the proposed approach devises optimal day-ahead operation policies, while the upper layer employs a cooperative strategy to further optimize the operational efficiency across the entire cluster. The energy management problem is accurately formulated as a mixed integer quadratic programming (MIQP) optimization, which incorporates linear terms in the problem's constraints. The formulation accounts for operational costs associated with SBES including expenses of charging/discharging and changes in operating states (CiOS). Real-world case studies with a cluster of three microgrids in Australia validate the effectiveness of this approach. Results show a reduction in operational costs for the base case scenario by 6.96 % compared to conventional microgrid management strategies. Sensitivity analyses further demonstrate the economic benefits of varying SBES capacity and flexibility pricing, with savings ranging from 6.5 % to 8.1 %. The proposed strategy also reduces CO2 emissions by up to 11.6 %, while improving system reliability. This strategy holds promise for integration into distributed energy systems with high renewable penetration and clustered local grids, offering significant advantages for utility operators and end-users through improved energy efficiency and reduced emissions.

Optimizing Virtual Network Embedding for Avionics with Time-Triggered Traffic Scheduling

Network virtualization technology abstracts the nodes and links resources in the physical network, and enables multiple virtual networks (VNs) to share the substrate network (SN) resources through the Virtual Netw ork Embedding (VNE) method. For time-triggered Ethernet (TTE) used in avionics, a time-triggered traffic scheduling oriented virtual network embedding (TT-VNE) method is proposed. While meeting the total resource constraints of traditional VNE problem, it ensures the strict periodicity of time-triggered (TT) traffic. During the solution process, the method sorts the virtual nodes according to the TT traffic bandwidth requirements and the total bandwidth requirements of the links connected to the virtual nodes, embeds the virtual nodes using the breadth first search algorithm, and plans the virtual links in candidate shortest path aggregation. If the TT traffic in the current virtual link is not schedulable, the iterative design of local virtual node re embedding and path planning is carried out. The simulation shows that the request acceptance rate of TT-VNE is not lower than that of existing methods, and when the number of virtual network requests in the star topology exceeds 30 , its request acceptance rate is about 14.3%higher than the VNE-NTANRC-D method which only considers the network topology and resource attributes.

Multi-UAVs task allocation method based on MPSO-SA-DQN

Multi-UAVs play an important role in the battlefield. Although many methods are proposed to solve the Multi-UAV task allocation, there still existing the problems of complex time constraints and uncertain solution space. The reason is that multi-UAVs usually face changing environmental factors. Aiming at solving such problem, this paper proposes a multi-UAV task assignment method based on Deep Q-based evolutionary reinforcement learning algorithms (MPSO-SA-DQN). Specifically, this method builds a multi-agent training framework based on the deep evolutionary reinforcement learning mechanism and SA-DQN. Its aim is to improve the global exploration and optimization capabilities of multi-agents. At the same time, the multi-dimensional particle swarm optimization algorithm is introduced to optimize the state space. Based on task priority mapping, the MPSO-SA-DQN algorithm framework is proposed. As a result, multi-agents can optimize the execution state in real time in the environment interaction. Besides, it also has the ability to reach optimal state and maximum reward. According to the characteristics of multi-UAV global task assignment, this paper designs a priority state space autoencoder strategy and global task feature. A multi-UAVs tasks allocation and iterative optimization method based on MPSO-SA-DQN algorithm is proposed, so as to continuously optimize the task allocation scheme. The simulation results show that the multi-UAV task allocation method based on MPSO-SA-DQN can effectively solve the problem of uncertainty in the optimal solution space of task allocation. At the same time, the algorithm achieves faster convergence result, and a good prospect of promotion in the field of UAV swarm cooperative task planning.

Existence and stability of standing waves for a weakly coupled nonlinear fractional Schrödinger system

We study the system of two weakly coupled nonlinear fractional Schrödinger equations{(−Δ)su+ωu=|u|2p−2u+β|u|p−2u|v|pin RN,(−Δ)sv+ωv=|v|2p−2v+β|u|p|v|p−2vin RN, where N≥2,s∈(0,1],2<2p<2s⁎=2N/(N−2s),ω>0 and β>0. For s∈(0,1] and 1<p<2, by finding a new kind of solution to the above system and comparing its energy level with those of other kinds of solutions, we show that each component of the least energy solution is nontrivial for any β>0, which forms a striking contrast with case p≥2. We emphasize that this result can be viewed as a complement to that of Guo and He (2016) [13] and Maia et al. (2006) [28]. When s∈(0,1),1<p<1+2s/N and ω>0 is fixed, we obtain the orbital stability of standing waves associated with the synchronized solution to the above system. To this end, we introduce an auxiliary mass constraint problem and establish the connection between the orbital stability of standing waves and the stability of ground state set to the auxiliary problem.

Scaling Abstraction Refinement for Program Analyses in Datalog using Graph Neural Networks

Counterexample-guided abstraction refinement (CEGAR) is a popular approach for automatically selecting abstractions with high precision and low time costs. Existing works cast abstraction refinements as constraint-solving problems. Due to the complexity of these problems, they cannot be scaled to large programs or complex analyses. We propose a novel approach that applies graph neural networks to improve the scalability of CEGAR for Datalog-based program analyses. By constructing graphs directly from the Datalog solver’s calculations, our method then uses a neural network to score abstraction parameters based on the information in these graphs. Then we reform the constraint problems such that the constraint solver ignores parameters with low scores. This in turn reduces the solution space and the size of the constraint problems. Since our graphs are directly constructed from Datalog computation without human effort, our approach can be applied to a broad range of parametric static analyses implemented in Datalog. We evaluate our approach on a pointer analysis and a typestate analysis and our approach can answer 2.83× and 1.5× as many queries as the baseline approach on large programs for the pointer analysis and the typestate analysis, respectively.

Modified Double Inertial Extragradient-like Approaches for Convex Bilevel Optimization Problems with VIP and CFPP Constraints

Convex bilevel optimization problems (CBOPs) exhibit a vital impact on the decision-making process under the hierarchical setting when image restoration plays a key role in signal processing and computer vision. In this paper, a modified double inertial extragradient-like approach with a line search procedure is introduced to tackle the CBOP with constraints of the CFPP and VIP, where the CFPP and VIP represent a common fixed point problem and a variational inequality problem, respectively. The strong convergence analysis of the proposed algorithm is discussed under certain mild assumptions, where it constitutes both sections that possess a mutual symmetry structure to a certain extent. As an application, our proposed algorithm is exploited for treating the image restoration problem, i.e., the LASSO problem with the constraints of fractional programming and fixed-point problems. The illustrative instance highlights the specific advantages and potential infect of the our proposed algorithm over the existing algorithms in the literature, particularly in the domain of image restoration.

Model-predictive optimal control of ferrofluidic microrobots in three-dimensional space

Ferrofluid microrobots have emerged as promising tools for minimally invasive medical procedures. Their unique properties to navigate complex fluids and reach otherwise inaccessible regions of the human body have enabled new applications in targeted drug delivery, tissue engineering, and diagnostics. This paper proposes a model-predictive controller for the external magnetic manipulation of ferrofluid microrobots in three dimensions (3D). The internal optimization routine of the controller determines appropriate changes in the applied electromagnetic field to minimize the deviation between the actual and desired trajectories of the microrobot. A linear system governing locomotion is derived and used as the equality constraints of the optimization problems associated with the feedback index. In addition to ferrofluid droplets, the controller presented in this work may be applied to other magnetically-pulled microrobots. Several experiments are performed to validate the controller and showcase its ability to adapt to changes in system parameters such as the desired tracking trajectory and the size, orientation, deformation, and velocity of the microrobot. The accuracy of the controller is analyzed for each experiment, and the average error is found to be within 0.25 mm for small velocities. An additional experiment is performed to demonstrate significant improvement over a PID controller that is optimally tuned using Bayesian optimization. The results presented in this paper suggest that the proposed control algorithm could enable new microrobotic capabilities in minimally invasive medical procedures, lab-on-a-chip applications, and microfluidics.

Command filter‐based adaptive finite‐time control of fractional‐order nonlinear constrained systems with input saturation

AbstractIn this article, the command filter‐based finite‐time tracking control issue is explored for fractional‐order nonlinear constrained systems (FONCSs) with saturated input. Firstly, a novel fractional‐order Lyapunov stability lemma is put forward, thereby offering a reliable strategy for finite‐time convergence of FONCSs. By employing an improved error compensation system and introducing auxiliary signal, a new finite‐time command filtered backstepping technique is developed. The proposed control strategy guarantees the finite‐time convergence characteristic of filtering signals, in addition to alleviate the impacts produced by saturated input. After that, a modified nonlinear state‐dependent function (NSDF) is developed to solve the state constraint problem while fulfilling the concavity condition. In comparison to the existing constrained control techniques in FONCSs, this approach not only ensures finite‐time convergence of the tracking error but also gets rid of feasibility demands. Ultimately, two simulation scenarios are supplied to illustrate the feasibility and usefulness of the suggested strategy.

A comparative study of evolutionary algorithms and particle swarm optimization approaches for constrained multi-objective optimization problems

Many real-world optimization problems contain multiple conflicting objectives as well as additional problem constraints. These problems are referred to as constrained multi-objective optimization problems (CMOPs). Many meta-heuristics for solving CMOPs, called constrained multi-objective meta-heuristics (CMOMHs) have been introduced in the literature, including those using particle swarm optimization (PSO)(Kennedy and Eberhart, 1995), genetic algorithms (GAs)(Man et al., 1996), and differential evolution (DE)(Storn and Price, 1997). CMOMHs can be grouped into four different classes: classic CMOMHs, co-evolutionary approaches, multi-stage approaches, and multi-tasking approaches. An extensive comparative study of twenty different CMOMHs on a wide variety of test problems, including real-world CMOPs in the fields of science and engineering, is conducted. A multi-swarm PSO approach called constrained multi-guide particle swarm optimization (ConMGPSO) is introduced and compared to the best-performing previous approaches according to the comparative study. The performance of each algorithm was found to be problem dependent, however the best overall approaches were ConMGPSO, paired-offspring constrained evolutionary algorithm (POCEA)(He et al., 2021), adaptive non-dominated sorting genetic algorithm III (A-NSGA-III)(Jain and Deb, 2014), and constrained multi-objective framework using Q-learning and evolutionary multi-tasking (CMOQLMT)(Ming and Gong, 2023). ConMGPSO and POCEA had the best performance on the CF benchmark set, which contains examples of bi-objective and tri-objective CMOPs with disconnected CPOFs. The CMOQLMT approach had the best performance on the DAS-CMOP benchmark set, which contain additional difficulty in terms of feasibility-, convergence-, and diversity-hardness. For the selected real-world CMOPs, A-NSGA-III had the best performance overall. ConMGPSO was shown to have the best performance on the process, design, and synthesis problems, and had competitive performance for the power system optimization problems.

Predefined-time adaptive fuzzy control for nonlinear output constraint systems with unknown backlash-like hysteresis via command filtering

In this article, the predefined-time adaptive fuzzy control problem for strict-feedback nonlinear systems with asymmetric time-varying output constraint and unknown backlash-like input hysteresis is considered. An innovative predefined-time adaptive control method, in which utilises unified barrier function (UBF) to deal with the output constraint problem and adopts a differential equation to represent the unknown backlash-like hysteresis, is presented by combining a novel command filter with backstepping technology. Fuzzy logic systems (FLSs) are employed to estimate the unknown nonlinearities. Moreover, by designing appropriate parameters, the constructed control strategy ensures that all signals are predefined-time bound and the tracking error stays in a small neighbourhood adjacent zero. Ultimately, two simulation examples are given to prove the effectiveness of the presented control algorithm.

Deriving Sufficient Conditions for Exact Relaxation of Complementarity Constraints in Optimization Problems With Energy Storage

Deriving Sufficient Conditions for Exact Relaxation of Complementarity Constraints in Optimization Problems With Energy Storage

Research on distributed optimal scheduling method based on consensus

Abstract With access to large-scale distributed power sources, the physical structure of the power grid system tends to be distributed. The application of traditional centralized optimal scheduling methods will lead to a surge in communication overhead and computational complexity, which will affect the performance and efficiency of the solution. In this paper, the minimum operating cost of the system is taken as the goal, and the distributed direct current optimal power flow (DC-OPF) optimization calculation of the photovoltaic-storage power generation system is considered to approximately solve the economic dispatch problem. The DC optimal power flow model with energy storage charging penalty is constructed. Then, the distributed optimization method based on the consensus alternating direction multiplier method (ADMM) is adopted. By decoupling the objective function and constraints of the whole system problem, the fully distributed DC-OPF calculation is realized by introducing the global consensus variable to deal with the boundary buses. Finally, the improved IEEE 30-bus example is used to test the method, and the simulation results verify the convergence and accuracy of the method.

Double-Structured Sparsity Guided Flexible Embedding Learning for Unsupervised Feature Selection.

In this article, we propose a novel unsupervised feature selection model combined with clustering, named double-structured sparsity guided flexible embedding learning (DSFEL) for unsupervised feature selection. DSFEL includes a module for learning a block-diagonal structural sparse graph that represents the clustering structure and another module for learning a completely row-sparse projection matrix using the l2,0 -norm constraint to select distinctive features. Compared with the commonly used l2,1 -norm regularization term, the l2,0 -norm constraint can avoid the drawbacks of sparsity limitation and parameter tuning. The optimization of the l2,0 -norm constraint problem, which is a nonconvex and nonsmooth problem, is a formidable challenge, and previous optimization algorithms have only been able to provide approximate solutions. In order to address this issue, this article proposes an efficient optimization strategy that yields a closed-form solution. Eventually, through comprehensive experimentation on nine real-world datasets, it is demonstrated that the proposed method outperforms existing state-of-the-art unsupervised feature selection methods.

Problem constraints in ideation contests: How different types of constraints matter

Companies are turning to ideation contests to engage ideators outside company boundaries to solve their complex problems. Our research focusses on how articulating the problem, specifically the number and type of constraints described within the problem statement (brief), is related to the number of ideas submitted by participants in ideation contests. Specifically, we find that participant engagement, in terms of ideas submitted, varies with three different types of constraints—input, process and output. Contributions to the creativity literature as well as managerial implications are discussed.

Distributed adaptive event-triggered finite-time fault-tolerant containment control for multi-UAVs with input constraints and actuator failures

This article investigates the distributed adaptive finite-time containment control problem for multi-UAVs with input constraints, actuator failures, communication limitations, and external disturbances. First, a new smoothing function is used to smooth the asymmetric input constraint signals so that the input constraint and actuator fault control problem can be transformed into a variable gain control problem. Subsequently, a new Nussbaum function is proposed to solve the variable gain control problem. A new adaptive event-triggered strategy is designed to solve the communication limitation problem, and the trigger threshold has the characteristic of adaptive adjustment that can be dynamically decreased. In response to external disturbances, an adaptive law is designed to estimate and compensate for the boundaries of disturbances. It follows from the analysis based on Lyapunov theory that under the proposed controller, the followers will converge to the convex envelope formed by the leaders in a finite time, and Zeno-free is achieved. Simulation results are provided to verify the effectiveness of the developed adaptive event-triggered finite-time fault-tolerant containment control laws.