Effect of Drop and Rebuilt Operator for Solving the Biobjective Obnoxious p-algorithm for dealing with a special case related to p-Median Problem

Abstract

In this paper, we solve the bi-objective obnoxious with a population-based method. The designed algorithm first determines a starting archive set by applying an iterative search on the equivalent problem, where an aggregate function is considered. Second, an adaptation of the dominating local search, combined with exchange operators, is considered for generating a series of new non-dominated solutions that enrich the reference archive set. Third, a drop and rebuild strategy is incorporated to the algorithm for iteratively highlighting the final Pareto front. An experimental part is given, where the performance of the method is evaluated on a set of benchmark instances of the literature. Its provided results are compared to those achieved by the more recent methods available in the literature. Encouraging results are reached.