
Distribution expansion planning (DEP) is the task of expanding a distribution network (DN) cost-effectively to meet the growing demand reliably and robustly. An efficient method is necessary to deal with uncertain factors such as renewable energy sources (RESs) generation, electricity prices, power demand, electric vehicle availability, etc. The robust DEP (RDEP) problem, structured as a min–max-min model, has emerged as a promising tool to cope with uncertainties. The first min problem finds the least-cost expansion strategy, while the max problem identifies the uncertainty realization under which the operation costs are maximized. The second min determines the least-cost scheduling solution, knowing the decision from the first and second levels. Although the RDEP approach has been widely used in the literature, the joint probability mass function (JPMF) among uncertain parameters has been overlooked. This paper constructs a novel framework for the RDEP problem in which the effect of the JPMF on the optimal expansion results is explored. Under the proposed strategy, the planner can add additional constraints to improve the solution quality. The tri-level RDEP model is solved using conic duality theory and decomposition techniques. Experimental results justify the efficiency of the proposed model.
This paper proposes a novel adaptive model reduction method for multi-input multi-output (MIMO) linear time-invariant (LTI) systems. The method integrates the Takenaka-Malmquist (TM) systems with the Multiple Signal Classification (MUSIC) algorithm. First, a novel frequency-domain sampling scheme preserving conjugate symmetry is introduced, which enables seamless integration of TM basis functions with the MUSIC algorithm. Second, the MUSIC algorithm is reinterpreted from direction-of-arrival (DOA) estimation to dominant pole selection. In this framework, source directions correspond to pole positions, and the number of sources corresponds to the reduced order. This enables adaptive, non-iterative pole selection, automatic order determination via eigenvalue energy ratio, and real-valued computation via persymmetrization. Moreover, when the dominant poles appear in complex conjugate pairs, the corresponding coefficient matrix exhibits conjugate symmetry, ensuring that the resulting reduced-order model has real coefficients. Theoretical guarantees of stability, steady-state preservation, and H_2 space membership are provided without state-space conversion. Numerical examples demonstrate high accuracy, efficiency, and robustness.
We extend an existing mixed-integer linear programming model that determines a cost-minimal set of conventional and renewable technologies and their corresponding dispatch at hourly fidelity to include: (i) multiple years of electrical demand, (ii) multiple investment opportunities, and (iii) technology degradation. Solving the monolithic formulation proves to be computationally inefficient. We utilize a Lagrangian decomposition methodology in which yearly subproblems are solved individually (and in parallel). An upper bound derived via optimization-based heuristics assesses solution quality against a linear-programming-based lower bound. Across twelve case studies involving decades-long planning horizons and projected electrical loads in distributed-generation (college campus) settings, the decomposed model achieves objective values within 0.5
We present a solution method for convex multi-parametric quadratically constrained quadratic programs (mpQCQPs) with a single quadratic constraint. Past contributions have either approached these problems by treating the problem as a multi-parametric nonlinear program (mpNLP) and approximating the solution, or solving the mpQCQP exactly using symbolic computations. In this article, we develop a hybrid method that builds on these contributions and attempts to preserve nonlinearity in the solution where possible, while simultaneously avoiding the need for symbolic computations. We achieve this by computing the exact multi-parametric solution in all critical regions whose active set does not include the quadratic constraint. When the active set contains the quadratic constraint, we linearize the quadratic constraint and use the linearization to approximate the multi-parametric solution. By iteratively refining the linearization, our approach is able to approximate the solution up to a user-defined tolerance. Results indicate that our method is able to obtain high-quality solutions to instances whose exact solution is currently intractable.
Distributed router networks play a fundamental role in modern communication infrastructures, where decentralized decision-making and security requirements are increasingly relevant. In this paper, we propose a novel equilibrium model for distributed router networks that incorporates both trust-reputation mechanisms and security levels as decision variables. Routers aim to maximize a utility function based on the trust received by others and their own security level, balanced against associated costs. An explicit link constraining the trust values and the security levels guarantees that routers characterized by higher security levels cannot be penalized. The model is formulated using the methodology of variational inequalities, allowing for a rigorous mathematical representation of equilibrium conditions under a set of feasible constraints. The analytical framework employs Lagrange multipliers and the Karush-Kuhn-Tucker conditions, providing insights into the role of active constraints. A net benefit function is introduced and used to evaluate the overall performance of each router in the network. Numerical examples, with reported equilibrium trust and security solutions, Lagrange multipliers, utility functions and net benefits illustrate how the model performs in various configurations.