Online simplification of water distribution network models for optimal scheduling
نویسندگان
چکیده
منابع مشابه
Optimal Pump Scheduling For Water Distribution Systems
Three different mathematical formulations for the scheduling of pumps to minimize energy consumption while still satisfying operational constraints are presented. Each formulation requires the solution of a highly nonlinear optimization problem that requires the iterative solution of an external numerical model for evaluating and satisfying the operational constraints. Two different algorithms ...
متن کاملA Hybrid Algorithm for Optimal Location and Sizing of Capacitors in the presence of Different Load Models in Distribution Network
In practical situations, distribution network loads are the mixtures of residential, industrial, and commercial types. This paper presents a hybrid optimization algorithm for the optimal placement of shunt capacitor banks in radial distribution networks in the presence of different voltage-dependent load models. The algorithm is based on the combination of Genetic Algorithm (GA) and Binary Part...
متن کاملOptimal Online Preemptive Scheduling
In this lecture we’ll study online preemptive scheduling on m machines of arbitrary speeds. We’ll first review the problem and it’s associated literature, then give an optimal deterministic algorithm known as ”RatioStretch”. RatioStretch uses the optimal competitive ratio R > 1 as an input, and achieves R whenever such an R is obtainable. The exact optimal R maybe computed via a linear program,...
متن کاملOptimal Sensor Placement for Water Distribution Network Security
Placement of sensors in water distribution networks helps timely detection of contamination and reduces risk to the population. Identifying the optimal locations of these sensors is important from economic perspective and has been previously attempted using the theory of optimization. This work extends that formulation by considering uncertainty in the network and describes a stochastic program...
متن کاملOptimal Online Algorithms for Minimax Resource Scheduling
We consider a very general online scheduling problem with an objective to minimize the maximum level of resource allocated. We find a simple characterization of an optimal deterministic online algorithm. We develop further results for two more specific problems, single resource scheduling and hierarchical line balancing. We determine how to compute optimal online algorithms for both problems us...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Hydroinformatics
سال: 2013
ISSN: 1464-7141,1465-1734
DOI: 10.2166/hydro.2013.029