Guiding single-objective optimization using multi-objective methods

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2611, Issue , 2003, Pages 268-279

  Jensen, Mikkel T ^a  

^a AARHUS UNIVERSITY   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

GENETIC ALGORITHMS; OPTIMIZATION;

BUILDING BLOCKES; JOB SHOP SCHEDULING PROBLEMS; LOCAL OPTIMA; MULTI OBJECTIVE; SINGLE OBJECTIVE OPTIMIZATION; SINGLE OBJECTIVE OPTIMIZATION PROBLEMS;

MULTIOBJECTIVE OPTIMIZATION;

EID: 35248825030     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36605-9_25     Document Type: Article

References (16)

1. J. L. Bentley, H. T. Kung, M. Schkolnick, and C. D. Thompson. On the Average Number of Maxima in a Set of Vectors and Applications. Journal of the ACM, 25:536-543, 1978.
2. S. Bleuler, M. Brack, L. Thiele, and C. Zitzler. Multiobjective Genetic Programming: Reducing Bloat using SPEA2. In Proceedings of CEC'2001, pages 536-543, 2001.
3. D. Corne, N. Jerram, J. Knowles, and M. Oates. PESA-II: Region-based Selection in Evolutionary Multiobjective Optimization. In L. Spector et al., editors, Proceedings of GECCO-2001: Genetic and Evolutionary Computation Conference, pages 283-290. Morgan Kaufmann, 2001.
4. E. D. de Jong, R. A. Watson, and J. B. Pollack. Reducing Bloat and Promoting Diversity using Multi-Objective Methods. In L. Spector et al., editors, Proceedings of GECCO'2001, pages 11-18. Morgan Kaufmann, 2001.
5. K. Deb, A. Pratab, S. Agarwal, and T. Meyarivan. A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Transactions on Evolutionary Computation, 6(2):182-197, April 2002.
6. H. Fisher and G. L. Thompson. Probabilistic learning combinations of local jobshop scheduling rules. In J. F. Muth and G. L. Thompson, editors, Industrial Scheduling, pages 225-251. Prentice Hall, 1963.
7. B. Giffler and G. L. Thompson. Algorithms for solving production scheduling problems. Operations Research, 8:487-503, 1960.
8. M. T. Jensen. Robust and Flexible Scheduling with Evolutionary Computation. PhD thesis, Department of Computer Science, University of Aarhus, 2001.
9. M. T. Jensen. Reducing the Run-time Complexity of the NSGA-II. In submission, 2002. Currently available from http://www.daimi.au.dk/∼mjensen/.
10. J. D. Knowles, R. A. Watson, and D. W. Corne. Reducing Local Optima in Single-Objective Problems by Multi-objectivization. In E. Zitzler et al., editors, Proceedings of the First International Conference on Evolutionary Multi-criterion Optimization (EMO'01), pages 269-283. Springer-Verlag, 2001.
11. S. Lawrence. Resource constrained project scheduling: an experimental investigation of heuristic scheduling techniques (Supplement). Graduate School of Industrial Administration, Carnegie-Mellon University, 1984.
12. S. J. Louis and G. J. E. Rawlins. Pareto Optimality, GA-easiness and Deception. In S. Forrest, editor, Proceedings of ICGA-5, pages 118-123. Morgan Kaufmann, 1993.
13. J. Noble and R. A. Watson. Pareto coevolution: Using performance against coevolved opponents in a game as dimensions for Pareto selection. In L. Spector et al., editors, Proceedings of GECCO'2001, pages 493-500. Morgan Kaufmann, 2001.
14. J. S. Scharnow, K. Tinnefeld, and I. Wegener. Fitness Landscapes Based on Sorting and Shortest Paths Problems. In J. J. Merelo Guervós et al., editors, Proceedings of PPSN VII, volume 2439 of LNCS, pages 54-63. Springer-Verlag, 2002.
15. R. A. Watson and J. B. Pollack. Symbiotic Combination as an Alternative to Sexual Recombination in Genetic Algorithms. In M. Schoenauer et al., editors, Proceedings of PPSN VI, volume 1917 of LNCS, pages 425-434. Springer-Verlag, 2000.
16. E. Zitzler and L. Thiele. Multiobjective Evolutionary Algorithms: A Comparative Case study and the Strength Pareto Approach. IEEE Transactions on Evolutionary Computation, 3(4):257-271, November 1999.