Helper-objectives: Using multi-objective evolutionary algorithms for single-objective optimisation

Journal of Mathematical Modelling and Algorithms

Volumn 3, Issue 4, 2004, Pages 323-347

  Jensen, Mikkel T ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

Genetic algorithms; Helper objectives; Multi objective optimisation; Multi objectivisation; Optimisation

Indexed keywords

EID: 20944439075     PISSN: 15701166     EISSN: 15729214     Source Type: Journal    
DOI: 10.1023/B:JMMA.0000049378.57591.c6     Document Type: Article

References (25)

1. Abbass, H. A., Sarker, R., and Newton, C.: PDE: A Pareto-frontier differential evolution approach for multi-objective optimization problems, in Proceedings of CEC 2001, Vol. 2, 2001, pp. 971-976.
2. Bentley, J. L.: Fast algorithms for geometric traveling salesman problems, ORSA J. Comput. 4(4) (1992), 387-411.
3. Bentley, J. L., Kung, H. T., Schkolnick, M., and Thompson, C. D.: On the average number of maxima in a set of vectors and applications, J. ACM 25 (1978), 536-543.
4. Bleuler, S., Brack, M., Thiele, L., and Zitzler, C.: Multiobjective genetic programming: Reducing bloat using SPEA2, in Proceedings of CEC'2001, 2001, pp. 536-543.
5. Coello, C. A. C. and Aguirre, A. H.: Design of combinatorial logic circuits through an evolutionary multiobjective optimization approach, Artificial Intelligence for Engineering, Design, Analysis and Manufacture 16 (2002), 39-53.
6. Corne, D., Jerram, N., Knowles, J., and Oates, M.: PESA-II: Region-based selection in evolutionary multiobjective optimization, in L. Spector et al. (eds), Proceedings of GECCO 2001: Genetic and Evolutionary Computation Conference, 2001, pp. 283-290.
7. de Jong, E. D., Watson, R. A., and Pollack, J. B.: Reducing bloat and promoting diversity using multi-objective methods, in E. Spector et al. (eds), Proceedings of GECCO 2001, 2001, pp. 11-18.
8. Deb, K., Pratab, A., Agarwal, S., and Meyarivan, T.: A fast and elitist multiobjective genetic algorithm: NSGA-II, IEEE Trans. Evolut. Comput. 6(2) (2002), 182-197.
9. Ekárt, A. and Németh, S. Z.: Selection based on the Pareto nondomination critierion for controlling code growth in genetic programming, Genetic Programming and Evolvable Machines 2 (2001), 61-73.
10. Fisher, H. and Thompson, G. L.: Probabilistic learning combinations of local job-shop scheduling rules, in J. F. Muth and G. L. Thompson (eds), Industrial Scheduling, Prentice-Hall, 1963, pp. 225-251.
11. Giffler, B. and Thompson, G. L.: Algorithms for solving production scheduling problems, Oper. Res. 8(1960), 487-503.
12. Good, P.: Permutation Tests, Springer, New York, 2000.
13. Jensen, M. T.: Robust and flexible scheduling with evolutionary computation, Ph.D. thesis, Department of Computer Science, University of Aarhus, 2001.
14. Jensen, M. T.: Guiding single-objective optimization using multi-objective methods, in G. Raidl et al. (eds), Applications of Evolutionary Computation, Lecture Notes in Comput. Sci. 2611, 2003, pp. 268-279.
15. Jensen, M. T.: Reducing the run-time complexity of multi-objective EAs: The NSGA-II and other algorithms, IEEE Trans. Evolut. Comput. 7(5) (2003), 503-515.
16. Johnson, D. S. and McGeoch, L. A.: The travelling salesman problem: A case study, in E. Aarts and J. K. Lenstra (eds), Local Search in Combinatorial Optimization, Wiley, 1997, Chapt. 8.
17. Knowles, J. D., Watson, R. A., and Corne, D. W.: Reducing local optima in single-objective problems by multi-objectivization, in E. Zitzler et al. (eds), Proceedings of the First International Conference on Evolutionary Multi-criterion Optimization (EMO'01), 2001, pp. 269-283.
18. Lawrence, S.: Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques (Supplement), Graduate School of Industrial Administration, Carnegie-Mellon University, 1984.
19. Louis, S. J. and Rawlins, G. J. E.: Pareto optimality, GA-easiness and deception, in S. Forrest (ed.), Proceedings of ICGA-5, 1993, pp. 118-123.
20. Scharnow, J. S., Tinnefeld, K., and Wegener, I.: Fitness landscapes based on sorting and shortest paths problems, in J. J. M. Guervós et al. (eds), Proceedings of PPSN VII, Lecture Notes in Comput. Sci. 2439, 2002, pp. 54-63.
21. Sokal, R. R. and Rohlf, F. J.: Biometry, W. H. Freeman and Company, 1995.
22. Starkweather, T., McDaniel, S., Mathias, K., Whitley, D., and Whitley, C.: A comparison of genetic sequencing operators, in R. Belew and L. Booker (eds), Proceedings of the 4th International Conference on Genetic Algorithms, 1991, pp. 69-76.
23. Storer, R. H., Wu, S. D., and Vaccari, R.: New search spaces for sequencing problems with applications to job shop scheduling, Management Sci. 38(10) (1992), 1495-1509.
24. Wright, M.: Subcost-guided search - Experiments with timetabling problems, J. Heuristics 7 (2001), 251-260.
25. Zitzler, E. and Thiele, L.: Multiobjective evolutionary algorithms: A comparative case study and the strength pareto approach, IEEE Trans. Evolut. Comput. 3(4) (1999), 257-271.