The parallel single front genetic algorithm (PSFGA) in dynamic multi-objective optimization

Authors:
Mario Cámara;Julio Ortega;Francisco De Toro
Affiliations:
Dep. of Computer Architecture and Technology, E.T.S.I.I.T., University of Granada, Spain;Dep. of Computer Architecture and Technology, E.T.S.I.I.T., University of Granada, Spain;Dep. of Signals, Telematics, and Communications, E.T.S.I.I.T., University of Granada, Spain
Venue:
IWANN'07 Proceedings of the 9th international work conference on Artificial neural networks
Year:
2007

Citing 6
Cited 2

Evolutionary Algorithms for Solving Multi-Objective Problems

Evolutionary Algorithms for Solving Multi-Objective Problems
Performance Measures for Dynamic Environments

PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
PSFGA: parallel processing and evolutionary computation for multiobjective optimisation

Parallel Computing - Special issue: Parallel and nature-inspired computational paradigms and applications
Considerations in engineering parallel multiobjective evolutionary algorithms

IEEE Transactions on Evolutionary Computation
Dynamic multiobjective optimization problems: test cases, approximations, and applications

IEEE Transactions on Evolutionary Computation
Evolutionary optimization in uncertain environments-a survey

IEEE Transactions on Evolutionary Computation

Benchmarks for dynamic multi-objective optimisation algorithms

ACM Computing Surveys (CSUR)
Solution attractor of local search in travelling salesman problem: concept, construction and application

International Journal of Metaheuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.