Search Results (23)

The design of multi-link vehicle suspension systems, such as the 3D double-wishbone, presents a critical challenge in automotive engineering. The process constitutes a high-dimensional, nonlinearly constrained optimization problem where traditional gradient-based methods often fail by converging to suboptimal local minima. This paper introduces a novel two-stage hybrid optimization framework designed to overcome this limitation by intelligently integrating quantum-inspired and classical techniques. The methodology explicitly defines a QUBO (Quadratic Unconstrained Binary Optimization) stage and an SQP (Sequential Quadratic Programming) stage. Stage 1 addresses the complex kinematic constraint problem by formulating it as a QUBO, which is then solved using Simulated Annealing to perform a global search, guaranteeing a physically feasible starting point. Subsequently, Stage 2 takes this feasible solution and employs an SQP algorithm to perform a high-precision local refinement, tuning the geometry to meet specific performance targets for camber and caster curves. The framework successfully converged to a design with a near-zero performance objective of 7.08 × 10⁻¹⁴. The efficacy of this hybrid approach is highlighted by the dramatic improvement from the high-error initial solution found by Simulated Annealing to the final, high-precision result from the SQP refinement. We conclude that this QUBO-SQP framework is a powerful and validated methodology for solving complex, real-world engineering design problems, effectively bridging the gap between global exploration and local precision. Full article

Flexi-grid technology has revolutionized optical networking by enabling Elastic Optical Networks (EONs) that offer greater flexibility and dynamism compared to traditional fixed-grid systems. As data traffic continues to grow exponentially, the need for efficient and scalable solutions to the routing and spectrum assignment (RSA) problem in EONs becomes increasingly critical. The RSA problem, being NP-Hard, requires solutions that can simultaneously address both spatial routing and spectrum allocation. This paper proposes a novel quantum-based approach to solving the RSA problem. By formulating the problem as a Quadratic Unconstrained Binary Optimization (QUBO) model, we employ the Quantum Approximate Optimization Algorithm (QAOA) to effectively solve it. Our approach is specifically designed to minimize end-to-end delay while satisfying the continuity and contiguity constraints of frequency slots. Simulations conducted using the Qiskit framework and IBM-QASM simulator validate the effectiveness of our method. We applied the QAOA-based RSA approach to small network topology, where the number of nodes and frequency slots was constrained by the limited qubit count on current quantum simulator. In this small network, the algorithm successfully converged to an optimal solution in less than 30 iterations, with a total runtime of approximately 10.7 s with an accuracy of $78.8\%$. Additionally, we conducted a comparative analysis between QAOA, integer linear programming, and deep reinforcement learning methods to evaluate the performance of the quantum-based approach relative to classical techniques. This work lays the foundation for future exploration of quantum computing in solving large-scale RSA problems in EONs, with the prospect of achieving quantum advantage as quantum technology continues to advance. Full article

Mine ventilation is crucial for ensuring safe production in mines, as it is integral to the entire underground mining process. This study addresses the issues of high energy consumption, regulation difficulties, and unreasonable regulation schemes in mine ventilation systems. To this end, we construct an optimization model for mine ventilation network regulation using mixed-integer nonlinear programming (MINLP), focusing on objectives such as minimizing energy consumption, optimal regulation locations and modes, and minimizing the number of regulators. We analyze the construction methods of the mathematical optimization model for both selected and unselected fans. To handle high-order terms in the MINLP model, we propose a variable discretization strategy that introduces 0-1 binary variables to discretize fan branches’ air quantity and frequency regulation ratios. This transformation converts high-order terms in the constraints of fan frequency regulation into quadratic terms, making the model suitable for solvers based on globally accurate algorithms. Example analysis demonstrate that the proposed method can find the optimal solution in all cases, confirming its effectiveness. Finally, we apply the optimization method of ventilation network regulation based on MINLP to a coal mine ventilation network. The results indicate that the power of the main fan after frequency regulation is 71.84 kW, achieving a significant energy savings rate of 65.60% compared to before optimization power levels. Notably, ventilation network can be regulated without adding new regulators, thereby reducing management and maintenance costs. This optimization method provides a solid foundation for the implementation of intelligent ventilation systems. Full article

The optimization of investment portfolios represents a pivotal task within the field of financial economics. Its objective is to identify asset combinations that meet specified criteria for return and risk. Traditionally, the maximization of the Sharpe Ratio, often achieved through quadratic programming, has constituted a popular approach for this purpose. However, real-world scenarios frequently necessitate more complex considerations, particularly in relation to portfolio diversification with a view to mitigating sector-specific risks and enhancing stability. The incorporation of diversification alongside the Sharpe Ratio into the optimization model creates a joint optimization task, which can be formulated as Quadratic Unconstrained Binary Optimization (QUBO) and addressed using quantum annealing or hybrid computing techniques. These techniques offer promising solutions. We present a novel QUBO formulation for this optimization, detailing its mathematical formulation and demonstrating its advantages over classical methods, particularly in handling diversification objectives. By leveraging available QUBO solvers and hybrid approaches, we explore the feasibility of handling large-scale problems while highlighting the importance of diversification in achieving robust portfolio performance. We finally elaborate on the results showing the trade-off between the observed values of the portfolio’s Sharpe Ratio and diversification, as a natural consequence of solving a multi-objective optimization problem. Full article

Positive and unlabeled learning (PU learning) is a significant binary classification task in machine learning; it focuses on training accurate classifiers using positive data and unlabeled data. Most of the works in this area are based on a two-step strategy: the first step is to identify reliable negative examples from unlabeled examples, and the second step is to construct the classifiers based on the positive examples and the identified reliable negative examples using supervised learning methods. However, these methods always underutilize the remaining unlabeled data, which limits the performance of PU learning. Furthermore, many methods require the iterative solution of the formulated quadratic programming problems to obtain the final classifier, resulting in a large computational cost. In this paper, we propose a new method called the absolute value inequality support vector machine, which applies the concept of eccentricity to select reliable negative examples from unlabeled data and then constructs a classifier based on the positive examples, the selected negative examples, and the remaining unlabeled data. In addition, we apply a hyperparameter optimization technique to automatically search and select the optimal parameter values in the proposed algorithm. Numerical experimental results on ten real-world datasets demonstrate that our method is better than the other three benchmark algorithms. Full article

We propose and implement an interpretable machine learning classification model for Explainable AI (XAI) based on expressive Boolean formulas. Potential applications include credit scoring and diagnosis of medical conditions. The Boolean formula defines a rule with tunable complexity (or interpretability) according to which input data are classified. Such a formula can include any operator that can be applied to one or more Boolean variables, thus providing higher expressivity compared to more rigid rule- and tree-based approaches. The classifier is trained using native local optimization techniques, efficiently searching the space of feasible formulas. Shallow rules can be determined by fast Integer Linear Programming (ILP) or Quadratic Unconstrained Binary Optimization (QUBO) solvers, potentially powered by special-purpose hardware or quantum devices. We combine the expressivity and efficiency of the native local optimizer with the fast operation of these devices by executing non-local moves that optimize over the subtrees of the full Boolean formula. We provide extensive numerical benchmarking results featuring several baselines on well-known public datasets. Based on the results, we find that the native local rule classifier is generally competitive with the other classifiers. The addition of non-local moves achieves similar results with fewer iterations. Therefore, using specialized or quantum hardware could lead to a significant speedup through the rapid proposal of non-local moves. Full article

The goal of this paper is to investigate the curves intersected by a vertical plane with the surfaces based on certain NCP functions. The convexity and differentiability of these curves are studied as well. In most cases, the inflection points of the curves cannot be expressed exactly. Therefore, we instead estimate the interval where the curves are convex under this situation. Then, with the help of differentiability and convexity, we obtain the local minimum or maximum of the curves accordingly. The study of these curves is very useful to binary quadratic programming. Full article

The problem concerning the optimal placement and sizing of renewable energy resources and battery energy storage systems in electrical DC distribution networks is addressed in this research by proposing a new mathematical formulation. The exact mixed-integer nonlinear programming (MINLP) model is transformed into a mixed-integer convex model using McCormick envelopes regarding the product between two positive variables. Convex theory allows ensuring that the global optimum is found due to the linear equivalent structure of the solution space and the quadratic structure of the objective function when all the binary variables are defined. Numerical results in the 21-bus system demonstrate the effectiveness and robustness of the proposed solution methodology when compared to the solution reached by solving the exact MINLP model. Numerical results showed that the simultaneous allocation of batteries and renewable energy resources allows for the best improvements in the daily operating costs, i.e., about 53.29% with respect to the benchmark case of the 21-bus grid, followed by the scenario where the renewable energy resources are reallocated while considering a fixed location for the batteries, with an improvement of 43.33%. In addition, the main result is that the difference between the exact modeling and the proposed formulation regarding the final objective function was less than 3.90% for all the simulation cases, which demonstrated the effectiveness of the proposed approach for operating distributed energy resources in monopolar DC networks. Full article

The active jet noise control received significant attention due to the little influence it has on the engine performance. The active jet noise control is a multivariable problem because it needs to achieve the simultaneous closed-loop control of jet noise and engine performance. Model predictive control (MPC) has great application potentials in the field of multivariable control of aero-engines, but the real-time performance of MPC is intractable. This paper proposed an active jet noise controller of a turbofan engine, based on explicit model predictive control (EMPC). An integrated model of turbofan engine and jet noise, which calculates the engine parameters and jet noise in real time, was established. The online computational burden of MPC was transferred to offline computation using multi-parametric quadratic programming (MPQP). To improve the efficiency of the online positioning algorithm, the sequence search method was replaced by a binary search tree. Step simulations were performed to test the effectiveness of the proposed controller. The results show that the proposed EMPC controller not only achieves the simultaneous control of jet noise and the turbofan engine, but also improve the real-time performance greatly. Full article

This paper contributes with a new two-stage optimization methodology to solve the problem of the optimal placement and sizing of solar photovoltaic (PV) generation units in medium-voltage distribution networks. The optimization problem is formulated with a mixed-integer nonlinear programming (MINLP) model, where it combines binary variables regarding the nodes where the PV generators will be located and continuous variables associated with the power flow solution. To solve the MINLP model a decoupled methodology is used where the binary problem is firstly solved with mixed-integer quadratic approximation; and once the nodes where the PV sources will be located are known, the dimensioning problem of the PV generators is secondly solved through an interior point method applied to the classical multi-period power flow formulation. Numerical results in the IEEE 33-bus and IEEE 85-bus systems demonstrate that the proposed approach improves the current literature results reached with combinatorial methods such as the Chu and Beasley genetic algorithm, the vortex search algorithm, the Newton-metaheuristic algorithm as well as the exact solution of the MINLP model with the GAMS software and the BONMIN solver. All the numerical simulations are implemented in the MATLAB programming environment and the convex equivalent models are solved with the CVX tool. Full article

There exists a wide range of constraint programming (CP) problems defined on Boolean functions depending on binary variables. One of the approaches to solving CP problems is using specific appropriate solvers, e.g., SAT solvers. An alternative is using the generic solvers for mixed-integer linear programming problems (MILP), but they require transforming expressions with Boolean functions to linear equations or inequalities. Here, we present two methods of such a transformation which applies to any Boolean function defined by explicit rules giving values of the Boolean function for all combinations of its Boolean variables. The first method represents the Boolean function as a linear equation in the original binary variables and, possibly, binary ancillaries, which become additional variables of the MILP problem being composed. The second method represents the Boolean function as a set of linear inequalities in the original binary variables and one additional continuous variable (representing the value of the function). The choice between the first or second method is a trade-off between the number of binary variables and number of linear constraints in the emerging MP problem. The advantage of the proposed approach is that both methods reduce important cryptanalysis problems, such as the preimaging of hash functions or breaking symmetric ciphers as the MILP problems, which are solved by the generic MILP solvers. Furthermore, the first method enables to reduce the binary linear equations to quadratic unconstrained binary optimization (QUBO), by the quantum annealer, e.g., D-Wave. Full article

Battery energy storage systems (BESSs) are key components in efficiently managing the electric power supply and demand in microgrids. However, the BESSs have issues in their investment costs and operating lifetime, and thus, the optimal sizing of the BESSs is one of the crucial requirements in design and management of the microgrids. This paper presents a problem framework and its solution method that calculates the optimal size of the BESSs in a microgrid, considering their cooperative operations with the other components. The proposed framework is formulated as a bi-level optimization problem; however, based on the Karush–Kuhn–Tucker approach, it is regarded as a type of operation scheduling problem. As a result, the techniques developed for determining the operation schedule become applicable. In this paper, a combined algorithm of binary particle swarm optimization and quadratic programming is selected as the basis of the solution method. The validity of the authors’ proposal is verified through numerical simulations and discussion of their results. Full article

In this study, we deal with the problem of scheduling charging periods of electrical vehicles (EVs) to satisfy the users’ demands for energy consumption as well as to optimally utilize the available power. We assume three-phase EV charging stations, each equipped with two charging ports (links) that can serve up to two EVs in the scheduling period but not simultaneously. Considering such a specification, we propose an on–off scheduling scheme wherein control over an energy flow is achieved by flexibly switching the ports in each station on and off in a manner such as to satisfy the energy demand of each EV, flatten the high energy-consuming load on the whole farm, and to minimize the number of switching operations. To satisfy these needs, the on–off scheduling scheme is formulated in terms of a binary linear programming problem, which is then extended to a quadratic version to incorporate the smoothness constraints. Various algorithmic approaches are used for solving a binary quadratic programming problem, including the Frank–Wolfe algorithm and successive linear approximations. The numerical simulations demonstrate that the latter is scalable, efficient, and flexible in a charging procedure, and it shaves the load peak while maintaining smooth charging profiles. Full article

This paper deals with the problem of the optimal selection and location of batteries in DC distribution grids by proposing a new mixed-integer convex model. The exact mixed-integer nonlinear model is transformed into a mixed-integer quadratic convex model (MIQC) by approximating the product among voltages in the power balance equations as a hyperplane. The most important characteristic of our proposal is that the MIQC formulations ensure the global optimum reaching via branch & bound methods and quadratic programming since each combination of the binary variables generates a node with a convex optimization subproblem. The formulation of the objective function is associated with the minimization of the energy losses for a daily operation scenario considering high renewable energy penetration. Numerical simulations show the effectiveness of the proposed MIQC model to reach the global optimum of the optimization model when compared with the exact optimization model in a 21-node test feeder. All the validations are carried out in the GAMS optimization software. Full article

Magnetic immunoassays employing Frequency Mixing Magnetic Detection (FMMD) have recently become increasingly popular for quantitative detection of various analytes. Simultaneous analysis of a sample for two or more targets is desirable in order to reduce the sample amount, save consumables, and save time. We show that different types of magnetic beads can be distinguished according to their frequency mixing response to a two-frequency magnetic excitation at different static magnetic offset fields. We recorded the offset field dependent FMMD response of two different particle types at frequencies f₁ + n⋅f₂, n = 1, 2, 3, 4 with f₁ = 30.8 kHz and f₂ = 63 Hz. Their signals were clearly distinguishable by the locations of the extremes and zeros of their responses. Binary mixtures of the two particle types were prepared with different mixing ratios. The mixture samples were analyzed by determining the best linear combination of the two pure constituents that best resembled the measured signals of the mixtures. Using a quadratic programming algorithm, the mixing ratios could be determined with an accuracy of greater than 14%. If each particle type is functionalized with a different antibody, multiplex detection of two different analytes becomes feasible. Full article