Abstract. The hypervolume measure is one of the most frequently applied measures for comparing the results of evolutionary multiobjective optimization algorithms (EMOA). The idea to use this measure for selection is self-evident. A steady-state EMOA will be devised, that combines concepts of non-dominated sorting with a selection operator based on the hypervolume measure. The algorithm computes a well distributed set of solutions with bounded size thereby focussing on interesting regions of the Pareto front(s). By means of standard benchmark problems the algorithm will be compared to other well established EMOA. The results show that our new algorithm achieves good convergence to the Pareto front and outperforms standard methods in the hypervolume covered. We also studied the applicability of the new approach in the important field of design optimization. In order to reduce the number of time consuming precise function evaluations, the algorithm will be supported by approximate functi...