[{"type":"journal_article","department":[{"_id":"35"},{"_id":"22"},{"_id":"395"}],"date_created":"2021-11-01T19:11:56Z","extern":"1","abstract":[{"text":"<jats:title>Abstract</jats:title><jats:sec>\r\n<jats:title>Purpose</jats:title>\r\n<jats:p>While observational studies revealed inverse associations between serum vitamin D levels [25(OH)D] and depression, randomized controlled trials (RCT) in children and adolescents are lacking. This RCT examined the effect of an untreated vitamin D deficiency compared to an immediate vitamin D<jats:sub>3</jats:sub> supplementation on depression scores in children and adolescents during standard day and in-patient psychiatric treatment.</jats:p>\r\n</jats:sec><jats:sec>\r\n<jats:title>Methods</jats:title>\r\n<jats:p>Patients with vitamin D deficiency [25(OH)D ≤ 30 nmol/l] and at least mild depression [Beck Depression Inventory II (BDI-II) &gt; 13] (<jats:italic>n</jats:italic> = 113) were 1:1 randomized into verum (VG; 2640 IU vitamin D<jats:sub>3</jats:sub>/d) or placebo group (PG) in a double-blind manner. During the intervention period of 28 days, both groups additionally received treatment as usual. BDI-II scores were assessed as primary outcome, DISYPS-II (Diagnostic System for Mental Disorders in Childhood and Adolescence, Self- and Parent Rating) and serum total 25(OH)D were secondary outcomes.</jats:p>\r\n</jats:sec><jats:sec>\r\n<jats:title>Results</jats:title>\r\n<jats:p>At admission, 49.3% of the screened patients (<jats:italic>n</jats:italic> = 280) had vitamin D deficiency. Although the intervention led to a higher increase of 25(OH)D levels in the VG than in the PG (treatment difference: + 14 ng/ml; 95% CI 4.86–23.77; <jats:italic>p</jats:italic> = 0.003), the change in BDI-II scores did not differ (+ 1.3; 95% CI − 2.22 to 4.81; <jats:italic>p</jats:italic> = 0.466). In contrast, DISYPS parental ratings revealed pronounced improvements of depressive symptoms in the VG (− 0.68; 95% CI − 1.23 to − 0.13; <jats:italic>p</jats:italic> = 0.016).</jats:p>\r\n</jats:sec><jats:sec>\r\n<jats:title>Conclusion</jats:title>\r\n<jats:p>Whereas this study failed to show a vitamin D supplementation effect on self-rated depression in adolescent in- or daycare patients, parents reported less depressive symptoms in VG at the end of our study. Future trials should consider clinician-rated depressive symptoms as primary outcome.</jats:p>\r\n</jats:sec><jats:sec>\r\n<jats:title>Trial registration</jats:title>\r\n<jats:p>“German Clinical Trials Register” (<jats:ext-link xmlns:xlink=\"http://www.w3.org/1999/xlink\" ext-link-type=\"uri\" xlink:href=\"https://www.drks.de\">https://www.drks.de</jats:ext-link>), registration number: DRKS00009758</jats:p>\r\n</jats:sec>","lang":"eng"}],"publication":"European Journal of Nutrition","citation":{"mla":"Libuda, Lars, et al. “Effect of Vitamin D Deficiency on Depressive Symptoms in Child and Adolescent Psychiatric Patients: Results of a Randomized Controlled Trial.” <i>European Journal of Nutrition</i>, 2020, pp. 3415–24, doi:<a href=\"https://doi.org/10.1007/s00394-020-02176-6\">10.1007/s00394-020-02176-6</a>.","ama":"Libuda L, Timmesfeld N, Antel J, et al. Effect of vitamin D deficiency on depressive symptoms in child and adolescent psychiatric patients: results of a randomized controlled trial. <i>European Journal of Nutrition</i>. Published online 2020:3415-3424. doi:<a href=\"https://doi.org/10.1007/s00394-020-02176-6\">10.1007/s00394-020-02176-6</a>","bibtex":"@article{Libuda_Timmesfeld_Antel_Hirtz_Bauer_Führer_Zwanziger_Öztürk_Langenbach_Hahn_et al._2020, title={Effect of vitamin D deficiency on depressive symptoms in child and adolescent psychiatric patients: results of a randomized controlled trial}, DOI={<a href=\"https://doi.org/10.1007/s00394-020-02176-6\">10.1007/s00394-020-02176-6</a>}, journal={European Journal of Nutrition}, author={Libuda, Lars and Timmesfeld, Nina and Antel, Jochen and Hirtz, Raphael and Bauer, Jens and Führer, Dagmar and Zwanziger, Denise and Öztürk, Dana and Langenbach, Gina and Hahn, Denise and et al.}, year={2020}, pages={3415–3424} }","apa":"Libuda, L., Timmesfeld, N., Antel, J., Hirtz, R., Bauer, J., Führer, D., Zwanziger, D., Öztürk, D., Langenbach, G., Hahn, D., Ring, S., Peters, T., Hinney, A., Bühlmeier, J., Hebebrand, J., Grasemann, C., &#38; Föcker, M. (2020). Effect of vitamin D deficiency on depressive symptoms in child and adolescent psychiatric patients: results of a randomized controlled trial. <i>European Journal of Nutrition</i>, 3415–3424. <a href=\"https://doi.org/10.1007/s00394-020-02176-6\">https://doi.org/10.1007/s00394-020-02176-6</a>","ieee":"L. Libuda <i>et al.</i>, “Effect of vitamin D deficiency on depressive symptoms in child and adolescent psychiatric patients: results of a randomized controlled trial,” <i>European Journal of Nutrition</i>, pp. 3415–3424, 2020, doi: <a href=\"https://doi.org/10.1007/s00394-020-02176-6\">10.1007/s00394-020-02176-6</a>.","short":"L. Libuda, N. Timmesfeld, J. Antel, R. Hirtz, J. Bauer, D. Führer, D. Zwanziger, D. Öztürk, G. Langenbach, D. Hahn, S. Ring, T. Peters, A. Hinney, J. Bühlmeier, J. Hebebrand, C. Grasemann, M. Föcker, European Journal of Nutrition (2020) 3415–3424.","chicago":"Libuda, Lars, Nina Timmesfeld, Jochen Antel, Raphael Hirtz, Jens Bauer, Dagmar Führer, Denise Zwanziger, et al. “Effect of Vitamin D Deficiency on Depressive Symptoms in Child and Adolescent Psychiatric Patients: Results of a Randomized Controlled Trial.” <i>European Journal of Nutrition</i>, 2020, 3415–24. <a href=\"https://doi.org/10.1007/s00394-020-02176-6\">https://doi.org/10.1007/s00394-020-02176-6</a>."},"user_id":"89838","doi":"10.1007/s00394-020-02176-6","page":"3415-3424","language":[{"iso":"eng"}],"_id":"27022","publication_status":"published","date_updated":"2022-09-15T09:49:57Z","year":"2020","title":"Effect of vitamin D deficiency on depressive symptoms in child and adolescent psychiatric patients: results of a randomized controlled trial","status":"public","author":[{"orcid":"0000-0003-1603-3133","last_name":"Libuda","first_name":"Lars","full_name":"Libuda, Lars","id":"88682"},{"last_name":"Timmesfeld","first_name":"Nina","full_name":"Timmesfeld, Nina"},{"full_name":"Antel, Jochen","last_name":"Antel","first_name":"Jochen"},{"first_name":"Raphael","last_name":"Hirtz","full_name":"Hirtz, Raphael"},{"full_name":"Bauer, Jens","first_name":"Jens","last_name":"Bauer"},{"last_name":"Führer","first_name":"Dagmar","full_name":"Führer, Dagmar"},{"full_name":"Zwanziger, Denise","first_name":"Denise","last_name":"Zwanziger"},{"first_name":"Dana","last_name":"Öztürk","full_name":"Öztürk, Dana"},{"first_name":"Gina","last_name":"Langenbach","full_name":"Langenbach, Gina"},{"first_name":"Denise","last_name":"Hahn","full_name":"Hahn, Denise"},{"full_name":"Ring, Stefanie","first_name":"Stefanie","last_name":"Ring"},{"full_name":"Peters, Triinu","first_name":"Triinu","last_name":"Peters"},{"full_name":"Hinney, Anke","last_name":"Hinney","first_name":"Anke"},{"id":"89838","full_name":"Bühlmeier, Judith","first_name":"Judith","last_name":"Bühlmeier"},{"first_name":"Johannes","last_name":"Hebebrand","full_name":"Hebebrand, Johannes"},{"full_name":"Grasemann, Corinna","first_name":"Corinna","last_name":"Grasemann"},{"last_name":"Föcker","first_name":"Manuel","full_name":"Föcker, Manuel"}],"publication_identifier":{"issn":["1436-6207","1436-6215"]}},{"extern":"1","abstract":[{"lang":"eng","text":"<jats:p>Acute anorexia nervosa (AN) constitutes an extreme physiological state. We aimed to detect state related metabolic alterations during inpatient admission and upon short- and long-term weight regain. In addition, we tested the hypothesis that metabolite concentrations adapt to those of healthy controls (HC) after long-term weight regain. Thirty-five female adolescents with AN and 25 female HC were recruited. Based on a targeted approach 187 metabolite concentrations were detected at inpatient admission (T0), after short-term weight recovery (T1; half of target-weight) and close to target weight (T2). Pattern hunter and time course analysis were performed. The highest number of significant differences in metabolite concentrations (N = 32) were observed between HC and T1. According to the detected main pattern, metabolite concentrations at T2 became more similar to those of HC. The course of single metabolite concentrations (e.g., glutamic acid) revealed different metabolic subtypes within the study sample. Patients with AN after short-term weight regain are in a greater “metabolic imbalance” than at starvation. After long-term weight regain, patients reach a metabolite profile similar to HC. Our results might be confounded by different metabolic subtypes of patients with AN.</jats:p>"}],"publication":"Metabolites","citation":{"ieee":"M. Föcker <i>et al.</i>, “Evaluation of Metabolic Profiles of Patients with Anorexia Nervosa at Inpatient Admission, Short- and Long-Term Weight Regain—Descriptive and Pattern Analysis,” <i>Metabolites</i>, Art. no. 7, 2020, doi: <a href=\"https://doi.org/10.3390/metabo11010007\">10.3390/metabo11010007</a>.","mla":"Föcker, Manuel, et al. “Evaluation of Metabolic Profiles of Patients with Anorexia Nervosa at Inpatient Admission, Short- and Long-Term Weight Regain—Descriptive and Pattern Analysis.” <i>Metabolites</i>, 7, 2020, doi:<a href=\"https://doi.org/10.3390/metabo11010007\">10.3390/metabo11010007</a>.","apa":"Föcker, M., Cecil, A., Prehn, C., Adamski, J., Albrecht, M., Adams, F., Hinney, A., Libuda, L., Bühlmeier, J., Hebebrand, J., Peters, T., &#38; Antel, J. (2020). Evaluation of Metabolic Profiles of Patients with Anorexia Nervosa at Inpatient Admission, Short- and Long-Term Weight Regain—Descriptive and Pattern Analysis. <i>Metabolites</i>, Article 7. <a href=\"https://doi.org/10.3390/metabo11010007\">https://doi.org/10.3390/metabo11010007</a>","bibtex":"@article{Föcker_Cecil_Prehn_Adamski_Albrecht_Adams_Hinney_Libuda_Bühlmeier_Hebebrand_et al._2020, title={Evaluation of Metabolic Profiles of Patients with Anorexia Nervosa at Inpatient Admission, Short- and Long-Term Weight Regain—Descriptive and Pattern Analysis}, DOI={<a href=\"https://doi.org/10.3390/metabo11010007\">10.3390/metabo11010007</a>}, number={7}, journal={Metabolites}, author={Föcker, Manuel and Cecil, Alexander and Prehn, Cornelia and Adamski, Jerzy and Albrecht, Muriel and Adams, Frederike and Hinney, Anke and Libuda, Lars and Bühlmeier, Judith and Hebebrand, Johannes and et al.}, year={2020} }","chicago":"Föcker, Manuel, Alexander Cecil, Cornelia Prehn, Jerzy Adamski, Muriel Albrecht, Frederike Adams, Anke Hinney, et al. “Evaluation of Metabolic Profiles of Patients with Anorexia Nervosa at Inpatient Admission, Short- and Long-Term Weight Regain—Descriptive and Pattern Analysis.” <i>Metabolites</i>, 2020. <a href=\"https://doi.org/10.3390/metabo11010007\">https://doi.org/10.3390/metabo11010007</a>.","short":"M. Föcker, A. Cecil, C. Prehn, J. Adamski, M. Albrecht, F. Adams, A. Hinney, L. Libuda, J. Bühlmeier, J. Hebebrand, T. Peters, J. Antel, Metabolites (2020).","ama":"Föcker M, Cecil A, Prehn C, et al. Evaluation of Metabolic Profiles of Patients with Anorexia Nervosa at Inpatient Admission, Short- and Long-Term Weight Regain—Descriptive and Pattern Analysis. <i>Metabolites</i>. Published online 2020. doi:<a href=\"https://doi.org/10.3390/metabo11010007\">10.3390/metabo11010007</a>"},"type":"journal_article","department":[{"_id":"35"},{"_id":"22"},{"_id":"395"}],"date_created":"2021-11-01T18:55:25Z","publication_status":"published","date_updated":"2022-09-15T09:49:18Z","year":"2020","status":"public","title":"Evaluation of Metabolic Profiles of Patients with Anorexia Nervosa at Inpatient Admission, Short- and Long-Term Weight Regain—Descriptive and Pattern Analysis","author":[{"last_name":"Föcker","first_name":"Manuel","full_name":"Föcker, Manuel"},{"full_name":"Cecil, Alexander","last_name":"Cecil","first_name":"Alexander"},{"full_name":"Prehn, Cornelia","last_name":"Prehn","first_name":"Cornelia"},{"first_name":"Jerzy","last_name":"Adamski","full_name":"Adamski, Jerzy"},{"first_name":"Muriel","last_name":"Albrecht","full_name":"Albrecht, Muriel"},{"full_name":"Adams, Frederike","first_name":"Frederike","last_name":"Adams"},{"first_name":"Anke","last_name":"Hinney","full_name":"Hinney, Anke"},{"id":"88682","full_name":"Libuda, Lars","orcid":"0000-0003-1603-3133","last_name":"Libuda","first_name":"Lars"},{"id":"89838","full_name":"Bühlmeier, Judith","first_name":"Judith","last_name":"Bühlmeier"},{"last_name":"Hebebrand","first_name":"Johannes","full_name":"Hebebrand, Johannes"},{"first_name":"Triinu","last_name":"Peters","full_name":"Peters, Triinu"},{"last_name":"Antel","first_name":"Jochen","full_name":"Antel, Jochen"}],"publication_identifier":{"issn":["2218-1989"]},"user_id":"89838","doi":"10.3390/metabo11010007","article_number":"7","language":[{"iso":"eng"}],"_id":"27018"},{"citation":{"ama":"Jansen K, Tempes J, Drozdowska A, et al. Short-term effects of carbohydrates differing in glycemic index (GI) consumed at lunch on children’s cognitive function in a randomized crossover study. <i>European Journal of Clinical Nutrition</i>. Published online 2020:757-764. doi:<a href=\"https://doi.org/10.1038/s41430-020-0600-0\">10.1038/s41430-020-0600-0</a>","bibtex":"@article{Jansen_Tempes_Drozdowska_Gutmann_Falkenstein_Buyken_Libuda_Rudolf_Lücke_Kersting_2020, title={Short-term effects of carbohydrates differing in glycemic index (GI) consumed at lunch on children’s cognitive function in a randomized crossover study}, DOI={<a href=\"https://doi.org/10.1038/s41430-020-0600-0\">10.1038/s41430-020-0600-0</a>}, journal={European Journal of Clinical Nutrition}, author={Jansen, Kathrin and Tempes, Jana and Drozdowska, Alina and Gutmann, Maike and Falkenstein, Michael and Buyken, Anette and Libuda, Lars and Rudolf, Henrik and Lücke, Thomas and Kersting, Mathilde}, year={2020}, pages={757–764} }","mla":"Jansen, Kathrin, et al. “Short-Term Effects of Carbohydrates Differing in Glycemic Index (GI) Consumed at Lunch on Children’s Cognitive Function in a Randomized Crossover Study.” <i>European Journal of Clinical Nutrition</i>, 2020, pp. 757–64, doi:<a href=\"https://doi.org/10.1038/s41430-020-0600-0\">10.1038/s41430-020-0600-0</a>.","chicago":"Jansen, Kathrin, Jana Tempes, Alina Drozdowska, Maike Gutmann, Michael Falkenstein, Anette Buyken, Lars Libuda, Henrik Rudolf, Thomas Lücke, and Mathilde Kersting. “Short-Term Effects of Carbohydrates Differing in Glycemic Index (GI) Consumed at Lunch on Children’s Cognitive Function in a Randomized Crossover Study.” <i>European Journal of Clinical Nutrition</i>, 2020, 757–64. <a href=\"https://doi.org/10.1038/s41430-020-0600-0\">https://doi.org/10.1038/s41430-020-0600-0</a>.","short":"K. Jansen, J. Tempes, A. Drozdowska, M. Gutmann, M. Falkenstein, A. Buyken, L. Libuda, H. Rudolf, T. Lücke, M. Kersting, European Journal of Clinical Nutrition (2020) 757–764.","apa":"Jansen, K., Tempes, J., Drozdowska, A., Gutmann, M., Falkenstein, M., Buyken, A., Libuda, L., Rudolf, H., Lücke, T., &#38; Kersting, M. (2020). Short-term effects of carbohydrates differing in glycemic index (GI) consumed at lunch on children’s cognitive function in a randomized crossover study. <i>European Journal of Clinical Nutrition</i>, 757–764. <a href=\"https://doi.org/10.1038/s41430-020-0600-0\">https://doi.org/10.1038/s41430-020-0600-0</a>","ieee":"K. Jansen <i>et al.</i>, “Short-term effects of carbohydrates differing in glycemic index (GI) consumed at lunch on children’s cognitive function in a randomized crossover study,” <i>European Journal of Clinical Nutrition</i>, pp. 757–764, 2020, doi: <a href=\"https://doi.org/10.1038/s41430-020-0600-0\">10.1038/s41430-020-0600-0</a>."},"publication":"European Journal of Clinical Nutrition","date_created":"2021-11-01T19:09:24Z","department":[{"_id":"35"},{"_id":"22"},{"_id":"395"},{"_id":"571"}],"type":"journal_article","author":[{"first_name":"Kathrin","last_name":"Jansen","full_name":"Jansen, Kathrin"},{"full_name":"Tempes, Jana","first_name":"Jana","last_name":"Tempes"},{"last_name":"Drozdowska","first_name":"Alina","full_name":"Drozdowska, Alina"},{"last_name":"Gutmann","first_name":"Maike","full_name":"Gutmann, Maike"},{"full_name":"Falkenstein, Michael","last_name":"Falkenstein","first_name":"Michael"},{"id":"65985","full_name":"Buyken, Anette","last_name":"Buyken","first_name":"Anette"},{"full_name":"Libuda, Lars","orcid":"0000-0003-1603-3133","first_name":"Lars","last_name":"Libuda","id":"88682"},{"first_name":"Henrik","last_name":"Rudolf","full_name":"Rudolf, Henrik"},{"last_name":"Lücke","first_name":"Thomas","full_name":"Lücke, Thomas"},{"full_name":"Kersting, Mathilde","last_name":"Kersting","first_name":"Mathilde"}],"publication_identifier":{"issn":["0954-3007","1476-5640"]},"year":"2020","title":"Short-term effects of carbohydrates differing in glycemic index (GI) consumed at lunch on children’s cognitive function in a randomized crossover study","status":"public","publication_status":"published","date_updated":"2023-01-05T16:43:34Z","language":[{"iso":"eng"}],"_id":"27021","page":"757-764","user_id":"61597","doi":"10.1038/s41430-020-0600-0"},{"publication":"Proceedings of the European Control Confrence 2020","citation":{"chicago":"Lee, J.G., Thomas Berger, S. Trenn, and H. Shim. “Utility of Edge-Wise Funnel Coupling for Asymptotically Solving Distributed Consensus Optimization.” In <i>Proceedings of the European Control Confrence 2020</i>, 911–16, 2020.","short":"J.G. Lee, T. Berger, S. Trenn, H. Shim, in: Proceedings of the European Control Confrence 2020, 2020, pp. 911–916.","ieee":"J. G. Lee, T. Berger, S. Trenn, and H. Shim, “Utility of Edge-wise Funnel Coupling for Asymptotically Solving Distributed Consensus Optimization,” in <i>Proceedings of the European Control Confrence 2020</i>, Saint Petersburg, Russia, 2020, pp. 911–916.","apa":"Lee, J. G., Berger, T., Trenn, S., &#38; Shim, H. (2020). Utility of Edge-wise Funnel Coupling for Asymptotically Solving Distributed Consensus Optimization. <i>Proceedings of the European Control Confrence 2020</i>, 911–916.","bibtex":"@inproceedings{Lee_Berger_Trenn_Shim_2020, title={Utility of Edge-wise Funnel Coupling for Asymptotically Solving Distributed Consensus Optimization}, booktitle={Proceedings of the European Control Confrence 2020}, author={Lee, J.G. and Berger, Thomas and Trenn, S. and Shim, H.}, year={2020}, pages={911–916} }","ama":"Lee JG, Berger T, Trenn S, Shim H. Utility of Edge-wise Funnel Coupling for Asymptotically Solving Distributed Consensus Optimization. In: <i>Proceedings of the European Control Confrence 2020</i>. ; 2020:911-916.","mla":"Lee, J. G., et al. “Utility of Edge-Wise Funnel Coupling for Asymptotically Solving Distributed Consensus Optimization.” <i>Proceedings of the European Control Confrence 2020</i>, 2020, pp. 911–16."},"type":"conference","date_created":"2023-01-12T10:38:25Z","date_updated":"2023-01-12T12:29:18Z","status":"public","year":"2020","title":"Utility of Edge-wise Funnel Coupling for Asymptotically Solving Distributed Consensus Optimization","conference":{"location":"Saint Petersburg, Russia","name":"Proceedings of the European Control Confrence 2020"},"author":[{"full_name":"Lee, J.G.","first_name":"J.G.","last_name":"Lee"},{"id":"77457","first_name":"Thomas","last_name":"Berger","full_name":"Berger, Thomas"},{"full_name":"Trenn, S.","first_name":"S.","last_name":"Trenn"},{"last_name":"Shim","first_name":"H.","full_name":"Shim, H."}],"user_id":"77457","page":"911-916","language":[{"iso":"eng"}],"_id":"36380"},{"publication":"Advances in Dynamics, Optimization and Computation","citation":{"ieee":"K. Flaßkamp, S. Ober-Blöbaum, and S. Peitz, “Symmetry in optimal control: A multiobjective model predictive control approach,” in <i>Advances in Dynamics, Optimization and Computation</i>, O. Junge, O. Schütze, G. Froyland, S. Ober-Blöbaum, and K. Padberg-Gehle, Eds. Cham: Springer International Publishing, 2020, pp. 209–237.","apa":"Flaßkamp, K., Ober-Blöbaum, S., &#38; Peitz, S. (2020). Symmetry in optimal control: A multiobjective model predictive control approach. In O. Junge, O. Schütze, G. Froyland, S. Ober-Blöbaum, &#38; K. Padberg-Gehle (Eds.), <i>Advances in Dynamics, Optimization and Computation</i> (pp. 209–237). Springer International Publishing.","chicago":"Flaßkamp, K., Sina Ober-Blöbaum, and S.  Peitz. “Symmetry in Optimal Control: A Multiobjective Model Predictive Control Approach.” In <i>Advances in Dynamics, Optimization and Computation</i>, edited by Oliver Junge, Oliver Schütze, Gary Froyland, Sina Ober-Blöbaum, and Kathrin Padberg-Gehle, 209–37. Cham: Springer International Publishing, 2020.","short":"K. Flaßkamp, S. Ober-Blöbaum, S. Peitz, in: O. Junge, O. Schütze, G. Froyland, S. Ober-Blöbaum, K. Padberg-Gehle (Eds.), Advances in Dynamics, Optimization and Computation, Springer International Publishing, Cham, 2020, pp. 209–237.","mla":"Flaßkamp, K., et al. “Symmetry in Optimal Control: A Multiobjective Model Predictive Control Approach.” <i>Advances in Dynamics, Optimization and Computation</i>, edited by Oliver Junge et al., Springer International Publishing, 2020, pp. 209–37.","bibtex":"@inbook{Flaßkamp_Ober-Blöbaum_Peitz_2020, place={Cham}, title={Symmetry in optimal control: A multiobjective model predictive control approach}, booktitle={Advances in Dynamics, Optimization and Computation}, publisher={Springer International Publishing}, author={Flaßkamp, K. and Ober-Blöbaum, Sina and Peitz, S. }, editor={Junge, Oliver and Schütze, Oliver and Froyland, Gary and Ober-Blöbaum, Sina and Padberg-Gehle, Kathrin}, year={2020}, pages={209–237} }","ama":"Flaßkamp K, Ober-Blöbaum S, Peitz S. Symmetry in optimal control: A multiobjective model predictive control approach. In: Junge O, Schütze O, Froyland G, Ober-Blöbaum S, Padberg-Gehle K, eds. <i>Advances in Dynamics, Optimization and Computation</i>. Springer International Publishing; 2020:209-237."},"place":"Cham","date_created":"2022-01-18T12:58:18Z","type":"book_chapter","department":[{"_id":"636"}],"status":"public","year":"2020","title":"Symmetry in optimal control: A multiobjective model predictive control approach","author":[{"full_name":"Flaßkamp, K.","last_name":"Flaßkamp","first_name":"K."},{"id":"16494","last_name":"Ober-Blöbaum","first_name":"Sina","full_name":"Ober-Blöbaum, Sina"},{"full_name":"Peitz, S. ","last_name":"Peitz","first_name":"S. "}],"date_updated":"2023-11-08T08:15:14Z","page":"209-237","language":[{"iso":"eng"}],"_id":"29413","publisher":"Springer International Publishing","user_id":"15694","editor":[{"full_name":"Junge, Oliver","last_name":"Junge","first_name":"Oliver"},{"full_name":"Schütze, Oliver","first_name":"Oliver","last_name":"Schütze"},{"first_name":"Gary","last_name":"Froyland","full_name":"Froyland, Gary"},{"first_name":"Sina","last_name":"Ober-Blöbaum","full_name":"Ober-Blöbaum, Sina"},{"last_name":"Padberg-Gehle","first_name":"Kathrin","full_name":"Padberg-Gehle, Kathrin"}]},{"author":[{"full_name":"Prager, Raphael Patrick","last_name":"Prager","first_name":"Raphael Patrick"},{"id":"100740","full_name":"Trautmann, Heike","last_name":"Trautmann","first_name":"Heike","orcid":"0000-0002-9788-8282"},{"last_name":"Wang","first_name":"Hao","full_name":"Wang, Hao"},{"first_name":"Thomas H. W.","last_name":"Bäck","full_name":"Bäck, Thomas H. W."},{"last_name":"Kerschke","first_name":"Pascal","full_name":"Kerschke, Pascal"}],"year":"2020","title":"Per-Instance Configuration of the Modularized CMA-ES by Means of Classifier Chains and Exploratory Landscape Analysis","status":"public","date_updated":"2023-10-16T13:04:15Z","language":[{"iso":"eng"}],"_id":"46328","page":"996–1003","doi":"10.1109/SSCI47803.2020.9308510","user_id":"15504","citation":{"mla":"Prager, Raphael Patrick, et al. “Per-Instance Configuration of the Modularized CMA-ES by Means of Classifier Chains and Exploratory Landscape Analysis.” <i>Proceedings of the IEEE Symposium Series on Computational Intelligence (SSCI)</i>, 2020, pp. 996–1003, doi:<a href=\"https://doi.org/10.1109/SSCI47803.2020.9308510\">10.1109/SSCI47803.2020.9308510</a>.","ama":"Prager RP, Trautmann H, Wang H, Bäck THW, Kerschke P. Per-Instance Configuration of the Modularized CMA-ES by Means of Classifier Chains and Exploratory Landscape Analysis. In: <i>Proceedings of the IEEE Symposium Series on Computational Intelligence (SSCI)</i>. ; 2020:996–1003. doi:<a href=\"https://doi.org/10.1109/SSCI47803.2020.9308510\">10.1109/SSCI47803.2020.9308510</a>","bibtex":"@inproceedings{Prager_Trautmann_Wang_Bäck_Kerschke_2020, place={Canberra, Australia}, title={Per-Instance Configuration of the Modularized CMA-ES by Means of Classifier Chains and Exploratory Landscape Analysis}, DOI={<a href=\"https://doi.org/10.1109/SSCI47803.2020.9308510\">10.1109/SSCI47803.2020.9308510</a>}, booktitle={Proceedings of the IEEE Symposium Series on Computational Intelligence (SSCI)}, author={Prager, Raphael Patrick and Trautmann, Heike and Wang, Hao and Bäck, Thomas H. W. and Kerschke, Pascal}, year={2020}, pages={996–1003} }","apa":"Prager, R. P., Trautmann, H., Wang, H., Bäck, T. H. W., &#38; Kerschke, P. (2020). Per-Instance Configuration of the Modularized CMA-ES by Means of Classifier Chains and Exploratory Landscape Analysis. <i>Proceedings of the IEEE Symposium Series on Computational Intelligence (SSCI)</i>, 996–1003. <a href=\"https://doi.org/10.1109/SSCI47803.2020.9308510\">https://doi.org/10.1109/SSCI47803.2020.9308510</a>","ieee":"R. P. Prager, H. Trautmann, H. Wang, T. H. W. Bäck, and P. Kerschke, “Per-Instance Configuration of the Modularized CMA-ES by Means of Classifier Chains and Exploratory Landscape Analysis,” in <i>Proceedings of the IEEE Symposium Series on Computational Intelligence (SSCI)</i>, 2020, pp. 996–1003, doi: <a href=\"https://doi.org/10.1109/SSCI47803.2020.9308510\">10.1109/SSCI47803.2020.9308510</a>.","chicago":"Prager, Raphael Patrick, Heike Trautmann, Hao Wang, Thomas H. W. Bäck, and Pascal Kerschke. “Per-Instance Configuration of the Modularized CMA-ES by Means of Classifier Chains and Exploratory Landscape Analysis.” In <i>Proceedings of the IEEE Symposium Series on Computational Intelligence (SSCI)</i>, 996–1003. Canberra, Australia, 2020. <a href=\"https://doi.org/10.1109/SSCI47803.2020.9308510\">https://doi.org/10.1109/SSCI47803.2020.9308510</a>.","short":"R.P. Prager, H. Trautmann, H. Wang, T.H.W. Bäck, P. Kerschke, in: Proceedings of the IEEE Symposium Series on Computational Intelligence (SSCI), Canberra, Australia, 2020, pp. 996–1003."},"publication":"Proceedings of the IEEE Symposium Series on Computational Intelligence (SSCI)","abstract":[{"lang":"eng","text":"In this paper, we rely on previous work proposing a modularized version of CMA-ES, which captures several alterations to the conventional CMA-ES developed in recent years. Each alteration provides significant advantages under certain problem properties, e.g., multi-modality, high conditioning. These distinct advancements are implemented as modules which result in 4608 unique versions of CMA-ES. Previous findings illustrate the competitive advantage of enabling and disabling the aforementioned modules for different optimization problems. Yet, this modular CMA-ES is lacking a method to automatically determine when the activation of specific modules is auspicious and when it is not. We propose a well-performing instance-specific algorithm configuration model which selects an (almost) optimal configuration of modules for a given problem instance. In addition, the structure of this configuration model is able to capture inter-dependencies between modules, e.g., two (or more) modules might only be advantageous in unison for some problem types, making the orchestration of modules a crucial task. This is accomplished by chaining multiple random forest classifiers together into a so-called Classifier Chain based on a set of numerical features extracted by means of Exploratory Landscape Analysis (ELA) to describe the given problem instances."}],"place":"Canberra, Australia","date_created":"2023-08-04T07:37:30Z","department":[{"_id":"34"},{"_id":"819"}],"type":"conference"},{"user_id":"15504","doi":"10.1007/978-3-030-53552-0_10","page":"80–95","_id":"46326","language":[{"iso":"eng"}],"date_updated":"2023-10-16T13:03:36Z","year":"2020","title":"confStream: Automated Algorithm Selection and Configuration of Stream Clustering Algorithms","status":"public","author":[{"last_name":"Carnein","first_name":"Matthias","full_name":"Carnein, Matthias"},{"full_name":"Trautmann, Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike","id":"100740"},{"last_name":"Bifet","first_name":"Albert","full_name":"Bifet, Albert"},{"full_name":"Pfahringer, Bernhard","last_name":"Pfahringer","first_name":"Bernhard"}],"type":"conference","department":[{"_id":"34"},{"_id":"819"}],"date_created":"2023-08-04T07:36:03Z","place":"Athens, Greece","abstract":[{"lang":"eng","text":"Machine learning has become one of the most important tools in data analysis. However, selecting the most appropriate machine learning algorithm and tuning its hyperparameters to their optimal values remains a difficult task. This is even more difficult for streaming applications where automated approaches are often not available to help during algorithm selection and configuration. This paper proposes the first approach for automated algorithm selection and configuration of stream clustering algorithms. We train an ensemble of different stream clustering algorithms and configurations in parallel and use the best performing configuration to obtain a clustering solution. By drawing new configurations from better performing ones, we are able to improve the ensemble performance over time. In large experiments on real and artificial data we show how our ensemble approach can improve upon default configurations and can also compete with a-posteriori algorithm configuration. Our approach is considerably faster than a-posteriori approaches and applicable in real-time. In addition, it is not limited to stream clustering and can be generalised to all streaming applications, including stream classification and regression."}],"publication":"Proceedings of the 14$^th$ Learning and Intelligent Optimization Conference (LION 2020)","citation":{"mla":"Carnein, Matthias, et al. “ConfStream: Automated Algorithm Selection and Configuration of Stream Clustering Algorithms.” <i>Proceedings of the 14$^th$ Learning and Intelligent Optimization Conference (LION 2020)</i>, 2020, pp. 80–95, doi:<a href=\"https://doi.org/10.1007/978-3-030-53552-0_10\">10.1007/978-3-030-53552-0_10</a>.","ama":"Carnein M, Trautmann H, Bifet A, Pfahringer B. confStream: Automated Algorithm Selection and Configuration of Stream Clustering Algorithms. In: <i>Proceedings of the 14$^th$ Learning and Intelligent Optimization Conference (LION 2020)</i>. ; 2020:80–95. doi:<a href=\"https://doi.org/10.1007/978-3-030-53552-0_10\">10.1007/978-3-030-53552-0_10</a>","bibtex":"@inproceedings{Carnein_Trautmann_Bifet_Pfahringer_2020, place={Athens, Greece}, title={confStream: Automated Algorithm Selection and Configuration of Stream Clustering Algorithms}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-53552-0_10\">10.1007/978-3-030-53552-0_10</a>}, booktitle={Proceedings of the 14$^th$ Learning and Intelligent Optimization Conference (LION 2020)}, author={Carnein, Matthias and Trautmann, Heike and Bifet, Albert and Pfahringer, Bernhard}, year={2020}, pages={80–95} }","apa":"Carnein, M., Trautmann, H., Bifet, A., &#38; Pfahringer, B. (2020). confStream: Automated Algorithm Selection and Configuration of Stream Clustering Algorithms. <i>Proceedings of the 14$^th$ Learning and Intelligent Optimization Conference (LION 2020)</i>, 80–95. <a href=\"https://doi.org/10.1007/978-3-030-53552-0_10\">https://doi.org/10.1007/978-3-030-53552-0_10</a>","ieee":"M. Carnein, H. Trautmann, A. Bifet, and B. Pfahringer, “confStream: Automated Algorithm Selection and Configuration of Stream Clustering Algorithms,” in <i>Proceedings of the 14$^th$ Learning and Intelligent Optimization Conference (LION 2020)</i>, 2020, pp. 80–95, doi: <a href=\"https://doi.org/10.1007/978-3-030-53552-0_10\">10.1007/978-3-030-53552-0_10</a>.","chicago":"Carnein, Matthias, Heike Trautmann, Albert Bifet, and Bernhard Pfahringer. “ConfStream: Automated Algorithm Selection and Configuration of Stream Clustering Algorithms.” In <i>Proceedings of the 14$^th$ Learning and Intelligent Optimization Conference (LION 2020)</i>, 80–95. Athens, Greece, 2020. <a href=\"https://doi.org/10.1007/978-3-030-53552-0_10\">https://doi.org/10.1007/978-3-030-53552-0_10</a>.","short":"M. Carnein, H. Trautmann, A. Bifet, B. Pfahringer, in: Proceedings of the 14$^th$ Learning and Intelligent Optimization Conference (LION 2020), Athens, Greece, 2020, pp. 80–95."}},{"place":"Canberra, Australia","date_created":"2023-08-04T07:40:33Z","department":[{"_id":"34"},{"_id":"819"}],"type":"conference","citation":{"ama":"Steinhoff V, Kerschke P, Aspar P, Trautmann H, Grimme C. Multiobjectivization of Local Search: Single-Objective Optimization Benefits From Multi-Objective Gradient Descent. In: <i>Proceedings of the IEEE Symposium Series on Computational Intelligence (SSCI)</i>. ; 2020:2445–2452. doi:<a href=\"https://doi.org/10.1109/SSCI47803.2020.9308259\">10.1109/SSCI47803.2020.9308259</a>","bibtex":"@inproceedings{Steinhoff_Kerschke_Aspar_Trautmann_Grimme_2020, place={Canberra, Australia}, title={Multiobjectivization of Local Search: Single-Objective Optimization Benefits From Multi-Objective Gradient Descent}, DOI={<a href=\"https://doi.org/10.1109/SSCI47803.2020.9308259\">10.1109/SSCI47803.2020.9308259</a>}, booktitle={Proceedings of the IEEE Symposium Series on Computational Intelligence (SSCI)}, author={Steinhoff, Vera and Kerschke, Pascal and Aspar, Pelin and Trautmann, Heike and Grimme, Christian}, year={2020}, pages={2445–2452} }","mla":"Steinhoff, Vera, et al. “Multiobjectivization of Local Search: Single-Objective Optimization Benefits From Multi-Objective Gradient Descent.” <i>Proceedings of the IEEE Symposium Series on Computational Intelligence (SSCI)</i>, 2020, pp. 2445–2452, doi:<a href=\"https://doi.org/10.1109/SSCI47803.2020.9308259\">10.1109/SSCI47803.2020.9308259</a>.","chicago":"Steinhoff, Vera, Pascal Kerschke, Pelin Aspar, Heike Trautmann, and Christian Grimme. “Multiobjectivization of Local Search: Single-Objective Optimization Benefits From Multi-Objective Gradient Descent.” In <i>Proceedings of the IEEE Symposium Series on Computational Intelligence (SSCI)</i>, 2445–2452. Canberra, Australia, 2020. <a href=\"https://doi.org/10.1109/SSCI47803.2020.9308259\">https://doi.org/10.1109/SSCI47803.2020.9308259</a>.","short":"V. Steinhoff, P. Kerschke, P. Aspar, H. Trautmann, C. Grimme, in: Proceedings of the IEEE Symposium Series on Computational Intelligence (SSCI), Canberra, Australia, 2020, pp. 2445–2452.","apa":"Steinhoff, V., Kerschke, P., Aspar, P., Trautmann, H., &#38; Grimme, C. (2020). Multiobjectivization of Local Search: Single-Objective Optimization Benefits From Multi-Objective Gradient Descent. <i>Proceedings of the IEEE Symposium Series on Computational Intelligence (SSCI)</i>, 2445–2452. <a href=\"https://doi.org/10.1109/SSCI47803.2020.9308259\">https://doi.org/10.1109/SSCI47803.2020.9308259</a>","ieee":"V. Steinhoff, P. Kerschke, P. Aspar, H. Trautmann, and C. Grimme, “Multiobjectivization of Local Search: Single-Objective Optimization Benefits From Multi-Objective Gradient Descent,” in <i>Proceedings of the IEEE Symposium Series on Computational Intelligence (SSCI)</i>, 2020, pp. 2445–2452, doi: <a href=\"https://doi.org/10.1109/SSCI47803.2020.9308259\">10.1109/SSCI47803.2020.9308259</a>."},"publication":"Proceedings of the IEEE Symposium Series on Computational Intelligence (SSCI)","abstract":[{"lang":"eng","text":"Multimodality is one of the biggest difficulties for optimization as local optima are often preventing algorithms from making progress. This does not only challenge local strategies that can get stuck. It also hinders meta-heuristics like evolutionary algorithms in convergence to the global optimum. In this paper we present a new concept of gradient descent, which is able to escape local traps. It relies on multiobjectivization of the original problem and applies the recently proposed and here slightly modified multi-objective local search mechanism MOGSA. We use a sophisticated visualization technique for multi-objective problems to prove the working principle of our idea. As such, this work highlights the transfer of new insights from the multi-objective to the single-objective domain and provides first visual evidence that multiobjectivization can link single-objective local optima in multimodal landscapes."}],"language":[{"iso":"eng"}],"_id":"46332","page":"2445–2452","doi":"10.1109/SSCI47803.2020.9308259","user_id":"15504","author":[{"full_name":"Steinhoff, Vera","first_name":"Vera","last_name":"Steinhoff"},{"full_name":"Kerschke, Pascal","first_name":"Pascal","last_name":"Kerschke"},{"full_name":"Aspar, Pelin","last_name":"Aspar","first_name":"Pelin"},{"orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike","full_name":"Trautmann, Heike","id":"100740"},{"full_name":"Grimme, Christian","last_name":"Grimme","first_name":"Christian"}],"title":"Multiobjectivization of Local Search: Single-Objective Optimization Benefits From Multi-Objective Gradient Descent","status":"public","year":"2020","date_updated":"2023-10-16T13:05:49Z"},{"file_date_updated":"2021-03-03T14:21:50Z","citation":{"bibtex":"@article{Protte_Fahr_Quevedo_2020, title={Behavioral Economics for Human-in-the-loop Control Systems Design: Overconfidence and the hot hand fallacy}, volume={40}, DOI={<a href=\"https://doi.org/10.1109/MCS.2020.3019723\">10.1109/MCS.2020.3019723</a>}, number={6}, journal={IEEE Control Systems Magazine}, publisher={IEEE}, author={Protte, Marius and Fahr, René and Quevedo, Daniel E.}, year={2020}, pages={57–76} }","ama":"Protte M, Fahr R, Quevedo DE. Behavioral Economics for Human-in-the-loop Control Systems Design: Overconfidence and the hot hand fallacy. <i>IEEE Control Systems Magazine</i>. 2020;40(6):57-76. doi:<a href=\"https://doi.org/10.1109/MCS.2020.3019723\">10.1109/MCS.2020.3019723</a>","mla":"Protte, Marius, et al. “Behavioral Economics for Human-in-the-Loop Control Systems Design: Overconfidence and the Hot Hand Fallacy.” <i>IEEE Control Systems Magazine</i>, vol. 40, no. 6, IEEE, 2020, pp. 57–76, doi:<a href=\"https://doi.org/10.1109/MCS.2020.3019723\">10.1109/MCS.2020.3019723</a>.","chicago":"Protte, Marius, René Fahr, and Daniel E. Quevedo. “Behavioral Economics for Human-in-the-Loop Control Systems Design: Overconfidence and the Hot Hand Fallacy.” <i>IEEE Control Systems Magazine</i> 40, no. 6 (2020): 57–76. <a href=\"https://doi.org/10.1109/MCS.2020.3019723\">https://doi.org/10.1109/MCS.2020.3019723</a>.","short":"M. Protte, R. Fahr, D.E. Quevedo, IEEE Control Systems Magazine 40 (2020) 57–76.","ieee":"M. Protte, R. Fahr, and D. E. Quevedo, “Behavioral Economics for Human-in-the-loop Control Systems Design: Overconfidence and the hot hand fallacy,” <i>IEEE Control Systems Magazine</i>, vol. 40, no. 6, pp. 57–76, 2020, doi: <a href=\"https://doi.org/10.1109/MCS.2020.3019723\">10.1109/MCS.2020.3019723</a>.","apa":"Protte, M., Fahr, R., &#38; Quevedo, D. E. (2020). Behavioral Economics for Human-in-the-loop Control Systems Design: Overconfidence and the hot hand fallacy. <i>IEEE Control Systems Magazine</i>, <i>40</i>(6), 57–76. <a href=\"https://doi.org/10.1109/MCS.2020.3019723\">https://doi.org/10.1109/MCS.2020.3019723</a>"},"status":"public","has_accepted_license":"1","page":"57 - 76","publisher":"IEEE","_id":"21369","user_id":"44549","ddc":["620","330"],"volume":40,"publication":"IEEE Control Systems Magazine","issue":"6","abstract":[{"text":"Successful design of human-in-the-loop control sys- tems requires appropriate models for human decision makers. Whilst most paradigms adopted in the control systems literature hide the (limited) decision capability of humans, in behavioral economics individual decision making and optimization processes are well-known to be affected by perceptual and behavioral biases. Our goal is to enrich control engineering with some insights from behavioral economics research through exposing such biases in control-relevant settings.\r\nThis paper addresses the following two key questions:\r\n1) How do behavioral biases affect decision making?\r\n2) What is the role played by feedback in human-in-the-loop control systems?\r\nOur experimental framework shows how individuals behave when faced with the task of piloting an UAV under risk and uncertainty, paralleling a real-world decision-making scenario. Our findings support the notion of humans in Cyberphysical Systems underlying behavioral biases regardless of – or even because of – receiving immediate outcome feedback. We observe substantial shares of drone controllers to act inefficiently through either flying excessively (overconfident) or overly conservatively (underconfident). Furthermore, we observe human-controllers to self-servingly misinterpret random sequences through being subject to a “hot hand fallacy”. We advise control engineers to mind the human component in order not to compromise technological accomplishments through human issues.","lang":"eng"}],"file":[{"date_updated":"2021-03-03T14:21:50Z","relation":"main_file","access_level":"closed","file_size":1501292,"file_name":"Protte_Fahr_Quevedo.pdf","content_type":"application/pdf","success":1,"file_id":"21370","creator":"mprotte","date_created":"2021-03-03T14:21:50Z"}],"date_created":"2021-03-03T14:20:10Z","type":"journal_article","department":[{"_id":"179"}],"title":"Behavioral Economics for Human-in-the-loop Control Systems Design: Overconfidence and the hot hand fallacy","year":"2020","author":[{"id":"44549","last_name":"Protte","first_name":"Marius","full_name":"Protte, Marius"},{"full_name":"Fahr, René","last_name":"Fahr","first_name":"René","id":"111"},{"full_name":"Quevedo, Daniel E.","last_name":"Quevedo","first_name":"Daniel E."}],"publication_status":"published","date_updated":"2023-10-23T10:38:19Z","intvolume":"        40","language":[{"iso":"eng"}],"doi":"10.1109/MCS.2020.3019723"},{"abstract":[{"lang":"eng","text":"In this work we review the novel framework for the computation of finite dimensional invariant sets of infinite dimensional dynamical systems developed in [6] and [36]. By utilizing results on embedding techniques for infinite dimensional systems we extend a classical subdivision scheme [8] as well as a continuation algorithm [7] for the computation of attractors and invariant manifolds of finite dimensional systems to the infinite dimensional case. We show how to implement this approach for the analysis of delay differential equations and partial differential equations and illustrate the feasibility of our implementation by computing the attractor of the Mackey-Glass equation and the unstable manifold of the one-dimensional Kuramoto-Sivashinsky equation."}],"publication":"Advances in Dynamics, Optimization and Computation","department":[{"_id":"101"}],"type":"book_chapter","date_created":"2020-08-14T15:02:22Z","intvolume":"       304","date_updated":"2023-11-17T13:13:25Z","publication_status":"published","author":[{"id":"32655","last_name":"Gerlach","first_name":"Raphael","full_name":"Gerlach, Raphael"},{"full_name":"Ziessler, Adrian","first_name":"Adrian","last_name":"Ziessler"}],"publication_identifier":{"issn":["2198-4182","2198-4190"],"isbn":["9783030512637","9783030512644"]},"title":"The Approximation of Invariant Sets in Infinite Dimensional Dynamical Systems","year":"2020","doi":"10.1007/978-3-030-51264-4_3","language":[{"iso":"eng"}],"series_title":"Studies in Systems, Decision and Control","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/978-3-030-51264-4_3"}],"citation":{"mla":"Gerlach, Raphael, and Adrian Ziessler. “The Approximation of Invariant Sets in Infinite Dimensional Dynamical Systems.” <i>Advances in Dynamics, Optimization and Computation</i>, edited by Oliver Junge et al., vol. 304, Springer International Publishing, 2020, pp. 66–85, doi:<a href=\"https://doi.org/10.1007/978-3-030-51264-4_3\">10.1007/978-3-030-51264-4_3</a>.","ama":"Gerlach R, Ziessler A. The Approximation of Invariant Sets in Infinite Dimensional Dynamical Systems. In: Junge O, Schütze O, Ober-Blöbaum S, Padberg-Gehle K, eds. <i>Advances in Dynamics, Optimization and Computation</i>. Vol 304. Studies in Systems, Decision and Control. Springer International Publishing; 2020:66-85. doi:<a href=\"https://doi.org/10.1007/978-3-030-51264-4_3\">10.1007/978-3-030-51264-4_3</a>","bibtex":"@inbook{Gerlach_Ziessler_2020, place={Cham}, series={Studies in Systems, Decision and Control}, title={The Approximation of Invariant Sets in Infinite Dimensional Dynamical Systems}, volume={304}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-51264-4_3\">10.1007/978-3-030-51264-4_3</a>}, booktitle={Advances in Dynamics, Optimization and Computation}, publisher={Springer International Publishing}, author={Gerlach, Raphael and Ziessler, Adrian}, editor={Junge, Oliver and Schütze, Oliver and Ober-Blöbaum, Sina and Padberg-Gehle, Kathrin}, year={2020}, pages={66–85}, collection={Studies in Systems, Decision and Control} }","apa":"Gerlach, R., &#38; Ziessler, A. (2020). The Approximation of Invariant Sets in Infinite Dimensional Dynamical Systems. In O. Junge, O. Schütze, S. Ober-Blöbaum, &#38; K. Padberg-Gehle (Eds.), <i>Advances in Dynamics, Optimization and Computation</i> (Vol. 304, pp. 66–85). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-51264-4_3\">https://doi.org/10.1007/978-3-030-51264-4_3</a>","ieee":"R. Gerlach and A. Ziessler, “The Approximation of Invariant Sets in Infinite Dimensional Dynamical Systems,” in <i>Advances in Dynamics, Optimization and Computation</i>, vol. 304, O. Junge, O. Schütze, S. Ober-Blöbaum, and K. Padberg-Gehle, Eds. Cham: Springer International Publishing, 2020, pp. 66–85.","short":"R. Gerlach, A. Ziessler, in: O. Junge, O. Schütze, S. Ober-Blöbaum, K. Padberg-Gehle (Eds.), Advances in Dynamics, Optimization and Computation, Springer International Publishing, Cham, 2020, pp. 66–85.","chicago":"Gerlach, Raphael, and Adrian Ziessler. “The Approximation of Invariant Sets in Infinite Dimensional Dynamical Systems.” In <i>Advances in Dynamics, Optimization and Computation</i>, edited by Oliver Junge, Oliver Schütze, Sina Ober-Blöbaum, and Kathrin Padberg-Gehle, 304:66–85. Studies in Systems, Decision and Control. Cham: Springer International Publishing, 2020. <a href=\"https://doi.org/10.1007/978-3-030-51264-4_3\">https://doi.org/10.1007/978-3-030-51264-4_3</a>."},"place":"Cham","status":"public","editor":[{"full_name":"Junge, Oliver","first_name":"Oliver","last_name":"Junge"},{"first_name":"Oliver","last_name":"Schütze","full_name":"Schütze, Oliver"},{"full_name":"Ober-Blöbaum, Sina","last_name":"Ober-Blöbaum","first_name":"Sina"},{"full_name":"Padberg-Gehle, Kathrin","first_name":"Kathrin","last_name":"Padberg-Gehle"}],"volume":304,"user_id":"32655","_id":"17994","publisher":"Springer International Publishing","page":"66-85"},{"page":"1277–1285","_id":"48847","publisher":"Association for Computing Machinery","user_id":"102979","status":"public","place":"New York, NY, USA","citation":{"chicago":"Bossek, Jakob, Frank Neumann, Pan Peng, and Dirk Sudholt. “More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 1277–1285. GECCO ’20. New York, NY, USA: Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3377930.3390174\">https://doi.org/10.1145/3377930.3390174</a>.","short":"J. Bossek, F. Neumann, P. Peng, D. Sudholt, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2020, pp. 1277–1285.","apa":"Bossek, J., Neumann, F., Peng, P., &#38; Sudholt, D. (2020). More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 1277–1285. <a href=\"https://doi.org/10.1145/3377930.3390174\">https://doi.org/10.1145/3377930.3390174</a>","ieee":"J. Bossek, F. Neumann, P. Peng, and D. Sudholt, “More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2020, pp. 1277–1285, doi: <a href=\"https://doi.org/10.1145/3377930.3390174\">10.1145/3377930.3390174</a>.","ama":"Bossek J, Neumann F, Peng P, Sudholt D. More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. GECCO ’20. Association for Computing Machinery; 2020:1277–1285. doi:<a href=\"https://doi.org/10.1145/3377930.3390174\">10.1145/3377930.3390174</a>","bibtex":"@inproceedings{Bossek_Neumann_Peng_Sudholt_2020, place={New York, NY, USA}, series={GECCO ’20}, title={More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization}, DOI={<a href=\"https://doi.org/10.1145/3377930.3390174\">10.1145/3377930.3390174</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Neumann, Frank and Peng, Pan and Sudholt, Dirk}, year={2020}, pages={1277–1285}, collection={GECCO ’20} }","mla":"Bossek, Jakob, et al. “More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2020, pp. 1277–1285, doi:<a href=\"https://doi.org/10.1145/3377930.3390174\">10.1145/3377930.3390174</a>."},"series_title":"GECCO ’20","language":[{"iso":"eng"}],"doi":"10.1145/3377930.3390174","title":"More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization","year":"2020","author":[{"orcid":"0000-0002-4121-4668","last_name":"Bossek","first_name":"Jakob","full_name":"Bossek, Jakob","id":"102979"},{"first_name":"Frank","last_name":"Neumann","full_name":"Neumann, Frank"},{"full_name":"Peng, Pan","last_name":"Peng","first_name":"Pan"},{"full_name":"Sudholt, Dirk","last_name":"Sudholt","first_name":"Dirk"}],"publication_identifier":{"isbn":["978-1-4503-7128-5"]},"publication_status":"published","date_updated":"2023-12-13T10:43:41Z","date_created":"2023-11-14T15:58:53Z","keyword":["dynamic optimization","evolutionary algorithms","running time analysis","theory"],"type":"conference","department":[{"_id":"819"}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference","extern":"1","abstract":[{"text":"Dynamic optimization problems have gained significant attention in evolutionary computation as evolutionary algorithms (EAs) can easily adapt to changing environments. We show that EAs can solve the graph coloring problem for bipartite graphs more efficiently by using dynamic optimization. In our approach the graph instance is given incrementally such that the EA can reoptimize its coloring when a new edge introduces a conflict. We show that, when edges are inserted in a way that preserves graph connectivity, Randomized Local Search (RLS) efficiently finds a proper 2-coloring for all bipartite graphs. This includes graphs for which RLS and other EAs need exponential expected time in a static optimization scenario. We investigate different ways of building up the graph by popular graph traversals such as breadth-first-search and depth-first-search and analyse the resulting runtime behavior. We further show that offspring populations (e. g. a (1 + {$\\lambda$}) RLS) lead to an exponential speedup in {$\\lambda$}. Finally, an island model using 3 islands succeeds in an optimal time of {$\\Theta$}(m) on every m-edge bipartite graph, outperforming offspring populations. This is the first example where an island model guarantees a speedup that is not bounded in the number of islands.","lang":"eng"}]},{"place":"Berlin, Heidelberg","citation":{"ama":"Bossek J, Doerr C, Kerschke P, Neumann A, Neumann F. Evolving Sampling Strategies for One-Shot Optimization Tasks. In: <i>Parallel Problem Solving from Nature (PPSN XVI)</i>. Springer-Verlag; 2020:111–124. doi:<a href=\"https://doi.org/10.1007/978-3-030-58112-1_8\">10.1007/978-3-030-58112-1_8</a>","bibtex":"@inproceedings{Bossek_Doerr_Kerschke_Neumann_Neumann_2020, place={Berlin, Heidelberg}, title={Evolving Sampling Strategies for One-Shot Optimization Tasks}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-58112-1_8\">10.1007/978-3-030-58112-1_8</a>}, booktitle={Parallel Problem Solving from Nature (PPSN XVI)}, publisher={Springer-Verlag}, author={Bossek, Jakob and Doerr, Carola and Kerschke, Pascal and Neumann, Aneta and Neumann, Frank}, year={2020}, pages={111–124} }","mla":"Bossek, Jakob, et al. “Evolving Sampling Strategies for One-Shot Optimization Tasks.” <i>Parallel Problem Solving from Nature (PPSN XVI)</i>, Springer-Verlag, 2020, pp. 111–124, doi:<a href=\"https://doi.org/10.1007/978-3-030-58112-1_8\">10.1007/978-3-030-58112-1_8</a>.","chicago":"Bossek, Jakob, Carola Doerr, Pascal Kerschke, Aneta Neumann, and Frank Neumann. “Evolving Sampling Strategies for One-Shot Optimization Tasks.” In <i>Parallel Problem Solving from Nature (PPSN XVI)</i>, 111–124. Berlin, Heidelberg: Springer-Verlag, 2020. <a href=\"https://doi.org/10.1007/978-3-030-58112-1_8\">https://doi.org/10.1007/978-3-030-58112-1_8</a>.","short":"J. Bossek, C. Doerr, P. Kerschke, A. Neumann, F. Neumann, in: Parallel Problem Solving from Nature (PPSN XVI), Springer-Verlag, Berlin, Heidelberg, 2020, pp. 111–124.","apa":"Bossek, J., Doerr, C., Kerschke, P., Neumann, A., &#38; Neumann, F. (2020). Evolving Sampling Strategies for One-Shot Optimization Tasks. <i>Parallel Problem Solving from Nature (PPSN XVI)</i>, 111–124. <a href=\"https://doi.org/10.1007/978-3-030-58112-1_8\">https://doi.org/10.1007/978-3-030-58112-1_8</a>","ieee":"J. Bossek, C. Doerr, P. Kerschke, A. Neumann, and F. Neumann, “Evolving Sampling Strategies for One-Shot Optimization Tasks,” in <i>Parallel Problem Solving from Nature (PPSN XVI)</i>, 2020, pp. 111–124, doi: <a href=\"https://doi.org/10.1007/978-3-030-58112-1_8\">10.1007/978-3-030-58112-1_8</a>."},"_id":"48849","publisher":"Springer-Verlag","page":"111–124","user_id":"102979","status":"public","date_created":"2023-11-14T15:58:53Z","department":[{"_id":"819"}],"type":"conference","keyword":["Continuous optimization","Fully parallel search","One-shot optimization","Regression","Surrogate-assisted optimization"],"publication":"Parallel Problem Solving from Nature (PPSN XVI)","extern":"1","abstract":[{"lang":"eng","text":"One-shot optimization tasks require to determine the set of solution candidates prior to their evaluation, i.e., without possibility for adaptive sampling. We consider two variants, classic one-shot optimization (where our aim is to find at least one solution of high quality) and one-shot regression (where the goal is to fit a model that resembles the true problem as well as possible). For both tasks it seems intuitive that well-distributed samples should perform better than uniform or grid-based samples, since they show a better coverage of the decision space. In practice, quasi-random designs such as Latin Hypercube Samples and low-discrepancy point sets are indeed very commonly used designs for one-shot optimization tasks. We study in this work how well low star discrepancy correlates with performance in one-shot optimization. Our results confirm an advantage of low-discrepancy designs, but also indicate the correlation between discrepancy values and overall performance is rather weak. We then demonstrate that commonly used designs may be far from optimal. More precisely, we evolve 24 very specific designs that each achieve good performance on one of our benchmark problems. Interestingly, we find that these specifically designed samples yield surprisingly good performance across the whole benchmark set. Our results therefore give strong indication that significant performance gains over state-of-the-art one-shot sampling techniques are possible, and that evolutionary algorithms can be an efficient means to evolve these."}],"language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-58112-1_8","publication_identifier":{"isbn":["978-3-030-58111-4"]},"author":[{"id":"102979","first_name":"Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668","full_name":"Bossek, Jakob"},{"full_name":"Doerr, Carola","last_name":"Doerr","first_name":"Carola"},{"full_name":"Kerschke, Pascal","first_name":"Pascal","last_name":"Kerschke"},{"first_name":"Aneta","last_name":"Neumann","full_name":"Neumann, Aneta"},{"full_name":"Neumann, Frank","last_name":"Neumann","first_name":"Frank"}],"title":"Evolving Sampling Strategies for One-Shot Optimization Tasks","year":"2020","publication_status":"published","date_updated":"2023-12-13T10:43:53Z"},{"user_id":"102979","_id":"48851","publisher":"Association for Computing Machinery","page":"1286–1294","status":"public","place":"New York, NY, USA","citation":{"mla":"Bossek, Jakob, et al. “The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2020, pp. 1286–1294, doi:<a href=\"https://doi.org/10.1145/3377930.3390243\">10.1145/3377930.3390243</a>.","ama":"Bossek J, Casel K, Kerschke P, Neumann F. The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. GECCO ’20. Association for Computing Machinery; 2020:1286–1294. doi:<a href=\"https://doi.org/10.1145/3377930.3390243\">10.1145/3377930.3390243</a>","bibtex":"@inproceedings{Bossek_Casel_Kerschke_Neumann_2020, place={New York, NY, USA}, series={GECCO ’20}, title={The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics}, DOI={<a href=\"https://doi.org/10.1145/3377930.3390243\">10.1145/3377930.3390243</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Casel, Katrin and Kerschke, Pascal and Neumann, Frank}, year={2020}, pages={1286–1294}, collection={GECCO ’20} }","apa":"Bossek, J., Casel, K., Kerschke, P., &#38; Neumann, F. (2020). The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 1286–1294. <a href=\"https://doi.org/10.1145/3377930.3390243\">https://doi.org/10.1145/3377930.3390243</a>","ieee":"J. Bossek, K. Casel, P. Kerschke, and F. Neumann, “The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2020, pp. 1286–1294, doi: <a href=\"https://doi.org/10.1145/3377930.3390243\">10.1145/3377930.3390243</a>.","chicago":"Bossek, Jakob, Katrin Casel, Pascal Kerschke, and Frank Neumann. “The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 1286–1294. GECCO ’20. New York, NY, USA: Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3377930.3390243\">https://doi.org/10.1145/3377930.3390243</a>.","short":"J. Bossek, K. Casel, P. Kerschke, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2020, pp. 1286–1294."},"doi":"10.1145/3377930.3390243","series_title":"GECCO ’20","language":[{"iso":"eng"}],"date_updated":"2023-12-13T10:43:33Z","publication_status":"published","publication_identifier":{"isbn":["978-1-4503-7128-5"]},"author":[{"id":"102979","last_name":"Bossek","first_name":"Jakob","orcid":"0000-0002-4121-4668","full_name":"Bossek, Jakob"},{"full_name":"Casel, Katrin","last_name":"Casel","first_name":"Katrin"},{"full_name":"Kerschke, Pascal","last_name":"Kerschke","first_name":"Pascal"},{"first_name":"Frank","last_name":"Neumann","full_name":"Neumann, Frank"}],"title":"The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics","year":"2020","department":[{"_id":"819"}],"type":"conference","keyword":["dynamic optimization","evolutionary algorithms","running time analysis","theory"],"date_created":"2023-11-14T15:58:53Z","abstract":[{"text":"Several important optimization problems in the area of vehicle routing can be seen as variants of the classical Traveling Salesperson Problem (TSP). In the area of evolutionary computation, the Traveling Thief Problem (TTP) has gained increasing interest over the last 5 years. In this paper, we investigate the effect of weights on such problems, in the sense that the cost of traveling increases with respect to the weights of nodes already visited during a tour. This provides abstractions of important TSP variants such as the Traveling Thief Problem and time dependent TSP variants, and allows to study precisely the increase in difficulty caused by weight dependence. We provide a 3.59-approximation for this weight dependent version of TSP with metric distances and bounded positive weights. Furthermore, we conduct experimental investigations for simple randomized local search with classical mutation operators and two variants of the state-of-the-art evolutionary algorithm EAX adapted to the weighted TSP. Our results show the impact of the node weights on the position of the nodes in the resulting tour.","lang":"eng"}],"extern":"1","publication":"Proceedings of the Genetic and Evolutionary Computation Conference"},{"status":"public","_id":"48845","publisher":"Association for Computing Machinery","page":"166–174","user_id":"102979","citation":{"mla":"Bossek, Jakob, et al. “Dynamic Bi-Objective Routing of Multiple Vehicles.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2020, pp. 166–174, doi:<a href=\"https://doi.org/10.1145/3377930.3390146\">10.1145/3377930.3390146</a>.","ama":"Bossek J, Grimme C, Trautmann H. Dynamic Bi-Objective Routing of Multiple Vehicles. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. GECCO ’20. Association for Computing Machinery; 2020:166–174. doi:<a href=\"https://doi.org/10.1145/3377930.3390146\">10.1145/3377930.3390146</a>","bibtex":"@inproceedings{Bossek_Grimme_Trautmann_2020, place={New York, NY, USA}, series={GECCO ’20}, title={Dynamic Bi-Objective Routing of Multiple Vehicles}, DOI={<a href=\"https://doi.org/10.1145/3377930.3390146\">10.1145/3377930.3390146</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Grimme, Christian and Trautmann, Heike}, year={2020}, pages={166–174}, collection={GECCO ’20} }","apa":"Bossek, J., Grimme, C., &#38; Trautmann, H. (2020). Dynamic Bi-Objective Routing of Multiple Vehicles. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 166–174. <a href=\"https://doi.org/10.1145/3377930.3390146\">https://doi.org/10.1145/3377930.3390146</a>","ieee":"J. Bossek, C. Grimme, and H. Trautmann, “Dynamic Bi-Objective Routing of Multiple Vehicles,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2020, pp. 166–174, doi: <a href=\"https://doi.org/10.1145/3377930.3390146\">10.1145/3377930.3390146</a>.","chicago":"Bossek, Jakob, Christian Grimme, and Heike Trautmann. “Dynamic Bi-Objective Routing of Multiple Vehicles.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 166–174. GECCO ’20. New York, NY, USA: Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3377930.3390146\">https://doi.org/10.1145/3377930.3390146</a>.","short":"J. Bossek, C. Grimme, H. Trautmann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2020, pp. 166–174."},"place":"New York, NY, USA","author":[{"id":"102979","orcid":"0000-0002-4121-4668","last_name":"Bossek","first_name":"Jakob","full_name":"Bossek, Jakob"},{"last_name":"Grimme","first_name":"Christian","full_name":"Grimme, Christian"},{"full_name":"Trautmann, Heike","first_name":"Heike","last_name":"Trautmann"}],"publication_identifier":{"isbn":["978-1-4503-7128-5"]},"year":"2020","title":"Dynamic Bi-Objective Routing of Multiple Vehicles","publication_status":"published","date_updated":"2023-12-13T10:43:24Z","language":[{"iso":"eng"}],"series_title":"GECCO ’20","doi":"10.1145/3377930.3390146","publication":"Proceedings of the Genetic and Evolutionary Computation Conference","extern":"1","abstract":[{"lang":"eng","text":"In practice, e.g. in delivery and service scenarios, Vehicle-Routing-Problems (VRPs) often imply repeated decision making on dynamic customer requests. As in classical VRPs, tours have to be planned short while the number of serviced customers has to be maximized at the same time resulting in a multi-objective problem. Beyond that, however, dynamic requests lead to the need for re-planning of not yet realized tour parts, while already realized tour parts are irreversible. In this paper we study this type of bi-objective dynamic VRP including sequential decision making and concurrent realization of decisions. We adopt a recently proposed Dynamic Evolutionary Multi-Objective Algorithm (DEMOA) for a related VRP problem and extend it to the more realistic (here considered) scenario of multiple vehicles. We empirically show that our DEMOA is competitive with a multi-vehicle offline and clairvoyant variant of the proposed DEMOA as well as with the dynamic single-vehicle approach proposed earlier."}],"date_created":"2023-11-14T15:58:52Z","department":[{"_id":"819"}],"keyword":["decision making","dynamic optimization","evolutionary algorithms","multi-objective optimization","vehicle routing"],"type":"conference"},{"status":"public","title":"Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection","year":"2020","author":[{"full_name":"Bossek, Jakob","last_name":"Bossek","first_name":"Jakob","orcid":"0000-0002-4121-4668","id":"102979"},{"full_name":"Kerschke, Pascal","last_name":"Kerschke","first_name":"Pascal"},{"last_name":"Trautmann","first_name":"Heike","full_name":"Trautmann, Heike"}],"date_updated":"2023-12-13T10:43:16Z","publication_status":"published","page":"1–8","_id":"48844","publisher":"IEEE Press","language":[{"iso":"eng"}],"doi":"10.1109/CEC48606.2020.9185613","user_id":"102979","publication":"2020 IEEE Congress on Evolutionary Computation (CEC)","citation":{"mla":"Bossek, Jakob, et al. “Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection.” <i>2020 IEEE Congress on Evolutionary Computation (CEC)</i>, IEEE Press, 2020, pp. 1–8, doi:<a href=\"https://doi.org/10.1109/CEC48606.2020.9185613\">10.1109/CEC48606.2020.9185613</a>.","ama":"Bossek J, Kerschke P, Trautmann H. Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection. In: <i>2020 IEEE Congress on Evolutionary Computation (CEC)</i>. IEEE Press; 2020:1–8. doi:<a href=\"https://doi.org/10.1109/CEC48606.2020.9185613\">10.1109/CEC48606.2020.9185613</a>","bibtex":"@inproceedings{Bossek_Kerschke_Trautmann_2020, place={Glasgow, United Kingdom}, title={Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection}, DOI={<a href=\"https://doi.org/10.1109/CEC48606.2020.9185613\">10.1109/CEC48606.2020.9185613</a>}, booktitle={2020 IEEE Congress on Evolutionary Computation (CEC)}, publisher={IEEE Press}, author={Bossek, Jakob and Kerschke, Pascal and Trautmann, Heike}, year={2020}, pages={1–8} }","apa":"Bossek, J., Kerschke, P., &#38; Trautmann, H. (2020). Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection. <i>2020 IEEE Congress on Evolutionary Computation (CEC)</i>, 1–8. <a href=\"https://doi.org/10.1109/CEC48606.2020.9185613\">https://doi.org/10.1109/CEC48606.2020.9185613</a>","ieee":"J. Bossek, P. Kerschke, and H. Trautmann, “Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection,” in <i>2020 IEEE Congress on Evolutionary Computation (CEC)</i>, 2020, pp. 1–8, doi: <a href=\"https://doi.org/10.1109/CEC48606.2020.9185613\">10.1109/CEC48606.2020.9185613</a>.","chicago":"Bossek, Jakob, Pascal Kerschke, and Heike Trautmann. “Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection.” In <i>2020 IEEE Congress on Evolutionary Computation (CEC)</i>, 1–8. Glasgow, United Kingdom: IEEE Press, 2020. <a href=\"https://doi.org/10.1109/CEC48606.2020.9185613\">https://doi.org/10.1109/CEC48606.2020.9185613</a>.","short":"J. Bossek, P. Kerschke, H. Trautmann, in: 2020 IEEE Congress on Evolutionary Computation (CEC), IEEE Press, Glasgow, United Kingdom, 2020, pp. 1–8."},"abstract":[{"text":"The Traveling-Salesperson-Problem (TSP) is arguably one of the best-known NP-hard combinatorial optimization problems. The two sophisticated heuristic solvers LKH and EAX and respective (restart) variants manage to calculate close-to optimal or even optimal solutions, also for large instances with several thousand nodes in reasonable time. In this work we extend existing benchmarking studies by addressing anytime behaviour of inexact TSP solvers based on empirical runtime distributions leading to an increased understanding of solver behaviour and the respective relation to problem hardness. It turns out that performance ranking of solvers is highly dependent on the focused approximation quality. Insights on intersection points of performances offer huge potential for the construction of hybridized solvers depending on instance features. Moreover, instance features tailored to anytime performance and corresponding performance indicators will highly improve automated algorithm selection models by including comprehensive information on solver quality.","lang":"eng"}],"extern":"1","place":"Glasgow, United Kingdom","date_created":"2023-11-14T15:58:52Z","type":"conference","department":[{"_id":"819"}]},{"date_created":"2023-11-14T15:58:53Z","type":"conference","keyword":["continuous black-box optimization","design of experiments","initial design","sequential model-based optimization"],"department":[{"_id":"819"}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference","abstract":[{"lang":"eng","text":"Sequential model-based optimization (SMBO) approaches are algorithms for solving problems that require computationally or otherwise expensive function evaluations. The key design principle of SMBO is a substitution of the true objective function by a surrogate, which is used to propose the point(s) to be evaluated next. SMBO algorithms are intrinsically modular, leaving the user with many important design choices. Significant research efforts go into understanding which settings perform best for which type of problems. Most works, however, focus on the choice of the model, the acquisition function, and the strategy used to optimize the latter. The choice of the initial sampling strategy, however, receives much less attention. Not surprisingly, quite diverging recommendations can be found in the literature. We analyze in this work how the size and the distribution of the initial sample influences the overall quality of the efficient global optimization (EGO) algorithm, a well-known SMBO approach. While, overall, small initial budgets using Halton sampling seem preferable, we also observe that the performance landscape is rather unstructured. We furthermore identify several situations in which EGO performs unfavorably against random sampling. Both observations indicate that an adaptive SMBO design could be beneficial, making SMBO an interesting test-bed for automated algorithm design."}],"extern":"1","series_title":"GECCO ’20","language":[{"iso":"eng"}],"doi":"10.1145/3377930.3390155","title":"Initial Design Strategies and Their Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB","year":"2020","author":[{"id":"102979","last_name":"Bossek","orcid":"0000-0002-4121-4668","first_name":"Jakob","full_name":"Bossek, Jakob"},{"full_name":"Doerr, Carola","first_name":"Carola","last_name":"Doerr"},{"last_name":"Kerschke","first_name":"Pascal","full_name":"Kerschke, Pascal"}],"publication_identifier":{"isbn":["978-1-4503-7128-5"]},"date_updated":"2023-12-13T10:44:01Z","publication_status":"published","place":"New York, NY, USA","citation":{"apa":"Bossek, J., Doerr, C., &#38; Kerschke, P. (2020). Initial Design Strategies and Their Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 778–786. <a href=\"https://doi.org/10.1145/3377930.3390155\">https://doi.org/10.1145/3377930.3390155</a>","ieee":"J. Bossek, C. Doerr, and P. Kerschke, “Initial Design Strategies and Their Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2020, pp. 778–786, doi: <a href=\"https://doi.org/10.1145/3377930.3390155\">10.1145/3377930.3390155</a>.","chicago":"Bossek, Jakob, Carola Doerr, and Pascal Kerschke. “Initial Design Strategies and Their Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 778–786. GECCO ’20. New York, NY, USA: Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3377930.3390155\">https://doi.org/10.1145/3377930.3390155</a>.","short":"J. Bossek, C. Doerr, P. Kerschke, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2020, pp. 778–786.","mla":"Bossek, Jakob, et al. “Initial Design Strategies and Their Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2020, pp. 778–786, doi:<a href=\"https://doi.org/10.1145/3377930.3390155\">10.1145/3377930.3390155</a>.","ama":"Bossek J, Doerr C, Kerschke P. Initial Design Strategies and Their Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. GECCO ’20. Association for Computing Machinery; 2020:778–786. doi:<a href=\"https://doi.org/10.1145/3377930.3390155\">10.1145/3377930.3390155</a>","bibtex":"@inproceedings{Bossek_Doerr_Kerschke_2020, place={New York, NY, USA}, series={GECCO ’20}, title={Initial Design Strategies and Their Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB}, DOI={<a href=\"https://doi.org/10.1145/3377930.3390155\">10.1145/3377930.3390155</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Doerr, Carola and Kerschke, Pascal}, year={2020}, pages={778–786}, collection={GECCO ’20} }"},"page":"778–786","_id":"48850","publisher":"Association for Computing Machinery","user_id":"102979","status":"public"},{"citation":{"mla":"Roostapour, Vahid, et al. “Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem.” <i>Proceedings of the 2020 Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2020, pp. 551–559, doi:<a href=\"https://doi.org/10.1145/3377930.3390168\">10.1145/3377930.3390168</a>.","bibtex":"@inproceedings{Roostapour_Bossek_Neumann_2020, place={New York, NY, USA}, series={{GECCO} ’20}, title={Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem}, DOI={<a href=\"https://doi.org/10.1145/3377930.3390168\">10.1145/3377930.3390168</a>}, booktitle={Proceedings of the 2020 Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Roostapour, Vahid and Bossek, Jakob and Neumann, Frank}, year={2020}, pages={551–559}, collection={{GECCO} ’20} }","ama":"Roostapour V, Bossek J, Neumann F. Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem. In: <i>Proceedings of the 2020 Genetic and Evolutionary Computation Conference</i>. {GECCO} ’20. Association for Computing Machinery; 2020:551–559. doi:<a href=\"https://doi.org/10.1145/3377930.3390168\">10.1145/3377930.3390168</a>","ieee":"V. Roostapour, J. Bossek, and F. Neumann, “Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem,” in <i>Proceedings of the 2020 Genetic and Evolutionary Computation Conference</i>, 2020, pp. 551–559, doi: <a href=\"https://doi.org/10.1145/3377930.3390168\">10.1145/3377930.3390168</a>.","apa":"Roostapour, V., Bossek, J., &#38; Neumann, F. (2020). Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem. <i>Proceedings of the 2020 Genetic and Evolutionary Computation Conference</i>, 551–559. <a href=\"https://doi.org/10.1145/3377930.3390168\">https://doi.org/10.1145/3377930.3390168</a>","chicago":"Roostapour, Vahid, Jakob Bossek, and Frank Neumann. “Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem.” In <i>Proceedings of the 2020 Genetic and Evolutionary Computation Conference</i>, 551–559. {GECCO} ’20. New York, NY, USA: Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3377930.3390168\">https://doi.org/10.1145/3377930.3390168</a>.","short":"V. Roostapour, J. Bossek, F. Neumann, in: Proceedings of the 2020 Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2020, pp. 551–559."},"place":"New York, NY, USA","status":"public","user_id":"102979","_id":"48895","publisher":"Association for Computing Machinery","page":"551–559","extern":"1","abstract":[{"text":"Evolutionary algorithms (EAs) are general-purpose problem solvers that usually perform an unbiased search. This is reasonable and desirable in a black-box scenario. For combinatorial optimization problems, often more knowledge about the structure of optimal solutions is given, which can be leveraged by means of biased search operators. We consider the Minimum Spanning Tree (MST) problem in a single- and multi-objective version, and introduce a biased mutation, which puts more emphasis on the selection of edges of low rank in terms of low domination number. We present example graphs where the biased mutation can significantly speed up the expected runtime until (Pareto-)optimal solutions are found. On the other hand, we demonstrate that bias can lead to exponential runtime if \"heavy\" edges are necessarily part of an optimal solution. However, on general graphs in the single-objective setting, we show that a combined mutation operator which decides for unbiased or biased edge selection in each step with equal probability exhibits a polynomial upper bound - as unbiased mutation - in the worst case and benefits from bias if the circumstances are favorable.","lang":"eng"}],"publication":"Proceedings of the 2020 Genetic and Evolutionary Computation Conference","department":[{"_id":"819"}],"type":"conference","keyword":["biased mutation","evolutionary algorithms","minimum spanning tree problem","runtime analysis"],"date_created":"2023-11-14T15:59:00Z","date_updated":"2023-12-13T10:49:38Z","author":[{"full_name":"Roostapour, Vahid","last_name":"Roostapour","first_name":"Vahid"},{"id":"102979","orcid":"0000-0002-4121-4668","last_name":"Bossek","first_name":"Jakob","full_name":"Bossek, Jakob"},{"full_name":"Neumann, Frank","last_name":"Neumann","first_name":"Frank"}],"publication_identifier":{"isbn":["978-1-4503-7128-5"]},"title":"Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem","year":"2020","doi":"10.1145/3377930.3390168","language":[{"iso":"eng"}],"series_title":"{GECCO} ’20"},{"citation":{"bibtex":"@article{Bossek_Kerschke_Trautmann_2020, title={A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms}, volume={88}, DOI={<a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">10.1016/j.asoc.2019.105901</a>}, number={C}, journal={Applied Soft Computing}, author={Bossek, Jakob and Kerschke, Pascal and Trautmann, Heike}, year={2020} }","ama":"Bossek J, Kerschke P, Trautmann H. A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms. <i>Applied Soft Computing</i>. 2020;88(C). doi:<a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">10.1016/j.asoc.2019.105901</a>","short":"J. Bossek, P. Kerschke, H. Trautmann, Applied Soft Computing 88 (2020).","chicago":"Bossek, Jakob, Pascal Kerschke, and Heike Trautmann. “A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms.” <i>Applied Soft Computing</i> 88, no. C (2020). <a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">https://doi.org/10.1016/j.asoc.2019.105901</a>.","ieee":"J. Bossek, P. Kerschke, and H. Trautmann, “A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms,” <i>Applied Soft Computing</i>, vol. 88, no. C, 2020, doi: <a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">10.1016/j.asoc.2019.105901</a>.","mla":"Bossek, Jakob, et al. “A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms.” <i>Applied Soft Computing</i>, vol. 88, no. C, 2020, doi:<a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">10.1016/j.asoc.2019.105901</a>.","apa":"Bossek, J., Kerschke, P., &#38; Trautmann, H. (2020). A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms. <i>Applied Soft Computing</i>, <i>88</i>(C). <a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">https://doi.org/10.1016/j.asoc.2019.105901</a>"},"publication":"Applied Soft Computing","issue":"C","abstract":[{"text":"We build upon a recently proposed multi-objective view onto performance measurement of single-objective stochastic solvers. The trade-off between the fraction of failed runs and the mean runtime of successful runs \\textendash both to be minimized \\textendash is directly analyzed based on a study on algorithm selection of inexact state-of-the-art solvers for the famous Traveling Salesperson Problem (TSP). Moreover, we adopt the hypervolume indicator (HV) commonly used in multi-objective optimization for simultaneously assessing both conflicting objectives and investigate relations to commonly used performance indicators, both theoretically and empirically. Next to Penalized Average Runtime (PAR) and Penalized Quantile Runtime (PQR), the HV measure is used as a core concept within the construction of per-instance algorithm selection models offering interesting insights into complementary behavior of inexact TSP solvers. \\textbullet The multi-objective perspective is naturally generalizable to multiple objectives. \\textbullet Proof of relationship between HV and the PAR in the considered bi-objective space. \\textbullet New insights into complementary behavior of stochastic optimization algorithms.","lang":"eng"}],"date_created":"2023-11-14T15:58:53Z","department":[{"_id":"819"}],"keyword":["Algorithm selection","Combinatorial optimization","Multi-objective optimization","Performance measurement","Traveling Salesperson Problem"],"type":"journal_article","author":[{"id":"102979","last_name":"Bossek","orcid":"0000-0002-4121-4668","first_name":"Jakob","full_name":"Bossek, Jakob"},{"first_name":"Pascal","last_name":"Kerschke","full_name":"Kerschke, Pascal"},{"last_name":"Trautmann","first_name":"Heike","full_name":"Trautmann, Heike"}],"publication_identifier":{"issn":["1568-4946"]},"status":"public","title":"A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms","year":"2020","intvolume":"        88","date_updated":"2023-12-13T10:52:17Z","_id":"48848","language":[{"iso":"eng"}],"volume":88,"user_id":"102979","doi":"10.1016/j.asoc.2019.105901"},{"citation":{"apa":"Bartz-Beielstein, T., Doerr, C., van den Berg, D., Bossek, J., Chandrasekaran, S., Eftimov, T., Fischbach, A., Kerschke, P., Cava, W. L., Lopez-Ibanez, M., Malan, K. M., Moore, J. H., Naujoks, B., Orzechowski, P., Volz, V., Wagner, M., &#38; Weise, T. (2020). Benchmarking in Optimization: Best Practice and Open Issues. <i>Corr</i>.","ieee":"T. Bartz-Beielstein <i>et al.</i>, “Benchmarking in Optimization: Best Practice and Open Issues,” <i>Corr</i>, 2020.","chicago":"Bartz-Beielstein, Thomas, Carola Doerr, Daan van den Berg, Jakob Bossek, Sowmya Chandrasekaran, Tome Eftimov, Andreas Fischbach, et al. “Benchmarking in Optimization: Best Practice and Open Issues.” <i>Corr</i>, 2020.","short":"T. Bartz-Beielstein, C. Doerr, D. van den Berg, J. Bossek, S. Chandrasekaran, T. Eftimov, A. Fischbach, P. Kerschke, W.L. Cava, M. Lopez-Ibanez, K.M. Malan, J.H. Moore, B. Naujoks, P. Orzechowski, V. Volz, M. Wagner, T. Weise, Corr (2020).","mla":"Bartz-Beielstein, Thomas, et al. “Benchmarking in Optimization: Best Practice and Open Issues.” <i>Corr</i>, 2020.","ama":"Bartz-Beielstein T, Doerr C, van den Berg D, et al. Benchmarking in Optimization: Best Practice and Open Issues. <i>Corr</i>. Published online 2020.","bibtex":"@article{Bartz-Beielstein_Doerr_van den Berg_Bossek_Chandrasekaran_Eftimov_Fischbach_Kerschke_Cava_Lopez-Ibanez_et al._2020, title={Benchmarking in Optimization: Best Practice and Open Issues}, journal={Corr}, author={Bartz-Beielstein, Thomas and Doerr, Carola and van den Berg, Daan and Bossek, Jakob and Chandrasekaran, Sowmya and Eftimov, Tome and Fischbach, Andreas and Kerschke, Pascal and Cava, William La and Lopez-Ibanez, Manuel and et al.}, year={2020} }"},"publication":"Corr","department":[{"_id":"819"}],"type":"journal_article","date_created":"2023-11-14T15:58:51Z","date_updated":"2023-12-13T10:52:24Z","author":[{"first_name":"Thomas","last_name":"Bartz-Beielstein","full_name":"Bartz-Beielstein, Thomas"},{"full_name":"Doerr, Carola","last_name":"Doerr","first_name":"Carola"},{"full_name":"van den Berg, Daan","first_name":"Daan","last_name":"van den Berg"},{"id":"102979","orcid":"0000-0002-4121-4668","last_name":"Bossek","first_name":"Jakob","full_name":"Bossek, Jakob"},{"full_name":"Chandrasekaran, Sowmya","last_name":"Chandrasekaran","first_name":"Sowmya"},{"full_name":"Eftimov, Tome","last_name":"Eftimov","first_name":"Tome"},{"last_name":"Fischbach","first_name":"Andreas","full_name":"Fischbach, Andreas"},{"first_name":"Pascal","last_name":"Kerschke","full_name":"Kerschke, Pascal"},{"full_name":"Cava, William La","first_name":"William La","last_name":"Cava"},{"full_name":"Lopez-Ibanez, Manuel","last_name":"Lopez-Ibanez","first_name":"Manuel"},{"last_name":"Malan","first_name":"Katherine M.","full_name":"Malan, Katherine M."},{"full_name":"Moore, Jason H.","first_name":"Jason H.","last_name":"Moore"},{"full_name":"Naujoks, Boris","last_name":"Naujoks","first_name":"Boris"},{"full_name":"Orzechowski, Patryk","first_name":"Patryk","last_name":"Orzechowski"},{"full_name":"Volz, Vanessa","last_name":"Volz","first_name":"Vanessa"},{"first_name":"Markus","last_name":"Wagner","full_name":"Wagner, Markus"},{"first_name":"Thomas","last_name":"Weise","full_name":"Weise, Thomas"}],"year":"2020","title":"Benchmarking in Optimization: Best Practice and Open Issues","status":"public","user_id":"102979","language":[{"iso":"eng"}],"_id":"48836"},{"publisher":"Pensoft Publishers","_id":"47476","volume":6,"user_id":"61139","status":"public","oa":"1","citation":{"mla":"Altenhöner, Reinhard, et al. “NFDI4Culture - Consortium for Research Data on Material and Immaterial Cultural Heritage.” <i>Research Ideas and Outcomes</i>, vol. 6, Pensoft Publishers, 2020, doi:<a href=\"https://doi.org/10.3897/rio.6.e57036\">10.3897/rio.6.e57036</a>.","bibtex":"@article{Altenhöner_Blümel_Boehm_Bove_Bicher_Bracht_Brand_Dieckmann_Effinger_Hagener_et al._2020, title={NFDI4Culture - Consortium for research data on material and immaterial cultural heritage}, volume={6}, DOI={<a href=\"https://doi.org/10.3897/rio.6.e57036\">10.3897/rio.6.e57036</a>}, journal={Research Ideas and Outcomes}, publisher={Pensoft Publishers}, author={Altenhöner, Reinhard and Blümel, Ina and Boehm, Franziska and Bove, Jens and Bicher, Katrin and Bracht, Christian and Brand, Ortrun and Dieckmann, Lisa and Effinger, Maria and Hagener, Malte and et al.}, year={2020} }","ama":"Altenhöner R, Blümel I, Boehm F, et al. NFDI4Culture - Consortium for research data on material and immaterial cultural heritage. <i>Research Ideas and Outcomes</i>. 2020;6. doi:<a href=\"https://doi.org/10.3897/rio.6.e57036\">10.3897/rio.6.e57036</a>","ieee":"R. Altenhöner <i>et al.</i>, “NFDI4Culture - Consortium for research data on material and immaterial cultural heritage,” <i>Research Ideas and Outcomes</i>, vol. 6, 2020, doi: <a href=\"https://doi.org/10.3897/rio.6.e57036\">10.3897/rio.6.e57036</a>.","apa":"Altenhöner, R., Blümel, I., Boehm, F., Bove, J., Bicher, K., Bracht, C., Brand, O., Dieckmann, L., Effinger, M., Hagener, M., Hammes, A., Heller, L., Kailus, A., Kohle, H., Ludwig, J., Münzmay, A., Pittroff, S., Razum, M., Röwenstrunk, D., … Wiermann, B. (2020). NFDI4Culture - Consortium for research data on material and immaterial cultural heritage. <i>Research Ideas and Outcomes</i>, <i>6</i>. <a href=\"https://doi.org/10.3897/rio.6.e57036\">https://doi.org/10.3897/rio.6.e57036</a>","chicago":"Altenhöner, Reinhard, Ina Blümel, Franziska Boehm, Jens Bove, Katrin Bicher, Christian Bracht, Ortrun Brand, et al. “NFDI4Culture - Consortium for Research Data on Material and Immaterial Cultural Heritage.” <i>Research Ideas and Outcomes</i> 6 (2020). <a href=\"https://doi.org/10.3897/rio.6.e57036\">https://doi.org/10.3897/rio.6.e57036</a>.","short":"R. Altenhöner, I. Blümel, F. Boehm, J. Bove, K. Bicher, C. Bracht, O. Brand, L. Dieckmann, M. Effinger, M. Hagener, A. Hammes, L. Heller, A. Kailus, H. Kohle, J. Ludwig, A. Münzmay, S. Pittroff, M. Razum, D. Röwenstrunk, H. Sack, H. Simon, D. Schmidt, T. Schrade, A.-V. Walzel, B. Wiermann, Research Ideas and Outcomes 6 (2020)."},"project":[{"name":"NFDI4Culture: NFDI4Culture – Konsortium für Forschungsdaten materieller und immaterieller Kulturgüter","_id":"745"}],"quality_controlled":"1","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.3897/rio.6.e57036","open_access":"1"}],"doi":"10.3897/rio.6.e57036","author":[{"last_name":"Altenhöner","first_name":"Reinhard","full_name":"Altenhöner, Reinhard"},{"first_name":"Ina","last_name":"Blümel","full_name":"Blümel, Ina"},{"last_name":"Boehm","first_name":"Franziska","full_name":"Boehm, Franziska"},{"last_name":"Bove","first_name":"Jens","full_name":"Bove, Jens"},{"first_name":"Katrin","last_name":"Bicher","full_name":"Bicher, Katrin"},{"full_name":"Bracht, Christian","first_name":"Christian","last_name":"Bracht"},{"full_name":"Brand, Ortrun","last_name":"Brand","first_name":"Ortrun"},{"first_name":"Lisa","last_name":"Dieckmann","full_name":"Dieckmann, Lisa"},{"full_name":"Effinger, Maria","first_name":"Maria","last_name":"Effinger"},{"full_name":"Hagener, Malte","last_name":"Hagener","first_name":"Malte"},{"full_name":"Hammes, Andrea","last_name":"Hammes","first_name":"Andrea"},{"first_name":"Lambert","last_name":"Heller","full_name":"Heller, Lambert"},{"full_name":"Kailus, Angela","first_name":"Angela","last_name":"Kailus"},{"full_name":"Kohle, Hubertus","first_name":"Hubertus","last_name":"Kohle"},{"full_name":"Ludwig, Jens","last_name":"Ludwig","first_name":"Jens"},{"id":"61139","last_name":"Münzmay","first_name":"Andreas","orcid":"0000-0002-8373-4055","full_name":"Münzmay, Andreas"},{"last_name":"Pittroff","first_name":"Sarah","full_name":"Pittroff, Sarah"},{"first_name":"Matthias","last_name":"Razum","full_name":"Razum, Matthias"},{"full_name":"Röwenstrunk, Daniel","first_name":"Daniel","last_name":"Röwenstrunk"},{"full_name":"Sack, Harald","first_name":"Harald","last_name":"Sack"},{"first_name":"Holger","last_name":"Simon","full_name":"Simon, Holger"},{"full_name":"Schmidt, Dörte","first_name":"Dörte","last_name":"Schmidt"},{"full_name":"Schrade, Torsten","last_name":"Schrade","first_name":"Torsten"},{"full_name":"Walzel, Annika-Valeska","last_name":"Walzel","first_name":"Annika-Valeska"},{"full_name":"Wiermann, Barbara","last_name":"Wiermann","first_name":"Barbara"}],"publication_identifier":{"issn":["2367-7163"]},"year":"2020","title":"NFDI4Culture - Consortium for research data on material and immaterial cultural heritage","article_type":"original","intvolume":"         6","publication_status":"published","date_updated":"2024-02-19T11:01:52Z","date_created":"2023-09-27T07:02:04Z","department":[{"_id":"572"},{"_id":"856"},{"_id":"615"}],"type":"journal_article","keyword":["Research Data Management"],"publication":"Research Ideas and Outcomes","abstract":[{"text":"Digital data on tangible and intangible cultural assets is an essential part of daily life, communication and experience. It has a lasting influence on the perception of cultural identity as well as on the interactions between research, the cultural economy and society. Throughout the last three decades, many cultural heritage institutions have contributed a wealth of digital representations of cultural assets (2D digital reproductions of paintings, sheet music, 3D digital models of sculptures, monuments, rooms, buildings), audio-visual data (music, film, stage performances), and procedural research data such as encoding and annotation formats. The long-term preservation and FAIR availability of research data from the cultural heritage domain is fundamentally important, not only for future academic success in the humanities but also for the cultural identity of individuals and society as a whole. Up to now, no coordinated effort for professional research data management on a national level exists in Germany. NFDI4Culture aims to fill this gap and create a user-centered, research-driven infrastructure that will cover a broad range of research domains from musicology, art history and architecture to performance, theatre, film, and media studies.</jats:p>\r\n          <jats:p>The research landscape addressed by the consortium is characterized by strong institutional differentiation. Research units in the consortium's community of interest comprise university institutes, art colleges, academies, galleries, libraries, archives and museums. This diverse landscape is also characterized by an abundance of research objects, methodologies and a great potential for data-driven research. In a unique effort carried out by the applicant and co-applicants of this proposal and ten academic societies, this community is interconnected for the first time through a federated approach that is ideally suited to the needs of the participating researchers. To promote collaboration within the NFDI, to share knowledge and technology and to provide extensive support for its users have been the guiding principles of the consortium from the beginning and will be at the heart of all workflows and decision-making processes. Thanks to these principles, NFDI4Culture has gathered strong support ranging from individual researchers to high-level cultural heritage organizations such as the UNESCO, the International Council of Museums, the Open Knowledge Foundation and Wikimedia. On this basis, NFDI4Culture will take innovative measures that promote a cultural change towards a more reflective and sustainable handling of research data and at the same time boost qualification and professionalization in data-driven research in the domain of cultural heritage. This will create a long-lasting impact on science, cultural economy and society as a whole.","lang":"eng"}]}]