Pareto Optimization or Cascaded Weighted Sum:  A Comparison of Concepts

Wilfried Jakob; Christian Blume

doi:10.3390/a7010166

journal article Open Access Mar 21, 2014

Pareto Optimization or Cascaded Weighted Sum: A Comparison of Concepts

Wilfried Jakob Christian Blume

Algorithms Vol. 7 No. 1 pp. 166-185 · MDPI AG

View at Publisher Save 10.3390/a7010166

Abstract

Looking at articles or conference papers published since the turn of the century, Pareto optimization is the dominating assessment method for multi-objective nonlinear optimization problems. However, is it always the method of choice for real-world applications, where either more than four objectives have to be considered, or the same type of task is repeated again and again with only minor modifications, in an automated optimization or planning process? This paper presents a classification of application scenarios and compares the Pareto approach with an extended version of the weighted sum, called cascaded weighted sum, for the different scenarios. Its range of application within the field of multi-objective optimization is discussed as well as its strengths and weaknesses.

Topics

No keywords indexed for this article. Browse by subject →

References

25

[1]

Pareto, V. (1896). Cours d’Économie Politique, F. Rouge. (in French).

[2]

Hoffmeister, F., and Bäck, T. (1992). Genetic Algorithms and Evolution Strategies: Similarities and Differences, FB Informatik, University of Dortmund. Technical Report SYS-1/92.

[3]

Branke, J., Deb, K., Miettinen, K., and Słowiński, R. (2008). Multiobjective Optimization: Interactive and Evolutionary Approaches, Springer. Lecture notes in computer science 5252. 10.1007/978-3-540-88908-3

[4]

Branke, J., Deb, K., Miettinen, K., and Słowiński, R. (2008). Introduction to evolutionary multiobjective optimization. Multiobjective Optimization: Interactive and Evolutionary Approaches, Springer. Lecture notes in computer science 5252. 10.1007/978-3-540-88908-3

[5]

Miettinen, K. (1999). Nonlinear Multiobjective Optimization, Kluwer Academic Publishers. International series in operations research & management science 12. 10.1007/978-1-4615-5563-6

[6]

Jakob "Fast rescheduling of multiple workflows to constrained heterogeneous resources using multi-criteria memetic computing" Algorithms (2013) 10.3390/a6020245

[7]

Haimes "On a bicriterion formulation of the problems of integrated system identification and system optimization" IEEE Trans. Syst. Man Cybern. (1971)

[8]

Osyczka, A. (1984). Multicriterion Optimization in Engineering with FORTRAN Programs, E. Horwood. Ellis Horwood series in mechanical engineering.

[9]

Branke, J., Deb, K., Miettinen, K., and Słowiński, R. (2008). Introduction to multiobjective optimization: Noninteractive approaches. Multiobjective Optimization: Interactive and Evolutionary Approaches, Springer. Lecture notes in computer science 5252. 10.1007/978-3-540-88908-3

[10]

Deb "A fast and elitist multiobjective genetic algorithm: NSGA-II" IEEE Trans. Evol. Comput. (2002) 10.1109/4235.996017

[11]

Giannakoglou, K.C., Tsahalis, D.T., Périaux, J., Papailiou, K.D., and Fogarty, T. (2001, January 19–21). SPEA2: Improving the strength pareto evolutionary algorithm for multiobjective optimization. Evolutionary Methods for Design Optimization and Control with Applications to Industrial Problems, Proceedings of the EUROGEN’2001 Conference, Athens, Greece.

[12]

SMS-EMOA: Multiobjective selection based on dominated hypervolume

Nicola Beume, Boris Naujoks, Michael Emmerich

European Journal of Operational Research 2007 10.1016/j.ejor.2006.08.008

[13]

Schwefel, H.-P., and Männer, R. (1990, January 1–3). GLEAM—A system for simulated “intuitive learning”. Parallel Problem Solving from Nature: Proceedings of the 1st Workshop, Dortmund, Germany. Lecture notes in computer science 496. 10.1007/bfb0029723

[14]

Blume, C., Jakob, W., and Krisch, S. (1994, January 25–27). Robot trajectory planning with collision avoidance using genetic algorithms and simulation. Proceedings of the 25th International Symposium on Industrial Robots (ISIR), Hanover, Germany.

[15]

Blume, C., and Jakob, W. (2009). GLEAM—General Learning Evolutionary Algorithm and Method. Ein evolutionärer Algorithmus und seine Anwendungen, KIT Scientific Publishing. (in German); Schriftenreihe des Instituts für Angewandte Informatik, Automatisierungstechnik am Karlsruher Institut für Technologie 32.

[16]

Schwefel, H.-P., and Männer, R. (1990, January 1–3). Explicit parallelism of genetic algorithms through population structures. Proceedings of the 1st Workshop on Parallel Problem Solving from Nature (PPSN I), Dortmund, Germany. 10.1007/bfb0029723

[17]

Voigt, H.-M., Ebeling, W., Rechenberg, I., and Schwefel, H.-P. (1996, January 22–26). An analysis of the effects of neighborhood size and shape on local selection algorithms. Proceedings of the 4th International Conference on Parallel Problem Solving from Nature (PPSN IV), LNCS 1141, Berlin, Germany. 10.1007/3-540-61723-x

[18]

Nguyen "Adaptive cellular memetic algorithms" Evol. Comput. (2009) 10.1162/evco.2009.17.2.231

[19]

Jakob "A general cost-benefit-based adaptation framework for multimeme algorithms" Memet. Comput. (2010) 10.1007/s12293-010-0040-9

[20]

Branke, J., Deb, K., Miettinen, K., and Słowiński, R. (2008). Visualizing the Pareto Frontier. Multiobjective Optimization: Interactive and Evolutionary Approaches, Springer. Lecture notes in computer science 5252. 10.1007/978-3-540-88908-3

[21]

Klamroth "Unbiased approximation in multicriteria optimization" Math. Method Oper. Res. (2003) 10.1007/s001860200217

[22]

Hernandez, S., Kassab, A.J., and Brebbia, C.A. (1999). Solving a highly multi-modal design optimization problem using the extended genetic algorithm GLEAM. Computer Aided Optimum Design of Structures VI: Conf. Proc. OPTI 99, WIT Press.

[23]

Branke, J., Deb, K., Miettinen, K., and Słowiński, R. (2008). Real-world applications of multiobjective optimization. Multiobjective Optimization: Interactive and Evolutionary Approaches, Springer-Verlag. Lecture notes in computer science 5252. 10.1007/978-3-540-88908-3

[24]

Blume, C. (1997, January 21–23). Automatic Generation of Collision Free Moves for the ABB Industrial Robot Control. Proceedings of the 1997 First International Conference on Knowledge-Based Intelligent Electronic Systems (KES ’97), Adelaide, SA, Australia.

[25]

Cagnoni, S. (2000). Optimized Collision Free Robot Move Statement Generation by the Evolutionary Software GLEAM. Real World Applications of Evolutionary Computing: Proceedings, Springer. Lecture notes in computer science 1803.

Cited By

102

A Min-Max Strategy to Aid Decision Making in a Bi-Objective Discrete Optimization Problem Using an Improved Ant Colony Algorithm

Douglas Yenwon Kparib, Stephen Boakye Twum · 2019

American Journal of Operations Rese...

Metrics

102

Citations

25

References

Details

Published: Mar 21, 2014
Vol/Issue: 7(1)
Pages: 166-185
License: View

Authors

W

Wilfried Jakob

Karlsruhe Institute of Technology (KIT), Institute of Applied Computer Science (IAI), P.O. Box 3640, Karlsruhe 76021, Germany

C

Christian Blume

Cologne University of Applied Sciences, Institute of Automation and Industrial IT, Steinmüllerallee 1, Gummersbach 51643, Germany

Cite This Article

Wilfried Jakob, Christian Blume (2014). Pareto Optimization or Cascaded Weighted Sum: A Comparison of Concepts. Algorithms, 7(1), 166-185. https://doi.org/10.3390/a7010166

Pareto Optimization or Cascaded Weighted Sum: A Comparison of Concepts

You May Also Like