Search results for " generation."
showing 10 items of 1108 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…
A new branch-and-price algorithm for the traveling tournament problem
2010
Abstract The traveling tournament problem ( ttp ) consists of finding a distance-minimal double round-robin tournament where the number of consecutive breaks is bounded. For solving the problem exactly, we propose a new branch-and-price approach. The starting point is a new compact formulation for the ttp . The corresponding extensive formulation resulting from a Dantzig-Wolfe decomposition is identical to one given by Easton, K., Nemhauser, G., Trick, M., 2003. Solving the traveling tournament problem: a combined interger programming and constraint programming approach. In: Burke, E., De Causmaecker, P. (Eds.), Practice and Theory of Automated Timetabling IV, Volume 2740 of Lecture Notes i…
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…
A new method for creating sparse design velocity fields
2006
We present a novel method for the computation of mesh node sensitivities with respect to the boundary node movement. The sensitivity field is sparse in a sense that movement of each boundary node affects only given amount of inner mesh nodes, which can result in considerable savings in the storage space. The method needs minimal control from the user, and it does not place any restrictions (such as block structure) on the mesh. Use of the method is demonstrated with a shape optimization problem using CAD-free parametrization. A solution to the classical die-swell free boundary problem by coupling the boundary node locations with the state variables is also presented. In that case, sparsity …
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…
Simulated one-pass list-mode: an approach to on-the-fly system matrix calculation.
2013
In the development of prototype systems for positron emission tomography a valid and robust image reconstruction algorithm is required. However, prototypes often employ novel detector and system geometries which may change rapidly under optimization. In addition, developing systems generally produce highly granular, or possibly continuous detection domains which require some level of on-the-fly calculation for retention of measurement precision. In this investigation a new method of on-the-fly system matrix calculation is proposed that provides advantages in application to such list-mode systems in terms of flexibility in system modeling. The new method is easily adaptable to complicated sy…
A comparison of column-generation approaches to the Synchronized Pickup and Delivery Problem
2015
Abstract In the Synchronized Pickup and Delivery Problem (SPDP), user-specified transportation requests from origin to destination points have to be serviced by a fleet of homogeneous vehicles. The task is to find a set of minimum-cost routes satisfying pairing and precedence, capacities, and time windows. Additionally, temporal synchronization constraints couple the service times at the pickup and delivery locations of the customer requests in the following way: a request has to be delivered within prespecified minimum and maximum time lags (called ride times) after it has been picked up. The presence of these ride-time constraints severely complicates the subproblem of the natural column-…
Assessing energy forecasting inaccuracy by simultaneously considering temporal and absolute errors
2017
Abstract Recent years have seen a growing trend in wind and solar energy generation globally and it is expected that an important percentage of total energy production comes from these energy sources. However, they present inherent variability that implies fluctuations in energy generation that are difficult to forecast. Thus, forecasting errors have a considerable role in the impacts and costs of renewable energy integration, management, and commercialization. This study presents an important advance in the task of analyzing prediction models, in particular, in the timing component of prediction error, which improves previous pioneering results. A new method to match time series is defined…
Seed Activation Scheduling for Influence Maximization in Social Networks
2018
This paper addresses the challenge of strategically maximizing the influence spread in a social network, by exploiting cascade propagators termed “seeds”. It introduces the Seed Activation Scheduling Problem (SASP) that chooses the timing of seed activation under a given budget, over a given time horizon, in the presence/absence of competition. The SASP is framed as a blogger-centric marketing problem on a two-level network, where the decisions are made to buy sponsored posts from prominent bloggers at calculated points in time. A Bayesian evidence diffusion model – the Partial Parallel Cascade (PPC) model – allows the network nodes to be partially activated, proportional to their accumulat…