This paper proposes a local search optimizer that, employed as an additional operator in multiobjective evolutionary techniques, can help to find more precise estimates of the Pareto-optimal surface with a smaller cost of function evaluation. The new operator employs quadratic approximations of the objective functions and constraints, which are built using only the function samples already produced by the usual evolutionary algorithm function evaluations. The local search phase consists of solving the auxiliary multiobjective quadratic optimization problem defined from the quadratic approximations, scalarized via a goal attainment formulation using an LMI solver. As the determination of the new approximated solutions is performed without the need of any additional function evaluation, the proposed methodology is suitable for costly black-box optimization problems.
Hybrid micro-grid systems (HMGS) are gaining increasing attention worldwide. The balance between electricity load and generation based on fluctuating renewable energy sources is a main challenge in the operation and design of HMGS. Battery energy storage systems are considered essential components for integrating high shares of renewable energy into a HMGS. Currently, there are very few studies in the field of mathematical optimisation and multi-criteria decision analysis that focus on the evaluation of different battery technologies and their impact on the HMGS design. The model proposed in this paper aims at optimising three different criteria: minimising electricity costs, reducing the loss of load probability, and maximising the use of locally available renewable energy. The model is applied in a case study in southern Germany. The optimisation is carried out using the C-DEEPSO algorithm. Its results are used as input for an AHP-TOPSIS model to identify the most suitable alternative out of five different battery technologies using expert weights. Lithium batteries are considered the best solution with regard to the given group preferences and the optimisation results.
This work presents a statistically principled method for estimating the required number of instances in the experimental comparison of multiple algorithms on a given problem class of interest. This approach generalises earlier results by allowing researchers to design experiments based on the desired best, worst, mean or median-case statistical power to detect differences between algorithms larger than a certain threshold. Holm’s step-down procedure is used to maintain the overall significance level controlled at desired levels, without resulting in overly conservative experiments. This paper also presents an approach for sampling each algorithm on each instance, based on optimal sample size ratios that minimise the total required number of runs subject to a desired accuracy in the estimation of paired differences. A case study investigating the effect of 21 variants of a custom-tailored Simulated Annealing for a class of scheduling problems is used to illustrate the application of the proposed methods for sample size calculations in the experimental comparison of algorithms.