Skip to main content

Optimization of Scalarizing Functions Through Evolutionary Multiobjective Optimization

  • Conference paper
Evolutionary Multi-Criterion Optimization (EMO 2007)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4403))

Included in the following conference series:

Abstract

This paper proposes an idea of using evolutionary multiobjective optimization (EMO) to optimize scalarizing functions. We assume that a scalarizing function to be optimized has already been generated from an original multiobjective problem. Our task is to optimize the given scalarizing function. In order to efficiently search for its optimal solution without getting stuck in local optima, we generate a new multiobjective problem to which an EMO algorithm is applied. The point is to specify multiple objectives, which are similar to but different from the scalarizing function, so that the location of the optimal solution is near the center of the Pareto front of the generated multiobjective problem. The use of EMO algorithms helps escape from local optima. It also helps find a number of alternative solutions around the optimal solution. Difficulties of Pareto ranking-based EMO algorithms in the handling of many objectives are avoided by the use of similar objectives. In this paper, we first demonstrate that the performance of EMO algorithms as single-objective optimizers of scalarizing functions highly depends on the choice of multiple objectives. Based on this observation, we propose a specification method of multiple objectives for the optimization of a weighted sum fitness function. Experimental results show that our approach works very well in the search for not only a single optimal solution but also a number of good alternative solutions around the optimal solution. Next we evaluate the performance of our approach in comparison with a hybrid EMO algorithm where a single-objective fitness evaluation scheme is probabilistically used in an EMO algorithm. Then we show that our approach can be also used to optimize other scalarizing functions (e.g., those based on constraint conditions and reference solutions). Finally we show that our approach is applicable not only to scalarizing functions but also other single-objective optimization problems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Colombo, G., Mumford, C.L.: Comparing Algorithms, Representations and Operators for the Multi-Objective Knapsack Problem. In: Proc. of 2005 Congress on Evolutionary Computation, pp. 2241–2247 (2005)

    Google Scholar 

  2. Deb, K.: Multi-Objective Optimization Using Evolutionary Algorithms. John Wiley & Sons, Chichester (2001)

    MATH  Google Scholar 

  3. Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A Fast and Elitist Multiobjective Genetic Algorithm: NSGA-II. IEEE Trans. on Evolutionary Computation 6, 182–197 (2002)

    Article  Google Scholar 

  4. Deb, K., Sundar, J.: Reference Point Based Multi-Objective Optimization Using Evolutionary Algorithms. In: Proc. of Genetic and Evolutionary Computation Conference, pp. 635–642 (2006)

    Google Scholar 

  5. Fonseca, C.M., Fleming, P.J.: On the Performance Assessment and Comparison of Stochastic Multiobjective Optimizers. In: Ebeling, W., Rechenberg, I., Voigt, H.-M., Schwefel, H.-P. (eds.) Parallel Problem Solving from Nature - PPSN IV. LNCS, vol. 1141, pp. 584–593. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  6. Hughes, E.J.: Multiple Single Objective Sampling. In: Proc. of 2003 Congress on Evolutionary Computation, pp. 2678–2684 (2003)

    Google Scholar 

  7. Hughes, E.J.: Evolutionary Many-Objective Optimization: Many Once or One Many? In: Proc. of 2005 Congress on Evolutionary Computation, pp. 222–227 (2005)

    Google Scholar 

  8. Ishibuchi, H., Doi, T., Nojima, Y.: Incorporation of Scalarizing Fitness Functions into Evolutionary Multiobjective Optimization Algorithms. In: Runarsson, T.P., Beyer, H.-G., Burke, E., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds.) Parallel Problem Solving from Nature - PPSN IX. LNCS, vol. 4193, pp. 493–502. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  9. Ishibuchi, H., Murata, T.: A Multi-Objective Genetic Local Search Algorithm and Its Application to Flowshop Scheduling. IEEE Trans. on Systems, Man, and Cybernetics - Part C: Applications and Reviews 28, 392–403 (1998)

    Article  Google Scholar 

  10. Ishibuchi, H., Nojima, Y., Doi, T.: Application of Multiobjective Evolutionary Algorithms to Single-Objective Optimization Problems. Abstract Booklet of 7th International Conference on Multi-Objective Programming and Goal Programming, 4 pages (2006)

    Google Scholar 

  11. Ishibuchi, H., Yoshida, T., Murata, T.: Balance between Genetic Search and Local Search in Memetic Algorithms for Multiobjective Permutation Flowshop Scheduling. IEEE Trans. on Evolutionary Computation 7, 204–223 (2003)

    Article  Google Scholar 

  12. Jaszkiewicz, A.: Genetic Local Search for Multi-Objective Combinatorial Optimization. European Journal of Operational Research 137, 50–71 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  13. Jaszkiewicz, A.: On the Performance of Multiple-Objective Genetic Local Search on the 0/1 Knapsack Problem - A Comparative Experiment. IEEE Trans. on Evolutionary Computation 6, 402–412 (2002)

    Article  Google Scholar 

  14. Jaszkiewicz, A.: On the Computational Efficiency of Multiple Objective Metaheuristics: The Knapsack Problem Case Study. European Journal of Operational Research 158, 418–433 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  15. Knowles, J.D., Watson, R.A., Corne, D.W.: Reducing Local Optima in Single-Objective Problems by Multi-Objectivization. In: Zitzler, E., Deb, K., Thiele, L., Coello Coello, C.A., Corne, D.W. (eds.) EMO 2001. LNCS, vol. 1993, pp. 269–283. Springer, Heidelberg (2001)

    Google Scholar 

  16. Mumford, C.L.: A Hierarchical Solve-and-Merge Framework for Multi-Objective Optimization. In: Proc. of 2005 Congress on Evolutionary Computation, pp. 2241–2247 (2005)

    Google Scholar 

  17. Purshouse, R.C., Fleming, P.J.: Evolutionary Many-Objective Optimization: An Exploratory Analysis. In: Proc. of 2003 Congress on Evolutionary Computation, pp. 2066–2073 (2003)

    Google Scholar 

  18. Watanabe, S., Sakakibara, K.: Multi-Objective Approaches in a Single-Objective Optimization Environment. In: Proc. of 2005 Congress on Evolutionary Computation, pp. 1714–1721 (2005)

    Google Scholar 

  19. Zitzler, E., Thiele, L.: Multiobjective Evolutionary Algorithms: A Comparative Case Study and the Strength Pareto Approach. IEEE Trans. on Evolutionary Computation 3, 257–271 (1999)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Shigeru Obayashi Kalyanmoy Deb Carlo Poloni Tomoyuki Hiroyasu Tadahiko Murata

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer Berlin Heidelberg

About this paper

Cite this paper

Ishibuchi, H., Nojima, Y. (2007). Optimization of Scalarizing Functions Through Evolutionary Multiobjective Optimization. In: Obayashi, S., Deb, K., Poloni, C., Hiroyasu, T., Murata, T. (eds) Evolutionary Multi-Criterion Optimization. EMO 2007. Lecture Notes in Computer Science, vol 4403. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70928-2_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-70928-2_8

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-70927-5

  • Online ISBN: 978-3-540-70928-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics