--- _id: '27521' author: - first_name: Johannes full_name: Hebebrand, Johannes last_name: Hebebrand - first_name: Gabriella full_name: Milos, Gabriella last_name: Milos - first_name: Martin full_name: Wabitsch, Martin last_name: Wabitsch - first_name: Martin full_name: Teufel, Martin last_name: Teufel - first_name: Dagmar full_name: Führer, Dagmar last_name: Führer - first_name: Judith full_name: Bühlmeier, Judith id: '89838' last_name: Bühlmeier - first_name: Lars full_name: Libuda, Lars id: '88682' last_name: Libuda orcid: 0000-0003-1603-3133 - first_name: Christine full_name: Ludwig, Christine last_name: Ludwig - first_name: Jochen full_name: Antel, Jochen last_name: Antel citation: ama: Hebebrand J, Milos G, Wabitsch M, et al. Clinical Trials Required to Assess Potential Benefits and Side Effects of Treatment of Patients With Anorexia Nervosa With Recombinant Human Leptin. Frontiers in Psychology. Published online 2019. doi:10.3389/fpsyg.2019.00769 apa: Hebebrand, J., Milos, G., Wabitsch, M., Teufel, M., Führer, D., Bühlmeier, J., Libuda, L., Ludwig, C., & Antel, J. (2019). Clinical Trials Required to Assess Potential Benefits and Side Effects of Treatment of Patients With Anorexia Nervosa With Recombinant Human Leptin. Frontiers in Psychology. https://doi.org/10.3389/fpsyg.2019.00769 bibtex: '@article{Hebebrand_Milos_Wabitsch_Teufel_Führer_Bühlmeier_Libuda_Ludwig_Antel_2019, title={Clinical Trials Required to Assess Potential Benefits and Side Effects of Treatment of Patients With Anorexia Nervosa With Recombinant Human Leptin}, DOI={10.3389/fpsyg.2019.00769}, journal={Frontiers in Psychology}, author={Hebebrand, Johannes and Milos, Gabriella and Wabitsch, Martin and Teufel, Martin and Führer, Dagmar and Bühlmeier, Judith and Libuda, Lars and Ludwig, Christine and Antel, Jochen}, year={2019} }' chicago: Hebebrand, Johannes, Gabriella Milos, Martin Wabitsch, Martin Teufel, Dagmar Führer, Judith Bühlmeier, Lars Libuda, Christine Ludwig, and Jochen Antel. “Clinical Trials Required to Assess Potential Benefits and Side Effects of Treatment of Patients With Anorexia Nervosa With Recombinant Human Leptin.” Frontiers in Psychology, 2019. https://doi.org/10.3389/fpsyg.2019.00769. ieee: 'J. Hebebrand et al., “Clinical Trials Required to Assess Potential Benefits and Side Effects of Treatment of Patients With Anorexia Nervosa With Recombinant Human Leptin,” Frontiers in Psychology, 2019, doi: 10.3389/fpsyg.2019.00769.' mla: Hebebrand, Johannes, et al. “Clinical Trials Required to Assess Potential Benefits and Side Effects of Treatment of Patients With Anorexia Nervosa With Recombinant Human Leptin.” Frontiers in Psychology, 2019, doi:10.3389/fpsyg.2019.00769. short: J. Hebebrand, G. Milos, M. Wabitsch, M. Teufel, D. Führer, J. Bühlmeier, L. Libuda, C. Ludwig, J. Antel, Frontiers in Psychology (2019). date_created: 2021-11-17T11:03:32Z date_updated: 2022-09-15T09:49:02Z department: - _id: '35' - _id: '22' - _id: '395' doi: 10.3389/fpsyg.2019.00769 extern: '1' language: - iso: eng publication: Frontiers in Psychology publication_identifier: issn: - 1664-1078 publication_status: published status: public title: Clinical Trials Required to Assess Potential Benefits and Side Effects of Treatment of Patients With Anorexia Nervosa With Recombinant Human Leptin type: journal_article user_id: '89838' year: '2019' ... --- _id: '47947' article_type: review author: - first_name: Michael full_name: Rüsing, Michael id: '22501' last_name: Rüsing orcid: 0000-0003-4682-4577 - first_name: Peter O. full_name: Weigel, Peter O. last_name: Weigel - first_name: Jie full_name: Zhao, Jie last_name: Zhao - first_name: Shayan full_name: Mookherjea, Shayan last_name: Mookherjea citation: ama: 'Rüsing M, Weigel PO, Zhao J, Mookherjea S. Toward 3D Integrated Photonics Including Lithium Niobate Thin Films: A Bridge Between Electronics, Radio Frequency, and Optical Technology. IEEE Nanotechnology Magazine. 2019;13(4):18-33. doi:10.1109/mnano.2019.2916115' apa: 'Rüsing, M., Weigel, P. O., Zhao, J., & Mookherjea, S. (2019). Toward 3D Integrated Photonics Including Lithium Niobate Thin Films: A Bridge Between Electronics, Radio Frequency, and Optical Technology. IEEE Nanotechnology Magazine, 13(4), 18–33. https://doi.org/10.1109/mnano.2019.2916115' bibtex: '@article{Rüsing_Weigel_Zhao_Mookherjea_2019, title={Toward 3D Integrated Photonics Including Lithium Niobate Thin Films: A Bridge Between Electronics, Radio Frequency, and Optical Technology}, volume={13}, DOI={10.1109/mnano.2019.2916115}, number={4}, journal={IEEE Nanotechnology Magazine}, publisher={Institute of Electrical and Electronics Engineers (IEEE)}, author={Rüsing, Michael and Weigel, Peter O. and Zhao, Jie and Mookherjea, Shayan}, year={2019}, pages={18–33} }' chicago: 'Rüsing, Michael, Peter O. Weigel, Jie Zhao, and Shayan Mookherjea. “Toward 3D Integrated Photonics Including Lithium Niobate Thin Films: A Bridge Between Electronics, Radio Frequency, and Optical Technology.” IEEE Nanotechnology Magazine 13, no. 4 (2019): 18–33. https://doi.org/10.1109/mnano.2019.2916115.' ieee: 'M. Rüsing, P. O. Weigel, J. Zhao, and S. Mookherjea, “Toward 3D Integrated Photonics Including Lithium Niobate Thin Films: A Bridge Between Electronics, Radio Frequency, and Optical Technology,” IEEE Nanotechnology Magazine, vol. 13, no. 4, pp. 18–33, 2019, doi: 10.1109/mnano.2019.2916115.' mla: 'Rüsing, Michael, et al. “Toward 3D Integrated Photonics Including Lithium Niobate Thin Films: A Bridge Between Electronics, Radio Frequency, and Optical Technology.” IEEE Nanotechnology Magazine, vol. 13, no. 4, Institute of Electrical and Electronics Engineers (IEEE), 2019, pp. 18–33, doi:10.1109/mnano.2019.2916115.' short: M. Rüsing, P.O. Weigel, J. Zhao, S. Mookherjea, IEEE Nanotechnology Magazine 13 (2019) 18–33. date_created: 2023-10-11T07:39:07Z date_updated: 2023-10-11T07:39:53Z doi: 10.1109/mnano.2019.2916115 extern: '1' intvolume: ' 13' issue: '4' keyword: - Electrical and Electronic Engineering - Mechanical Engineering language: - iso: eng page: 18-33 publication: IEEE Nanotechnology Magazine publication_identifier: issn: - 1932-4510 - 1942-7808 publication_status: published publisher: Institute of Electrical and Electronics Engineers (IEEE) quality_controlled: '1' status: public title: 'Toward 3D Integrated Photonics Including Lithium Niobate Thin Films: A Bridge Between Electronics, Radio Frequency, and Optical Technology' type: journal_article user_id: '22501' volume: 13 year: '2019' ... --- _id: '46343' abstract: - lang: eng text: This paper addresses multimodality of multi-objective (MO) optimization landscapes. Contrary to common perception of local optima, according to which they are hindering the progress of optimization algorithms, it will be shown that local efficient sets in a multi-objective setting can assist optimizers in finding global efficient sets. We use sophisticated visualization techniques, which rely on gradient field heatmaps, to highlight those insights into landscape characteristics. Finally, the MO local optimizer MOGSA is introduced, which exploits those observations by sliding down the multi-objective gradient hill and moving along the local efficient sets. author: - first_name: Christian full_name: Grimme, Christian last_name: Grimme - first_name: Pascal full_name: Kerschke, Pascal last_name: Kerschke - first_name: Heike full_name: Trautmann, Heike id: '100740' last_name: Trautmann orcid: 0000-0002-9788-8282 citation: ama: 'Grimme C, Kerschke P, Trautmann H. Multimodality in Multi-Objective Optimization — More Boon than Bane? In: Deb K, Goodman E, Coello CCA, et al., eds. Proceedings of the 10$^th$ International Conference on Evolutionary Multi-Criterion Optimization (EMO). Vol 11411. Lecture Notes in Computer Science. Springer; 2019:126–138. doi:10.1007/978-3-030-12598-1_11' apa: Grimme, C., Kerschke, P., & Trautmann, H. (2019). Multimodality in Multi-Objective Optimization — More Boon than Bane? In K. Deb, E. Goodman, C. C. A. Coello, K. Klamroth, K. Miettinen, S. Mostaghim, & P. Reed (Eds.), Proceedings of the 10$^th$ International Conference on Evolutionary Multi-Criterion Optimization (EMO) (Vol. 11411, pp. 126–138). Springer. https://doi.org/10.1007/978-3-030-12598-1_11 bibtex: '@inproceedings{Grimme_Kerschke_Trautmann_2019, place={East Lansing, MI, USA}, series={Lecture Notes in Computer Science}, title={Multimodality in Multi-Objective Optimization — More Boon than Bane?}, volume={11411}, DOI={10.1007/978-3-030-12598-1_11}, booktitle={Proceedings of the 10$^th$ International Conference on Evolutionary Multi-Criterion Optimization (EMO)}, publisher={Springer}, author={Grimme, Christian and Kerschke, Pascal and Trautmann, Heike}, editor={Deb, Kalyanmoy and Goodman, Erik and Coello, Coello Carlos A. and Klamroth, Kathrin and Miettinen, Kaisa and Mostaghim, Sanaz and Reed, Patrick}, year={2019}, pages={126–138}, collection={Lecture Notes in Computer Science} }' chicago: 'Grimme, Christian, Pascal Kerschke, and Heike Trautmann. “Multimodality in Multi-Objective Optimization — More Boon than Bane?” In Proceedings of the 10$^th$ International Conference on Evolutionary Multi-Criterion Optimization (EMO), edited by Kalyanmoy Deb, Erik Goodman, Coello Carlos A. Coello, Kathrin Klamroth, Kaisa Miettinen, Sanaz Mostaghim, and Patrick Reed, 11411:126–138. Lecture Notes in Computer Science. East Lansing, MI, USA: Springer, 2019. https://doi.org/10.1007/978-3-030-12598-1_11.' ieee: 'C. Grimme, P. Kerschke, and H. Trautmann, “Multimodality in Multi-Objective Optimization — More Boon than Bane?,” in Proceedings of the 10$^th$ International Conference on Evolutionary Multi-Criterion Optimization (EMO), 2019, vol. 11411, pp. 126–138, doi: 10.1007/978-3-030-12598-1_11.' mla: Grimme, Christian, et al. “Multimodality in Multi-Objective Optimization — More Boon than Bane?” Proceedings of the 10$^th$ International Conference on Evolutionary Multi-Criterion Optimization (EMO), edited by Kalyanmoy Deb et al., vol. 11411, Springer, 2019, pp. 126–138, doi:10.1007/978-3-030-12598-1_11. short: 'C. Grimme, P. Kerschke, H. Trautmann, in: K. Deb, E. Goodman, C.C.A. Coello, K. Klamroth, K. Miettinen, S. Mostaghim, P. Reed (Eds.), Proceedings of the 10$^th$ International Conference on Evolutionary Multi-Criterion Optimization (EMO), Springer, East Lansing, MI, USA, 2019, pp. 126–138.' date_created: 2023-08-04T07:49:08Z date_updated: 2023-10-16T13:31:03Z department: - _id: '34' - _id: '819' doi: 10.1007/978-3-030-12598-1_11 editor: - first_name: Kalyanmoy full_name: Deb, Kalyanmoy last_name: Deb - first_name: Erik full_name: Goodman, Erik last_name: Goodman - first_name: Coello Carlos A. full_name: Coello, Coello Carlos A. last_name: Coello - first_name: Kathrin full_name: Klamroth, Kathrin last_name: Klamroth - first_name: Kaisa full_name: Miettinen, Kaisa last_name: Miettinen - first_name: Sanaz full_name: Mostaghim, Sanaz last_name: Mostaghim - first_name: Patrick full_name: Reed, Patrick last_name: Reed intvolume: ' 11411' language: - iso: eng page: 126–138 place: East Lansing, MI, USA publication: Proceedings of the 10$^th$ International Conference on Evolutionary Multi-Criterion Optimization (EMO) publisher: Springer series_title: Lecture Notes in Computer Science status: public title: Multimodality in Multi-Objective Optimization — More Boon than Bane? type: conference user_id: '15504' volume: 11411 year: '2019' ... --- _id: '46342' abstract: - lang: eng text: There is a range of phenomena in continuous, global multi-objective optimization, that cannot occur in single-objective optimization. For instance, in some multi-objective optimization problems it is possible to follow continuous paths of gradients of straightforward weighted scalarization functions, starting from locally efficient solutions, in order to reach globally Pareto optimal solutions. This paper seeks to better characterize multimodal multi-objective landscapes and to better understand the transitions from local optima to global optima in simple, path-oriented search procedures. author: - first_name: Christian full_name: Grimme, Christian last_name: Grimme - first_name: Pascal full_name: Kerschke, Pascal last_name: Kerschke - first_name: Michael T M full_name: Emmerich, Michael T M last_name: Emmerich - first_name: Mike full_name: Preuss, Mike last_name: Preuss - first_name: André H full_name: Deutz, André H last_name: Deutz - first_name: Heike full_name: Trautmann, Heike id: '100740' last_name: Trautmann orcid: 0000-0002-9788-8282 citation: ama: 'Grimme C, Kerschke P, Emmerich MTM, Preuss M, Deutz AH, Trautmann H. Sliding to the Global Optimum: How to Benefit from Non-Global Optima in Multimodal Multi-Objective Optimization. In: AIP Conference Proceedings. AIP Publishing; 2019:020052-1-020052-020054. doi:10.1063/1.5090019' apa: 'Grimme, C., Kerschke, P., Emmerich, M. T. M., Preuss, M., Deutz, A. H., & Trautmann, H. (2019). Sliding to the Global Optimum: How to Benefit from Non-Global Optima in Multimodal Multi-Objective Optimization. AIP Conference Proceedings, 020052-1-020052–020054. https://doi.org/10.1063/1.5090019' bibtex: '@inproceedings{Grimme_Kerschke_Emmerich_Preuss_Deutz_Trautmann_2019, place={Leiden, The Netherlands}, title={Sliding to the Global Optimum: How to Benefit from Non-Global Optima in Multimodal Multi-Objective Optimization}, DOI={10.1063/1.5090019}, booktitle={AIP Conference Proceedings}, publisher={AIP Publishing}, author={Grimme, Christian and Kerschke, Pascal and Emmerich, Michael T M and Preuss, Mike and Deutz, André H and Trautmann, Heike}, year={2019}, pages={020052-1-020052–4} }' chicago: 'Grimme, Christian, Pascal Kerschke, Michael T M Emmerich, Mike Preuss, André H Deutz, and Heike Trautmann. “Sliding to the Global Optimum: How to Benefit from Non-Global Optima in Multimodal Multi-Objective Optimization.” In AIP Conference Proceedings, 020052-1-020052–54. Leiden, The Netherlands: AIP Publishing, 2019. https://doi.org/10.1063/1.5090019.' ieee: 'C. Grimme, P. Kerschke, M. T. M. Emmerich, M. Preuss, A. H. Deutz, and H. Trautmann, “Sliding to the Global Optimum: How to Benefit from Non-Global Optima in Multimodal Multi-Objective Optimization,” in AIP Conference Proceedings, 2019, pp. 020052-1-020052–4, doi: 10.1063/1.5090019.' mla: 'Grimme, Christian, et al. “Sliding to the Global Optimum: How to Benefit from Non-Global Optima in Multimodal Multi-Objective Optimization.” AIP Conference Proceedings, AIP Publishing, 2019, pp. 020052-1-020052–54, doi:10.1063/1.5090019.' short: 'C. Grimme, P. Kerschke, M.T.M. Emmerich, M. Preuss, A.H. Deutz, H. Trautmann, in: AIP Conference Proceedings, AIP Publishing, Leiden, The Netherlands, 2019, pp. 020052-1-020052–4.' date_created: 2023-08-04T07:48:15Z date_updated: 2023-10-16T13:30:43Z department: - _id: '34' - _id: '819' doi: 10.1063/1.5090019 language: - iso: eng page: 020052-1-020052-4 place: Leiden, The Netherlands publication: AIP Conference Proceedings publisher: AIP Publishing status: public title: 'Sliding to the Global Optimum: How to Benefit from Non-Global Optima in Multimodal Multi-Objective Optimization' type: conference user_id: '15504' year: '2019' ... --- _id: '48341' author: - first_name: Manuel full_name: Wille, Manuel id: '9310' last_name: Wille citation: ama: 'Wille M. Prinzipien und Strategien der Textgliederung in den Zeitungen des 18. Jahrhunderts – Eine computerbasierte Korpusanalyse. In: Simmler F, Baeva G, eds. Textgliederungsprinzipien. Ihre Kennzeichnungsformen Und Funktionen Vom 8. Bis 18. Jahrhundert. Akten Zum Internationalen Kongress Vom 22. Bis 24. Juni 2017 an Der Universität St. Petersburg. Vol 34. Berliner Sprachwissenschaftliche Studien. Weidler; 2019:507-531.' apa: Wille, M. (2019). Prinzipien und Strategien der Textgliederung in den Zeitungen des 18. Jahrhunderts – Eine computerbasierte Korpusanalyse. In F. Simmler & G. Baeva (Eds.), Textgliederungsprinzipien. Ihre Kennzeichnungsformen und Funktionen vom 8. bis 18. Jahrhundert. Akten zum Internationalen Kongress vom 22. bis 24. Juni 2017 an der Universität St. Petersburg (Vol. 34, pp. 507–531). Weidler. bibtex: '@inbook{Wille_2019, place={Berlin}, series={Berliner Sprachwissenschaftliche Studien}, title={Prinzipien und Strategien der Textgliederung in den Zeitungen des 18. Jahrhunderts – Eine computerbasierte Korpusanalyse}, volume={34}, booktitle={Textgliederungsprinzipien. Ihre Kennzeichnungsformen und Funktionen vom 8. bis 18. Jahrhundert. Akten zum Internationalen Kongress vom 22. bis 24. Juni 2017 an der Universität St. Petersburg}, publisher={Weidler}, author={Wille, Manuel}, editor={Simmler, Franz and Baeva, Galina}, year={2019}, pages={507–531}, collection={Berliner Sprachwissenschaftliche Studien} }' chicago: 'Wille, Manuel. “Prinzipien Und Strategien Der Textgliederung in Den Zeitungen Des 18. Jahrhunderts – Eine Computerbasierte Korpusanalyse.” In Textgliederungsprinzipien. Ihre Kennzeichnungsformen Und Funktionen Vom 8. Bis 18. Jahrhundert. Akten Zum Internationalen Kongress Vom 22. Bis 24. Juni 2017 an Der Universität St. Petersburg, edited by Franz Simmler and Galina Baeva, 34:507–31. Berliner Sprachwissenschaftliche Studien. Berlin: Weidler, 2019.' ieee: 'M. Wille, “Prinzipien und Strategien der Textgliederung in den Zeitungen des 18. Jahrhunderts – Eine computerbasierte Korpusanalyse,” in Textgliederungsprinzipien. Ihre Kennzeichnungsformen und Funktionen vom 8. bis 18. Jahrhundert. Akten zum Internationalen Kongress vom 22. bis 24. Juni 2017 an der Universität St. Petersburg, vol. 34, F. Simmler and G. Baeva, Eds. Berlin: Weidler, 2019, pp. 507–531.' mla: Wille, Manuel. “Prinzipien Und Strategien Der Textgliederung in Den Zeitungen Des 18. Jahrhunderts – Eine Computerbasierte Korpusanalyse.” Textgliederungsprinzipien. Ihre Kennzeichnungsformen Und Funktionen Vom 8. Bis 18. Jahrhundert. Akten Zum Internationalen Kongress Vom 22. Bis 24. Juni 2017 an Der Universität St. Petersburg, edited by Franz Simmler and Galina Baeva, vol. 34, Weidler, 2019, pp. 507–31. short: 'M. Wille, in: F. Simmler, G. Baeva (Eds.), Textgliederungsprinzipien. Ihre Kennzeichnungsformen Und Funktionen Vom 8. Bis 18. Jahrhundert. Akten Zum Internationalen Kongress Vom 22. Bis 24. Juni 2017 an Der Universität St. Petersburg, Weidler, Berlin, 2019, pp. 507–531.' date_created: 2023-10-19T12:10:09Z date_updated: 2023-10-19T12:33:38Z editor: - first_name: Franz full_name: Simmler, Franz last_name: Simmler - first_name: Galina full_name: Baeva, Galina last_name: Baeva intvolume: ' 34' language: - iso: eng page: 507 - 531 place: Berlin publication: Textgliederungsprinzipien. Ihre Kennzeichnungsformen und Funktionen vom 8. bis 18. Jahrhundert. Akten zum Internationalen Kongress vom 22. bis 24. Juni 2017 an der Universität St. Petersburg publication_identifier: unknown: - " \t978-3-89693-736-0" publisher: Weidler series_title: Berliner Sprachwissenschaftliche Studien status: public title: Prinzipien und Strategien der Textgliederung in den Zeitungen des 18. Jahrhunderts – Eine computerbasierte Korpusanalyse type: book_chapter user_id: '9310' volume: 34 year: '2019' ... --- _id: '31142' author: - first_name: Britt-Marie full_name: Schuster, Britt-Marie id: '17386' last_name: Schuster citation: ama: 'Schuster B-M. Textgliederungsprinzipien und Beziehungsgestaltung im Stammbuch von 1559–1878. In: Simmler F, Baeva G, eds. Textgliederungsprinzipien. Ihre Kennzeichnungsformen und Funktionen in Texten vom 8. bis 18. Jahrhundert. Akten zum Internationalen Kongress an der Staatlichen Universität St. Petersburg vom 22. bis 24. Juni 2017. WEIDLER; 2019:293–312.' apa: Schuster, B.-M. (2019). Textgliederungsprinzipien und Beziehungsgestaltung im Stammbuch von 1559–1878. In F. Simmler & G. Baeva (Eds.), Textgliederungsprinzipien. Ihre Kennzeichnungsformen und Funktionen in Texten vom 8. bis 18. Jahrhundert. Akten zum Internationalen Kongress an der Staatlichen Universität St. Petersburg vom 22. bis 24. Juni 2017 (pp. 293–312). WEIDLER. bibtex: '@inbook{Schuster_2019, place={Berlin }, title={Textgliederungsprinzipien und Beziehungsgestaltung im Stammbuch von 1559–1878}, booktitle={Textgliederungsprinzipien. Ihre Kennzeichnungsformen und Funktionen in Texten vom 8. bis 18. Jahrhundert. Akten zum Internationalen Kongress an der Staatlichen Universität St. Petersburg vom 22. bis 24. Juni 2017}, publisher={WEIDLER}, author={Schuster, Britt-Marie}, editor={Simmler, Franz and Baeva, Galina}, year={2019}, pages={293–312} }' chicago: 'Schuster, Britt-Marie. “Textgliederungsprinzipien und Beziehungsgestaltung im Stammbuch von 1559–1878.” In Textgliederungsprinzipien. Ihre Kennzeichnungsformen und Funktionen in Texten vom 8. bis 18. Jahrhundert. Akten zum Internationalen Kongress an der Staatlichen Universität St. Petersburg vom 22. bis 24. Juni 2017, edited by Franz Simmler and Galina Baeva, 293–312. Berlin : WEIDLER, 2019.' ieee: 'B.-M. Schuster, “Textgliederungsprinzipien und Beziehungsgestaltung im Stammbuch von 1559–1878,” in Textgliederungsprinzipien. Ihre Kennzeichnungsformen und Funktionen in Texten vom 8. bis 18. Jahrhundert. Akten zum Internationalen Kongress an der Staatlichen Universität St. Petersburg vom 22. bis 24. Juni 2017, F. Simmler and G. Baeva, Eds. Berlin : WEIDLER, 2019, pp. 293–312.' mla: Schuster, Britt-Marie. “Textgliederungsprinzipien und Beziehungsgestaltung im Stammbuch von 1559–1878.” Textgliederungsprinzipien. Ihre Kennzeichnungsformen und Funktionen in Texten vom 8. bis 18. Jahrhundert. Akten zum Internationalen Kongress an der Staatlichen Universität St. Petersburg vom 22. bis 24. Juni 2017, edited by Franz Simmler and Galina Baeva, WEIDLER, 2019, pp. 293–312. short: 'B.-M. Schuster, in: F. Simmler, G. Baeva (Eds.), Textgliederungsprinzipien. Ihre Kennzeichnungsformen und Funktionen in Texten vom 8. bis 18. Jahrhundert. Akten zum Internationalen Kongress an der Staatlichen Universität St. Petersburg vom 22. bis 24. Juni 2017, WEIDLER, Berlin , 2019, pp. 293–312.' date_created: 2022-05-09T13:15:16Z date_updated: 2023-10-12T13:23:02Z department: - _id: '745' editor: - first_name: 'Franz ' full_name: 'Simmler, Franz ' last_name: Simmler - first_name: Galina full_name: Baeva, Galina last_name: Baeva keyword: - Textsortengeschichte language: - iso: ger page: 293–312 place: 'Berlin ' publication: Textgliederungsprinzipien. Ihre Kennzeichnungsformen und Funktionen in Texten vom 8. bis 18. Jahrhundert. Akten zum Internationalen Kongress an der Staatlichen Universität St. Petersburg vom 22. bis 24. Juni 2017 publisher: WEIDLER status: public title: Textgliederungsprinzipien und Beziehungsgestaltung im Stammbuch von 1559–1878 type: book_chapter user_id: '17386' year: '2019' ... --- _id: '46336' abstract: - lang: eng text: Choosing the best-performing optimizer(s) out of a portfolio of optimization algorithms is usually a difficult and complex task. It gets even worse, if the underlying functions are unknown, i.e., so-called black-box problems, and function evaluations are considered to be expensive. In case of continuous single-objective optimization problems, exploratory landscape analysis (ELA), a sophisticated and effective approach for characterizing the landscapes of such problems by means of numerical values before actually performing the optimization task itself, is advantageous. Unfortunately, until now it has been quite complicated to compute multiple ELA features simultaneously, as the corresponding code has been—if at all—spread across multiple platforms or at least across several packages within these platforms. This article presents a broad summary of existing ELA approaches and introduces flacco, an R-package for feature-based landscape analysis of continuous and constrained optimization problems. Although its functions neither solve the optimization problem itself nor the related algorithm selection problem (ASP), it offers easy access to an essential ingredient of the ASP by providing a wide collection of ELA features on a single platform—even within a single package. In addition, flacco provides multiple visualization techniques, which enhance the understanding of some of these numerical features, and thereby make certain landscape properties more comprehensible. On top of that, we will introduce the package’s built-in, as well as web-hosted and hence platform-independent, graphical user interface (GUI). It facilitates the usage of the package—especially for people who are not familiar with R—and thus makes flacco a very convenient toolbox when working towards algorithm selection of continuous single-objective optimization problems. author: - first_name: Pascal full_name: Kerschke, Pascal last_name: Kerschke - first_name: Heike full_name: Trautmann, Heike id: '100740' last_name: Trautmann orcid: 0000-0002-9788-8282 citation: ama: 'Kerschke P, Trautmann H. Comprehensive Feature-Based Landscape Analysis of Continuous and Constrained Optimization Problems Using the R-package flacco. In: Bauer N, Ickstadt K, Lübke K, Szepannek G, Trautmann H, Vichi M, eds. Applications in Statistical Computing. Springer; 2019:93–123. doi:10.1007/978-3-030-25147-5_7' apa: Kerschke, P., & Trautmann, H. (2019). Comprehensive Feature-Based Landscape Analysis of Continuous and Constrained Optimization Problems Using the R-package flacco. In N. Bauer, K. Ickstadt, K. Lübke, G. Szepannek, H. Trautmann, & M. Vichi (Eds.), Applications in Statistical Computing (pp. 93–123). Springer. https://doi.org/10.1007/978-3-030-25147-5_7 bibtex: '@inbook{Kerschke_Trautmann_2019, title={Comprehensive Feature-Based Landscape Analysis of Continuous and Constrained Optimization Problems Using the R-package flacco}, DOI={10.1007/978-3-030-25147-5_7}, booktitle={Applications in Statistical Computing}, publisher={Springer}, author={Kerschke, Pascal and Trautmann, Heike}, editor={Bauer, Nadja and Ickstadt, Katja and Lübke, Karsten and Szepannek, Gero and Trautmann, Heike and Vichi, Maurizio}, year={2019}, pages={93–123} }' chicago: Kerschke, Pascal, and Heike Trautmann. “Comprehensive Feature-Based Landscape Analysis of Continuous and Constrained Optimization Problems Using the R-Package Flacco.” In Applications in Statistical Computing, edited by Nadja Bauer, Katja Ickstadt, Karsten Lübke, Gero Szepannek, Heike Trautmann, and Maurizio Vichi, 93–123. Springer, 2019. https://doi.org/10.1007/978-3-030-25147-5_7. ieee: P. Kerschke and H. Trautmann, “Comprehensive Feature-Based Landscape Analysis of Continuous and Constrained Optimization Problems Using the R-package flacco,” in Applications in Statistical Computing, N. Bauer, K. Ickstadt, K. Lübke, G. Szepannek, H. Trautmann, and M. Vichi, Eds. Springer, 2019, pp. 93–123. mla: Kerschke, Pascal, and Heike Trautmann. “Comprehensive Feature-Based Landscape Analysis of Continuous and Constrained Optimization Problems Using the R-Package Flacco.” Applications in Statistical Computing, edited by Nadja Bauer et al., Springer, 2019, pp. 93–123, doi:10.1007/978-3-030-25147-5_7. short: 'P. Kerschke, H. Trautmann, in: N. Bauer, K. Ickstadt, K. Lübke, G. Szepannek, H. Trautmann, M. Vichi (Eds.), Applications in Statistical Computing, Springer, 2019, pp. 93–123.' date_created: 2023-08-04T07:43:30Z date_updated: 2023-10-16T13:08:22Z department: - _id: '34' - _id: '819' doi: 10.1007/978-3-030-25147-5_7 editor: - first_name: Nadja full_name: Bauer, Nadja last_name: Bauer - first_name: Katja full_name: Ickstadt, Katja last_name: Ickstadt - first_name: Karsten full_name: Lübke, Karsten last_name: Lübke - first_name: Gero full_name: Szepannek, Gero last_name: Szepannek - first_name: Heike full_name: Trautmann, Heike last_name: Trautmann - first_name: Maurizio full_name: Vichi, Maurizio last_name: Vichi language: - iso: eng page: 93–123 publication: Applications in Statistical Computing publisher: Springer status: public title: Comprehensive Feature-Based Landscape Analysis of Continuous and Constrained Optimization Problems Using the R-package flacco type: book_chapter user_id: '15504' year: '2019' ... --- _id: '46346' abstract: - lang: eng text: In this article, we build upon previous work on designing informative and efficient Exploratory Landscape Analysis features for characterizing problems' landscapes and show their effectiveness in automatically constructing algorithm selection models in continuous black-box optimization problems. Focusing on algorithm performance results of the COCO platform of several years, we construct a representative set of high-performing complementary solvers and present an algorithm selection model that, compared to the portfolio's single best solver, on average requires less than half of the resources for solving a given problem. Therefore, there is a huge gain in efficiency compared to classical ensemble methods combined with an increased insight into problem characteristics and algorithm properties by using informative features. The model acts on the assumption that the function set of the Black-Box Optimization Benchmark is representative enough for practical applications. The model allows for selecting the best suited optimization algorithm within the considered set for unseen problems prior to the optimization itself based on a small sample of function evaluations. Note that such a sample can even be reused for the initial population of an evolutionary (optimization) algorithm so that even the feature costs become negligible. author: - first_name: Pascal full_name: Kerschke, Pascal last_name: Kerschke - first_name: Heike full_name: Trautmann, Heike id: '100740' last_name: Trautmann orcid: 0000-0002-9788-8282 citation: ama: Kerschke P, Trautmann H. Automated Algorithm Selection on Continuous Black-Box Problems By Combining Exploratory Landscape Analysis and Machine Learning. Evolutionary Computation (ECJ). 2019;27(1):99–127. doi:10.1162/evco_a_00236 apa: Kerschke, P., & Trautmann, H. (2019). Automated Algorithm Selection on Continuous Black-Box Problems By Combining Exploratory Landscape Analysis and Machine Learning. Evolutionary Computation (ECJ), 27(1), 99–127. https://doi.org/10.1162/evco_a_00236 bibtex: '@article{Kerschke_Trautmann_2019, title={Automated Algorithm Selection on Continuous Black-Box Problems By Combining Exploratory Landscape Analysis and Machine Learning}, volume={27}, DOI={10.1162/evco_a_00236}, number={1}, journal={Evolutionary Computation (ECJ)}, author={Kerschke, Pascal and Trautmann, Heike}, year={2019}, pages={99–127} }' chicago: 'Kerschke, Pascal, and Heike Trautmann. “Automated Algorithm Selection on Continuous Black-Box Problems By Combining Exploratory Landscape Analysis and Machine Learning.” Evolutionary Computation (ECJ) 27, no. 1 (2019): 99–127. https://doi.org/10.1162/evco_a_00236.' ieee: 'P. Kerschke and H. Trautmann, “Automated Algorithm Selection on Continuous Black-Box Problems By Combining Exploratory Landscape Analysis and Machine Learning,” Evolutionary Computation (ECJ), vol. 27, no. 1, pp. 99–127, 2019, doi: 10.1162/evco_a_00236.' mla: Kerschke, Pascal, and Heike Trautmann. “Automated Algorithm Selection on Continuous Black-Box Problems By Combining Exploratory Landscape Analysis and Machine Learning.” Evolutionary Computation (ECJ), vol. 27, no. 1, 2019, pp. 99–127, doi:10.1162/evco_a_00236. short: P. Kerschke, H. Trautmann, Evolutionary Computation (ECJ) 27 (2019) 99–127. date_created: 2023-08-04T07:51:18Z date_updated: 2023-10-16T13:31:57Z department: - _id: '34' - _id: '819' doi: 10.1162/evco_a_00236 intvolume: ' 27' issue: '1' language: - iso: eng page: 99–127 publication: Evolutionary Computation (ECJ) status: public title: Automated Algorithm Selection on Continuous Black-Box Problems By Combining Exploratory Landscape Analysis and Machine Learning type: journal_article user_id: '15504' volume: 27 year: '2019' ... --- _id: '46347' abstract: - lang: eng text: We continue recent work on the definition of multimodality in multiobjective optimization (MO) and the introduction of a test bed for multimodal MO problems. This goes beyond well-known diversity maintenance approaches but instead focuses on the landscape topology induced by the objective functions. More general multimodal MO problems are considered by allowing ellipsoid contours for single-objective subproblems. An experimental analysis compares two MO algorithms, one that explicitly relies on hypervolume gradient approximation, and one that is based on local search, both on a selection of generated example problems. We do not focus on performance but on the interaction induced by the problems and algorithms, which can be described by means of specific characteristics explicitly designed for the multimodal MO setting. Furthermore, we widen the scope of our analysis by additionally applying visualization techniques in the decision space. This strengthens and extends the foundations for Exploratory Landscape Analysis (ELA) in MO. author: - first_name: Pascal full_name: Kerschke, Pascal last_name: Kerschke - first_name: Hao full_name: Wang, Hao last_name: Wang - first_name: Mike full_name: Preuss, Mike last_name: Preuss - first_name: Christian full_name: Grimme, Christian last_name: Grimme - first_name: André full_name: Deutz, André last_name: Deutz - first_name: Heike full_name: Trautmann, Heike id: '100740' last_name: Trautmann orcid: 0000-0002-9788-8282 - first_name: Michael full_name: Emmerich, Michael last_name: Emmerich citation: ama: Kerschke P, Wang H, Preuss M, et al. Search Dynamics on Multimodal Multi-Objective Problems. Evolutionary Computation (ECJ). 2019;27(4):577–609. doi:10.1162/evco_a_00234 apa: Kerschke, P., Wang, H., Preuss, M., Grimme, C., Deutz, A., Trautmann, H., & Emmerich, M. (2019). Search Dynamics on Multimodal Multi-Objective Problems. Evolutionary Computation (ECJ), 27(4), 577–609. https://doi.org/10.1162/evco_a_00234 bibtex: '@article{Kerschke_Wang_Preuss_Grimme_Deutz_Trautmann_Emmerich_2019, title={Search Dynamics on Multimodal Multi-Objective Problems}, volume={27}, DOI={10.1162/evco_a_00234}, number={4}, journal={Evolutionary Computation (ECJ)}, author={Kerschke, Pascal and Wang, Hao and Preuss, Mike and Grimme, Christian and Deutz, André and Trautmann, Heike and Emmerich, Michael}, year={2019}, pages={577–609} }' chicago: 'Kerschke, Pascal, Hao Wang, Mike Preuss, Christian Grimme, André Deutz, Heike Trautmann, and Michael Emmerich. “Search Dynamics on Multimodal Multi-Objective Problems.” Evolutionary Computation (ECJ) 27, no. 4 (2019): 577–609. https://doi.org/10.1162/evco_a_00234.' ieee: 'P. Kerschke et al., “Search Dynamics on Multimodal Multi-Objective Problems,” Evolutionary Computation (ECJ), vol. 27, no. 4, pp. 577–609, 2019, doi: 10.1162/evco_a_00234.' mla: Kerschke, Pascal, et al. “Search Dynamics on Multimodal Multi-Objective Problems.” Evolutionary Computation (ECJ), vol. 27, no. 4, 2019, pp. 577–609, doi:10.1162/evco_a_00234. short: P. Kerschke, H. Wang, M. Preuss, C. Grimme, A. Deutz, H. Trautmann, M. Emmerich, Evolutionary Computation (ECJ) 27 (2019) 577–609. date_created: 2023-08-04T07:52:06Z date_updated: 2023-10-16T13:32:18Z department: - _id: '34' - _id: '819' doi: 10.1162/evco_a_00234 intvolume: ' 27' issue: '4' language: - iso: eng page: 577–609 publication: Evolutionary Computation (ECJ) status: public title: Search Dynamics on Multimodal Multi-Objective Problems type: journal_article user_id: '15504' volume: 27 year: '2019' ... --- _id: '23720' abstract: - lang: eng text: Die Instandsetzung von sicherheitskritischen Komponenten durch Besatzungsmitglieder auf See erfordert technische und organisa-torische Unterstützungsmaßnahmen. Zur Instandsetzung kritischer Systeme auf See bietet AR-Technologie erkennbare Potenziale (Räumliche Visualisierung, Kontextualisierung). Zugleich sollen Instandsetzungs-Einsätze im Sinne des informellen arbeits- und einsatzbezogenen Lernens zum Kompetenzerwerb genutzt werden. Dazu wird eine AR-Architektur vorgestellt, die das Lernen im Anwendungsfall ‚Instandsetzung‘ integriert. author: - first_name: Iris full_name: Gräßler, Iris id: '47565' last_name: Gräßler orcid: 0000-0001-5765-971X - first_name: Jens full_name: Pottebaum, Jens id: '405' last_name: Pottebaum orcid: http://orcid.org/0000-0001-8778-2989 - first_name: Patrick full_name: Taplick, Patrick last_name: Taplick - first_name: Daniel full_name: Roesmann, Daniel id: '54680' last_name: Roesmann - first_name: Daniel full_name: Preuß, Daniel id: '40253' last_name: Preuß citation: ama: 'Gräßler I, Pottebaum J, Taplick P, Roesmann D, Preuß D. Unterstützung des Lernens für kritische Situationen: Potenzial von Augmented Reality für die Instandsetzung auf See. In: Lukas U, Bauer K, Dolereit T, eds. Go-3D 2019 “Mit 3D Richtung Maritim 4.0” - Tagungsband zur Konferenz Go-3D 2019. Fraunhofer Verlag; 2019:45-57.' apa: 'Gräßler, I., Pottebaum, J., Taplick, P., Roesmann, D., & Preuß, D. (2019). Unterstützung des Lernens für kritische Situationen: Potenzial von Augmented Reality für die Instandsetzung auf See. In U. Lukas, K. Bauer, & T. Dolereit (Eds.), Go-3D 2019 “Mit 3D Richtung Maritim 4.0” - Tagungsband zur Konferenz Go-3D 2019 (pp. 45–57). Fraunhofer Verlag.' bibtex: '@inproceedings{Gräßler_Pottebaum_Taplick_Roesmann_Preuß_2019, title={Unterstützung des Lernens für kritische Situationen: Potenzial von Augmented Reality für die Instandsetzung auf See}, booktitle={Go-3D 2019 “Mit 3D Richtung Maritim 4.0” - Tagungsband zur Konferenz Go-3D 2019}, publisher={Fraunhofer Verlag}, author={Gräßler, Iris and Pottebaum, Jens and Taplick, Patrick and Roesmann, Daniel and Preuß, Daniel}, editor={Lukas, Uwe and Bauer, Kristine and Dolereit, Tim}, year={2019}, pages={45–57} }' chicago: 'Gräßler, Iris, Jens Pottebaum, Patrick Taplick, Daniel Roesmann, and Daniel Preuß. “Unterstützung des Lernens für kritische Situationen: Potenzial von Augmented Reality für die Instandsetzung auf See.” In Go-3D 2019 “Mit 3D Richtung Maritim 4.0” - Tagungsband zur Konferenz Go-3D 2019, edited by Uwe Lukas, Kristine Bauer, and Tim Dolereit, 45–57. Fraunhofer Verlag, 2019.' ieee: 'I. Gräßler, J. Pottebaum, P. Taplick, D. Roesmann, and D. Preuß, “Unterstützung des Lernens für kritische Situationen: Potenzial von Augmented Reality für die Instandsetzung auf See,” in Go-3D 2019 “Mit 3D Richtung Maritim 4.0” - Tagungsband zur Konferenz Go-3D 2019, 2019, pp. 45–57.' mla: 'Gräßler, Iris, et al. “Unterstützung des Lernens für kritische Situationen: Potenzial von Augmented Reality für die Instandsetzung auf See.” Go-3D 2019 “Mit 3D Richtung Maritim 4.0” - Tagungsband zur Konferenz Go-3D 2019, edited by Uwe Lukas et al., Fraunhofer Verlag, 2019, pp. 45–57.' short: 'I. Gräßler, J. Pottebaum, P. Taplick, D. Roesmann, D. Preuß, in: U. Lukas, K. Bauer, T. Dolereit (Eds.), Go-3D 2019 “Mit 3D Richtung Maritim 4.0” - Tagungsband zur Konferenz Go-3D 2019, Fraunhofer Verlag, 2019, pp. 45–57.' date_created: 2021-09-03T06:37:14Z date_updated: 2023-11-16T09:24:58Z department: - _id: '152' editor: - first_name: Uwe full_name: Lukas, Uwe last_name: Lukas - first_name: Kristine full_name: Bauer, Kristine last_name: Bauer - first_name: Tim full_name: Dolereit, Tim last_name: Dolereit language: - iso: ger page: 45-57 publication: Go-3D 2019 "Mit 3D Richtung Maritim 4.0" - Tagungsband zur Konferenz Go-3D 2019 publisher: Fraunhofer Verlag quality_controlled: '1' status: public title: 'Unterstützung des Lernens für kritische Situationen: Potenzial von Augmented Reality für die Instandsetzung auf See' type: conference user_id: '405' year: '2019' ... --- _id: '48841' abstract: - lang: eng text: We tackle a bi-objective dynamic orienteering problem where customer requests arise as time passes by. The goal is to minimize the tour length traveled by a single delivery vehicle while simultaneously keeping the number of dismissed dynamic customers to a minimum. We propose a dynamic Evolutionary Multi-Objective Algorithm which is grounded on insights gained from a previous series of work on an a-posteriori version of the problem, where all request times are known in advance. In our experiments, we simulate different decision maker strategies and evaluate the development of the Pareto-front approximations on exemplary problem instances. It turns out, that despite severely reduced computational budget and no oracle-knowledge of request times the dynamic EMOA is capable of producing approximations which partially dominate the results of the a-posteriori EMOA and dynamic integer linear programming strategies. author: - first_name: Jakob full_name: Bossek, Jakob id: '102979' last_name: Bossek orcid: 0000-0002-4121-4668 - first_name: Christian full_name: Grimme, Christian last_name: Grimme - first_name: Stephan full_name: Meisel, Stephan last_name: Meisel - first_name: Günter full_name: Rudolph, Günter last_name: Rudolph - first_name: Heike full_name: Trautmann, Heike last_name: Trautmann citation: ama: 'Bossek J, Grimme C, Meisel S, Rudolph G, Trautmann H. Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm. In: Deb K, Goodman E, Coello Coello CA, et al., eds. Evolutionary Multi-Criterion Optimization (EMO). Lecture Notes in Computer Science. Springer International Publishing; 2019:516–528. doi:10.1007/978-3-030-12598-1_41' apa: 'Bossek, J., Grimme, C., Meisel, S., Rudolph, G., & Trautmann, H. (2019). Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm. In K. Deb, E. Goodman, C. A. Coello Coello, K. Klamroth, K. Miettinen, S. Mostaghim, & P. Reed (Eds.), Evolutionary Multi-Criterion Optimization (EMO) (pp. 516–528). Springer International Publishing. https://doi.org/10.1007/978-3-030-12598-1_41' bibtex: '@inproceedings{Bossek_Grimme_Meisel_Rudolph_Trautmann_2019, place={Cham}, series={Lecture Notes in Computer Science}, title={Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm}, DOI={10.1007/978-3-030-12598-1_41}, booktitle={Evolutionary Multi-Criterion Optimization (EMO)}, publisher={Springer International Publishing}, author={Bossek, Jakob and Grimme, Christian and Meisel, Stephan and Rudolph, Günter and Trautmann, Heike}, editor={Deb, Kalyanmoy and Goodman, Erik and Coello Coello, Carlos A. and Klamroth, Kathrin and Miettinen, Kaisa and Mostaghim, Sanaz and Reed, Patrick}, year={2019}, pages={516–528}, collection={Lecture Notes in Computer Science} }' chicago: 'Bossek, Jakob, Christian Grimme, Stephan Meisel, Günter Rudolph, and Heike Trautmann. “Bi-Objective Orienteering: Towards a Dynamic Multi-Objective Evolutionary Algorithm.” In Evolutionary Multi-Criterion Optimization (EMO), edited by Kalyanmoy Deb, Erik Goodman, Carlos A. Coello Coello, Kathrin Klamroth, Kaisa Miettinen, Sanaz Mostaghim, and Patrick Reed, 516–528. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2019. https://doi.org/10.1007/978-3-030-12598-1_41.' ieee: 'J. Bossek, C. Grimme, S. Meisel, G. Rudolph, and H. Trautmann, “Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm,” in Evolutionary Multi-Criterion Optimization (EMO), 2019, pp. 516–528, doi: 10.1007/978-3-030-12598-1_41.' mla: 'Bossek, Jakob, et al. “Bi-Objective Orienteering: Towards a Dynamic Multi-Objective Evolutionary Algorithm.” Evolutionary Multi-Criterion Optimization (EMO), edited by Kalyanmoy Deb et al., Springer International Publishing, 2019, pp. 516–528, doi:10.1007/978-3-030-12598-1_41.' short: 'J. Bossek, C. Grimme, S. Meisel, G. Rudolph, H. Trautmann, in: K. Deb, E. Goodman, C.A. Coello Coello, K. Klamroth, K. Miettinen, S. Mostaghim, P. Reed (Eds.), Evolutionary Multi-Criterion Optimization (EMO), Springer International Publishing, Cham, 2019, pp. 516–528.' date_created: 2023-11-14T15:58:52Z date_updated: 2023-12-13T10:43:07Z department: - _id: '819' doi: 10.1007/978-3-030-12598-1_41 editor: - first_name: Kalyanmoy full_name: Deb, Kalyanmoy last_name: Deb - first_name: Erik full_name: Goodman, Erik last_name: Goodman - first_name: Carlos A. full_name: Coello Coello, Carlos A. last_name: Coello Coello - first_name: Kathrin full_name: Klamroth, Kathrin last_name: Klamroth - first_name: Kaisa full_name: Miettinen, Kaisa last_name: Miettinen - first_name: Sanaz full_name: Mostaghim, Sanaz last_name: Mostaghim - first_name: Patrick full_name: Reed, Patrick last_name: Reed extern: '1' keyword: - Combinatorial optimization - Dynamic optimization - Metaheuristics - Multi-objective optimization - Vehicle routing language: - iso: eng page: 516–528 place: Cham publication: Evolutionary Multi-Criterion Optimization (EMO) publication_identifier: isbn: - 978-3-030-12598-1 publication_status: published publisher: Springer International Publishing series_title: Lecture Notes in Computer Science status: public title: 'Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm' type: conference user_id: '102979' year: '2019' ... --- _id: '48842' abstract: - lang: eng text: 'Evolutionary algorithms have successfully been applied to evolve problem instances that exhibit a significant difference in performance for a given algorithm or a pair of algorithms inter alia for the Traveling Salesperson Problem (TSP). Creating a large variety of instances is crucial for successful applications in the blooming field of algorithm selection. In this paper, we introduce new and creative mutation operators for evolving instances of the TSP. We show that adopting those operators in an evolutionary algorithm allows for the generation of benchmark sets with highly desirable properties: (1) novelty by clear visual distinction to established benchmark sets in the field, (2) visual and quantitative diversity in the space of TSP problem characteristics, and (3) significant performance differences with respect to the restart versions of heuristic state-of-the-art TSP solvers EAX and LKH. The important aspect of diversity is addressed and achieved solely by the proposed mutation operators and not enforced by explicit diversity preservation.' author: - first_name: Jakob full_name: Bossek, Jakob id: '102979' last_name: Bossek orcid: 0000-0002-4121-4668 - first_name: Pascal full_name: Kerschke, Pascal last_name: Kerschke - first_name: Aneta full_name: Neumann, Aneta last_name: Neumann - first_name: Markus full_name: Wagner, Markus last_name: Wagner - first_name: Frank full_name: Neumann, Frank last_name: Neumann - first_name: Heike full_name: Trautmann, Heike last_name: Trautmann citation: ama: 'Bossek J, Kerschke P, Neumann A, Wagner M, Neumann F, Trautmann H. Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators. In: Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms. FOGA ’19. Association for Computing Machinery; 2019:58–71. doi:10.1145/3299904.3340307' apa: Bossek, J., Kerschke, P., Neumann, A., Wagner, M., Neumann, F., & Trautmann, H. (2019). Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators. Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 58–71. https://doi.org/10.1145/3299904.3340307 bibtex: '@inproceedings{Bossek_Kerschke_Neumann_Wagner_Neumann_Trautmann_2019, place={New York, NY, USA}, series={FOGA ’19}, title={Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators}, DOI={10.1145/3299904.3340307}, booktitle={Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Kerschke, Pascal and Neumann, Aneta and Wagner, Markus and Neumann, Frank and Trautmann, Heike}, year={2019}, pages={58–71}, collection={FOGA ’19} }' chicago: 'Bossek, Jakob, Pascal Kerschke, Aneta Neumann, Markus Wagner, Frank Neumann, and Heike Trautmann. “Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators.” In Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 58–71. FOGA ’19. New York, NY, USA: Association for Computing Machinery, 2019. https://doi.org/10.1145/3299904.3340307.' ieee: 'J. Bossek, P. Kerschke, A. Neumann, M. Wagner, F. Neumann, and H. Trautmann, “Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators,” in Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, 2019, pp. 58–71, doi: 10.1145/3299904.3340307.' mla: Bossek, Jakob, et al. “Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators.” Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, Association for Computing Machinery, 2019, pp. 58–71, doi:10.1145/3299904.3340307. short: 'J. Bossek, P. Kerschke, A. Neumann, M. Wagner, F. Neumann, H. Trautmann, in: Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, Association for Computing Machinery, New York, NY, USA, 2019, pp. 58–71.' date_created: 2023-11-14T15:58:52Z date_updated: 2023-12-13T10:42:57Z department: - _id: '819' doi: 10.1145/3299904.3340307 extern: '1' keyword: - benchmarking - instance features - optimization - problem generation - traveling salesperson problem language: - iso: eng page: 58–71 place: New York, NY, USA publication: Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms publication_identifier: isbn: - 978-1-4503-6254-2 publication_status: published publisher: Association for Computing Machinery series_title: FOGA ’19 status: public title: Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators type: conference user_id: '102979' year: '2019' ... --- _id: '48843' abstract: - lang: eng text: We contribute to the theoretical understanding of randomized search heuristics for dynamic problems. We consider the classical graph coloring problem and investigate the dynamic setting where edges are added to the current graph. We then analyze the expected time for randomized search heuristics to recompute high quality solutions. This includes the (1+1) EA and RLS in a setting where the number of colors is bounded and we are minimizing the number of conflicts as well as iterated local search algorithms that use an unbounded color palette and aim to use the smallest colors and - as a consequence - the smallest number of colors. We identify classes of bipartite graphs where reoptimization is as hard as or even harder than optimization from scratch, i. e. starting with a random initialization. Even adding a single edge can lead to hard symmetry problems. However, graph classes that are hard for one algorithm turn out to be easy for others. In most cases our bounds show that reoptimization is faster than optimizing from scratch. Furthermore, we show how to speed up computations by using problem specific operators concentrating on parts of the graph where changes have occurred. author: - first_name: Jakob full_name: Bossek, Jakob id: '102979' last_name: Bossek orcid: 0000-0002-4121-4668 - first_name: Frank full_name: Neumann, Frank last_name: Neumann - first_name: Pan full_name: Peng, Pan last_name: Peng - first_name: Dirk full_name: Sudholt, Dirk last_name: Sudholt citation: ama: 'Bossek J, Neumann F, Peng P, Sudholt D. Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO ’19. Association for Computing Machinery; 2019:1443–1451. doi:10.1145/3321707.3321792' apa: Bossek, J., Neumann, F., Peng, P., & Sudholt, D. (2019). Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring. Proceedings of the Genetic and Evolutionary Computation Conference, 1443–1451. https://doi.org/10.1145/3321707.3321792 bibtex: '@inproceedings{Bossek_Neumann_Peng_Sudholt_2019, place={New York, NY, USA}, series={GECCO ’19}, title={Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring}, DOI={10.1145/3321707.3321792}, 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={2019}, pages={1443–1451}, collection={GECCO ’19} }' chicago: 'Bossek, Jakob, Frank Neumann, Pan Peng, and Dirk Sudholt. “Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring.” In Proceedings of the Genetic and Evolutionary Computation Conference, 1443–1451. GECCO ’19. New York, NY, USA: Association for Computing Machinery, 2019. https://doi.org/10.1145/3321707.3321792.' ieee: 'J. Bossek, F. Neumann, P. Peng, and D. Sudholt, “Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring,” in Proceedings of the Genetic and Evolutionary Computation Conference, 2019, pp. 1443–1451, doi: 10.1145/3321707.3321792.' mla: Bossek, Jakob, et al. “Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring.” Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2019, pp. 1443–1451, doi:10.1145/3321707.3321792. 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, 2019, pp. 1443–1451.' date_created: 2023-11-14T15:58:52Z date_updated: 2023-12-13T10:42:37Z department: - _id: '819' doi: 10.1145/3321707.3321792 extern: '1' keyword: - dynamic optimization - evolutionary algorithms - running time analysis - theory language: - iso: eng page: 1443–1451 place: New York, NY, USA publication: Proceedings of the Genetic and Evolutionary Computation Conference publication_identifier: isbn: - 978-1-4503-6111-8 publication_status: published publisher: Association for Computing Machinery series_title: GECCO ’19 status: public title: Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring type: conference user_id: '102979' year: '2019' ... --- _id: '48840' abstract: - lang: eng text: Research has shown that for many single-objective graph problems where optimum solutions are composed of low weight sub-graphs, such as the minimum spanning tree problem (MST), mutation operators favoring low weight edges show superior performance. Intuitively, similar observations should hold for multi-criteria variants of such problems. In this work, we focus on the multi-criteria MST problem. A thorough experimental study is conducted where we estimate the probability of edges being part of non-dominated spanning trees as a function of the edges’ non-domination level or domination count, respectively. Building on gained insights, we propose several biased one-edge-exchange mutation operators that differ in the used edge-selection probability distribution (biased towards edges of low rank). Our empirical analysis shows that among different graph types (dense and sparse) and edge weight types (both uniformly random and combinations of Euclidean and uniformly random) biased edge-selection strategies perform superior in contrast to the baseline uniform edge-selection. Our findings are in particular strong for dense graphs. author: - first_name: Jakob full_name: Bossek, Jakob id: '102979' last_name: Bossek orcid: 0000-0002-4121-4668 - first_name: Christian full_name: Grimme, Christian last_name: Grimme - first_name: Frank full_name: Neumann, Frank last_name: Neumann citation: ama: 'Bossek J, Grimme C, Neumann F. On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem. In: Proceedings of the Genetic and Evolutionary Computation Conference. GECCO ’19. Association for Computing Machinery; 2019:516–523. doi:10.1145/3321707.3321818' apa: Bossek, J., Grimme, C., & Neumann, F. (2019). On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem. Proceedings of the Genetic and Evolutionary Computation Conference, 516–523. https://doi.org/10.1145/3321707.3321818 bibtex: '@inproceedings{Bossek_Grimme_Neumann_2019, place={New York, NY, USA}, series={GECCO ’19}, title={On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem}, DOI={10.1145/3321707.3321818}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Grimme, Christian and Neumann, Frank}, year={2019}, pages={516–523}, collection={GECCO ’19} }' chicago: 'Bossek, Jakob, Christian Grimme, and Frank Neumann. “On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem.” In Proceedings of the Genetic and Evolutionary Computation Conference, 516–523. GECCO ’19. New York, NY, USA: Association for Computing Machinery, 2019. https://doi.org/10.1145/3321707.3321818.' ieee: 'J. Bossek, C. Grimme, and F. Neumann, “On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem,” in Proceedings of the Genetic and Evolutionary Computation Conference, 2019, pp. 516–523, doi: 10.1145/3321707.3321818.' mla: Bossek, Jakob, et al. “On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem.” Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2019, pp. 516–523, doi:10.1145/3321707.3321818. short: 'J. Bossek, C. Grimme, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2019, pp. 516–523.' date_created: 2023-11-14T15:58:52Z date_updated: 2023-12-13T10:42:24Z department: - _id: '819' doi: 10.1145/3321707.3321818 extern: '1' keyword: - biased mutation - combinatorial optimization - minimum spanning tree - multi-objective optimization language: - iso: eng page: 516–523 place: New York, NY, USA publication: Proceedings of the Genetic and Evolutionary Computation Conference publication_identifier: isbn: - 978-1-4503-6111-8 publication_status: published publisher: Association for Computing Machinery series_title: GECCO ’19 status: public title: On the Benefits of Biased Edge-Exchange Mutation for the Multi-Criteria Spanning Tree Problem type: conference user_id: '102979' year: '2019' ... --- _id: '48858' abstract: - lang: eng text: The $$\textbackslash mathcal NP$$-hard multi-criteria shortest path problem (mcSPP) is of utmost practical relevance, e.~g., in navigation system design and logistics. We address the problem of approximating the Pareto-front of the mcSPP with sum objectives. We do so by proposing a new mutation operator for multi-objective evolutionary algorithms that solves single-objective versions of the shortest path problem on subgraphs. A rigorous empirical benchmark on a diverse set of problem instances shows the effectiveness of the approach in comparison to a well-known mutation operator in terms of convergence speed and approximation quality. In addition, we glance at the neighbourhood structure and similarity of obtained Pareto-optimal solutions and derive promising directions for future work. author: - first_name: Jakob full_name: Bossek, Jakob id: '102979' last_name: Bossek orcid: 0000-0002-4121-4668 - first_name: Christian full_name: Grimme, Christian last_name: Grimme citation: ama: 'Bossek J, Grimme C. Solving Scalarized Subproblems within Evolutionary Algorithms for Multi-criteria Shortest Path Problems. In: Battiti R, Brunato M, Kotsireas I, Pardalos PM, eds. Learning and Intelligent Optimization. Lecture Notes in Computer Science. Springer International Publishing; 2019:184–198. doi:10.1007/978-3-030-05348-2_17' apa: Bossek, J., & Grimme, C. (2019). Solving Scalarized Subproblems within Evolutionary Algorithms for Multi-criteria Shortest Path Problems. In R. Battiti, M. Brunato, I. Kotsireas, & P. M. Pardalos (Eds.), Learning and Intelligent Optimization (pp. 184–198). Springer International Publishing. https://doi.org/10.1007/978-3-030-05348-2_17 bibtex: '@inproceedings{Bossek_Grimme_2019, place={Cham}, series={Lecture Notes in Computer Science}, title={Solving Scalarized Subproblems within Evolutionary Algorithms for Multi-criteria Shortest Path Problems}, DOI={10.1007/978-3-030-05348-2_17}, booktitle={Learning and Intelligent Optimization}, publisher={Springer International Publishing}, author={Bossek, Jakob and Grimme, Christian}, editor={Battiti, Roberto and Brunato, Mauro and Kotsireas, Ilias and Pardalos, Panos M.}, year={2019}, pages={184–198}, collection={Lecture Notes in Computer Science} }' chicago: 'Bossek, Jakob, and Christian Grimme. “Solving Scalarized Subproblems within Evolutionary Algorithms for Multi-Criteria Shortest Path Problems.” In Learning and Intelligent Optimization, edited by Roberto Battiti, Mauro Brunato, Ilias Kotsireas, and Panos M. Pardalos, 184–198. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2019. https://doi.org/10.1007/978-3-030-05348-2_17.' ieee: 'J. Bossek and C. Grimme, “Solving Scalarized Subproblems within Evolutionary Algorithms for Multi-criteria Shortest Path Problems,” in Learning and Intelligent Optimization, 2019, pp. 184–198, doi: 10.1007/978-3-030-05348-2_17.' mla: Bossek, Jakob, and Christian Grimme. “Solving Scalarized Subproblems within Evolutionary Algorithms for Multi-Criteria Shortest Path Problems.” Learning and Intelligent Optimization, edited by Roberto Battiti et al., Springer International Publishing, 2019, pp. 184–198, doi:10.1007/978-3-030-05348-2_17. short: 'J. Bossek, C. Grimme, in: R. Battiti, M. Brunato, I. Kotsireas, P.M. Pardalos (Eds.), Learning and Intelligent Optimization, Springer International Publishing, Cham, 2019, pp. 184–198.' date_created: 2023-11-14T15:58:54Z date_updated: 2023-12-13T10:44:44Z department: - _id: '819' doi: 10.1007/978-3-030-05348-2_17 editor: - first_name: Roberto full_name: Battiti, Roberto last_name: Battiti - first_name: Mauro full_name: Brunato, Mauro last_name: Brunato - first_name: Ilias full_name: Kotsireas, Ilias last_name: Kotsireas - first_name: Panos M. full_name: Pardalos, Panos M. last_name: Pardalos extern: '1' language: - iso: eng page: 184–198 place: Cham publication: Learning and Intelligent Optimization publication_identifier: isbn: - 978-3-030-05348-2 publication_status: published publisher: Springer International Publishing series_title: Lecture Notes in Computer Science status: public title: Solving Scalarized Subproblems within Evolutionary Algorithms for Multi-criteria Shortest Path Problems type: conference user_id: '102979' year: '2019' ... --- _id: '48875' abstract: - lang: eng text: A multiobjective perspective onto common performance measures such as the PAR10 score or the expected runtime of single-objective stochastic solvers is presented by directly investigating the tradeoff between the fraction of failed runs and the average runtime. Multi-objective indicators operating in the bi-objective space allow for an overall performance comparison on a set of instances paving the way for instance-based automated algorithm selection techniques. author: - first_name: Jakob full_name: Bossek, Jakob id: '102979' last_name: Bossek orcid: 0000-0002-4121-4668 - first_name: Heike full_name: Trautmann, Heike last_name: Trautmann citation: ama: 'Bossek J, Trautmann H. Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time. In: Battiti R, Brunato M, Kotsireas I, Pardalos PM, eds. Learning and Intelligent Optimization. Lecture Notes in Computer Science. Springer International Publishing; 2019:215–219. doi:10.1007/978-3-030-05348-2_19' apa: 'Bossek, J., & Trautmann, H. (2019). Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time. In R. Battiti, M. Brunato, I. Kotsireas, & P. M. Pardalos (Eds.), Learning and Intelligent Optimization (pp. 215–219). Springer International Publishing. https://doi.org/10.1007/978-3-030-05348-2_19' bibtex: '@inproceedings{Bossek_Trautmann_2019, place={Cham}, series={Lecture Notes in Computer Science}, title={Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time}, DOI={10.1007/978-3-030-05348-2_19}, booktitle={Learning and Intelligent Optimization}, publisher={Springer International Publishing}, author={Bossek, Jakob and Trautmann, Heike}, editor={Battiti, Roberto and Brunato, Mauro and Kotsireas, Ilias and Pardalos, Panos M.}, year={2019}, pages={215–219}, collection={Lecture Notes in Computer Science} }' chicago: 'Bossek, Jakob, and Heike Trautmann. “Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time.” In Learning and Intelligent Optimization, edited by Roberto Battiti, Mauro Brunato, Ilias Kotsireas, and Panos M. Pardalos, 215–219. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2019. https://doi.org/10.1007/978-3-030-05348-2_19.' ieee: 'J. Bossek and H. Trautmann, “Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time,” in Learning and Intelligent Optimization, 2019, pp. 215–219, doi: 10.1007/978-3-030-05348-2_19.' mla: 'Bossek, Jakob, and Heike Trautmann. “Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time.” Learning and Intelligent Optimization, edited by Roberto Battiti et al., Springer International Publishing, 2019, pp. 215–219, doi:10.1007/978-3-030-05348-2_19.' short: 'J. Bossek, H. Trautmann, in: R. Battiti, M. Brunato, I. Kotsireas, P.M. Pardalos (Eds.), Learning and Intelligent Optimization, Springer International Publishing, Cham, 2019, pp. 215–219.' date_created: 2023-11-14T15:58:57Z date_updated: 2023-12-13T10:47:32Z department: - _id: '819' doi: 10.1007/978-3-030-05348-2_19 editor: - first_name: Roberto full_name: Battiti, Roberto last_name: Battiti - first_name: Mauro full_name: Brunato, Mauro last_name: Brunato - first_name: Ilias full_name: Kotsireas, Ilias last_name: Kotsireas - first_name: Panos M. full_name: Pardalos, Panos M. last_name: Pardalos extern: '1' keyword: - Algorithm selection - Performance measurement language: - iso: eng page: 215–219 place: Cham publication: Learning and Intelligent Optimization publication_identifier: isbn: - 978-3-030-05348-2 publisher: Springer International Publishing series_title: Lecture Notes in Computer Science status: public title: 'Multi-Objective Performance Measurement: Alternatives to PAR10 and Expected Running Time' type: conference user_id: '102979' year: '2019' ... --- _id: '22041' abstract: - lang: eng text: The Arburg Plastic Freeforming (APF) is an additive manufacturing process that allows three-dimensional, thermoplastic components to be produced in layer by layer. The components are generated by depositing fine, molten plastic droplets. One of the main advantages of the APF process is the open machine control. Thus, the process parameters can be adapted and optimized for the individual applications. The optimization is carried out on the basis of a variation of the process parameters using a statistical design of experiments. Relevant process parameters are the layer thickness, the form factor, the raster and delta angle as well as the overlap between the contour and the filling of a layer. In addition, the nozzle and build chamber temperatures are varied. Using this procedure, the effects of the influencing parameters on the mechanical properties and the interactions between the influencing parameters are analyzed and converted into mathematical models. On the basis of the results and the models, guidelines will be developed to assist the user of APF technology in the systematic process configuration for their own applications. The material used is ABS, one of the most frequently used amorphous thermoplastics in additive manufacturing. The mechanical properties are determined on the basis of tensile tests and the characteristic values tensile strength, elongation at break and Young's modulus. The results should show the performance of the APF technology in regard to the mechanical properties. author: - first_name: Elmar full_name: Moritzer, Elmar id: '20531' last_name: Moritzer - first_name: André full_name: Hirsch, André id: '27599' last_name: Hirsch - first_name: Felix full_name: Hecker, Felix id: '45537' last_name: Hecker citation: ama: 'Moritzer E, Hirsch A, Hecker F. Process Parameter Optimization to Improve the Mechanical Properties of Arburg Plastic Freeformed Components. In: 30th Annual International Solid Freeform Fabrication Symposium. Vol 30. ; 2019:705-714. doi:http://dx.doi.org/10.26153/tsw/17308' apa: Moritzer, E., Hirsch, A., & Hecker, F. (2019). Process Parameter Optimization to Improve the Mechanical Properties of Arburg Plastic Freeformed Components. 30th Annual International Solid Freeform Fabrication Symposium, 30, 705–714. http://dx.doi.org/10.26153/tsw/17308 bibtex: '@inproceedings{Moritzer_Hirsch_Hecker_2019, title={Process Parameter Optimization to Improve the Mechanical Properties of Arburg Plastic Freeformed Components}, volume={30}, DOI={http://dx.doi.org/10.26153/tsw/17308}, booktitle={30th Annual International Solid Freeform Fabrication Symposium}, author={Moritzer, Elmar and Hirsch, André and Hecker, Felix}, year={2019}, pages={705–714} }' chicago: Moritzer, Elmar, André Hirsch, and Felix Hecker. “Process Parameter Optimization to Improve the Mechanical Properties of Arburg Plastic Freeformed Components.” In 30th Annual International Solid Freeform Fabrication Symposium, 30:705–14, 2019. http://dx.doi.org/10.26153/tsw/17308. ieee: 'E. Moritzer, A. Hirsch, and F. Hecker, “Process Parameter Optimization to Improve the Mechanical Properties of Arburg Plastic Freeformed Components,” in 30th Annual International Solid Freeform Fabrication Symposium, 2019, vol. 30, pp. 705–714, doi: http://dx.doi.org/10.26153/tsw/17308.' mla: Moritzer, Elmar, et al. “Process Parameter Optimization to Improve the Mechanical Properties of Arburg Plastic Freeformed Components.” 30th Annual International Solid Freeform Fabrication Symposium, vol. 30, 2019, pp. 705–14, doi:http://dx.doi.org/10.26153/tsw/17308. short: 'E. Moritzer, A. Hirsch, F. Hecker, in: 30th Annual International Solid Freeform Fabrication Symposium, 2019, pp. 705–714.' date_created: 2021-05-07T13:23:23Z date_updated: 2024-01-15T12:01:40Z department: - _id: '219' - _id: '624' - _id: '367' - _id: '321' - _id: '9' doi: http://dx.doi.org/10.26153/tsw/17308 intvolume: ' 30' language: - iso: eng page: 705-714 publication: 30th Annual International Solid Freeform Fabrication Symposium status: public title: Process Parameter Optimization to Improve the Mechanical Properties of Arburg Plastic Freeformed Components type: conference user_id: '45537' volume: 30 year: '2019' ... --- _id: '53274' abstract: - lang: eng text: This paper studies the performance of improper Gaussian signaling (IGS) over a 2-user Rayleigh single-input single-output (SISO) interference channel, treating interference as noise. We assume that the receivers have perfect channel state information (CSI), while the transmitters have access to only statistical CSI. Under these assumptions, we consider a signaling scheme, which we refer to as proper/improper Gaussian signaling or PGS/IGS, where at most one user may employ IGS. For the Rayleigh fading channel model, we characterize the statistical distribution of the signal-to-interference-plus-noise ratio at each receiver and derive closed-form expressions for the ergodic rates. By adapting the powers, we characterize the Pareto boundary of the ergodic rate region for the 2-user fading IC. The ergodic transmission rates can be attained using fixed-rate codebooks and no optimization is involved. Our results show that, in the moderate and strong interference regimes, the proposed PGS/IGS scheme improves the performance with respect to the PGS scheme. Additionally, we numerically compute the ergodic rate region of the full IGS scheme when both users can employ IGS and their transmission parameters are optimized by an exhaustive search. Our results suggest that most of the Pareto optimal points for the 2-user fading IC channel are attained when either both users transmit PGS or when one transmits PGS and the other transmits maximally improper Gaussian signals and time sharing is allowed. article_number: '922' author: - first_name: Mohammad full_name: Soleymani, Mohammad last_name: Soleymani - first_name: Ignacio full_name: Santamaria, Ignacio last_name: Santamaria - first_name: Christian full_name: Lameiro, Christian last_name: Lameiro - first_name: Peter J. full_name: Schreier, Peter J. last_name: Schreier citation: ama: Soleymani M, Santamaria I, Lameiro C, Schreier PJ. Ergodic Rate for Fading Interference Channels with Proper and Improper Gaussian Signaling. Entropy. 2019;21(10). doi:10.3390/e21100922 apa: Soleymani, M., Santamaria, I., Lameiro, C., & Schreier, P. J. (2019). Ergodic Rate for Fading Interference Channels with Proper and Improper Gaussian Signaling. Entropy, 21(10), Article 922. https://doi.org/10.3390/e21100922 bibtex: '@article{Soleymani_Santamaria_Lameiro_Schreier_2019, title={Ergodic Rate for Fading Interference Channels with Proper and Improper Gaussian Signaling}, volume={21}, DOI={10.3390/e21100922}, number={10922}, journal={Entropy}, publisher={MDPI AG}, author={Soleymani, Mohammad and Santamaria, Ignacio and Lameiro, Christian and Schreier, Peter J.}, year={2019} }' chicago: Soleymani, Mohammad, Ignacio Santamaria, Christian Lameiro, and Peter J. Schreier. “Ergodic Rate for Fading Interference Channels with Proper and Improper Gaussian Signaling.” Entropy 21, no. 10 (2019). https://doi.org/10.3390/e21100922. ieee: 'M. Soleymani, I. Santamaria, C. Lameiro, and P. J. Schreier, “Ergodic Rate for Fading Interference Channels with Proper and Improper Gaussian Signaling,” Entropy, vol. 21, no. 10, Art. no. 922, 2019, doi: 10.3390/e21100922.' mla: Soleymani, Mohammad, et al. “Ergodic Rate for Fading Interference Channels with Proper and Improper Gaussian Signaling.” Entropy, vol. 21, no. 10, 922, MDPI AG, 2019, doi:10.3390/e21100922. short: M. Soleymani, I. Santamaria, C. Lameiro, P.J. Schreier, Entropy 21 (2019). date_created: 2024-04-05T09:07:05Z date_updated: 2024-04-05T13:19:44Z department: - _id: '263' doi: 10.3390/e21100922 intvolume: ' 21' issue: '10' keyword: - General Physics and Astronomy language: - iso: eng publication: Entropy publication_identifier: issn: - 1099-4300 publication_status: published publisher: MDPI AG status: public title: Ergodic Rate for Fading Interference Channels with Proper and Improper Gaussian Signaling type: journal_article user_id: '67076' volume: 21 year: '2019' ... --- _id: '4684' abstract: - lang: eng text: Recent years have seen the emergence of physical products that are digitally networked with other products and with information systems to enable complex business scenarios in manufacturing, mobility, or healthcare. These “smart products”, which enable the co-creation of “smart service” that is based on monitoring, optimization, remote control, and autonomous adaptation of products, profoundly transform service systems into what we call “smart service systems”. In a multi-method study that includes conceptual research and qualitative data from in-depth interviews, we conceptualize “smart service” and “smart service systems” based on using smart products as boundary objects that integrate service consumers’ and service providers’ resources and activities. Smart products allow both actors to retrieve and to analyze aggregated field evidence and to adapt service systems based on contextual data. We discuss the implications that the introduction of smart service systems have for foundational concepts of service science and conclude that smart service systems are characterized by technology-mediated, continuous, and routinized interactions. article_type: original author: - first_name: Daniel full_name: Beverungen, Daniel id: '59677' last_name: Beverungen - first_name: Oliver full_name: Müller, Oliver id: '72849' last_name: Müller - first_name: Martin full_name: Matzner, Martin last_name: Matzner - first_name: Jan full_name: Mendling, Jan last_name: Mendling - first_name: Jan full_name: vom Brocke, Jan last_name: vom Brocke citation: ama: Beverungen D, Müller O, Matzner M, Mendling J, vom Brocke J. Conceptualizing smart service systems. Electronic Markets. 2019;29:7-18. doi:10.1007/s12525-017-0270-5 apa: Beverungen, D., Müller, O., Matzner, M., Mendling, J., & vom Brocke, J. (2019). Conceptualizing smart service systems. Electronic Markets, 29, 7–18. https://doi.org/10.1007/s12525-017-0270-5 bibtex: '@article{Beverungen_Müller_Matzner_Mendling_vom Brocke_2019, title={Conceptualizing smart service systems}, volume={29}, DOI={10.1007/s12525-017-0270-5}, journal={Electronic Markets}, publisher={SpringerNature}, author={Beverungen, Daniel and Müller, Oliver and Matzner, Martin and Mendling, Jan and vom Brocke, Jan}, year={2019}, pages={7–18} }' chicago: 'Beverungen, Daniel, Oliver Müller, Martin Matzner, Jan Mendling, and Jan vom Brocke. “Conceptualizing Smart Service Systems.” Electronic Markets 29 (2019): 7–18. https://doi.org/10.1007/s12525-017-0270-5.' ieee: 'D. Beverungen, O. Müller, M. Matzner, J. Mendling, and J. vom Brocke, “Conceptualizing smart service systems,” Electronic Markets, vol. 29, pp. 7–18, 2019, doi: 10.1007/s12525-017-0270-5.' mla: Beverungen, Daniel, et al. “Conceptualizing Smart Service Systems.” Electronic Markets, vol. 29, SpringerNature, 2019, pp. 7–18, doi:10.1007/s12525-017-0270-5. short: D. Beverungen, O. Müller, M. Matzner, J. Mendling, J. vom Brocke, Electronic Markets 29 (2019) 7–18. date_created: 2018-10-12T08:24:45Z date_updated: 2024-04-18T12:55:05Z ddc: - '380' department: - _id: '195' doi: 10.1007/s12525-017-0270-5 file: - access_level: closed content_type: application/pdf creator: dabe date_created: 2024-04-18T12:53:07Z date_updated: 2024-04-18T12:53:07Z file_id: '53575' file_name: Beverungen_et_al-Conceptualizing_Smart_Service_Systems.pdf file_size: 599681 relation: main_file success: 1 file_date_updated: 2024-04-18T12:53:07Z has_accepted_license: '1' intvolume: ' 29' jel: - L8 keyword: - Boundary object - Internet of things - Service science - Smart products - Smart service language: - iso: eng page: 7-18 project: - _id: '1070' call_identifier: MSCA-RISE-2014 grant_number: '645751' name: 'RISE_BPM: Propelling Business Process Management by Research and Innovation Staff Exchange' publication: Electronic Markets publication_identifier: issn: - '14228890' publication_status: published publisher: SpringerNature quality_controlled: '1' status: public title: Conceptualizing smart service systems type: journal_article user_id: '59677' volume: 29 year: '2019' ... --- _id: '53976' author: - first_name: Seyed Mohsen full_name: Mousavi, Seyed Mohsen last_name: Mousavi - first_name: Madjid full_name: Tavana, Madjid id: '31858' last_name: Tavana - first_name: Najmeh full_name: Alikar, Najmeh last_name: Alikar - first_name: Mostafa full_name: Zandieh, Mostafa last_name: Zandieh citation: ama: Mousavi SM, Tavana M, Alikar N, Zandieh M. A tuned hybrid intelligent fruit fly optimization algorithm for fuzzy rule generation and classification. Neural Computing and Applications. 2019;31(3):873-885. doi:10.1007/s00521-017-3115-4 apa: Mousavi, S. M., Tavana, M., Alikar, N., & Zandieh, M. (2019). A tuned hybrid intelligent fruit fly optimization algorithm for fuzzy rule generation and classification. Neural Computing and Applications, 31(3), 873–885. https://doi.org/10.1007/s00521-017-3115-4 bibtex: '@article{Mousavi_Tavana_Alikar_Zandieh_2019, title={A tuned hybrid intelligent fruit fly optimization algorithm for fuzzy rule generation and classification}, volume={31}, DOI={10.1007/s00521-017-3115-4}, number={3}, journal={Neural Computing and Applications}, publisher={Springer Science and Business Media LLC}, author={Mousavi, Seyed Mohsen and Tavana, Madjid and Alikar, Najmeh and Zandieh, Mostafa}, year={2019}, pages={873–885} }' chicago: 'Mousavi, Seyed Mohsen, Madjid Tavana, Najmeh Alikar, and Mostafa Zandieh. “A Tuned Hybrid Intelligent Fruit Fly Optimization Algorithm for Fuzzy Rule Generation and Classification.” Neural Computing and Applications 31, no. 3 (2019): 873–85. https://doi.org/10.1007/s00521-017-3115-4.' ieee: 'S. M. Mousavi, M. Tavana, N. Alikar, and M. Zandieh, “A tuned hybrid intelligent fruit fly optimization algorithm for fuzzy rule generation and classification,” Neural Computing and Applications, vol. 31, no. 3, pp. 873–885, 2019, doi: 10.1007/s00521-017-3115-4.' mla: Mousavi, Seyed Mohsen, et al. “A Tuned Hybrid Intelligent Fruit Fly Optimization Algorithm for Fuzzy Rule Generation and Classification.” Neural Computing and Applications, vol. 31, no. 3, Springer Science and Business Media LLC, 2019, pp. 873–85, doi:10.1007/s00521-017-3115-4. short: S.M. Mousavi, M. Tavana, N. Alikar, M. Zandieh, Neural Computing and Applications 31 (2019) 873–885. date_created: 2024-05-06T16:27:01Z date_updated: 2024-05-06T16:38:47Z department: - _id: '277' doi: 10.1007/s00521-017-3115-4 intvolume: ' 31' issue: '3' language: - iso: eng page: 873-885 publication: Neural Computing and Applications publication_identifier: issn: - 0941-0643 - 1433-3058 publication_status: published publisher: Springer Science and Business Media LLC status: public title: A tuned hybrid intelligent fruit fly optimization algorithm for fuzzy rule generation and classification type: journal_article user_id: '51811' volume: 31 year: '2019' ...