Looking at articles or conference papers published since the turn of the century, Pareto optimization is the dominating assessment method for multi-objective nonlinear optimization problems. However, is it always the method of choice for real-world applications, where either more than four objectives have to be considered, or the same type of task is repeated again and again with only minor modifications, in an automated optimization or planning process? This paper presents a classification of application scenarios and compares the Pareto approach with an extended version of the weighted sum, called cascaded weighted sum, for the different scenarios. Its range of application within the field of multi-objective optimization is discussed as well as its strengths and weaknesses.
10 July 2013 in IEEE Transactions on Instrumentation and Measurement
Today, power systems are subject to fundamental changes concerning functionality and dynamics due to new energy sources and increasing demand. However, detailed information of the system and the system state is the property of the suppliers or distributors, and is not comprehensively available to researchers at present. We propose to capture easily accessible, high-rate, low-voltage (LV) time series at different locations, and to store the whole data for subsequent usage in a large database. A system state simulation shall use these data and provide for load information without knowing the currents. For this purpose, we develop the electrical data recorder (EDR) and perform measurements in our first starting test site, the island network like Karlsruhe Institute of Technology campus. We first present comparison results between captured voltage characteristics and campus smart meter measurements that we use as an indication of the load status. We develop the Electrical Grid Analysis Simulation Modeling and Visualization Tool (eASiMoV) and show feasibility in a simple simulation. We measure the storage transfer to the large-scale database facility and give evaluation results. The EDR device, the eASiMoV software, and data handling methods are exhibited as valuable components of a promising new approach.
This paper is motivated by, but not limited to, the task of scheduling jobs organized in workflows to a computational grid. Due to the dynamic nature of grid computing, more or less permanent replanning is required so that only very limited time is available to come up with a revised plan. To meet the requirements of both users and resource owners, a multi-objective optimization comprising execution time and costs is needed. This paper summarizes our work over the last six years in this field, and reports new results obtained by the combination of heuristics and evolutionary search in an adaptive Memetic Algorithm. We will show how different heuristics contribute to solving varying replanning scenarios and investigate the question of the maximum manageable work load for a grid of growing size starting with a load of 200 jobs and 20 resources up to 7000 jobs and 700 resources. Furthermore, the effect of four different local searchers incorporated into the evolutionary search is studied. We will also report briefly on approaches that failed within the short time frame given for planning.