Search results for " optimization."
showing 10 items of 2333 documents
On Fuzzy Stochastic Integral Equations—A Martingale Problem Approach
2011
In the paper we consider fuzzy stochastic integral equations using the methods of stochastic inclusions. The idea is to consider an associated martingale problem and its solutions in order to obtain a solution to the fuzzy stochastic equation.
Determination of Pareto frontier in multi-objective maintenance optimization
2011
Abstract The objective of a maintenance policy generally is the global maintenance cost minimization that involves not only the direct costs for both the maintenance actions and the spare parts, but also those ones due to the system stop for preventive maintenance and the downtime for failure. For some operating systems, the failure event can be dangerous so that they are asked to operate assuring a very high reliability level between two consecutive fixed stops. The present paper attempts to individuate the set of elements on which performing maintenance actions so that the system can assure the required reliability level until the next fixed stop for maintenance, minimizing both the globa…
Minimum power losses by using droop coefficients regulation method with voltage and frequency constraints in islanded microgrids
2018
In this paper, a droop coefficients regulation methodology is proposed for an islanded microgrid to optimize the power losses. Based on the P-f and Q-V relations to adjust the droop coefficients at every loading condition, the optimized operating set point generates minimum power losses operation while satisfying the constraints of voltage and frequency limitation. A 9-bus case study is here implemented to show the effectiveness of this new approach as well as the improved operation quality of the system.
Optimal power flow for technically feasible energy management systems in islanded microgrids
2016
This paper presents a combined optimal energy and power flow management for islanded microgrids. The highest control level in this case will provide a feasible and optimized operating point around the economic optimum. In order to account for both unbalanced and balanced loads, the optimal power flow is carried out using a Glow-worm Swarm Optimizer. The control level is organized into two different sub-levels, the highest of which accounts for minimum cost operation and the lowest one solving the optimal power flow and devising the set points of inverter interfaced generation units and rotating machines with a minimum power loss. A test has been carried out for 6 bus islanded microgrids to …
Amorphous Ropinirole-Loaded Mucoadhesive Buccal Film: A Potential Patient-Friendly Tool to Improve Drug Pharmacokinetic Profile and Effectiveness
2020
Nowadays the therapeutic strategies to manage Parkinson&rsquo
Impulsively-controlled systems and reverse dwell time: A linear programming approach
2015
We present a receding horizon algorithm that converges to the exact solution in polynomial time for a class of optimal impulse control problems with uniformly distributed impulse instants and governed by so-called reverse dwell time conditions. The cost has two separate terms, one depending on time and the second monotonically decreasing on the state norm. The obtained results have both theoretical and practical relevance. From a theoretical perspective we prove certain geometrical properties of the discrete set of feasible solutions. From a practical standpoint, such properties reduce the computational burden and speed up the search for the optimum thus making the algorithm suitable for th…
Quantized Dissensus in Networks of Agents subject to Death and Duplication
2012
Dissensus is a modeling framework for networks of dynamic agents in competition for scarce resources. Originally inspired by biological cells behaviors, it fits also marketing, finance and many other application areas. Competition is often unstable in the sense that strong agents, those having access to large resources, gain more and more resources at the expense of weak agents. Thus, strong agents duplicate when reaching a critical amount of resources, whereas weak agents die when loosing all their resources. To capture all these phenomena we introduce systems with a discrete time gossip and unstable state dynamics interrupted by discrete events affecting the network topology. Invariancy o…
A Branch-and-Cut method for the Capacitated Location-Routing Problem
2011
International audience; Recent researches in the design of logistic networks have shown that the overall distribution cost may be excessive if routing decisions are ignored when locating depots. The Location-Routing Problem (LRP) overcomes this drawback by simultaneously tackling location and routing decisions. The aim of this paper is to propose an exact approach based on a Branch-and-Cut algorithm for solving the LRP with capacity constraints on depots and vehicles. The proposed method is based on a zero-one linear model strengthened by new families of valid inequalities. The computational evaluation on three sets of instances (34 instances in total), with 5–10 potential depots and 20–88 …
Mode-superposition correction method for deterministic and stochastic analysis of structural systems
2001
The role played by the modal analysis in the framework of structural dynamics is fundamental from both deterministic and stochastic point of view. However the accuracy obtained by means of the classical modal analysis is not always satisfactory. Therefore it is clear the importance of methods able to correct the modal response in such a way to obtain the required accuracy. Many methods have been proposed in the last years but they are meaningful only when the forcing function is expressed by an analytical function. Moreover in stochastic analysis they fail for white noise excitation. In the paper a method able to give a very accurate response for both deterministic and stochastic input is p…
Longest Common Subsequence from Fragments via Sparse Dynamic Programming
1998
Sparse Dynamic Programming has emerged as an essential tool for the design of efficient algorithms for optimization problems coming from such diverse areas as Computer Science, Computational Biology and Speech Recognition [7,11,15]. We provide a new Sparse Dynamic Programming technique that extends the Hunt-Szymanski [2,9,8] paradigm for the computation of the Longest Common Subsequence (LCS) and apply it to solve the LCS from Fragments problem: given a pair of strings X and Y (of length n and m, resp.) and a set M of matching substrings of X and Y, find the longest common subsequence based only on the symbol correspondences induced by the substrings. This problem arises in an application t…