Solution Of Optimization Problem Research Articles

Research on Garment Washing Optimization Based on Linear Programming and Iterative Algorithm

This study is dedicated to exploring the optimization strategies for impurity dissolution during garment washing, aiming at minimizing the number of washes and water costs, while ensuring that the clothes are cleaned as expected. The proposed model was evaluated in a series of programming simulation experiments to obtain optimal solutions for several key problems. The study first applies an iterative algorithm to achieve the optimal rationing of the amount of washing and water consumption under specific conditions. Then, the variables were dynamically combined and resolved to deeply analyze the effects of initial solubility, decay coefficient, and initial contamination on the results. Finally, a mathematical model for detergent selection was developed through a linear programming model, which resulted in the optimal selection and lowest cost of different detergents based on the constraints and objective function.

Power Quality Conditioners-Based Fractional-Order PID Controllers Using Hybrid Jellyfish Search and Particle Swarm Algorithm for Power Quality Enhancement

Power quality (PQ) is a major issue in today’s electrical system that affects both utilities and customers. The proliferation of power electronics devices, smart grid technology, and renewable energy sources (RES) have all contributed to the emergence of PQ concerns in today’s power system. The Unified Power Quality Conditioner (UPQC) is a versatile tool that can be used to fix distribution grid issues caused by irregular voltage, current, or frequency. Several tuning parameters, however, restrict the effectiveness of the Fractional-Order Proportional Integral Derivative (FOPID) control technique, which is proposed to improve UPQC performance. To move beyond these restrictions and find the optimal solution for the FOPID controller problem, a hybrid optimization strategy called the Hybrid Jellyfish Search Optimizer and Particle Swarm Optimizer (HJSPSO) is employed. To meet the load requirement during PQ issue periods, the suggested model incorporates a renewable energy source into the grid system. Whether the load is linear or non-linear, the design maintains PQ problems to a minimum. Furthermore, the FOPID control technique is compared with other controllers. Results show that grid-connected RES systems using the proposed FOPID control approach for UPQC have fewer PQ problems. The presented UPQC with HJSPSO strategy significantly outperformed, with the shortest computing time of 127.474 s and an objective function value of 1.423.

A review on multi objective optimization problems and advancement on its solutions

A plenty of literatures are available for finding solution of optimization problem of single objective. Very few literatures are available for finding solution of optimization problem with multi objective optimization. Many researchers analysing multi objective problems by treating as single objective, keeping rest of variables as constant. With the tremendous rise of innovations in evolutionary computation, that has added feathers to Multi Objective Optimization techniques.

BinDMO: a new Binary Dwarf Mongoose Optimization algorithm on based Z-shaped, U-shaped, and taper-shaped transfer functions for CEC-2017 benchmarks

Intelligent swarm optimization algorithms have become increasingly common due to their success in solving real-world problems. Dwarf Mongoose Optimization (DMO) algorithm is a newly proposed intelligent swarm optimization algorithm in recent years. It was developed for continuous optimization problem solutions in its original paper. But real-world problems are not always problems that take continuously variable values. Real-world problems are often problems with discrete variables. Therefore, heuristic algorithms proposed for continuous optimization problems need to be updated to solve discrete optimization problems. In this study, DMO has been updated for binary optimization problems and the Binary DMO (BinDMO) algorithm has been proposed. In binary optimization, the search space consists of binary variable values. Transfer functions are often used in the conversion of continuous variable values to binary variable values. In this study, twelve different transfer functions were used (four Z-shaped, four U-shaped, and four Taper-shaped). Thus, twelve different BinDMO variations were obtained (BinDMO1, BinDMO2, …, BinDMO12). The achievements of BinDMO variations were tested on thirteen different unimodal and multimodal classical benchmark functions. The effectiveness of population sizes on the effectiveness of BinDMO was also investigated. When the results were examined, it was determined that the most successful BinDMO variation was BinDMO1 (with Z1-shaped transfer function). The most successful BinDMO variation was compared with three different binary heuristic algorithms selected from the literature (SO, PDO, and AFT) on CEC-2017 benchmark functions. According to the average results, BinDMO was the most successful binary heuristic algorithm. This has proven that BinDMO can be chosen as an alternative algorithm for binary optimization problems.

Non-Overlapping Domain Decomposition for 1D Optimal Control Problems Governed by Time-Fractional Diffusion Equations on Coupled Domains: Optimality System and Virtual Controls

We consider a non-overlapping domain decomposition method for optimal control problems of the tracking type governed by time-fractional diffusion equations in one space dimension, where the fractional time derivative is considered in the Caputo sense. We concentrate on a transmission problem defined on two adjacent intervals, where at the interface we introduce an iterative non-overlapping domain decomposition in the spirit of P.L. Lions for the corresponding first-order optimality system, such that the optimality system corresponding to the optimal control problem on the entire domain is iteratively decomposed into two systems on the respective sub-domains; this approach can be framed as first optimize, then decompose. We show that the iteration involving the states and adjoint states converges in the appropriate spaces. Moreover, we show that the decomposed systems on the sub-domain can in turn be interpreted as optimality systems of so-called virtual control problems on the sub-domains. Using this property, we are able to solve the original optimal control problem by an iterative solution of optimal control problems on the sub-domains. This approach can be framed as first decompose, then optimize. We provide a mathematical analysis of the problems as well as a numerical finite difference discretization using the L1-method with respect to the Caputo derivative, along with two examples in order to verify the method.

Dendritic Growth Optimization: A Novel Nature-Inspired Algorithm for Real-World Optimization Problems.

In numerous scientific disciplines and practical applications, addressing optimization challenges is a common imperative. Nature-inspired optimization algorithms represent a highly valuable and pragmatic approach to tackling these complexities. This paper introduces Dendritic Growth Optimization (DGO), a novel algorithm inspired by natural branching patterns. DGO offers a novel solution for intricate optimization problems and demonstrates its efficiency in exploring diverse solution spaces. The algorithm has been extensively tested with a suite of machine learning algorithms, deep learning algorithms, and metaheuristic algorithms, and the results, both before and after optimization, unequivocally support the proposed algorithm's feasibility, effectiveness, and generalizability. Through empirical validation using established datasets like diabetes and breast cancer, the algorithm consistently enhances model performance across various domains. Beyond its working and experimental analysis, DGO's wide-ranging applications in machine learning, logistics, and engineering for solving real-world problems have been highlighted. The study also considers the challenges and practical implications of implementing DGO in multiple scenarios. As optimization remains crucial in research and industry, DGO emerges as a promising avenue for innovation and problem solving.

Existence of harmonic maps and eigenvalue optimization in higher dimensions

AbstractWe prove the existence of nonconstant harmonic maps of optimal regularity from an arbitrary closed manifold $(M^{n},g)$ ( M n , g ) of dimension $n>2$ n > 2 to any closed, non-aspherical manifold $N$ N containing no stable minimal two-spheres. In particular, this gives the first general existence result for harmonic maps from higher-dimensional manifolds to a large class of positively curved targets. In the special case of the round spheres $N=\mathbb{S}^{k}$ N = S k , $k\geqslant 3$ k ⩾ 3 , we obtain a distinguished family of nonconstant harmonic maps $M\to \mathbb{S}^{k}$ M → S k of index at most $k+1$ k + 1 , with singular set of codimension at least 7 for $k$ k sufficiently large. Furthermore, if $3\leqslant n\leqslant 5$ 3 ⩽ n ⩽ 5 , we show that these smooth harmonic maps stabilize as $k$ k becomes large, and correspond to the solutions of an eigenvalue optimization problem on $M$ M , generalizing the conformal maximization of the first Laplace eigenvalue on surfaces.

Allocation of Starting Points in Global Optimization Problems

We propose new multistart techniques for finding good local solutions in global optimization problems. The objective function is assumed to be differentiable, and the feasible set is a convex compact set. The techniques are based on finding maximum distant points on the feasible set. A special global optimization problem is used to determine the maximum distant points. Preliminary computational results are given.

Fast Multiobjective Gradient Methods with Nesterov Acceleration via Inertial Gradient-Like Systems

We derive efficient algorithms to compute weakly Pareto optimal solutions for smooth, convex and unconstrained multiobjective optimization problems in general Hilbert spaces. To this end, we define a novel inertial gradient-like dynamical system in the multiobjective setting, which trajectories converge weakly to Pareto optimal solutions. Discretization of this system yields an inertial multiobjective algorithm which generates sequences that converge weakly to Pareto optimal solutions. We employ Nesterov acceleration to define an algorithm with an improved convergence rate compared to the plain multiobjective steepest descent method (Algorithm 1). A further improvement in terms of efficiency is achieved by avoiding the solution of a quadratic subproblem to compute a common step direction for all objective functions, which is usually required in first-order methods. Using a different discretization of our inertial gradient-like dynamical system, we obtain an accelerated multiobjective gradient method that does not require the solution of a subproblem in each step (Algorithm 2). While this algorithm does not converge in general, it yields good results on test problems while being faster than standard steepest descent.

Novel hybrid kepler optimization algorithm for parameter estimation of photovoltaic modules

The parameter identification problem of photovoltaic (PV) models is classified as a complex nonlinear optimization problem that cannot be accurately solved by traditional techniques. Therefore, metaheuristic algorithms have been recently used to solve this problem due to their potential to approximate the optimal solution for several complicated optimization problems. Despite that, the existing metaheuristic algorithms still suffer from sluggish convergence rates and stagnation in local optima when applied to tackle this problem. Therefore, this study presents a new parameter estimation technique, namely HKOA, based on integrating the recently published Kepler optimization algorithm (KOA) with the ranking-based update and exploitation improvement mechanisms to accurately estimate the unknown parameters of the third-, single-, and double-diode models. The former mechanism aims at promoting the KOA’s exploration operator to diminish getting stuck in local optima, while the latter mechanism is used to strengthen its exploitation operator to faster converge to the approximate solution. Both KOA and HKOA are validated using the RTC France solar cell and five PV modules, including Photowatt-PWP201, Ultra 85-P, Ultra 85-P, STP6-120/36, and STM6-40/36, to show their efficiency and stability. In addition, they are extensively compared to several optimization techniques to show their effectiveness. According to the experimental findings, HKOA is a strong alternative method for estimating the unknown parameters of PV models because it can yield substantially different and superior findings for the third-, single-, and double-diode models.

A fresh look at nonsmooth Levenberg–Marquardt methods with applications to bilevel optimization

In this paper, we revisit the classical problem of solving over-determined systems of nonsmooth equations numerically. We suggest a nonsmooth Levenberg–Marquardt method for its solution which, in contrast to the existing literature, does not require local Lipschitzness of the data functions. This is possible when using Newton-differentiability instead of semismoothness as the underlying tool of generalized differentiation. Conditions for local fast convergence of the method are given. Afterwards, in the context of over-determined mixed nonlinear complementarity systems, our findings are applied, and globalized solution methods, based on a residual induced by the maximum and the Fischer–Burmeister function, respectively, are constructed. The assumptions for local fast convergence are worked out and compared. Finally, these methods are applied for the numerical solution of bilevel optimization problems. We recall the derivation of a stationarity condition taking the shape of an over-determined mixed nonlinear complementarity system involving a penalty parameter, formulate assumptions for local fast convergence of our solution methods explicitly, and present results of numerical experiments. Particularly, we investigate whether the treatment of the appearing penalty parameter as an additional variable is beneficial or not.

Integrated Q-Learning with Firefly Algorithm for Transportation Problems

The study addresses the optimization of land transportation in the context of vehicle routing, a critical aspect of transportation logistics. The specific objectives are to employ various meta-heuristic optimization techniques, including Genetic Algorithms (GA), Ant Colony Optimization (ACO), Firefly Algorithm (FA), Particle Swarm Optimization (PSO), and Q-Learning reinforcement algorithm, to find the optimal solutions for vehicle routing problems. The primary aim is to enhance the efficiency and effectiveness of land transportation systems by minimizing factors such as travel distance or time while adhering to constraints. The study evaluates the advantages and limitations of each algorithm and introduces a novel-based approach that integrates Q-learning with the FA. The results demonstrate that these meta-heuristic optimization techniques offer promising solutions for complex vehicle routing challenges. The integrated Q-learning with Firefly Algorithm (iQLFA) emerges as the most successful approach among them, showcasing its potential to significantly improve transportation optimization outcomes.

A new MPPT controller based on a modified multiswarm PSO algorithm using an adaptive factor selection strategy for partially shaded PV systems

Maximum power point tracking (MPPT) controller is the main element in photovoltaic (PV) systems, which is used to ensure maximum power extraction under different meteorological conditions. A MPPT controller can guarantee good performance criteria even in the presence of climatic changes. To achieve this goal, several techniques have been proposed in the literature to improve robustness of the PV system control, such as artificial intelligence and multiswarm particle swarm optimization (MSPSO) algorithm. Previous research on classical MSPSO has shown that the algorithm search behavior cannot find the optimal solution for certain problems. In this context, we investigate the design of a new MPPT controller based on a modified version of heterogeneous multiswarm particle swarm optimization algorithm using an adaptive factor selection strategy (FMSPSO) for PV systems. The proposed FMSPSO can improve the tracking capability with high accuracy, less oscillations, and high robustness. To validate the proposed solution, a simulation and experimental benchmarking of a PV system are presented and analyzed. The obtained results show the effectiveness of the proposed solution compared with the classical MSPSO, fuzzy logic, and perturb and observe (P&O) control presented in other recent works.

A Surrogate-Assisted Evolutionary Algorithm for Seeking Multiple Solutions of Expensive Multimodal Optimization Problems

A Surrogate-Assisted Evolutionary Algorithm for Seeking Multiple Solutions of Expensive Multimodal Optimization Problems

Exploiting sparsity for localisation of large‐scale wireless sensor networks

AbstractWireless Sensor Network (WSN) localisation refers to the problem of determining the position of each of the agents in a WSN using noisy measurement information. In many cases, such as in distance and bearing‐based localisation, the measurement model is a non‐linear function of the agents' positions, leading to pairwise interconnections between the agents. As the optimal solution for the WSN localisation problem is known to be computationally expensive in these cases, an efficient approximation is desired. The authors show that the inherent sparsity in this problem can be exploited to greatly reduce the computational effort of using an Extended Kalman Filter (EKF) for large‐scale WSN localisation. In the proposed method, which the authors call the L‐Banded Extended Kalman Filter (LB‐EKF), the measurement information matrix is converted into a banded matrix by relabelling (permuting the order of) the vertices of the graph. Using a combination of theoretical analysis and numerical simulations, it is shown that typical WSN configurations (which can be modelled as random geometric graphs) can be localised in a scalable manner using the proposed LB‐EKF approach.

A Mixed‐Integer Linear Programming Framework for Optimization of Water Network Operations Problems

AbstractWater distribution systems (WDSs) are critical infrastructure used to convey water from sources to consumers. The mathematical framework governing the distribution of flows and heads in extended period simulations of WDSs lends itself to application in a wide range of optimization problems. Applying the classical mixed integer linear programming (MILP) approach to model WDSs hydraulics within an optimization framework can contribute to higher solution accuracy with lower computational effort. However, adapting WDSs models to conform to a MILP formulation has proven challenging because of the intrinsic non‐linearity of system hydraulics and the complexity associated with modeling hydraulic devices that influence the state of the WDS. This paper introduces MILPNet, an adjustable framework for WDSs that can be used to build and solve an extensive array of MILP optimization problems. MILPNet includes constraints that represent the mass balance and energy conservation equations, hydraulic devices, control rules, and status checks. To conform to MILP structure, MILPNet employs piece‐wise linear approximation and integer programming. MILPNet was implemented and tested using Gurobi Python API. Modeling accuracy was shown to be comparable to EPANET, a public domain software for hydraulic modeling, and sensitivity analyses were conducted to examine the impacts of the modeling assumptions on the performance of MILPNet. Additionally, application of the framework was demonstrated using pump scheduling optimization examples in single and rolling horizon scenarios. Our results show that MILPNet can facilitate the construction and solution of optimization problems for a range of applications in WDSs operations.

A Neural Separation Algorithm for the Rounded Capacity Inequalities

The cutting plane method is a key technique for successful branch-and-cut and branch-price-and-cut algorithms that find the exact optimal solutions for various vehicle routing problems (VRPs). Among various cuts, the rounded capacity inequalities (RCIs) are the most fundamental. To generate RCIs, we need to solve the separation problem, whose exact solution takes a long time to obtain; therefore, heuristic methods are widely used. We design a learning-based separation heuristic algorithm with graph coarsening that learns the solutions of the exact separation problem with a graph neural network (GNN), which is trained with small instances of 50 to 100 customers. We embed our separation algorithm within the cutting plane method to find a lower bound for the capacitated VRP (CVRP) with up to 1,000 customers. We compare the performance of our approach with CVRPSEP, a popular separation software package for various cuts used in solving VRPs. Our computational results show that our approach finds better lower bounds than CVRPSEP for large-scale problems with 400 or more customers, whereas CVRPSEP shows strong competency for problems with less than 400 customers. History: Accepted by Andrea Lodi, Area Editor for Design & Analysis of Algorithms–Discrete. Funding: This work was supported by the National Research Foundation of Korea (NRF) grant funded by the Korean government (MSIT) [RS-2023-00259550] and the Institute of Information & Communications Technology Planning & Evaluation (IITP) grant funded by the Korean government (MSIT) [2022-0-01032, Development of Collective Collaboration Intelligence Framework for Internet of Autonomous Things]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/ijoc.2022.0310 .

SCOP: Schrödinger Control Optimal Planning for Goal-based Wealth Management

We consider the problem of optimization of contributions of a financial planner such as a working individual towards a financial goal such as retirement. The objective of the planner is to find an optimal and feasible schedule of periodic installments to an investment portfolio set up towards the goal. Because portfolio returns are random, the practical version of the problem amounts to finding an optimal contribution scheme such that the goal is satisfied at a given confidence level. This paper suggests a semi-analytical approach to a continuous-time version of this problem based on a controlled backward Kolmogorov equation (BKE) which describes the tail probability of the terminal wealth given a contribution policy. The controlled BKE is solved semi-analytically by reducing it to a controlled Schrödinger equation and solving the latter using an algebraic method. Numerically, our approach amounts to finding semi-analytical solutions simultaneously for all values of control parameters on a small grid, and then using the standard two-dimensional spline interpolation to simultaneously represent all satisficing solutions of the original plan optimization problem. Rather than being a point in the space of control variables, satisficing solutions form continuous contour lines (efficient frontiers) in this space.

Group contribution method for rapid estimation of crystal growth rates

The morphological evolution of organic crystals during crystallization depends on the face-specific growth rates. Classical growth rate models relate the face-specific growth rates to the crystal lattice, energy of stable facets, growth mechanism, and supersaturation. The complexities of these models have increased over time to account accurately for solution conditions, the structure of growth units, and their attachment rates. Such advanced growth rate models require several layers of computations to obtain attachment energies of facets, nucleation rates, kink density, and attachment rates. Among these, the most intensive and time-consuming computation is for attachment rates, which require molecular dynamic simulations. This substantially increases the overall computation time to predict the absolute growth rate for even one crystallization condition. Since it is nearly impossible to iterate such a growth rate model, optimization schemes cannot be implemented to identify solution conditions that favor specific crystal growth. To reduce the computational time for attachment rate calculations, we implement a group contribution method (GCM) that relates the properties of functional groups in a molecule to their attachment rates to the crystal lattice, thereby rapidly estimating the growth rates of organic crystals. The process of molecular attachment involves partial desolvation of a solvated molecule, referred to as a transition state, followed by total desolvation via spontaneous attachment to a crystal facet. The first step in GCM is to identify the equilibrium states of fully solvated and partially desolvated solute molecules. The degree of supersaturation dictates the extent of this equilibrium and, thereby, the activation barrier for the growth of crystals, according to transition state theory. Identifying this equilibrium phenomenon allows for capturing the functional-group-specific interactions that depend on molecular motion, which could be related to operating conditions such as temperature and pressure. The stochastic optimization technique with Monte-Carlo sampling allows an efficient optimization problem solution to obtain the group interaction parameters. The GCM approach is first validated for the estimation of growth rates of glutamic acid and L-histidine, and then extended to predict growth rates of alanine and glycine rapidly. The optimized parameters and GCM scheme can be used to estimate growth rates in other crystallization systems.

Страхование капитального ремонта в Российской Федерации: актуальные проблемы и перспективы

Issues of provision of housing to citizens, dilapidation of the housing stock of the country and the importance of its renovation are named among the acute problems in Addresses of the President of the Russian Federation . A wisely developed system of major renovations of apartment blocks is the most optimal problem solution. However, although the adopted measures have been advanced and timely, they could not alleviate the emerging destructive tendencies, so the legislator has brought forward an initiative to introduce a mechanism of insurance of major renovations in the Russian Federation. This idea is not new in the world’s practice and is quite efficiently implemented in foreign laws and orders, primarily in form of an insurance coverage or performance bond. Its practical implementation in Russia and prospects of successful functioning present a relevant civil task. Following the results of the study, the authors conclude that the efficiency of this novelty will depend on the level of development of its implementation, establishment of the optimal legal framework and organizational mechanism.