Search results for "Tribute"
showing 10 items of 1455 documents
A new formulation of the optimal compensation and reconfiguration problem including minimum load nodes unavailability for automated distribution netw…
2004
This paper deals with a new formulation of the optimal operation of electrical distribution networks problem in regular working state. In the new deregulated energy market providing reliable and economical service to customers is a primary task. The multiobjective formulation of the reconfiguration and compensation problem used in this paper considers as a primary object also the minimisation of the load nodes unavailability (UA) expressed in probabilistic terms. Therefore, the objectives to be attained through the optimisation strategy are: minimal power losses operation, minimum UA of the load nodes, load balancing among the HV/MV transformers, and voltage profile regularisation. The appl…
Optimal Sizing and Siting of Distributed Energy Resources Considering Public and Private Incentive Policies
2008
The present work presents the formulation and solution approach for the problem of optimal sizing and siting of distributed energy resources based on Photovoltaic, PV, technology. The considered system is an isolated grid (small island) and the parts involved are the utility and the customers. As it happens in islands, the same utility generates and delivers energy to customers, for this reason, the installation of dispersed generation units is beneficial for reducing power losses, regularizing the voltage profile, but also for increasing the profit. The problem is solved by means of the Non dominated sorting Genetic Algorithm II, NSGA-II, identifying the optimal size and location of PV sys…
Modelling energy storage systems using Fourier analysis: An application for smart grids optimal management
2014
In this paper, a new and efficient model for variables representation, named F-coding, in optimal power dispatch problems for smart electrical distribution grids is proposed. In particular, an application devoted to optimal energy dispatch of Distributed Energy Resources including ideal storage devices is here considered. Electrical energy storage systems, such as any other component that must meet an integral capacity constraint in optimal dispatch problems, have to show the same energy level at the beginning and at the end of the considered timeframe for operation. The use of zero-integral functions, such as sinusoidal functions, for the synthesis of the charge and discharge course of bat…
Scheduling shared continuous resources on many-cores
2014
We consider the problem of scheduling a number of jobs on m identical processors sharing a continuously divisible resource. Each job j comes with a resource requirement rj∈[0,1]. The job can be processed at full speed if granted its full resource requirement. If receiving only an x-portion of r_j, it is processed at an x-fraction of the full speed. Our goal is to find a resource assignment that minimizes the makespan (i.e., the latest completion time). Variants of such problems, relating the resource assignment of jobs to their processing speeds, have been studied under the term discrete-continuous scheduling. Known results are either very pessimistic or heuristic in nature. In this paper, …
The distributed assembly permutation flowshop scheduling problem
2013
Nowadays, improving the management of complex supply chains is a key to become competitive in the twenty-first century global market. Supply chains are composed of multi-plant facilities that must be coordinated and synchronised to cut waste and lead times. This paper proposes a Distributed Assembly Permutation Flowshop Scheduling Problem (DAPFSP) with two stages to model and study complex supply chains. This problem is a generalisation of the Distributed Permutation Flowshop Scheduling Problem (DPFSP). The first stage of the DAPFSP is composed of f identical production factories. Each one is a flowshop that produces jobs to be assembled into final products in a second assembly stage. The o…
MECHANISM DESIGN FOR OPTIMAL CONSENSUS PROBLEMS
2006
We consider stationary consensus protocols for networks of dynamic agents with fixed and switching topologies. At each time instant, each agent knows only its and its neighbors’ state, but must reach consensus on a group decision value that is function of all the agents’ initial state.We show that our protocol design is the solution of individual optimizations performed by the agents. This notion suggests a game theoretic interpretation of consensus problems as mechanism design problems. Under this perspective a supervisor entails the agents to reach a consensus by imposing individual objectives. We prove that such objectives can be chosen so that rational agents have a unique optimal proto…
Distributed Resource Allocation in Underlay Multicast D2D Communications
2021
Multicast device-to-device communications operating underlay with cellular networks is a spectral efficient technique for disseminating data to nearby receivers. However, due to the critical challenge of having an intelligent interference coordination between multicast groups along with the cellular network, it is necessary to judiciously perform resource allocation for the combined network. In this work, we present a framework for a joint channel and power allocation strategy to maximize the sum rate of the combined network while guaranteeing minimum rate to individual groups and cellular users. The objective function is augmented by an austerity function that penalizes excessive assignmen…
Wireless sensor network coverage problem using modified fireworks algorithm
2016
Wireless sensor networks are emerging technology with increasing number of applications, and consequently an active research area. One of the problems pertinent to wireless sensor networks is the coverage problem with number of definitions, depending on the assumed conditions. In this paper we consider hard optimization area coverage problem with the goal of finding optimal sensor nodes positions that maximize probabilistic coverage of the area of interest. For such type of optimization problem swarm intelligence stochastic metaheuristics have been successfully used. In this paper we propose a modified enhanced fireworks algorithm for wireless sensor network coverage problem and compare it …
Adaptive and Dynamic Ant Colony Search Algorithm for Optimal Distribution Systems Reinforcement Strategy
2006
The metaheuristic technique of Ant Colony Search has been revised here in order to deal with dynamic search optimization problems having a large search space and mixed integer variables. The problem to which it has been applied is an electrical distribution systems management problem. This kind of issues is indeed getting increasingly complicated due to the introduction of new energy trading strategies, new environmental constraints and new technologies. In particular, in this paper, the problem of finding the optimal reinforcement strategy to provide reliable and economic service to customers in a given time frame is investigated. Utilities indeed need efficient software tools to take deci…
Relaxed Stability and Performance LMI Conditions for Takagi-Sugeno Fuzzy Systems With Polynomial Constraints on Membership Function Shapes
2008
Most linear matrix inequality (LMI) fuzzy control results in literature are valid for any membership function, i.e., independent of the actual membership shape. Hence, they are conservative (with respect to other nonlinear control approaches) when specific knowledge of the shapes is available. This paper presents relaxed LMI conditions for fuzzy control that incorporate such shape information in the form of polynomial constraints, generalizing previous works by the authors. Interesting particular cases are overlap (product) bounds and ellipsoidal regions. Numerical examples illustrate the achieved improvements, as well as the possibilities of solving some multiobjective problems. The result…