This paper analyzes the use of the, previously proposed, Parallel Single Front Genetic Algorithm (PSFGA) in applications in which the objective functions, the restrictions, and hence also solutions can change over the time. These dynamic optimization problems appear in quite different real applications with relevant socio-economic impacts. PSFGA uses a master process that distributes the population among the processors in the system (that evolve their corresponding solutions according to an island model), and collects and adjusts the set of local Pareto fronts found by each processor (this way, the master also allows an implicit communication among islands). The procedure exclusively uses non-dominated individuals for the selection and variation, and maintains the diversity of the approximation to the Pareto front by using a strategy based on a crowding distance.
['Mario Cámara', 'Julio Ortega', 'Francisco de Toro']
The parallel single front genetic algorithm (PSFGA) in dynamic multi-objective optimization