A new multi-objective evolutionary algorithm: Neighbourhood exploring evolution strategy

Engineering Optimization

Volumn 37, Issue 4, 2005, Pages 351-379

  Hu, Xiaolin ^a   Coello, Carlos A Coello ^b   Huang, Zhangcan ^a  

^a WUHAN UNIVERSITY OF TECHNOLOGY   (China)

^b DEPARTAMENTO DE FÍSICA   (Mexico)

Author keywords

Evolution strategy; Evolutionary algorithm; Line up competition algorithm; Multi objective optimization; Neighbourhood exploring evolution strategy

Indexed keywords

COMPUTER SIMULATION; GRAPH THEORY; MATHEMATICAL OPERATORS; OPTIMIZATION; PROBABILITY; SET THEORY;

EVOLUTIONARY STRATEGY; LINE-UP COMPETITION ALGORITHM; MULTI-OBJECTIVE OPTIMIZATION; NEIGHBORHOOD EXPLORING EVOLUTION STRATEGY;

EVOLUTIONARY ALGORITHMS;

EID: 20444477971     PISSN: 0305215X     EISSN: None     Source Type: Journal    
DOI: 10.1080/03052150500035658     Document Type: Article

References (22)

1. Coello, C.A.C. and Cortés, N.C., An approach to solve multiobjective optimization problems based on an artificial immune system. In First International Conference on Artificial Immune Systems (ICARIS 2002), edited by J. Timmis and P.J. Bentley, pp. 212-221, 2002, (University of Kent at Canterbury: England).
2. Coello, C.A.C. and Landa Becerra, R., Evolutionary multiobjective optimization using a cultural algorithm, in Proceedings of the 2003 IEEE Swarm Intelligence Symposium, IEEE Service Center, Indianapolis, Indiana, USA, 2003, pp. 6-13.
3. Coello, C.A.C., Lamont, G.B. and Van Veldhuizen, D.A., Evolutionary Algorithms for Solving Multi-Objective Problems, 2002 (Kluwer Academic Publishers: Boston).
4. Deb, K., Multi-Objective Optimization Using Evolutionary Algorithms, 2001 (John Wiley & Sons: Chichester).
5. Deb, K. and Agrawal. R.B., Simulated binary crossover for continuous search space. Complex Syst., 1995, 9(2), 115-148.
6. Deb, K. and Goel, T., Controlled elitist non-dominated sorting genetic algorithms for better convergence. In Proceedings of the First International Conference on Evolutionary Multi-Criterion Optimization (EMO 2001), Zurich, Switzerland, edited by E. Zitzler et al., pp. 67-81, 2001 (Springer-Verlag: Berlin).
7. Deb, K., Pratap, A., Agarwal, S. and Meyarivan, T., A fast and elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput., 2002, 6(2), 182-197.
8. Deb, K., Thiele, L., Laumanns, M., et al., Scalable multi-objective optimization test problems, in Proceedings of Congress on Evolutionary Computation (CEC2002), Hawaii, USA. IEEE Service Center, 2002, 825-830.
9. Doerner, K., Gutjahr, W.J., Hartl, R.F., et al., Ant colony optimization in multiobjective portfolio selection, in Proceedings of the 4th Metaheuristics International Conference, Porto, Portugal, 2001, 243-248.
10. Goldberg, D.E. and Richardson, J., Genetic algorithms with sharing for multi-modal function optimization. In Proceedings of the First International Conference on Genetic Algorithms and Their Applications, edited by J. Grefenstette, pp. 41-49, 1987.
11. Hu, X. and Eberhart. R., Multiobjective optimization using dynamic neighbourhood particle swarm optimization, in Proceedings of the 2002 Congress on Evolutionary Computation, Hawaii, USA, 2002, 1677-1681.
12. Jensen, M.T., Reducing the run-time complexity of multiobjective EAs: the NSGA-II and other algorithms. IEEE Trans. Evol. Comput., 2003, 7(5), 503-515.
13. Knowles, J.D. and Corne, D.W., Approximating the non-dominated front using the Pareto archived evolution strategy. Evol. Comput., 2000, 8(2), 149-172.
14. Miettinen, K., Nonlinear Multiobjective Optimization, 1998 (Kluwer Academic Publishers: Boston, Massachusetts).
15. Nam, D. and Park, C.H., Multiobjective simulated annealing: a comparative study to evolutionary algorithms. Int. J. Fuzzy Syst., 2000, 2(2), 87-97.
16. Schaffer, J.D., Some experiments in machine learning using vector evaluated genetic algorithms. PhD thesis, Vanderbilt University, Nashville, USA 1984.
17. Yan, L., New algorithm of global optimization for process system - line-up competition algorithm. PhD thesis, Beijing University of Chemical Technology, Beijing, 1998 (in Chinese).
18. Yan, L., Solving traveling salesman problem with line-up competition algorithm. Operat. Res. Manage. Sci., 1999, 8(3), 24-30 (in Chinese).
19. Yan, L., Solving combinatorial optimization problems with line-up competition algorithm. Comput. Chem. Eng., 2003, 27(2), 251-258.
20. Yan, L. and Ma, D., Global optimization of non-convex nonlinear programs using line-up competition algorithm. Comput. Chem. Eng., 2001, 25(11-12), 1601-1610.
21. Zitzler, E. and Thiele, L., Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. IEEE Trans. Evol. Comput., 1999, 3(4), 257-271.
22. Zitzler, E., Deb, K. and Thiele, L., Comparison of multi-objective evolutionary algorithms: empirical results. Evol. Comput., 2000, 8(2), 125-148.