Multi-objective genetic local search algorithm
- 23 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 119-124
- https://doi.org/10.1109/icec.1996.542345
Abstract
Proposes a hybrid algorithm for finding a set of non-dominated solutions of a multi-objective optimization problem. In the proposed algorithm, a local search procedure is applied to each solution (i.e. to each individual) generated by genetic operations. The aim of the proposed algorithm is not to determine a single final solution but to try to find all the non-dominated solutions of a multi-objective optimization problem. The choice of the final solution is left to the decision maker's preference. The high searching ability of the proposed algorithm is demonstrated by computer simulations on flowshop scheduling problems.Keywords
This publication has 6 references indexed in Scilit:
- A variant of evolution strategies for vector optimizationPublished by Springer Nature ,2006
- Performance evaluation of genetic algorithms for flowshop scheduling problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- MOGA: multi-objective genetic algorithmsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An Overview of Evolutionary Algorithms in Multiobjective OptimizationEvolutionary Computation, 1995
- Genetic algorithms and neighborhood search algorithms for fuzzy flowshop scheduling problemsFuzzy Sets and Systems, 1994
- Genetic local search algorithms for the traveling salesman problemPublished by Springer Nature ,1991