[{"citation":{"chicago":"Schütze, O., K. Witting, Sina Ober-Blöbaum, M. Dellnitz, and Emilia Tantar. “Set Oriented Methods for the Numerical Treatment of Multi-Objective Optimization Problems.” In <i>EVOLVE - A Bridge Between Probability, Set Oriented Numerics, and Evolutionary Computation</i>, 187–219. Studies in Computational Intelligence. Berlin Heidelberg: Springer, 2013.","short":"O. Schütze, K. Witting, S. Ober-Blöbaum, M. Dellnitz, E. Tantar, in: EVOLVE - A Bridge Between Probability, Set Oriented Numerics, and Evolutionary Computation, Springer, Berlin Heidelberg, 2013, pp. 187–219.","apa":"Schütze, O., Witting, K., Ober-Blöbaum, S., Dellnitz, M., &#38; Tantar, E. (2013). Set oriented methods for the numerical treatment of multi-objective optimization problems. In <i>EVOLVE - A Bridge Between Probability, Set Oriented Numerics, and Evolutionary Computation</i> (pp. 187–219). Springer.","ieee":"O. Schütze, K. Witting, S. Ober-Blöbaum, M. Dellnitz, and E. Tantar, “Set oriented methods for the numerical treatment of multi-objective optimization problems,” in <i>EVOLVE - A Bridge Between Probability, Set Oriented Numerics, and Evolutionary Computation</i>, Berlin Heidelberg: Springer, 2013, pp. 187–219.","ama":"Schütze O, Witting K, Ober-Blöbaum S, Dellnitz M, Tantar E. Set oriented methods for the numerical treatment of multi-objective optimization problems. In: <i>EVOLVE - A Bridge Between Probability, Set Oriented Numerics, and Evolutionary Computation</i>. Studies in Computational Intelligence. Springer; 2013:187-219.","bibtex":"@inbook{Schütze_Witting_Ober-Blöbaum_Dellnitz_Tantar_2013, place={Berlin Heidelberg}, series={Studies in Computational Intelligence}, title={Set oriented methods for the numerical treatment of multi-objective optimization problems}, booktitle={EVOLVE - A Bridge Between Probability, Set Oriented Numerics, and Evolutionary Computation}, publisher={Springer}, author={Schütze, O. and Witting, K. and Ober-Blöbaum, Sina and Dellnitz, M. and Tantar, Emilia}, year={2013}, pages={187–219}, collection={Studies in Computational Intelligence} }","mla":"Schütze, O., et al. “Set Oriented Methods for the Numerical Treatment of Multi-Objective Optimization Problems.” <i>EVOLVE - A Bridge Between Probability, Set Oriented Numerics, and Evolutionary Computation</i>, Springer, 2013, pp. 187–219."},"publication":"EVOLVE - A Bridge Between Probability, Set Oriented Numerics, and Evolutionary Computation","department":[{"_id":"636"}],"type":"book_chapter","place":"Berlin Heidelberg","date_created":"2022-01-18T14:16:14Z","date_updated":"2022-01-21T08:23:59Z","author":[{"full_name":"Schütze, O.","first_name":"O.","last_name":"Schütze"},{"full_name":"Witting, K.","last_name":"Witting","first_name":"K."},{"id":"16494","last_name":"Ober-Blöbaum","first_name":"Sina","full_name":"Ober-Blöbaum, Sina"},{"last_name":"Dellnitz","first_name":"M.","full_name":"Dellnitz, M."},{"first_name":"Emilia","last_name":"Tantar","full_name":"Tantar, Emilia"}],"title":"Set oriented methods for the numerical treatment of multi-objective optimization problems","year":"2013","status":"public","user_id":"15694","_id":"29419","series_title":"Studies in Computational Intelligence","language":[{"iso":"eng"}],"publisher":"Springer","page":"187-219"},{"citation":{"chicago":"Witting, K., Sina Ober-Blöbaum, and M. Dellnitz. “A Variational Approach to Define Robustness for Parametric Multiobjective Optimization Problems.” <i>Journal of Global Optimization</i> 57(2) (2013): 331–45.","short":"K. Witting, S. Ober-Blöbaum, M. Dellnitz, Journal of Global Optimization 57(2) (2013) 331–345.","ieee":"K. Witting, S. Ober-Blöbaum, and M. Dellnitz, “A variational approach to define robustness for parametric multiobjective optimization problems,” <i>Journal of Global Optimization</i>, vol. 57(2), pp. 331–345, 2013.","apa":"Witting, K., Ober-Blöbaum, S., &#38; Dellnitz, M. (2013). A variational approach to define robustness for parametric multiobjective optimization problems. <i>Journal of Global Optimization</i>, <i>57(2)</i>, 331–345.","bibtex":"@article{Witting_Ober-Blöbaum_Dellnitz_2013, title={A variational approach to define robustness for parametric multiobjective optimization problems}, volume={57(2)}, journal={Journal of Global Optimization}, author={Witting, K. and Ober-Blöbaum, Sina and Dellnitz, M.}, year={2013}, pages={331–345} }","ama":"Witting K, Ober-Blöbaum S, Dellnitz M. A variational approach to define robustness for parametric multiobjective optimization problems. <i>Journal of Global Optimization</i>. 2013;57(2):331-345.","mla":"Witting, K., et al. “A Variational Approach to Define Robustness for Parametric Multiobjective Optimization Problems.” <i>Journal of Global Optimization</i>, vol. 57(2), 2013, pp. 331–45."},"publication":"Journal of Global Optimization","type":"journal_article","date_created":"2022-01-18T11:58:38Z","date_updated":"2022-01-21T10:37:38Z","author":[{"last_name":"Witting","first_name":"K.","full_name":"Witting, K."},{"id":"16494","first_name":"Sina","last_name":"Ober-Blöbaum","full_name":"Ober-Blöbaum, Sina"},{"full_name":"Dellnitz, M.","last_name":"Dellnitz","first_name":"M."}],"year":"2013","status":"public","title":"A variational approach to define robustness for parametric multiobjective optimization problems","volume":"57(2)","user_id":"15694","language":[{"iso":"eng"}],"_id":"29406","page":"331-345"},{"user_id":"15694","language":[{"iso":"eng"}],"_id":"29443","page":"204-209","date_updated":"2022-01-21T14:40:40Z","conference":{"start_date":"2013-07-17","location":"Zurich, Switzerland","end_date":"2013-07-19"},"author":[{"id":"16494","last_name":"Ober-Blöbaum","first_name":"Sina","full_name":"Ober-Blöbaum, Sina"},{"first_name":"A. ","last_name":"Seifried","full_name":"Seifried, A. "}],"year":"2013","status":"public","title":"A multiobjective optimization approach for optimal control problems of mechanical systems with uncertainties","department":[{"_id":"636"}],"type":"conference","date_created":"2022-01-19T11:10:19Z","citation":{"mla":"Ober-Blöbaum, Sina, and A. Seifried. “A Multiobjective Optimization Approach for Optimal Control Problems of Mechanical Systems with Uncertainties.” <i>European Control Conference</i>, 2013, pp. 204–09.","ama":"Ober-Blöbaum S, Seifried A. A multiobjective optimization approach for optimal control problems of mechanical systems with uncertainties. In: <i>European Control Conference</i>. ; 2013:204-209.","bibtex":"@inproceedings{Ober-Blöbaum_Seifried_2013, title={A multiobjective optimization approach for optimal control problems of mechanical systems with uncertainties}, booktitle={European Control Conference}, author={Ober-Blöbaum, Sina and Seifried, A. }, year={2013}, pages={204–209} }","apa":"Ober-Blöbaum, S., &#38; Seifried, A. (2013). A multiobjective optimization approach for optimal control problems of mechanical systems with uncertainties. <i>European Control Conference</i>, 204–209.","ieee":"S. Ober-Blöbaum and A. Seifried, “A multiobjective optimization approach for optimal control problems of mechanical systems with uncertainties,” in <i>European Control Conference</i>, Zurich, Switzerland, 2013, pp. 204–209.","short":"S. Ober-Blöbaum, A. Seifried, in: European Control Conference, 2013, pp. 204–209.","chicago":"Ober-Blöbaum, Sina, and A.  Seifried. “A Multiobjective Optimization Approach for Optimal Control Problems of Mechanical Systems with Uncertainties.” In <i>European Control Conference</i>, 204–9, 2013."},"publication":"European Control Conference"},{"type":"conference","department":[{"_id":"636"}],"date_created":"2022-01-19T11:07:02Z","publication":"European Control Conference","citation":{"mla":"Flaßkamp, K., et al. “Discretized Switching Time Optimization Problems.” <i>European Control Conference</i>, 2013, pp. 3179–84.","bibtex":"@inproceedings{Flaßkamp_Murphey_Ober-Blöbaum_2013, title={Discretized switching time optimization problems}, booktitle={European Control Conference}, author={Flaßkamp, K. and Murphey, T. and Ober-Blöbaum, Sina}, year={2013}, pages={3179–3184} }","ama":"Flaßkamp K, Murphey T, Ober-Blöbaum S. Discretized switching time optimization problems. In: <i>European Control Conference</i>. ; 2013:3179-3184.","ieee":"K. Flaßkamp, T. Murphey, and S. Ober-Blöbaum, “Discretized switching time optimization problems,” in <i>European Control Conference</i>, Zurich, Switzerland, 2013, pp. 3179–3184.","apa":"Flaßkamp, K., Murphey, T., &#38; Ober-Blöbaum, S. (2013). Discretized switching time optimization problems. <i>European Control Conference</i>, 3179–3184.","chicago":"Flaßkamp, K., T. Murphey, and Sina Ober-Blöbaum. “Discretized Switching Time Optimization Problems.” In <i>European Control Conference</i>, 3179–84, 2013.","short":"K. Flaßkamp, T. Murphey, S. Ober-Blöbaum, in: European Control Conference, 2013, pp. 3179–3184."},"user_id":"15694","page":"3179-3184","language":[{"iso":"eng"}],"_id":"29442","date_updated":"2022-01-21T14:39:43Z","status":"public","year":"2013","title":"Discretized switching time optimization problems","conference":{"location":"Zurich, Switzerland","start_date":"2013-07-17","end_date":"2013-07-19"},"author":[{"full_name":"Flaßkamp, K.","first_name":"K.","last_name":"Flaßkamp"},{"full_name":"Murphey, T.","last_name":"Murphey","first_name":"T."},{"first_name":"Sina","last_name":"Ober-Blöbaum","full_name":"Ober-Blöbaum, Sina","id":"16494"}]},{"date_updated":"2022-01-24T08:12:25Z","status":"public","title":"Optimization for discretized switched systems","year":"2013","author":[{"full_name":"Flaßkamp, K.","first_name":"K.","last_name":"Flaßkamp"},{"full_name":"Murphey, T.","first_name":"T.","last_name":"Murphey"},{"id":"16494","last_name":"Ober-Blöbaum","first_name":"Sina","full_name":"Ober-Blöbaum, Sina"}],"user_id":"15694","volume":"13(1)","page":"401-402","_id":"29490","language":[{"iso":"eng"}],"publication":"Proceedings of Applied Mathematics and Mechanics","citation":{"mla":"Flaßkamp, K., et al. “Optimization for Discretized Switched Systems.” <i>Proceedings of Applied Mathematics and Mechanics</i>, vol. 13(1), 2013, pp. 401–02.","bibtex":"@inproceedings{Flaßkamp_Murphey_Ober-Blöbaum_2013, title={Optimization for discretized switched systems}, volume={13(1)}, booktitle={Proceedings of Applied Mathematics and Mechanics}, author={Flaßkamp, K. and Murphey, T. and Ober-Blöbaum, Sina}, year={2013}, pages={401–402} }","ama":"Flaßkamp K, Murphey T, Ober-Blöbaum S. Optimization for discretized switched systems. In: <i>Proceedings of Applied Mathematics and Mechanics</i>. Vol 13(1). ; 2013:401-402.","ieee":"K. Flaßkamp, T. Murphey, and S. Ober-Blöbaum, “Optimization for discretized switched systems,” in <i>Proceedings of Applied Mathematics and Mechanics</i>, 2013, vol. 13(1), pp. 401–402.","apa":"Flaßkamp, K., Murphey, T., &#38; Ober-Blöbaum, S. (2013). Optimization for discretized switched systems. <i>Proceedings of Applied Mathematics and Mechanics</i>, <i>13(1)</i>, 401–402.","chicago":"Flaßkamp, K., T. Murphey, and Sina Ober-Blöbaum. “Optimization for Discretized Switched Systems.” In <i>Proceedings of Applied Mathematics and Mechanics</i>, 13(1):401–2, 2013.","short":"K. Flaßkamp, T. Murphey, S. Ober-Blöbaum, in: Proceedings of Applied Mathematics and Mechanics, 2013, pp. 401–402."},"type":"conference","department":[{"_id":"636"}],"date_created":"2022-01-20T09:07:18Z"},{"intvolume":"         2","publication_status":"published","date_updated":"2023-01-11T10:53:42Z","author":[{"id":"459","first_name":"Kirsten","last_name":"Schlegel-Matthies","full_name":"Schlegel-Matthies, Kirsten"},{"last_name":"Methfessel","first_name":"Barbara","full_name":"Methfessel, Barbara"}],"publication_identifier":{"issn":["2193-8806"]},"year":"2013","status":"public","title":"Für eine veränderte Fachpraxis - Zur Kultur und Technik der Nahrungszubereitung und Mahlzeitengestaltung","volume":2,"user_id":"459","_id":"36002","publisher":"Barbara Budrich","language":[{"iso":"ger"}],"page":"49-60","citation":{"mla":"Schlegel-Matthies, Kirsten, and Barbara Methfessel. “Für eine veränderte Fachpraxis - Zur Kultur und Technik der Nahrungszubereitung und Mahlzeitengestaltung.” <i>Haushalt in Bidlung und Forschung</i>, vol. 2, no. 4, Barbara Budrich, 2013, pp. 49–60.","apa":"Schlegel-Matthies, K., &#38; Methfessel, B. (2013). Für eine veränderte Fachpraxis - Zur Kultur und Technik der Nahrungszubereitung und Mahlzeitengestaltung. <i>Haushalt in Bidlung und Forschung</i>, <i>2</i>(4), 49–60.","ieee":"K. Schlegel-Matthies and B. Methfessel, “Für eine veränderte Fachpraxis - Zur Kultur und Technik der Nahrungszubereitung und Mahlzeitengestaltung,” <i>Haushalt in Bidlung und Forschung</i>, vol. 2, no. 4, pp. 49–60, 2013.","short":"K. Schlegel-Matthies, B. Methfessel, Haushalt in Bidlung und Forschung 2 (2013) 49–60.","ama":"Schlegel-Matthies K, Methfessel B. Für eine veränderte Fachpraxis - Zur Kultur und Technik der Nahrungszubereitung und Mahlzeitengestaltung. <i>Haushalt in Bidlung und Forschung</i>. 2013;2(4):49-60.","chicago":"Schlegel-Matthies, Kirsten, and Barbara Methfessel. “Für eine veränderte Fachpraxis - Zur Kultur und Technik der Nahrungszubereitung und Mahlzeitengestaltung.” <i>Haushalt in Bidlung und Forschung</i> 2, no. 4 (2013): 49–60.","bibtex":"@article{Schlegel-Matthies_Methfessel_2013, title={Für eine veränderte Fachpraxis - Zur Kultur und Technik der Nahrungszubereitung und Mahlzeitengestaltung}, volume={2}, number={4}, journal={Haushalt in Bidlung und Forschung}, publisher={Barbara Budrich}, author={Schlegel-Matthies, Kirsten and Methfessel, Barbara}, year={2013}, pages={49–60} }"},"issue":"4","publication":"Haushalt in Bidlung und Forschung","department":[{"_id":"35"},{"_id":"17"},{"_id":"22"},{"_id":"396"}],"type":"journal_article","date_created":"2023-01-11T10:53:33Z"},{"citation":{"chicago":"Sosa, Hernández V, O Schütze, G Rudolph, and Heike Trautmann. “The Directed Search Method for Pareto Front Approximations with Maximum Dominated Hypervolume.” In <i>EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation IV</i>, edited by M Emmerich, A Deutz, O Schuetze, T Bäck, A Tantar, PD Moral, P Legrand, P Bouvry, and CA Coello, 227:189–205. Advances in Intelligent Systems and Computing. Springer International Publishing, 2013. <a href=\"https://doi.org/10.1007/978-3-319-01128-8_13\">https://doi.org/10.1007/978-3-319-01128-8_13</a>.","short":"H.V. Sosa, O. Schütze, G. Rudolph, H. Trautmann, in: M. Emmerich, A. Deutz, O. Schuetze, T. Bäck, A. Tantar, P. Moral, P. Legrand, P. Bouvry, C. Coello (Eds.), EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation IV, Springer International Publishing, 2013, pp. 189–205.","apa":"Sosa, H. V., Schütze, O., Rudolph, G., &#38; Trautmann, H. (2013). The Directed Search Method for Pareto Front Approximations with Maximum Dominated Hypervolume. In M. Emmerich, A. Deutz, O. Schuetze, T. Bäck, A. Tantar, P. Moral, P. Legrand, P. Bouvry, &#38; C. Coello (Eds.), <i>EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation IV</i> (Vol. 227, pp. 189–205). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-01128-8_13\">https://doi.org/10.1007/978-3-319-01128-8_13</a>","ieee":"H. V. Sosa, O. Schütze, G. Rudolph, and H. Trautmann, “The Directed Search Method for Pareto Front Approximations with Maximum Dominated Hypervolume,” in <i>EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation IV</i>, vol. 227, M. Emmerich, A. Deutz, O. Schuetze, T. Bäck, A. Tantar, P. Moral, P. Legrand, P. Bouvry, and C. Coello, Eds. Springer International Publishing, 2013, pp. 189–205.","ama":"Sosa HV, Schütze O, Rudolph G, Trautmann H. The Directed Search Method for Pareto Front Approximations with Maximum Dominated Hypervolume. In: Emmerich M, Deutz A, Schuetze O, et al., eds. <i>EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation IV</i>. Vol 227. Advances in Intelligent Systems and Computing. Springer International Publishing; 2013:189–205. doi:<a href=\"https://doi.org/10.1007/978-3-319-01128-8_13\">10.1007/978-3-319-01128-8_13</a>","bibtex":"@inbook{Sosa_Schütze_Rudolph_Trautmann_2013, series={Advances in Intelligent Systems and Computing}, title={The Directed Search Method for Pareto Front Approximations with Maximum Dominated Hypervolume}, volume={227}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-01128-8_13\">10.1007/978-3-319-01128-8_13</a>}, booktitle={EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation IV}, publisher={Springer International Publishing}, author={Sosa, Hernández V and Schütze, O and Rudolph, G and Trautmann, Heike}, editor={Emmerich, M and Deutz, A and Schuetze, O and Bäck, T and Tantar, A and Moral, PD and Legrand, P and Bouvry, P and Coello, CA}, year={2013}, pages={189–205}, collection={Advances in Intelligent Systems and Computing} }","mla":"Sosa, Hernández V., et al. “The Directed Search Method for Pareto Front Approximations with Maximum Dominated Hypervolume.” <i>EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation IV</i>, edited by M Emmerich et al., vol. 227, Springer International Publishing, 2013, pp. 189–205, doi:<a href=\"https://doi.org/10.1007/978-3-319-01128-8_13\">10.1007/978-3-319-01128-8_13</a>."},"status":"public","user_id":"15504","editor":[{"full_name":"Emmerich, M","first_name":"M","last_name":"Emmerich"},{"full_name":"Deutz, A","first_name":"A","last_name":"Deutz"},{"full_name":"Schuetze, O","first_name":"O","last_name":"Schuetze"},{"full_name":"Bäck, T","last_name":"Bäck","first_name":"T"},{"full_name":"Tantar, A","first_name":"A","last_name":"Tantar"},{"full_name":"Moral, PD","first_name":"PD","last_name":"Moral"},{"first_name":"P","last_name":"Legrand","full_name":"Legrand, P"},{"full_name":"Bouvry, P","first_name":"P","last_name":"Bouvry"},{"full_name":"Coello, CA","first_name":"CA","last_name":"Coello"}],"volume":227,"page":"189–205","publisher":"Springer International Publishing","_id":"46385","abstract":[{"lang":"eng","text":"In many applications one is faced with the problem that multiple objectives have to be optimized at the same time. Since typically the solution set of such multi-objective optimization problems forms a manifold which cannot be computed analytically, one is in many cases interested in a suitable finite size approximation of this set. One widely used approach is to find a representative set that maximizes the dominated hypervolume that is defined by the images in objective space of these solutions and a given reference point.\r\n\r\nIn this paper, we propose a new point-wise iterative search procedure, Hypervolume Directed Search (HVDS), that aims to increase the hypervolume of a given point in an archive for bi-objective unconstrained optimization problems. We present the HVDS both as a standalone algorithm and as a local searcher within a specialized evolutionary algorithm. Numerical results confirm the strength of the novel approach."}],"publication":"EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation IV","type":"book_chapter","department":[{"_id":"34"},{"_id":"819"}],"date_created":"2023-08-04T15:37:00Z","date_updated":"2023-10-16T13:44:50Z","intvolume":"       227","title":"The Directed Search Method for Pareto Front Approximations with Maximum Dominated Hypervolume","year":"2013","author":[{"full_name":"Sosa, Hernández V","last_name":"Sosa","first_name":"Hernández V"},{"first_name":"O","last_name":"Schütze","full_name":"Schütze, O"},{"full_name":"Rudolph, G","last_name":"Rudolph","first_name":"G"},{"full_name":"Trautmann, Heike","first_name":"Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","id":"100740"}],"publication_identifier":{"isbn":["978-3-319-01127-1"]},"doi":"10.1007/978-3-319-01128-8_13","series_title":"Advances in Intelligent Systems and Computing","language":[{"iso":"eng"}]},{"status":"public","_id":"46386","publisher":"Springer Berlin Heidelberg","page":"89–105","editor":[{"full_name":"Schütze, O","first_name":"O","last_name":"Schütze"},{"first_name":"Coello CA","last_name":"Coello","full_name":"Coello, Coello CA"},{"full_name":"Tantar, A","last_name":"Tantar","first_name":"A"},{"full_name":"Tantar, E","first_name":"E","last_name":"Tantar"},{"full_name":"Bouvry, P","first_name":"P","last_name":"Bouvry"},{"first_name":"Moral P","last_name":"Del","full_name":"Del, Moral P"},{"first_name":"P","last_name":"Legrand","full_name":"Legrand, P"}],"volume":175,"user_id":"15504","citation":{"bibtex":"@inbook{Trautmann_Rudolph_Dominguez-Medina_Schütze_2013, series={Advances in Intelligent Systems and Computing}, title={Finding Evenly Spaced Pareto Fronts for Three-Objective Optimization Problems}, volume={175}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-31519-0_6\">10.1007/978-3-642-31519-0_6</a>}, booktitle={EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II}, publisher={Springer Berlin Heidelberg}, author={Trautmann, Heike and Rudolph, G and Dominguez-Medina, C and Schütze, O}, editor={Schütze, O and Coello, Coello CA and Tantar, A and Tantar, E and Bouvry, P and Del, Moral P and Legrand, P}, year={2013}, pages={89–105}, collection={Advances in Intelligent Systems and Computing} }","ama":"Trautmann H, Rudolph G, Dominguez-Medina C, Schütze O. Finding Evenly Spaced Pareto Fronts for Three-Objective Optimization Problems. In: Schütze O, Coello CC, Tantar A, et al., eds. <i>EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II</i>. Vol 175. Advances in Intelligent Systems and Computing. Springer Berlin Heidelberg; 2013:89–105. doi:<a href=\"https://doi.org/10.1007/978-3-642-31519-0_6\">10.1007/978-3-642-31519-0_6</a>","mla":"Trautmann, Heike, et al. “Finding Evenly Spaced Pareto Fronts for Three-Objective Optimization Problems.” <i>EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II</i>, edited by O Schütze et al., vol. 175, Springer Berlin Heidelberg, 2013, pp. 89–105, doi:<a href=\"https://doi.org/10.1007/978-3-642-31519-0_6\">10.1007/978-3-642-31519-0_6</a>.","chicago":"Trautmann, Heike, G Rudolph, C Dominguez-Medina, and O Schütze. “Finding Evenly Spaced Pareto Fronts for Three-Objective Optimization Problems.” In <i>EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II</i>, edited by O Schütze, Coello CA Coello, A Tantar, E Tantar, P Bouvry, Moral P Del, and P Legrand, 175:89–105. Advances in Intelligent Systems and Computing. Springer Berlin Heidelberg, 2013. <a href=\"https://doi.org/10.1007/978-3-642-31519-0_6\">https://doi.org/10.1007/978-3-642-31519-0_6</a>.","short":"H. Trautmann, G. Rudolph, C. Dominguez-Medina, O. Schütze, in: O. Schütze, C.C. Coello, A. Tantar, E. Tantar, P. Bouvry, M.P. Del, P. Legrand (Eds.), EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II, Springer Berlin Heidelberg, 2013, pp. 89–105.","ieee":"H. Trautmann, G. Rudolph, C. Dominguez-Medina, and O. Schütze, “Finding Evenly Spaced Pareto Fronts for Three-Objective Optimization Problems,” in <i>EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II</i>, vol. 175, O. Schütze, C. C. Coello, A. Tantar, E. Tantar, P. Bouvry, M. P. Del, and P. Legrand, Eds. Springer Berlin Heidelberg, 2013, pp. 89–105.","apa":"Trautmann, H., Rudolph, G., Dominguez-Medina, C., &#38; Schütze, O. (2013). Finding Evenly Spaced Pareto Fronts for Three-Objective Optimization Problems. In O. Schütze, C. C. Coello, A. Tantar, E. Tantar, P. Bouvry, M. P. Del, &#38; P. Legrand (Eds.), <i>EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II</i> (Vol. 175, pp. 89–105). Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-31519-0_6\">https://doi.org/10.1007/978-3-642-31519-0_6</a>"},"author":[{"full_name":"Trautmann, Heike","first_name":"Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","id":"100740"},{"first_name":"G","last_name":"Rudolph","full_name":"Rudolph, G"},{"full_name":"Dominguez-Medina, C","first_name":"C","last_name":"Dominguez-Medina"},{"first_name":"O","last_name":"Schütze","full_name":"Schütze, O"}],"publication_identifier":{"isbn":["978-3-642-31518-3"]},"title":"Finding Evenly Spaced Pareto Fronts for Three-Objective Optimization Problems","year":"2013","intvolume":"       175","date_updated":"2023-10-16T13:45:12Z","language":[{"iso":"eng"}],"series_title":"Advances in Intelligent Systems and Computing","doi":"10.1007/978-3-642-31519-0_6","publication":"EVOLVE — A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation II","abstract":[{"text":"The averaged Hausdorff distance Δ p is a performance indicator in multi-objective evolutionary optimization which simultaneously takes into account proximity to the true Pareto front and uniform spread of solutions. Recently, the multi-objective evolutionary algorithm Δ p -EMOA was introduced which successfully generates evenly spaced Pareto front approximations for bi-objective problems by integrating an external archiving strategy into the SMS-EMOA based on Δ p . In this work a conceptual generalization of the Δ p -EMOA for higher objective space dimensions is presented and experimentally compared to state-of-the art EMOA as well as specialized EMOA variants on three-dimensional optimization problems.","lang":"eng"}],"date_created":"2023-08-04T15:38:25Z","department":[{"_id":"34"},{"_id":"819"}],"type":"book_chapter"},{"citation":{"mla":"Rudolph, G., et al. “Evenly Spaced Pareto Front Approximations for Tricriteria Problems Based on Triangulation.” <i>Evolutionary Multi-Criterion Optimization — 7$^th$ International Conference, EMO 2013, Sheffield, UK, Proceedings</i>, edited by RC Purshouse et al., vol. 7811, Springer, 2013, pp. 443–458, doi:<a href=\"https://doi.org/10.1007/978-3-642-37140-0_34\">https://doi.org/10.1007/978-3-642-37140-0_34</a>.","bibtex":"@inproceedings{Rudolph_Trautmann_Sengupta_Schütze_2013, series={Lecture Notes in Computer Science}, title={Evenly Spaced Pareto Front Approximations for Tricriteria Problems Based on Triangulation}, volume={7811}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-37140-0_34\">https://doi.org/10.1007/978-3-642-37140-0_34</a>}, booktitle={Evolutionary Multi-Criterion Optimization — 7$^th$ International Conference, EMO 2013, Sheffield, UK, Proceedings}, publisher={Springer}, author={Rudolph, G and Trautmann, Heike and Sengupta, S and Schütze, O}, editor={Purshouse, RC and Fleming, PJ and Fonseca, CM and Greco, S and Shaw, J}, year={2013}, pages={443–458}, collection={Lecture Notes in Computer Science} }","ama":"Rudolph G, Trautmann H, Sengupta S, Schütze O. Evenly Spaced Pareto Front Approximations for Tricriteria Problems Based on Triangulation. In: Purshouse R, Fleming P, Fonseca C, Greco S, Shaw J, eds. <i>Evolutionary Multi-Criterion Optimization — 7$^th$ International Conference, EMO 2013, Sheffield, UK, Proceedings</i>. Vol 7811. Lecture Notes in Computer Science. Springer; 2013:443–458. doi:<a href=\"https://doi.org/10.1007/978-3-642-37140-0_34\">https://doi.org/10.1007/978-3-642-37140-0_34</a>","ieee":"G. Rudolph, H. Trautmann, S. Sengupta, and O. Schütze, “Evenly Spaced Pareto Front Approximations for Tricriteria Problems Based on Triangulation,” in <i>Evolutionary Multi-Criterion Optimization — 7$^th$ International Conference, EMO 2013, Sheffield, UK, Proceedings</i>, 2013, vol. 7811, pp. 443–458, doi: <a href=\"https://doi.org/10.1007/978-3-642-37140-0_34\">https://doi.org/10.1007/978-3-642-37140-0_34</a>.","apa":"Rudolph, G., Trautmann, H., Sengupta, S., &#38; Schütze, O. (2013). Evenly Spaced Pareto Front Approximations for Tricriteria Problems Based on Triangulation. In R. Purshouse, P. Fleming, C. Fonseca, S. Greco, &#38; J. Shaw (Eds.), <i>Evolutionary Multi-Criterion Optimization — 7$^th$ International Conference, EMO 2013, Sheffield, UK, Proceedings</i> (Vol. 7811, pp. 443–458). Springer. <a href=\"https://doi.org/10.1007/978-3-642-37140-0_34\">https://doi.org/10.1007/978-3-642-37140-0_34</a>","chicago":"Rudolph, G, Heike Trautmann, S Sengupta, and O Schütze. “Evenly Spaced Pareto Front Approximations for Tricriteria Problems Based on Triangulation.” In <i>Evolutionary Multi-Criterion Optimization — 7$^th$ International Conference, EMO 2013, Sheffield, UK, Proceedings</i>, edited by RC Purshouse, PJ Fleming, CM Fonseca, S Greco, and J Shaw, 7811:443–458. Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-37140-0_34\">https://doi.org/10.1007/978-3-642-37140-0_34</a>.","short":"G. Rudolph, H. Trautmann, S. Sengupta, O. Schütze, in: R. Purshouse, P. Fleming, C. Fonseca, S. Greco, J. Shaw (Eds.), Evolutionary Multi-Criterion Optimization — 7$^th$ International Conference, EMO 2013, Sheffield, UK, Proceedings, Springer, 2013, pp. 443–458."},"status":"public","page":"443–458","_id":"46390","publisher":"Springer","user_id":"15504","editor":[{"full_name":"Purshouse, RC","last_name":"Purshouse","first_name":"RC"},{"full_name":"Fleming, PJ","last_name":"Fleming","first_name":"PJ"},{"first_name":"CM","last_name":"Fonseca","full_name":"Fonseca, CM"},{"first_name":"S","last_name":"Greco","full_name":"Greco, S"},{"full_name":"Shaw, J","last_name":"Shaw","first_name":"J"}],"volume":7811,"publication":"Evolutionary Multi-Criterion Optimization — 7$^th$ International Conference, EMO 2013, Sheffield, UK, Proceedings","abstract":[{"lang":"eng","text":"In some technical applications like multiobjective online control an evenly spaced approximation of the Pareto front is desired. Since standard evolutionary multiobjective optimization (EMO) algorithms have not been designed for that kind of approximation we propose an archive-based plug-in method that builds an evenly spaced approximation using averaged Hausdorff measure between archive and reference front. In case of three objectives this reference font is constructed from a triangulated approximation of the Pareto front from a previous experiment. The plug-in can be deployed in online or offline mode for any kind of EMO algorithm."}],"date_created":"2023-08-04T15:43:38Z","type":"conference","department":[{"_id":"34"},{"_id":"819"}],"year":"2013","title":"Evenly Spaced Pareto Front Approximations for Tricriteria Problems Based on Triangulation","author":[{"full_name":"Rudolph, G","first_name":"G","last_name":"Rudolph"},{"id":"100740","full_name":"Trautmann, Heike","orcid":"0000-0002-9788-8282","first_name":"Heike","last_name":"Trautmann"},{"first_name":"S","last_name":"Sengupta","full_name":"Sengupta, S"},{"full_name":"Schütze, O","first_name":"O","last_name":"Schütze"}],"date_updated":"2023-10-16T13:46:35Z","intvolume":"      7811","series_title":"Lecture Notes in Computer Science","language":[{"iso":"eng"}],"doi":"https://doi.org/10.1007/978-3-642-37140-0_34"},{"place":"New York, NY, USA","date_created":"2023-08-04T15:45:26Z","department":[{"_id":"34"},{"_id":"819"}],"type":"conference","citation":{"bibtex":"@inproceedings{Sosa-Hernandez_Schütze_Rudoph_Trautmann_2013, place={New York, NY, USA}, series={GECCO ’13 Companion}, title={Directed Search Method for Indicator-based Multi-objective Evolutionary Algorithms}, DOI={<a href=\"https://doi.org/10.1145/2464576.2482756\">10.1145/2464576.2482756</a>}, booktitle={Proceeding of the Fifteenth Annual Conference Companion on Genetic and Evolutionary Computation Conference Companion}, publisher={ACM}, author={Sosa-Hernandez, VA and Schütze, O and Rudoph, G and Trautmann, Heike}, year={2013}, pages={1699–1702}, collection={GECCO ’13 Companion} }","ama":"Sosa-Hernandez V, Schütze O, Rudoph G, Trautmann H. Directed Search Method for Indicator-based Multi-objective Evolutionary Algorithms. In: <i>Proceeding of the Fifteenth Annual Conference Companion on Genetic and Evolutionary Computation Conference Companion</i>. GECCO ’13 Companion. ACM; 2013:1699–1702. doi:<a href=\"https://doi.org/10.1145/2464576.2482756\">10.1145/2464576.2482756</a>","mla":"Sosa-Hernandez, VA, et al. “Directed Search Method for Indicator-Based Multi-Objective Evolutionary Algorithms.” <i>Proceeding of the Fifteenth Annual Conference Companion on Genetic and Evolutionary Computation Conference Companion</i>, ACM, 2013, pp. 1699–1702, doi:<a href=\"https://doi.org/10.1145/2464576.2482756\">10.1145/2464576.2482756</a>.","short":"V. Sosa-Hernandez, O. Schütze, G. Rudoph, H. Trautmann, in: Proceeding of the Fifteenth Annual Conference Companion on Genetic and Evolutionary Computation Conference Companion, ACM, New York, NY, USA, 2013, pp. 1699–1702.","chicago":"Sosa-Hernandez, VA, O Schütze, G Rudoph, and Heike Trautmann. “Directed Search Method for Indicator-Based Multi-Objective Evolutionary Algorithms.” In <i>Proceeding of the Fifteenth Annual Conference Companion on Genetic and Evolutionary Computation Conference Companion</i>, 1699–1702. GECCO ’13 Companion. New York, NY, USA: ACM, 2013. <a href=\"https://doi.org/10.1145/2464576.2482756\">https://doi.org/10.1145/2464576.2482756</a>.","ieee":"V. Sosa-Hernandez, O. Schütze, G. Rudoph, and H. Trautmann, “Directed Search Method for Indicator-based Multi-objective Evolutionary Algorithms,” in <i>Proceeding of the Fifteenth Annual Conference Companion on Genetic and Evolutionary Computation Conference Companion</i>, 2013, pp. 1699–1702, doi: <a href=\"https://doi.org/10.1145/2464576.2482756\">10.1145/2464576.2482756</a>.","apa":"Sosa-Hernandez, V., Schütze, O., Rudoph, G., &#38; Trautmann, H. (2013). Directed Search Method for Indicator-based Multi-objective Evolutionary Algorithms. <i>Proceeding of the Fifteenth Annual Conference Companion on Genetic and Evolutionary Computation Conference Companion</i>, 1699–1702. <a href=\"https://doi.org/10.1145/2464576.2482756\">https://doi.org/10.1145/2464576.2482756</a>"},"publication":"Proceeding of the Fifteenth Annual Conference Companion on Genetic and Evolutionary Computation Conference Companion","abstract":[{"text":"Indicator based evolutionary algorithms have caught the interest of many researchers for the treatment of multi-objective optimization problems in the recent past since they deliver the desired approximation of the solution set and due to a usually better performance compared to dominance based algorithms. Nevertheless, these methods still suffer the drawback that many function evaluations are required to obtain a suitable representation of the solution set. The aim of this study is to present the Directed Search (DS) Method as local searcher within global indicator based optimization algorithms. For this, we will present the DS in the context of hypervolume maximization leading to both a new local search algorithm and a new memetic algorithm. Further, we will present first attempts to adapt the DS to a class of parameter dependent problems.","lang":"eng"}],"publisher":"ACM","_id":"46391","series_title":"GECCO ’13 Companion","language":[{"iso":"eng"}],"page":"1699–1702","doi":"10.1145/2464576.2482756","user_id":"15504","author":[{"last_name":"Sosa-Hernandez","first_name":"VA","full_name":"Sosa-Hernandez, VA"},{"full_name":"Schütze, O","last_name":"Schütze","first_name":"O"},{"last_name":"Rudoph","first_name":"G","full_name":"Rudoph, G"},{"full_name":"Trautmann, Heike","orcid":"0000-0002-9788-8282","first_name":"Heike","last_name":"Trautmann","id":"100740"}],"title":"Directed Search Method for Indicator-based Multi-objective Evolutionary Algorithms","status":"public","year":"2013","date_updated":"2023-10-16T13:46:54Z"},{"department":[{"_id":"34"},{"_id":"819"}],"type":"conference","date_created":"2023-08-04T15:40:15Z","place":"Cancun, Mexico","abstract":[{"text":"Here we address the problem of computing finite size Hausdorff approximations of the Pareto front of four-objective optimization problems by means of evolutionary computing. Since many applications desire an approximation evenly spread along the Pareto front and approximations that are good in the Hausdorff sense are typically evenly spread along the Pareto front we consider three different evolutionary multi-objective algorithms tailored to that purpose, where two of them are based on the Part and Selection Algorithm (PSA). Finally, we present some numerical results indicating the strength of the novel methods.","lang":"eng"}],"citation":{"short":"C. Dominguez-Medina, G. Rudolph, O. Schütze, H. Trautmann, in: Proceedings of the 2013 IEEE Congress on Evolutionary Computation (CEC), Cancun, Mexico, 2013, pp. 3190–3197.","chicago":"Dominguez-Medina, C, G Rudolph, O Schütze, and Heike Trautmann. “Evenly Spaced Pareto Fronts of Quad-Objective Problems Using PSA Partitioning Technique.” In <i>Proceedings of the 2013 IEEE Congress on Evolutionary Computation (CEC)</i>, 3190–3197. Cancun, Mexico, 2013. <a href=\"https://doi.org/10.1109/CEC.2013.6557960\">https://doi.org/10.1109/CEC.2013.6557960</a>.","apa":"Dominguez-Medina, C., Rudolph, G., Schütze, O., &#38; Trautmann, H. (2013). Evenly spaced Pareto fronts of quad-objective problems using PSA partitioning technique. <i>Proceedings of the 2013 IEEE Congress on Evolutionary Computation (CEC)</i>, 3190–3197. <a href=\"https://doi.org/10.1109/CEC.2013.6557960\">https://doi.org/10.1109/CEC.2013.6557960</a>","ieee":"C. Dominguez-Medina, G. Rudolph, O. Schütze, and H. Trautmann, “Evenly spaced Pareto fronts of quad-objective problems using PSA partitioning technique,” in <i>Proceedings of the 2013 IEEE Congress on Evolutionary Computation (CEC)</i>, 2013, pp. 3190–3197, doi: <a href=\"https://doi.org/10.1109/CEC.2013.6557960\">https://doi.org/10.1109/CEC.2013.6557960</a>.","ama":"Dominguez-Medina C, Rudolph G, Schütze O, Trautmann H. Evenly spaced Pareto fronts of quad-objective problems using PSA partitioning technique. In: <i>Proceedings of the 2013 IEEE Congress on Evolutionary Computation (CEC)</i>. ; 2013:3190–3197. doi:<a href=\"https://doi.org/10.1109/CEC.2013.6557960\">https://doi.org/10.1109/CEC.2013.6557960</a>","bibtex":"@inproceedings{Dominguez-Medina_Rudolph_Schütze_Trautmann_2013, place={Cancun, Mexico}, title={Evenly spaced Pareto fronts of quad-objective problems using PSA partitioning technique}, DOI={<a href=\"https://doi.org/10.1109/CEC.2013.6557960\">https://doi.org/10.1109/CEC.2013.6557960</a>}, booktitle={Proceedings of the 2013 IEEE Congress on Evolutionary Computation (CEC)}, author={Dominguez-Medina, C and Rudolph, G and Schütze, O and Trautmann, Heike}, year={2013}, pages={3190–3197} }","mla":"Dominguez-Medina, C., et al. “Evenly Spaced Pareto Fronts of Quad-Objective Problems Using PSA Partitioning Technique.” <i>Proceedings of the 2013 IEEE Congress on Evolutionary Computation (CEC)</i>, 2013, pp. 3190–3197, doi:<a href=\"https://doi.org/10.1109/CEC.2013.6557960\">https://doi.org/10.1109/CEC.2013.6557960</a>."},"publication":"Proceedings of the 2013 IEEE Congress on Evolutionary Computation (CEC)","user_id":"15504","doi":"https://doi.org/10.1109/CEC.2013.6557960","_id":"46387","language":[{"iso":"eng"}],"page":"3190–3197","date_updated":"2023-10-16T13:45:34Z","author":[{"last_name":"Dominguez-Medina","first_name":"C","full_name":"Dominguez-Medina, C"},{"first_name":"G","last_name":"Rudolph","full_name":"Rudolph, G"},{"full_name":"Schütze, O","last_name":"Schütze","first_name":"O"},{"full_name":"Trautmann, Heike","first_name":"Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282","id":"100740"}],"status":"public","title":"Evenly spaced Pareto fronts of quad-objective problems using PSA partitioning technique","year":"2013"},{"department":[{"_id":"34"},{"_id":"819"}],"type":"journal_article","date_created":"2023-08-04T15:50:03Z","abstract":[{"lang":"eng","text":"In multiobjective optimization, the identification of practically relevant solutions on the Pareto-optimal front is an important research topic. Desirability functions (DFs) allow the preferences of the decision maker to be specified in an intuitive way. Recently, it has been shown for continuous optimization problems that an a priori transformation of the objectives by means of DFs can be used to focus the search of a hypervolume-based evolutionary algorithm on the desired part of the front. In many-objective optimization, however, the computational complexity of the hypervolume can become a crucial part. Thus, an alternative to this approach will be presented in this paper. The new algorithm operates in the untransformed objective space, but the desirability index (DI), that is, a DF-based scalarization, will be used as the second-level selection criterion in the non-dominated sorting. The diversity and uniform distribution of the resulting approximation are ensured by the use of an external archive. In the experiments, different preferences are specified as DFs, and their effects are investigated. It is shown that trade-off solutions are generated in the desired regions of the Pareto-optimal front and with a density adaptive to the DI. The efficiency of the approach with respect to increasing objective space dimension is also analysed using scalable test functions. The convergence speed is superior to other set-based and preference-based evolutionary multiobjective algorithms while the approach is of low computational complexity due to cheap DI evaluations. Copyright © 2013 John Wiley & Sons, Ltd."}],"citation":{"short":"H. Trautmann, T. Wagner, D. Biermann, C. Weihs, Journal of Multi-Criteria Decision Analysis 20 (2013) 319–337.","chicago":"Trautmann, Heike, T Wagner, D Biermann, and C Weihs. “Indicator-Based Selection in Evolutionary Multiobjective Optimization Algorithms Based On the Desirability Index.” <i>Journal of Multi-Criteria Decision Analysis</i> 20, no. 5–6 (2013): 319–337. <a href=\"https://doi.org/10.1002/mcda.1503\">https://doi.org/10.1002/mcda.1503</a>.","ieee":"H. Trautmann, T. Wagner, D. Biermann, and C. Weihs, “Indicator-based Selection in Evolutionary Multiobjective Optimization Algorithms Based On the Desirability Index,” <i>Journal of Multi-Criteria Decision Analysis</i>, vol. 20, no. 5–6, pp. 319–337, 2013, doi: <a href=\"https://doi.org/10.1002/mcda.1503\">https://doi.org/10.1002/mcda.1503</a>.","apa":"Trautmann, H., Wagner, T., Biermann, D., &#38; Weihs, C. (2013). Indicator-based Selection in Evolutionary Multiobjective Optimization Algorithms Based On the Desirability Index. <i>Journal of Multi-Criteria Decision Analysis</i>, <i>20</i>(5–6), 319–337. <a href=\"https://doi.org/10.1002/mcda.1503\">https://doi.org/10.1002/mcda.1503</a>","bibtex":"@article{Trautmann_Wagner_Biermann_Weihs_2013, title={Indicator-based Selection in Evolutionary Multiobjective Optimization Algorithms Based On the Desirability Index}, volume={20}, DOI={<a href=\"https://doi.org/10.1002/mcda.1503\">https://doi.org/10.1002/mcda.1503</a>}, number={5–6}, journal={Journal of Multi-Criteria Decision Analysis}, author={Trautmann, Heike and Wagner, T and Biermann, D and Weihs, C}, year={2013}, pages={319–337} }","ama":"Trautmann H, Wagner T, Biermann D, Weihs C. Indicator-based Selection in Evolutionary Multiobjective Optimization Algorithms Based On the Desirability Index. <i>Journal of Multi-Criteria Decision Analysis</i>. 2013;20(5-6):319–337. doi:<a href=\"https://doi.org/10.1002/mcda.1503\">https://doi.org/10.1002/mcda.1503</a>","mla":"Trautmann, Heike, et al. “Indicator-Based Selection in Evolutionary Multiobjective Optimization Algorithms Based On the Desirability Index.” <i>Journal of Multi-Criteria Decision Analysis</i>, vol. 20, no. 5–6, 2013, pp. 319–337, doi:<a href=\"https://doi.org/10.1002/mcda.1503\">https://doi.org/10.1002/mcda.1503</a>."},"issue":"5-6","publication":"Journal of Multi-Criteria Decision Analysis","volume":20,"user_id":"15504","doi":"https://doi.org/10.1002/mcda.1503","_id":"46395","language":[{"iso":"eng"}],"page":"319–337","intvolume":"        20","date_updated":"2023-10-16T13:48:31Z","author":[{"id":"100740","orcid":"0000-0002-9788-8282","first_name":"Heike","last_name":"Trautmann","full_name":"Trautmann, Heike"},{"last_name":"Wagner","first_name":"T","full_name":"Wagner, T"},{"last_name":"Biermann","first_name":"D","full_name":"Biermann, D"},{"full_name":"Weihs, C","last_name":"Weihs","first_name":"C"}],"title":"Indicator-based Selection in Evolutionary Multiobjective Optimization Algorithms Based On the Desirability Index","year":"2013","status":"public"},{"abstract":[{"lang":"eng","text":"In multi-objective optimization, set-based performance indicators have become the state of the art for assessing the quality of Pareto front approximations. As a consequence, they are also more and more used within the design of multi-objective optimization algorithms. The R2 and the Hypervolume (HV) indicator represent two popular examples. In order to understand the behavior and the approximations preferred by these indicators and algorithms, a comprehensive knowledge of the indicator’s properties is required. Whereas this knowledge is available for the HV, we presented a first approach in this direction for the R2 indicator just recently. In this paper, we build upon this knowledge and enhance the considerations with respect to the integration of preferences into the R2 indicator. More specifically, we analyze the effect of the reference point, the domain of the weights, and the distribution of weight vectors on the optimization of $\\mu$ solutions with respect to the R2 indicator. By means of theoretical findings and empirical evidence, we show the potentials of these three possibilities using the optimal distribution of $\\mu$ solutions for exemplary setups."}],"publication":"Evolutionary Multi-Criterion Optimization","citation":{"ama":"Wagner T, Trautmann H, Brockhoff D. Preference Articulation by Means of the R2 Indicator. In: Purshouse RC, Fleming PJ, Fonseca CM, Greco S, Shaw J, eds. <i>Evolutionary Multi-Criterion Optimization</i>. Springer Berlin Heidelberg; 2013:81–95.","bibtex":"@inproceedings{Wagner_Trautmann_Brockhoff_2013, place={Berlin, Heidelberg}, title={Preference Articulation by Means of the R2 Indicator}, booktitle={Evolutionary Multi-Criterion Optimization}, publisher={Springer Berlin Heidelberg}, author={Wagner, Tobias and Trautmann, Heike and Brockhoff, Dimo}, editor={Purshouse, Robin C. and Fleming, Peter J. and Fonseca, Carlos M. and Greco, Salvatore and Shaw, Jane}, year={2013}, pages={81–95} }","mla":"Wagner, Tobias, et al. “Preference Articulation by Means of the R2 Indicator.” <i>Evolutionary Multi-Criterion Optimization</i>, edited by Robin C. Purshouse et al., Springer Berlin Heidelberg, 2013, pp. 81–95.","chicago":"Wagner, Tobias, Heike Trautmann, and Dimo Brockhoff. “Preference Articulation by Means of the R2 Indicator.” In <i>Evolutionary Multi-Criterion Optimization</i>, edited by Robin C. Purshouse, Peter J. Fleming, Carlos M. Fonseca, Salvatore Greco, and Jane Shaw, 81–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.","short":"T. Wagner, H. Trautmann, D. Brockhoff, in: R.C. Purshouse, P.J. Fleming, C.M. Fonseca, S. Greco, J. Shaw (Eds.), Evolutionary Multi-Criterion Optimization, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 81–95.","apa":"Wagner, T., Trautmann, H., &#38; Brockhoff, D. (2013). Preference Articulation by Means of the R2 Indicator. In R. C. Purshouse, P. J. Fleming, C. M. Fonseca, S. Greco, &#38; J. Shaw (Eds.), <i>Evolutionary Multi-Criterion Optimization</i> (pp. 81–95). Springer Berlin Heidelberg.","ieee":"T. Wagner, H. Trautmann, and D. Brockhoff, “Preference Articulation by Means of the R2 Indicator,” in <i>Evolutionary Multi-Criterion Optimization</i>, 2013, pp. 81–95."},"type":"conference","department":[{"_id":"34"},{"_id":"819"}],"place":"Berlin, Heidelberg","date_created":"2023-08-04T15:47:49Z","date_updated":"2023-10-16T13:47:58Z","title":"Preference Articulation by Means of the R2 Indicator","status":"public","year":"2013","author":[{"full_name":"Wagner, Tobias","last_name":"Wagner","first_name":"Tobias"},{"id":"100740","full_name":"Trautmann, Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike"},{"last_name":"Brockhoff","first_name":"Dimo","full_name":"Brockhoff, Dimo"}],"publication_identifier":{"isbn":["978-3-642-37140-0"]},"user_id":"15504","editor":[{"last_name":"Purshouse","first_name":"Robin C.","full_name":"Purshouse, Robin C."},{"full_name":"Fleming, Peter J.","last_name":"Fleming","first_name":"Peter J."},{"last_name":"Fonseca","first_name":"Carlos M.","full_name":"Fonseca, Carlos M."},{"full_name":"Greco, Salvatore","last_name":"Greco","first_name":"Salvatore"},{"full_name":"Shaw, Jane","first_name":"Jane","last_name":"Shaw"}],"page":"81–95","language":[{"iso":"eng"}],"_id":"46393","publisher":"Springer Berlin Heidelberg"},{"citation":{"bibtex":"@inproceedings{Trautmann_Wagner_Brockhoff_2013, place={Berlin, Heidelberg}, title={R2-EMOA: Focused Multiobjective Search Using R2-Indicator-Based Selection}, booktitle={Learning and Intelligent Optimization}, publisher={Springer Berlin Heidelberg}, author={Trautmann, Heike and Wagner, Tobias and Brockhoff, Dimo}, editor={Nicosia, Giuseppe and Pardalos, Panos}, year={2013}, pages={70–74} }","ama":"Trautmann H, Wagner T, Brockhoff D. R2-EMOA: Focused Multiobjective Search Using R2-Indicator-Based Selection. In: Nicosia G, Pardalos P, eds. <i>Learning and Intelligent Optimization</i>. Springer Berlin Heidelberg; 2013:70–74.","mla":"Trautmann, Heike, et al. “R2-EMOA: Focused Multiobjective Search Using R2-Indicator-Based Selection.” <i>Learning and Intelligent Optimization</i>, edited by Giuseppe Nicosia and Panos Pardalos, Springer Berlin Heidelberg, 2013, pp. 70–74.","chicago":"Trautmann, Heike, Tobias Wagner, and Dimo Brockhoff. “R2-EMOA: Focused Multiobjective Search Using R2-Indicator-Based Selection.” In <i>Learning and Intelligent Optimization</i>, edited by Giuseppe Nicosia and Panos Pardalos, 70–74. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.","short":"H. Trautmann, T. Wagner, D. Brockhoff, in: G. Nicosia, P. Pardalos (Eds.), Learning and Intelligent Optimization, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 70–74.","ieee":"H. Trautmann, T. Wagner, and D. Brockhoff, “R2-EMOA: Focused Multiobjective Search Using R2-Indicator-Based Selection,” in <i>Learning and Intelligent Optimization</i>, 2013, pp. 70–74.","apa":"Trautmann, H., Wagner, T., &#38; Brockhoff, D. (2013). R2-EMOA: Focused Multiobjective Search Using R2-Indicator-Based Selection. In G. Nicosia &#38; P. Pardalos (Eds.), <i>Learning and Intelligent Optimization</i> (pp. 70–74). Springer Berlin Heidelberg."},"publication":"Learning and Intelligent Optimization","abstract":[{"text":"An indicator-based evolutionary multiobjective optimization algorithm (EMOA) is introduced which incorporates the contribution to the unary R2-indicator as the secondary selection criterion. First experiments indicate that the R2-EMOA accurately approximates the Pareto front of the considered continuous multiobjective optimization problems. Furthermore, decision makers’ preferences can be included by adjusting the weight vector distributions of the indicator which results in a focused search behavior.","lang":"eng"}],"date_created":"2023-08-04T15:47:00Z","place":"Berlin, Heidelberg","department":[{"_id":"34"},{"_id":"819"}],"type":"conference","author":[{"id":"100740","last_name":"Trautmann","orcid":"0000-0002-9788-8282","first_name":"Heike","full_name":"Trautmann, Heike"},{"last_name":"Wagner","first_name":"Tobias","full_name":"Wagner, Tobias"},{"full_name":"Brockhoff, Dimo","last_name":"Brockhoff","first_name":"Dimo"}],"publication_identifier":{"isbn":["978-3-642-44973-4"]},"title":"R2-EMOA: Focused Multiobjective Search Using R2-Indicator-Based Selection","year":"2013","status":"public","date_updated":"2023-10-16T13:47:41Z","_id":"46392","language":[{"iso":"eng"}],"publisher":"Springer Berlin Heidelberg","page":"70–74","editor":[{"full_name":"Nicosia, Giuseppe","first_name":"Giuseppe","last_name":"Nicosia"},{"last_name":"Pardalos","first_name":"Panos","full_name":"Pardalos, Panos"}],"user_id":"15504"},{"citation":{"short":"O. Mersmann, B. Bischl, H. Trautmann, M. Wagner, J. Bossek, F. Neumann, Annals of Mathematics and Artificial Intelligence 69 (2013) 151–182.","chicago":"Mersmann, Olaf, Bernd Bischl, Heike Trautmann, Markus Wagner, Jakob Bossek, and Frank Neumann. “A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesperson Problem.” <i>Annals of Mathematics and Artificial Intelligence</i> 69, no. 2 (2013): 151–182. <a href=\"https://doi.org/10.1007/s10472-013-9341-2\">https://doi.org/10.1007/s10472-013-9341-2</a>.","ieee":"O. Mersmann, B. Bischl, H. Trautmann, M. Wagner, J. Bossek, and F. Neumann, “A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesperson Problem,” <i>Annals of Mathematics and Artificial Intelligence</i>, vol. 69, no. 2, pp. 151–182, 2013, doi: <a href=\"https://doi.org/10.1007/s10472-013-9341-2\">10.1007/s10472-013-9341-2</a>.","apa":"Mersmann, O., Bischl, B., Trautmann, H., Wagner, M., Bossek, J., &#38; Neumann, F. (2013). A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesperson Problem. <i>Annals of Mathematics and Artificial Intelligence</i>, <i>69</i>(2), 151–182. <a href=\"https://doi.org/10.1007/s10472-013-9341-2\">https://doi.org/10.1007/s10472-013-9341-2</a>","bibtex":"@article{Mersmann_Bischl_Trautmann_Wagner_Bossek_Neumann_2013, title={A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesperson Problem}, volume={69}, DOI={<a href=\"https://doi.org/10.1007/s10472-013-9341-2\">10.1007/s10472-013-9341-2</a>}, number={2}, journal={Annals of Mathematics and Artificial Intelligence}, author={Mersmann, Olaf and Bischl, Bernd and Trautmann, Heike and Wagner, Markus and Bossek, Jakob and Neumann, Frank}, year={2013}, pages={151–182} }","ama":"Mersmann O, Bischl B, Trautmann H, Wagner M, Bossek J, Neumann F. A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesperson Problem. <i>Annals of Mathematics and Artificial Intelligence</i>. 2013;69(2):151–182. doi:<a href=\"https://doi.org/10.1007/s10472-013-9341-2\">10.1007/s10472-013-9341-2</a>","mla":"Mersmann, Olaf, et al. “A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesperson Problem.” <i>Annals of Mathematics and Artificial Intelligence</i>, vol. 69, no. 2, 2013, pp. 151–182, doi:<a href=\"https://doi.org/10.1007/s10472-013-9341-2\">10.1007/s10472-013-9341-2</a>."},"status":"public","page":"151–182","_id":"48889","user_id":"102979","volume":69,"publication":"Annals of Mathematics and Artificial Intelligence","issue":"2","abstract":[{"lang":"eng","text":"Meta-heuristics are frequently used to tackle NP-hard combinatorial optimization problems. With this paper we contribute to the understanding of the success of 2-opt based local search algorithms for solving the traveling salesperson problem (TSP). Although 2-opt is widely used in practice, it is hard to understand its success from a theoretical perspective. We take a statistical approach and examine the features of TSP instances that make the problem either hard or easy to solve. As a measure of problem difficulty for 2-opt we use the approximation ratio that it achieves on a given instance. Our investigations point out important features that make TSP instances hard or easy to be approximated by 2-opt."}],"date_created":"2023-11-14T15:58:59Z","keyword":["2-opt","90B06","Classification","Feature selection","MARS","TSP"],"type":"journal_article","department":[{"_id":"819"}],"year":"2013","title":"A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesperson Problem","author":[{"full_name":"Mersmann, Olaf","first_name":"Olaf","last_name":"Mersmann"},{"full_name":"Bischl, Bernd","first_name":"Bernd","last_name":"Bischl"},{"first_name":"Heike","last_name":"Trautmann","full_name":"Trautmann, Heike"},{"full_name":"Wagner, Markus","last_name":"Wagner","first_name":"Markus"},{"id":"102979","first_name":"Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668","full_name":"Bossek, Jakob"},{"first_name":"Frank","last_name":"Neumann","full_name":"Neumann, Frank"}],"publication_identifier":{"issn":["1012-2443"]},"date_updated":"2023-12-13T10:50:41Z","intvolume":"        69","language":[{"iso":"eng"}],"doi":"10.1007/s10472-013-9341-2"},{"abstract":[{"lang":"eng","text":"Meta-heuristics are frequently used to tackle NP-hard combinatorial optimization problems. With this paper we contribute to the understanding of the success of 2-opt based local search algorithms for solving the traveling salesperson problem (TSP). Although 2-opt is widely used in practice, it is hard to understand its success from a theoretical perspective. We take a statistical approach and examine the features of TSP instances that make the problem either hard or easy to solve. As a measure of problem difficulty for 2-opt we use the approximation ratio that it achieves on a given instance. Our investigations point out important features that make TSP instances hard or easy to be approximated by 2-opt."}],"citation":{"ieee":"O. Mersmann, B. Bischl, H. Trautmann, M. Wagner, J. Bossek, and F. Neumann, “A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem,” <i>Annals of Mathematics and Artificial Intelligence</i>, vol. 69, pp. 151–182, 2013.","mla":"Mersmann, O., et al. “A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem.” <i>Annals of Mathematics and Artificial Intelligence</i>, vol. 69, 2013, pp. 151–182.","apa":"Mersmann, O., Bischl, B., Trautmann, H., Wagner, M., Bossek, J., &#38; Neumann, F. (2013). A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem. <i>Annals of Mathematics and Artificial Intelligence</i>, <i>69</i>, 151–182.","bibtex":"@article{Mersmann_Bischl_Trautmann_Wagner_Bossek_Neumann_2013, title={A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem}, volume={69}, journal={Annals of Mathematics and Artificial Intelligence}, author={Mersmann, O and Bischl, B and Trautmann, Heike and Wagner, M and Bossek, Jakob and Neumann, F}, year={2013}, pages={151–182} }","chicago":"Mersmann, O, B Bischl, Heike Trautmann, M Wagner, Jakob Bossek, and F Neumann. “A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem.” <i>Annals of Mathematics and Artificial Intelligence</i> 69 (2013): 151–182.","ama":"Mersmann O, Bischl B, Trautmann H, Wagner M, Bossek J, Neumann F. A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem. <i>Annals of Mathematics and Artificial Intelligence</i>. 2013;69:151–182.","short":"O. Mersmann, B. Bischl, H. Trautmann, M. Wagner, J. Bossek, F. Neumann, Annals of Mathematics and Artificial Intelligence 69 (2013) 151–182."},"publication":"Annals of Mathematics and Artificial Intelligence","department":[{"_id":"34"},{"_id":"819"}],"type":"journal_article","date_created":"2023-08-04T15:48:57Z","intvolume":"        69","date_updated":"2024-06-10T11:57:43Z","author":[{"first_name":"O","last_name":"Mersmann","full_name":"Mersmann, O"},{"first_name":"B","last_name":"Bischl","full_name":"Bischl, B"},{"id":"100740","orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike","full_name":"Trautmann, Heike"},{"full_name":"Wagner, M","last_name":"Wagner","first_name":"M"},{"orcid":"0000-0002-4121-4668","last_name":"Bossek","first_name":"Jakob","full_name":"Bossek, Jakob","id":"102979"},{"full_name":"Neumann, F","first_name":"F","last_name":"Neumann"}],"year":"2013","title":"A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem","status":"public","volume":69,"user_id":"15504","language":[{"iso":"eng"}],"_id":"46394","page":"151–182"},{"abstract":[{"lang":"eng","text":"In some patients with atypical cystic fibrosis (CF), only one allele of the CF transmembrane conductance regulator (CFTR) gene is affected. Mutations of the epithelial sodium channel (ENaC) may contribute to the pathophysiology of the disease in these patients. To functionally characterize a mutation in the $\\beta$-subunit of ENaC ($\\beta$V348M) recently identified in a patient with severe CF-like symptoms (Mutesa et al. 2009), we expressed wild-type (wt) $\\alpha$$\\beta$$\\gamma$ENaC or mutant $\\alpha$$\\beta$V348M$\\gamma$ENaC in Xenopus laevis oocytes. The $\\beta$V348M mutation stimulated amiloride-sensitive whole-cell current ($\\Delta$I(ami)) by $\\sim$40% but had no effect on surface expression or single-channel conductance of ENaC. Instead the mutation increased channel open probability (P(o)). Proteolytic activation of mutant ENaC by chymotrypsin was reduced compared with that of wt ENaC ($\\sim$3.0-fold vs. $\\sim$4.2-fold), which is consistent with the increased baseline P(o) of mutant ENaC. Similarly, the ENaC activator S3969 stimulated mutant ENaC currents to a lesser degree (by $\\sim$2.6-fold) than wt ENaC currents (by $\\sim$3.5-fold). The gain-of-function effect of the $\\beta$V348M mutation was confirmed by whole-cell current measurements in HEK293 cells transiently transfected with wt or mutant ENaC. Computational channel modeling in combination with functional expression of different $\\beta$V348 mutants in oocytes suggests that the $\\beta$V348M mutation increases channel P(o) by destabilizing the closed channel state. Our findings indicate that the gain-of-function effect of the $\\beta$V348M mutation may contribute to CF pathophysiology by inappropriately increasing sodium and fluid absorption in the respiratory tract."}],"citation":{"apa":"Rauh, R., Soell, D., Haerteis, S., Diakov, A., Nesterov, V., Krueger, B., Sticht, H., &#38; Korbmacher, C. (2013). A mutation in the $\\beta$-subunit of ENaC identified in a patient with cystic fibrosis-like symptoms has a gain-of-function effect. <i>American Journal of Physiology-Lung Cellular and Molecular Physiology</i>, <i>304</i>(1), L43–L55. <a href=\"https://doi.org/10.1152/ajplung.00093.2012\">https://doi.org/10.1152/ajplung.00093.2012</a>","ieee":"R. Rauh <i>et al.</i>, “A mutation in the $\\beta$-subunit of ENaC identified in a patient with cystic fibrosis-like symptoms has a gain-of-function effect,” <i>American Journal of Physiology-Lung Cellular and Molecular Physiology</i>, vol. 304, no. 1, pp. L43–L55, 2013, doi: <a href=\"https://doi.org/10.1152/ajplung.00093.2012\">10.1152/ajplung.00093.2012</a>.","short":"R. Rauh, D. Soell, S. Haerteis, A. Diakov, V. Nesterov, B. Krueger, H. Sticht, C. Korbmacher, American Journal of Physiology-Lung Cellular and Molecular Physiology 304 (2013) L43–L55.","chicago":"Rauh, Robert, Daniel Soell, Silke Haerteis, Alexei Diakov, Viatcheslav Nesterov, Bettina Krueger, Heinrich Sticht, and Christoph Korbmacher. “A Mutation in the $\\beta$-Subunit of ENaC Identified in a Patient with Cystic Fibrosis-like Symptoms Has a Gain-of-Function Effect.” <i>American Journal of Physiology-Lung Cellular and Molecular Physiology</i> 304, no. 1 (2013): L43–L55. <a href=\"https://doi.org/10.1152/ajplung.00093.2012\">https://doi.org/10.1152/ajplung.00093.2012</a>.","mla":"Rauh, Robert, et al. “A Mutation in the $\\beta$-Subunit of ENaC Identified in a Patient with Cystic Fibrosis-like Symptoms Has a Gain-of-Function Effect.” <i>American Journal of Physiology-Lung Cellular and Molecular Physiology</i>, vol. 304, no. 1, American Physiological Society, 2013, pp. L43–L55, doi:<a href=\"https://doi.org/10.1152/ajplung.00093.2012\">10.1152/ajplung.00093.2012</a>.","ama":"Rauh R, Soell D, Haerteis S, et al. A mutation in the $\\beta$-subunit of ENaC identified in a patient with cystic fibrosis-like symptoms has a gain-of-function effect. <i>American Journal of Physiology-Lung Cellular and Molecular Physiology</i>. 2013;304(1):L43–L55. doi:<a href=\"https://doi.org/10.1152/ajplung.00093.2012\">10.1152/ajplung.00093.2012</a>","bibtex":"@article{Rauh_Soell_Haerteis_Diakov_Nesterov_Krueger_Sticht_Korbmacher_2013, title={A mutation in the $\\beta$-subunit of ENaC identified in a patient with cystic fibrosis-like symptoms has a gain-of-function effect}, volume={304}, DOI={<a href=\"https://doi.org/10.1152/ajplung.00093.2012\">10.1152/ajplung.00093.2012</a>}, number={1}, journal={American Journal of Physiology-Lung Cellular and Molecular Physiology}, publisher={American Physiological Society}, author={Rauh, Robert and Soell, Daniel and Haerteis, Silke and Diakov, Alexei and Nesterov, Viatcheslav and Krueger, Bettina and Sticht, Heinrich and Korbmacher, Christoph}, year={2013}, pages={L43–L55} }"},"issue":"1","publication":"American Journal of Physiology-Lung Cellular and Molecular Physiology","department":[{"_id":"35"},{"_id":"22"}],"type":"journal_article","date_created":"2024-06-30T13:47:44Z","intvolume":"       304","date_updated":"2024-06-30T13:47:56Z","author":[{"full_name":"Rauh, Robert","first_name":"Robert","last_name":"Rauh"},{"last_name":"Soell","first_name":"Daniel","full_name":"Soell, Daniel"},{"full_name":"Haerteis, Silke","first_name":"Silke","last_name":"Haerteis"},{"last_name":"Diakov","first_name":"Alexei","full_name":"Diakov, Alexei"},{"full_name":"Nesterov, Viatcheslav","first_name":"Viatcheslav","last_name":"Nesterov"},{"last_name":"Krueger","orcid":"0000-0001-5351-1785","first_name":"Bettina","full_name":"Krueger, Bettina","id":"49428"},{"full_name":"Sticht, Heinrich","first_name":"Heinrich","last_name":"Sticht"},{"full_name":"Korbmacher, Christoph","last_name":"Korbmacher","first_name":"Christoph"}],"status":"public","year":"2013","title":"A mutation in the $\\beta$-subunit of ENaC identified in a patient with cystic fibrosis-like symptoms has a gain-of-function effect","volume":304,"user_id":"49428","doi":"10.1152/ajplung.00093.2012","_id":"54933","publisher":"American Physiological Society","language":[{"iso":"eng"}],"page":"L43–L55"},{"date_updated":"2023-01-16T12:08:17Z","author":[{"first_name":"Fabian","last_name":"Mischkalla","full_name":"Mischkalla, Fabian"},{"first_name":"Wolfgang","last_name":"Müller","full_name":"Müller, Wolfgang","id":"16243"}],"publication_identifier":{"eisbn":["978-1-4799-1170-7"]},"conference":{"name":"23rd International Workshop on Power and Timing Modeling, Optimization and Simulation (PATMOS)"},"title":"Efficient Power-Intent Validation Using \"Loosely-Timed\" Simulation Models: A Non-Invasive Approach","status":"public","year":"2013","user_id":"5786","doi":"10.1109/PATMOS.2013.6662171","_id":"36919","publisher":"IEEE","language":[{"iso":"eng"}],"abstract":[{"text":"Faced with increasing demands on energy efficiency, current electronic systems operate according to complex power management schemes including more and more fine-grained voltage frequency scaling and power shutdown scenarios. Consequently, validation of the power design intent should begin as early as possible at electronic system-level (ESL) together with first executable system specifications for integrity tests. However, today's system-level design methodologies usually focus on the abstraction of digital logic and time, so that typical low-power aspects cannot be considered so far. In this paper, we present a high-level modeling approach on top of the SystemC/TLM standard to simulate power distribution and voltage based implications in a \"loosely-timed\" functional execution context. The approach reuses legacy TLM models and prevents the need for detailed lock-step process synchronization in contrast to existing methods. A case study derived from an open source low-power design demonstrates the efficiency of our approach in terms of simulation performance and testability.","lang":"eng"}],"citation":{"bibtex":"@inproceedings{Mischkalla_Müller_2013, place={Karlsruhe}, title={Efficient Power-Intent Validation Using “Loosely-Timed” Simulation Models: A Non-Invasive Approach}, DOI={<a href=\"https://doi.org/10.1109/PATMOS.2013.6662171\">10.1109/PATMOS.2013.6662171</a>}, publisher={IEEE}, author={Mischkalla, Fabian and Müller, Wolfgang}, year={2013} }","ama":"Mischkalla F, Müller W. Efficient Power-Intent Validation Using “Loosely-Timed” Simulation Models: A Non-Invasive Approach. In: IEEE; 2013. doi:<a href=\"https://doi.org/10.1109/PATMOS.2013.6662171\">10.1109/PATMOS.2013.6662171</a>","mla":"Mischkalla, Fabian, and Wolfgang Müller. <i>Efficient Power-Intent Validation Using “Loosely-Timed” Simulation Models: A Non-Invasive Approach</i>. IEEE, 2013, doi:<a href=\"https://doi.org/10.1109/PATMOS.2013.6662171\">10.1109/PATMOS.2013.6662171</a>.","short":"F. Mischkalla, W. Müller, in: IEEE, Karlsruhe, 2013.","chicago":"Mischkalla, Fabian, and Wolfgang Müller. “Efficient Power-Intent Validation Using ‘Loosely-Timed’ Simulation Models: A Non-Invasive Approach.” Karlsruhe: IEEE, 2013. <a href=\"https://doi.org/10.1109/PATMOS.2013.6662171\">https://doi.org/10.1109/PATMOS.2013.6662171</a>.","ieee":"F. Mischkalla and W. Müller, “Efficient Power-Intent Validation Using ‘Loosely-Timed’ Simulation Models: A Non-Invasive Approach,” presented at the 23rd International Workshop on Power and Timing Modeling, Optimization and Simulation (PATMOS), 2013, doi: <a href=\"https://doi.org/10.1109/PATMOS.2013.6662171\">10.1109/PATMOS.2013.6662171</a>.","apa":"Mischkalla, F., &#38; Müller, W. (2013). <i>Efficient Power-Intent Validation Using “Loosely-Timed” Simulation Models: A Non-Invasive Approach</i>. 23rd International Workshop on Power and Timing Modeling, Optimization and Simulation (PATMOS). <a href=\"https://doi.org/10.1109/PATMOS.2013.6662171\">https://doi.org/10.1109/PATMOS.2013.6662171</a>"},"department":[{"_id":"672"}],"keyword":["Time-varying systems","Time-domain analysis","Synchronization","Context modeling","Clocks","Semantics","Standards"],"type":"conference","date_created":"2023-01-16T12:08:03Z","place":"Karlsruhe"},{"language":[{"iso":"ger"}],"_id":"37412","publisher":"Verlag Barbara Budrich","user_id":"61597","alternative_title":["Ökonomischer Zwang, ökologisches Gewissen und globale Konflikte"],"status":"public","year":"2013","title":"Ernährung- und Konsumbildung","author":[{"last_name":"Bigga","first_name":"Regine","full_name":"Bigga, Regine","id":"620"}],"publication_identifier":{"issn":["2193-8806"]},"date_updated":"2023-01-19T11:19:21Z","date_created":"2023-01-18T13:49:40Z","place":"Leverkusen","type":"review","department":[{"_id":"35"},{"_id":"17"},{"_id":"22"},{"_id":"396"},{"_id":"394"}],"publication":"Haushalt in Bildung und Forschung","citation":{"chicago":"Bigga, Regine. “Ernährung- und Konsumbildung.” <i>Haushalt in Bildung und Forschung</i>. Leverkusen: Verlag Barbara Budrich, 2013.","short":"R. Bigga, Haushalt in Bildung und Forschung (2013).","apa":"Bigga, R. (2013). Ernährung- und Konsumbildung. In <i>Haushalt in Bildung und Forschung</i>. Verlag Barbara Budrich.","ieee":"R. Bigga, “Ernährung- und Konsumbildung,” <i>Haushalt in Bildung und Forschung</i>. Verlag Barbara Budrich, Leverkusen, 2013.","ama":"Bigga R. Ernährung- und Konsumbildung. <i>Haushalt in Bildung und Forschung</i>. Published online 2013.","bibtex":"@article{Bigga_2013, place={Leverkusen}, title={Ernährung- und Konsumbildung}, journal={Haushalt in Bildung und Forschung}, publisher={Verlag Barbara Budrich}, author={Bigga, Regine}, year={2013} }","mla":"Bigga, Regine. “Ernährung- und Konsumbildung.” <i>Haushalt in Bildung und Forschung</i>, Verlag Barbara Budrich, 2013."}},{"date_created":"2023-01-11T11:35:37Z","type":"journal_article","department":[{"_id":"115"}],"publication":" Quaderni di Palazzo Serra 22","citation":{"short":"C. Lorenz,  Quaderni di Palazzo Serra 22 (2013) 135–143.","chicago":"Lorenz, Cornelia. “Niederdeutsche Lexeme im Regiolekt – eine empirische Studie unter Einheimischen und Zugezogenen in Ostwestfalen.” <i> Quaderni di Palazzo Serra 22</i>, 2013, 135–43.","ieee":"C. Lorenz, “Niederdeutsche Lexeme im Regiolekt – eine empirische Studie unter Einheimischen und Zugezogenen in Ostwestfalen,” <i> Quaderni di Palazzo Serra 22</i>, pp. 135–143, 2013.","apa":"Lorenz, C. (2013). Niederdeutsche Lexeme im Regiolekt – eine empirische Studie unter Einheimischen und Zugezogenen in Ostwestfalen. <i> Quaderni di Palazzo Serra 22</i>, 135–143.","bibtex":"@article{Lorenz_2013, title={Niederdeutsche Lexeme im Regiolekt – eine empirische Studie unter Einheimischen und Zugezogenen in Ostwestfalen}, journal={ Quaderni di Palazzo Serra 22}, publisher={Università die Genova}, author={Lorenz, Cornelia}, year={2013}, pages={135–143} }","ama":"Lorenz C. Niederdeutsche Lexeme im Regiolekt – eine empirische Studie unter Einheimischen und Zugezogenen in Ostwestfalen. <i> Quaderni di Palazzo Serra 22</i>. Published online 2013:135-143.","mla":"Lorenz, Cornelia. “Niederdeutsche Lexeme im Regiolekt – eine empirische Studie unter Einheimischen und Zugezogenen in Ostwestfalen.” <i> Quaderni di Palazzo Serra 22</i>, Università die Genova, 2013, pp. 135–43."},"page":"135-143","language":[{"iso":"ger"}],"_id":"36066","publisher":"Università die Genova","user_id":"29788","title":"Niederdeutsche Lexeme im Regiolekt – eine empirische Studie unter Einheimischen und Zugezogenen in Ostwestfalen","status":"public","year":"2013","author":[{"id":"29788","last_name":"Lorenz","first_name":"Cornelia","full_name":"Lorenz, Cornelia"}],"date_updated":"2023-01-20T12:45:21Z","publication_status":"published"}]