[{"type":"book_chapter","publication":"Forcierte Form. Deutschsprachige Versepik des 20. und 21. Jahrhunderts im europäischen Kontext (Abhandlungen zur Literaturwissenschaft)","status":"public","editor":[{"first_name":"Kai","last_name":"Bremer","full_name":"Bremer, Kai"},{"last_name":"Elit","full_name":"Elit, Stefan","first_name":"Stefan"}],"series_title":"(Abhandlungen zur Literaturwissenschaft)","user_id":"21240","department":[{"_id":"465"}],"_id":"31356","language":[{"iso":"ger"}],"citation":{"mla":"Elit, Stefan. “Typen der deutschsprachigen Versepik 1745/1848.” <i>Forcierte Form. Deutschsprachige Versepik des 20. und 21. Jahrhunderts im europäischen Kontext (Abhandlungen zur Literaturwissenschaft)</i>, edited by Kai Bremer and Stefan Elit, 2020, pp. 39–55.","bibtex":"@inbook{Elit_2020, place={Stuttgart}, series={(Abhandlungen zur Literaturwissenschaft)}, title={Typen der deutschsprachigen Versepik 1745/1848}, booktitle={Forcierte Form. Deutschsprachige Versepik des 20. und 21. Jahrhunderts im europäischen Kontext (Abhandlungen zur Literaturwissenschaft)}, author={Elit, Stefan}, editor={Bremer, Kai and Elit, Stefan}, year={2020}, pages={39–55}, collection={(Abhandlungen zur Literaturwissenschaft)} }","short":"S. Elit, in: K. Bremer, S. Elit (Eds.), Forcierte Form. Deutschsprachige Versepik des 20. und 21. Jahrhunderts im europäischen Kontext (Abhandlungen zur Literaturwissenschaft), Stuttgart, 2020, pp. 39–55.","apa":"Elit, S. (2020). Typen der deutschsprachigen Versepik 1745/1848. In K. Bremer &#38; S. Elit (Eds.), <i>Forcierte Form. Deutschsprachige Versepik des 20. und 21. Jahrhunderts im europäischen Kontext (Abhandlungen zur Literaturwissenschaft)</i> (pp. 39–55).","ieee":"S. Elit, “Typen der deutschsprachigen Versepik 1745/1848,” in <i>Forcierte Form. Deutschsprachige Versepik des 20. und 21. Jahrhunderts im europäischen Kontext (Abhandlungen zur Literaturwissenschaft)</i>, K. Bremer and S. Elit, Eds. Stuttgart, 2020, pp. 39–55.","chicago":"Elit, Stefan. “Typen der deutschsprachigen Versepik 1745/1848.” In <i>Forcierte Form. Deutschsprachige Versepik des 20. und 21. Jahrhunderts im europäischen Kontext (Abhandlungen zur Literaturwissenschaft)</i>, edited by Kai Bremer and Stefan Elit, 39–55. (Abhandlungen zur Literaturwissenschaft). Stuttgart, 2020.","ama":"Elit S. Typen der deutschsprachigen Versepik 1745/1848. In: Bremer K, Elit S, eds. <i>Forcierte Form. Deutschsprachige Versepik des 20. und 21. Jahrhunderts im europäischen Kontext (Abhandlungen zur Literaturwissenschaft)</i>. (Abhandlungen zur Literaturwissenschaft). ; 2020:39-55."},"page":"39-55","year":"2020","place":"Stuttgart","date_created":"2022-05-20T12:11:18Z","author":[{"first_name":"Stefan","last_name":"Elit","orcid":"0000-0002-4719-1073","id":"105","full_name":"Elit, Stefan"}],"date_updated":"2022-05-20T12:11:33Z","title":"Typen der deutschsprachigen Versepik 1745/1848"},{"status":"public","editor":[{"first_name":"Annette","last_name":"Gerok-Reiter","full_name":"Gerok-Reiter, Annette"},{"last_name":"Lahr","full_name":"Lahr, Anna-Sara","first_name":"Anna-Sara"},{"first_name":"Simone","last_name":"Leidinger","full_name":"Leidinger, Simone"}],"publication":"Raum und Zeit im Minnesang. Ansätze – Spielarten – Funktionen (Studien zur historischen Poetik 29) ","type":"book_chapter","language":[{"iso":"ger"}],"department":[{"_id":"466"}],"user_id":"21240","_id":"31562","page":"377-393","citation":{"apa":"Egidi, M. (2020). „Zeit, Raum und Subjektivität bei Hartmann von Aue und Burkhard von Hohenfels“. In A. Gerok-Reiter, A.-S. Lahr, &#38; S. Leidinger (Eds.), <i>Raum und Zeit im Minnesang. Ansätze – Spielarten – Funktionen (Studien zur historischen Poetik 29) </i> (pp. 377–393).","bibtex":"@inbook{Egidi_2020, place={Heidelberg}, title={„Zeit, Raum und Subjektivität bei Hartmann von Aue und Burkhard von Hohenfels“}, booktitle={Raum und Zeit im Minnesang. Ansätze – Spielarten – Funktionen (Studien zur historischen Poetik 29) }, author={Egidi, Margreth}, editor={Gerok-Reiter, Annette and Lahr, Anna-Sara and Leidinger, Simone}, year={2020}, pages={377–393} }","short":"M. Egidi, in: A. Gerok-Reiter, A.-S. Lahr, S. Leidinger (Eds.), Raum und Zeit im Minnesang. Ansätze – Spielarten – Funktionen (Studien zur historischen Poetik 29) , Heidelberg, 2020, pp. 377–393.","mla":"Egidi, Margreth. “„Zeit, Raum und Subjektivität bei Hartmann von Aue und Burkhard von Hohenfels“.” <i>Raum und Zeit im Minnesang. Ansätze – Spielarten – Funktionen (Studien zur historischen Poetik 29) </i>, edited by Annette Gerok-Reiter et al., 2020, pp. 377–93.","ama":"Egidi M. „Zeit, Raum und Subjektivität bei Hartmann von Aue und Burkhard von Hohenfels“. In: Gerok-Reiter A, Lahr A-S, Leidinger S, eds. <i>Raum und Zeit im Minnesang. Ansätze – Spielarten – Funktionen (Studien zur historischen Poetik 29) </i>. ; 2020:377-393.","ieee":"M. Egidi, “„Zeit, Raum und Subjektivität bei Hartmann von Aue und Burkhard von Hohenfels“,” in <i>Raum und Zeit im Minnesang. Ansätze – Spielarten – Funktionen (Studien zur historischen Poetik 29) </i>, A. Gerok-Reiter, A.-S. Lahr, and S. Leidinger, Eds. Heidelberg, 2020, pp. 377–393.","chicago":"Egidi, Margreth. “„Zeit, Raum und Subjektivität bei Hartmann von Aue und Burkhard von Hohenfels“.” In <i>Raum und Zeit im Minnesang. Ansätze – Spielarten – Funktionen (Studien zur historischen Poetik 29) </i>, edited by Annette Gerok-Reiter, Anna-Sara Lahr, and Simone Leidinger, 377–93. Heidelberg, 2020."},"place":"Heidelberg","year":"2020","title":"„Zeit, Raum und Subjektivität bei Hartmann von Aue und Burkhard von Hohenfels“","author":[{"full_name":"Egidi, Margreth","id":"32238","last_name":"Egidi","first_name":"Margreth"}],"date_created":"2022-06-01T11:22:13Z","date_updated":"2022-06-01T11:22:30Z"},{"keyword":["Physiology (medical)","Public Health","Environmental and Occupational Health","Orthopedics and Sports Medicine","General Medicine","Public Health","Environmental and Occupational Health","Physiology"],"language":[{"iso":"eng"}],"abstract":[{"text":"<jats:title>Abstract</jats:title><jats:sec>\r\n<jats:title>Purpose</jats:title>\r\n<jats:p>Space flight and bed rest (BR) lead to a rapid decline in exercise capacity. Whey protein plus potassium bicarbonate diet-supplementation (NUTR) could attenuate this effect by improving oxidative metabolism. We evaluated the impact of 21-day BR and NUTR on fatigue resistance of plantar flexor muscles (PF) during repeated shortening contractions, and whether any change was related to altered energy metabolism and muscle oxygenation.</jats:p>\r\n</jats:sec><jats:sec>\r\n<jats:title>Methods</jats:title>\r\n<jats:p>Ten healthy men received a standardized isocaloric diet with (<jats:italic>n</jats:italic> = 5) or without (<jats:italic>n</jats:italic> = 5) NUTR. Eight bouts of 24 concentric plantar flexions (30 s each bout) with 20 s rest between bouts were employed. PF muscle size was assessed by means of peripheral quantitative computed tomography. PF muscle volume was assessed with magnetic resonance imaging. PF muscle force, contraction velocity, power and surface electromyogram signals were recorded during each contraction, as well as energy metabolism (<jats:sup>31</jats:sup>P nuclear magnetic resonance spectroscopy) and oxygenation (near-infrared spectroscopy). Cardiopulmonary parameters were measured during an incremental cycle exercise test.</jats:p>\r\n</jats:sec><jats:sec>\r\n<jats:title>Results</jats:title>\r\n<jats:p>BR caused 10–15% loss of PF volume that was partly recovered 3 days after re-ambulation, as a consequence of fluid redistribution. Unexpectedly, PF fatigue resistance was not affected by BR or NUTR. BR induced a shift in muscle metabolism toward glycolysis and some signs of impaired muscle oxygen extraction. NUTR did not attenuate the BR-induced-shift in energy metabolism.</jats:p>\r\n</jats:sec><jats:sec>\r\n<jats:title>Conclusions</jats:title>\r\n<jats:p>Twenty-one days’ BR did not impair PF fatigue resistance, but the shift to glycolytic metabolism and indications of impaired oxygen extraction may be early signs of developing reduced muscle fatigue resistance.</jats:p>\r\n</jats:sec>","lang":"eng"}],"publication":"European Journal of Applied Physiology","title":"Effects of 21 days of bed rest and whey protein supplementation on plantar flexor muscle fatigue resistance during repeated shortening contractions","publisher":"Springer Science and Business Media LLC","date_created":"2022-09-15T09:30:41Z","year":"2020","issue":"5","extern":"1","_id":"33389","user_id":"89838","status":"public","type":"journal_article","doi":"10.1007/s00421-020-04333-5","date_updated":"2022-09-15T09:48:23Z","author":[{"full_name":"Bosutti, Alessandra","last_name":"Bosutti","first_name":"Alessandra"},{"full_name":"Mulder, Edwin","last_name":"Mulder","first_name":"Edwin"},{"first_name":"Jochen","full_name":"Zange, Jochen","last_name":"Zange"},{"id":"89838","full_name":"Bühlmeier, Judith","last_name":"Bühlmeier","first_name":"Judith"},{"full_name":"Ganse, Bergita","last_name":"Ganse","first_name":"Bergita"},{"last_name":"Degens","full_name":"Degens, Hans","first_name":"Hans"}],"volume":120,"citation":{"ama":"Bosutti A, Mulder E, Zange J, Bühlmeier J, Ganse B, Degens H. Effects of 21 days of bed rest and whey protein supplementation on plantar flexor muscle fatigue resistance during repeated shortening contractions. <i>European Journal of Applied Physiology</i>. 2020;120(5):969-983. doi:<a href=\"https://doi.org/10.1007/s00421-020-04333-5\">10.1007/s00421-020-04333-5</a>","ieee":"A. Bosutti, E. Mulder, J. Zange, J. Bühlmeier, B. Ganse, and H. Degens, “Effects of 21 days of bed rest and whey protein supplementation on plantar flexor muscle fatigue resistance during repeated shortening contractions,” <i>European Journal of Applied Physiology</i>, vol. 120, no. 5, pp. 969–983, 2020, doi: <a href=\"https://doi.org/10.1007/s00421-020-04333-5\">10.1007/s00421-020-04333-5</a>.","chicago":"Bosutti, Alessandra, Edwin Mulder, Jochen Zange, Judith Bühlmeier, Bergita Ganse, and Hans Degens. “Effects of 21 Days of Bed Rest and Whey Protein Supplementation on Plantar Flexor Muscle Fatigue Resistance during Repeated Shortening Contractions.” <i>European Journal of Applied Physiology</i> 120, no. 5 (2020): 969–83. <a href=\"https://doi.org/10.1007/s00421-020-04333-5\">https://doi.org/10.1007/s00421-020-04333-5</a>.","apa":"Bosutti, A., Mulder, E., Zange, J., Bühlmeier, J., Ganse, B., &#38; Degens, H. (2020). Effects of 21 days of bed rest and whey protein supplementation on plantar flexor muscle fatigue resistance during repeated shortening contractions. <i>European Journal of Applied Physiology</i>, <i>120</i>(5), 969–983. <a href=\"https://doi.org/10.1007/s00421-020-04333-5\">https://doi.org/10.1007/s00421-020-04333-5</a>","bibtex":"@article{Bosutti_Mulder_Zange_Bühlmeier_Ganse_Degens_2020, title={Effects of 21 days of bed rest and whey protein supplementation on plantar flexor muscle fatigue resistance during repeated shortening contractions}, volume={120}, DOI={<a href=\"https://doi.org/10.1007/s00421-020-04333-5\">10.1007/s00421-020-04333-5</a>}, number={5}, journal={European Journal of Applied Physiology}, publisher={Springer Science and Business Media LLC}, author={Bosutti, Alessandra and Mulder, Edwin and Zange, Jochen and Bühlmeier, Judith and Ganse, Bergita and Degens, Hans}, year={2020}, pages={969–983} }","short":"A. Bosutti, E. Mulder, J. Zange, J. Bühlmeier, B. Ganse, H. Degens, European Journal of Applied Physiology 120 (2020) 969–983.","mla":"Bosutti, Alessandra, et al. “Effects of 21 Days of Bed Rest and Whey Protein Supplementation on Plantar Flexor Muscle Fatigue Resistance during Repeated Shortening Contractions.” <i>European Journal of Applied Physiology</i>, vol. 120, no. 5, Springer Science and Business Media LLC, 2020, pp. 969–83, doi:<a href=\"https://doi.org/10.1007/s00421-020-04333-5\">10.1007/s00421-020-04333-5</a>."},"page":"969-983","intvolume":"       120","publication_status":"published","publication_identifier":{"issn":["1439-6319","1439-6327"]}},{"language":[{"iso":"chi"}],"department":[{"_id":"5"},{"_id":"116"}],"user_id":"49063","_id":"32679","status":"public","editor":[{"first_name":"Andreas","full_name":"Mahler, Andreas","last_name":"Mahler"}],"publication":"Der Essay als 'neue Form' ","type":"book_chapter","title":"Montaignes Launen und Fantasien oder : Vom Erschreiben des Essays (\"Essais\" I.20; III.5)","date_created":"2022-08-09T18:21:47Z","author":[{"first_name":"Jörn","id":"37947","full_name":"Steigerwald, Jörn","last_name":"Steigerwald"}],"publisher":"Harrassowitz","date_updated":"2022-10-04T01:52:52Z","page":"65-82","citation":{"chicago":"Steigerwald Jörn. “Montaignes Launen und Fantasien oder : Vom Erschreiben des Essays (‘Essais’ I.20; III.5).” In <i>Der Essay als “neue Form” </i>, edited by Mahler Andreas, 65–82. Wiesbaden: Harrassowitz, 2020.","ieee":"Steigerwald J., “Montaignes Launen und Fantasien oder : Vom Erschreiben des Essays (‘Essais’ I.20; III.5),” in <i>Der Essay als “neue Form” </i>, Mahler A., Ed. Wiesbaden: Harrassowitz, 2020, pp. 65–82.","ama":"Steigerwald J. Montaignes Launen und Fantasien oder : Vom Erschreiben des Essays (“Essais” I.20; III.5). In: Mahler A, ed. <i>Der Essay als “neue Form” </i>. Harrassowitz; 2020:65-82.","short":"Steigerwald J., in: Mahler A. (Ed.), Der Essay als “neue Form” , Harrassowitz, Wiesbaden, 2020, pp. 65–82.","mla":"Steigerwald Jörn. “Montaignes Launen und Fantasien oder : Vom Erschreiben des Essays (‘Essais’ I.20; III.5).” <i>Der Essay als “neue Form” </i>, edited by Mahler Andreas, Harrassowitz, 2020, pp. 65–82.","bibtex":"@inbook{Steigerwald_2020, place={Wiesbaden}, title={Montaignes Launen und Fantasien oder : Vom Erschreiben des Essays (“Essais” I.20; III.5)}, booktitle={Der Essay als “neue Form” }, publisher={Harrassowitz}, author={Steigerwald Jörn}, editor={Mahler Andreas}, year={2020}, pages={65–82} }","apa":"Steigerwald J. (2020). Montaignes Launen und Fantasien oder : Vom Erschreiben des Essays (“Essais” I.20; III.5). In Mahler A. (Ed.), <i>Der Essay als “neue Form” </i> (pp. 65–82). Harrassowitz."},"place":"Wiesbaden","year":"2020"},{"doi":"10.3390/nano10010141","date_updated":"2023-01-10T12:11:57Z","volume":10,"author":[{"first_name":"Julius","last_name":"Bürger","id":"46952","full_name":"Bürger, Julius"},{"full_name":"Kunnathully, Vinay","last_name":"Kunnathully","first_name":"Vinay"},{"last_name":"Kool","full_name":"Kool, Daniel","id":"44586","first_name":"Daniel"},{"last_name":"Lindner","full_name":"Lindner, Jörg","id":"20797","first_name":"Jörg"},{"first_name":"Katharina","last_name":"Brassat","id":"11305","full_name":"Brassat, Katharina"}],"intvolume":"        10","citation":{"mla":"Bürger, Julius, et al. “Characterisation of the PS-PMMA Interfaces in Microphase Separated Block Copolymer Thin Films by Analytical (S)TEM.” <i>Nanomaterials</i>, vol. 10, no. 1, 141, MDPI AG, 2020, doi:<a href=\"https://doi.org/10.3390/nano10010141\">10.3390/nano10010141</a>.","short":"J. Bürger, V. Kunnathully, D. Kool, J. Lindner, K. Brassat, Nanomaterials 10 (2020).","bibtex":"@article{Bürger_Kunnathully_Kool_Lindner_Brassat_2020, title={Characterisation of the PS-PMMA Interfaces in Microphase Separated Block Copolymer Thin Films by Analytical (S)TEM}, volume={10}, DOI={<a href=\"https://doi.org/10.3390/nano10010141\">10.3390/nano10010141</a>}, number={1141}, journal={Nanomaterials}, publisher={MDPI AG}, author={Bürger, Julius and Kunnathully, Vinay and Kool, Daniel and Lindner, Jörg and Brassat, Katharina}, year={2020} }","apa":"Bürger, J., Kunnathully, V., Kool, D., Lindner, J., &#38; Brassat, K. (2020). Characterisation of the PS-PMMA Interfaces in Microphase Separated Block Copolymer Thin Films by Analytical (S)TEM. <i>Nanomaterials</i>, <i>10</i>(1), Article 141. <a href=\"https://doi.org/10.3390/nano10010141\">https://doi.org/10.3390/nano10010141</a>","ama":"Bürger J, Kunnathully V, Kool D, Lindner J, Brassat K. Characterisation of the PS-PMMA Interfaces in Microphase Separated Block Copolymer Thin Films by Analytical (S)TEM. <i>Nanomaterials</i>. 2020;10(1). doi:<a href=\"https://doi.org/10.3390/nano10010141\">10.3390/nano10010141</a>","ieee":"J. Bürger, V. Kunnathully, D. Kool, J. Lindner, and K. Brassat, “Characterisation of the PS-PMMA Interfaces in Microphase Separated Block Copolymer Thin Films by Analytical (S)TEM,” <i>Nanomaterials</i>, vol. 10, no. 1, Art. no. 141, 2020, doi: <a href=\"https://doi.org/10.3390/nano10010141\">10.3390/nano10010141</a>.","chicago":"Bürger, Julius, Vinay Kunnathully, Daniel Kool, Jörg Lindner, and Katharina Brassat. “Characterisation of the PS-PMMA Interfaces in Microphase Separated Block Copolymer Thin Films by Analytical (S)TEM.” <i>Nanomaterials</i> 10, no. 1 (2020). <a href=\"https://doi.org/10.3390/nano10010141\">https://doi.org/10.3390/nano10010141</a>."},"publication_identifier":{"issn":["2079-4991"]},"publication_status":"published","article_number":"141","_id":"34092","department":[{"_id":"15"},{"_id":"230"}],"user_id":"77496","status":"public","type":"journal_article","title":"Characterisation of the PS-PMMA Interfaces in Microphase Separated Block Copolymer Thin Films by Analytical (S)TEM","publisher":"MDPI AG","date_created":"2022-11-15T14:20:33Z","year":"2020","issue":"1","keyword":["General Materials Science","General Chemical Engineering"],"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"<jats:p>Block copolymer (BCP) self-assembly is a promising tool for next generation lithography as microphase separated polymer domains in thin films can act as templates for surface nanopatterning with sub-20 nm features. The replicated patterns can, however, only be as precise as their templates. Thus, the investigation of the morphology of polymer domains is of great importance. Commonly used analytical techniques (neutron scattering, scanning force microscopy) either lack spatial information or nanoscale resolution. Using advanced analytical (scanning) transmission electron microscopy ((S)TEM), we provide real space information on polymer domain morphology and interfaces between polystyrene (PS) and polymethylmethacrylate (PMMA) in cylinder- and lamellae-forming BCPs at highest resolution. This allows us to correlate the internal structure of polymer domains with line edge roughnesses, interface widths and domain sizes. STEM is employed for high-resolution imaging, electron energy loss spectroscopy and energy filtered TEM (EFTEM) spectroscopic imaging for material identification and EFTEM thickness mapping for visualisation of material densities at defects. The volume fraction of non-phase separated polymer species can be analysed by EFTEM. These methods give new insights into the morphology of polymer domains the exact knowledge of which will allow to improve pattern quality for nanolithography.</jats:p>"}],"publication":"Nanomaterials"},{"author":[{"orcid":"0000-0001-5765-971X","last_name":"Gräßler","id":"47565","full_name":"Gräßler, Iris","first_name":"Iris"},{"full_name":"Pottebaum, Jens","id":"405","orcid":"http://orcid.org/0000-0001-8778-2989","last_name":"Pottebaum","first_name":"Jens"}],"date_created":"2021-08-23T12:37:24Z","volume":"Band 1","date_updated":"2023-11-16T09:24:11Z","publisher":"Cambridge University Press","doi":"10.1017/dsd.2020.158","title":"Immersive Abstraction: A new Morphology of Intuitive Interaction with System Models","publication_status":"published","publication_identifier":{"issn":["2633-7762"]},"quality_controlled":"1","citation":{"ama":"Gräßler I, Pottebaum J. Immersive Abstraction: A new Morphology of Intuitive Interaction with System Models. <i>Proceedings of the Design Society: DESIGN Conference; 26 - 29 Okt 2020</i>. 2020;Band 1:1295-1304. doi:<a href=\"https://doi.org/10.1017/dsd.2020.158\">10.1017/dsd.2020.158</a>","ieee":"I. Gräßler and J. Pottebaum, “Immersive Abstraction: A new Morphology of Intuitive Interaction with System Models,” <i>Proceedings of the Design Society: DESIGN Conference; 26. - 29. Okt. 2020</i>, vol. Band 1, pp. 1295–1304, 2020, doi: <a href=\"https://doi.org/10.1017/dsd.2020.158\">10.1017/dsd.2020.158</a>.","chicago":"Gräßler, Iris, and Jens Pottebaum. “Immersive Abstraction: A New Morphology of Intuitive Interaction with System Models.” <i>Proceedings of the Design Society: DESIGN Conference; 26. - 29. Okt. 2020</i> Band 1 (2020): 1295–1304. <a href=\"https://doi.org/10.1017/dsd.2020.158\">https://doi.org/10.1017/dsd.2020.158</a>.","bibtex":"@article{Gräßler_Pottebaum_2020, title={Immersive Abstraction: A new Morphology of Intuitive Interaction with System Models}, volume={Band 1}, DOI={<a href=\"https://doi.org/10.1017/dsd.2020.158\">10.1017/dsd.2020.158</a>}, journal={Proceedings of the Design Society: DESIGN Conference; 26. - 29. Okt. 2020}, publisher={Cambridge University Press}, author={Gräßler, Iris and Pottebaum, Jens}, year={2020}, pages={1295–1304} }","mla":"Gräßler, Iris, and Jens Pottebaum. “Immersive Abstraction: A New Morphology of Intuitive Interaction with System Models.” <i>Proceedings of the Design Society: DESIGN Conference; 26. - 29. Okt. 2020</i>, vol. Band 1, Cambridge University Press, 2020, pp. 1295–304, doi:<a href=\"https://doi.org/10.1017/dsd.2020.158\">10.1017/dsd.2020.158</a>.","short":"I. Gräßler, J. Pottebaum, Proceedings of the Design Society: DESIGN Conference; 26. - 29. Okt. 2020 Band 1 (2020) 1295–1304.","apa":"Gräßler, I., &#38; Pottebaum, J. (2020). Immersive Abstraction: A new Morphology of Intuitive Interaction with System Models. <i>Proceedings of the Design Society: DESIGN Conference; 26. - 29. Okt. 2020</i>, <i>Band 1</i>, 1295–1304. <a href=\"https://doi.org/10.1017/dsd.2020.158\">https://doi.org/10.1017/dsd.2020.158</a>"},"page":"1295-1304","year":"2020","user_id":"405","department":[{"_id":"152"}],"_id":"23468","language":[{"iso":"eng"}],"type":"journal_article","publication":"Proceedings of the Design Society: DESIGN Conference; 26. - 29. Okt. 2020","status":"public","abstract":[{"text":"<jats:title>Abstract</jats:title><jats:p>The value of models is well recognised in product and systems engineering. Modelling languages and diagrams are used to capture mental models and to handle model complexity. Literature research indicates that there are only very few approaches to utilise the potential of virtual and augmented reality for supporting tasks in model based (systems) engineering. The paper at hand contributes a new morphology of intuitive interaction for Immersive Abstraction as a holistic approach to extend that coverage. It presents a holistic framework to categorise solutions and future research directions.</jats:p>","lang":"eng"}]},{"publication_identifier":{"isbn":["978-1-4503-7984-7/20/06"]},"citation":{"mla":"Krings, Sarah Claudia, et al. “Development Framework for Context-Aware Augmented Reality Applications.” <i>Proceedings of the 12th ACM SIGCHI Symposium on Engineering Interactive Computing Systems (EICS 2020)</i>, 2020, doi:<a href=\"https://doi.org/10.1145/3393672.3398640\">10.1145/3393672.3398640</a>.","short":"S.C. Krings, E. Yigitbas, I. Jovanovikj, S. Sauer, G. Engels, in: Proceedings of the 12th ACM SIGCHI Symposium on Engineering Interactive Computing Systems (EICS 2020), 2020.","bibtex":"@inproceedings{Krings_Yigitbas_Jovanovikj_Sauer_Engels_2020, title={Development Framework for Context-Aware Augmented Reality Applications}, DOI={<a href=\"https://doi.org/10.1145/3393672.3398640\">10.1145/3393672.3398640</a>}, booktitle={Proceedings of the 12th ACM SIGCHI Symposium on Engineering Interactive Computing Systems (EICS 2020)}, author={Krings, Sarah Claudia and Yigitbas, Enes and Jovanovikj, Ivan and Sauer, Stefan and Engels, Gregor}, year={2020} }","apa":"Krings, S. C., Yigitbas, E., Jovanovikj, I., Sauer, S., &#38; Engels, G. (2020). Development Framework for Context-Aware Augmented Reality Applications. <i>Proceedings of the 12th ACM SIGCHI Symposium on Engineering Interactive Computing Systems (EICS 2020)</i>. <a href=\"https://doi.org/10.1145/3393672.3398640\">https://doi.org/10.1145/3393672.3398640</a>","ieee":"S. C. Krings, E. Yigitbas, I. Jovanovikj, S. Sauer, and G. Engels, “Development Framework for Context-Aware Augmented Reality Applications,” 2020, doi: <a href=\"https://doi.org/10.1145/3393672.3398640\">10.1145/3393672.3398640</a>.","chicago":"Krings, Sarah Claudia, Enes Yigitbas, Ivan Jovanovikj, Stefan Sauer, and Gregor Engels. “Development Framework for Context-Aware Augmented Reality Applications.” In <i>Proceedings of the 12th ACM SIGCHI Symposium on Engineering Interactive Computing Systems (EICS 2020)</i>, 2020. <a href=\"https://doi.org/10.1145/3393672.3398640\">https://doi.org/10.1145/3393672.3398640</a>.","ama":"Krings SC, Yigitbas E, Jovanovikj I, Sauer S, Engels G. Development Framework for Context-Aware Augmented Reality Applications. In: <i>Proceedings of the 12th ACM SIGCHI Symposium on Engineering Interactive Computing Systems (EICS 2020)</i>. ; 2020. doi:<a href=\"https://doi.org/10.1145/3393672.3398640\">10.1145/3393672.3398640</a>"},"year":"2020","date_created":"2020-04-21T11:49:52Z","author":[{"first_name":"Sarah Claudia","full_name":"Krings, Sarah Claudia","id":"64063","orcid":"0000-0001-8040-7553","last_name":"Krings"},{"full_name":"Yigitbas, Enes","id":"8447","last_name":"Yigitbas","orcid":"0000-0002-5967-833X","first_name":"Enes"},{"first_name":"Ivan","id":"39187","full_name":"Jovanovikj, Ivan","last_name":"Jovanovikj","orcid":"https://orcid.org/0000-0002-1838-794X"},{"orcid":"0000-0003-3084-0409","last_name":"Sauer","id":"447","full_name":"Sauer, Stefan","first_name":"Stefan"},{"first_name":"Gregor","last_name":"Engels","full_name":"Engels, Gregor","id":"107"}],"date_updated":"2023-12-07T10:42:15Z","doi":"10.1145/3393672.3398640","title":"Development Framework for Context-Aware Augmented Reality Applications","type":"conference","publication":"Proceedings of the 12th ACM SIGCHI Symposium on Engineering Interactive Computing Systems (EICS 2020)","status":"public","user_id":"8447","department":[{"_id":"66"},{"_id":"534"}],"_id":"16790","language":[{"iso":"eng"}]},{"publication_status":"published","publication_identifier":{"isbn":["978-1-4503-7128-5"]},"place":"New York, NY, USA","year":"2020","citation":{"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>","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>.","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>.","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>","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.","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>.","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} }"},"page":"1277–1285","date_updated":"2023-12-13T10:43:41Z","publisher":"Association for Computing Machinery","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"},{"full_name":"Sudholt, Dirk","last_name":"Sudholt","first_name":"Dirk"}],"date_created":"2023-11-14T15:58:53Z","title":"More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization","doi":"10.1145/3377930.3390174","type":"conference","publication":"Proceedings of the Genetic and Evolutionary Computation Conference","abstract":[{"lang":"eng","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."}],"status":"public","_id":"48847","series_title":"GECCO ’20","user_id":"102979","department":[{"_id":"819"}],"keyword":["dynamic optimization","evolutionary algorithms","running time analysis","theory"],"language":[{"iso":"eng"}],"extern":"1"},{"language":[{"iso":"eng"}],"keyword":["dynamic optimization","evolutionary algorithms","running time analysis","theory"],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference","abstract":[{"lang":"eng","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."}],"date_created":"2023-11-14T15:58:53Z","publisher":"Association for Computing Machinery","title":"The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics","year":"2020","department":[{"_id":"819"}],"user_id":"102979","series_title":"GECCO ’20","_id":"48851","extern":"1","type":"conference","status":"public","author":[{"first_name":"Jakob","id":"102979","full_name":"Bossek, Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668"},{"full_name":"Casel, Katrin","last_name":"Casel","first_name":"Katrin"},{"first_name":"Pascal","full_name":"Kerschke, Pascal","last_name":"Kerschke"},{"full_name":"Neumann, Frank","last_name":"Neumann","first_name":"Frank"}],"date_updated":"2023-12-13T10:43:33Z","doi":"10.1145/3377930.3390243","publication_identifier":{"isbn":["978-1-4503-7128-5"]},"publication_status":"published","page":"1286–1294","citation":{"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>","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>.","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>","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} }","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>.","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."},"place":"New York, NY, USA"},{"title":"Dynamic Bi-Objective Routing of Multiple Vehicles","doi":"10.1145/3377930.3390146","publisher":"Association for Computing Machinery","date_updated":"2023-12-13T10:43:24Z","author":[{"first_name":"Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668","id":"102979","full_name":"Bossek, Jakob"},{"first_name":"Christian","last_name":"Grimme","full_name":"Grimme, Christian"},{"first_name":"Heike","last_name":"Trautmann","full_name":"Trautmann, Heike"}],"date_created":"2023-11-14T15:58:52Z","year":"2020","place":"New York, NY, USA","citation":{"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>","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.","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>.","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} }","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>.","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>.","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>"},"page":"166–174","publication_status":"published","publication_identifier":{"isbn":["978-1-4503-7128-5"]},"keyword":["decision making","dynamic optimization","evolutionary algorithms","multi-objective optimization","vehicle routing"],"extern":"1","language":[{"iso":"eng"}],"_id":"48845","user_id":"102979","series_title":"GECCO ’20","department":[{"_id":"819"}],"abstract":[{"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.","lang":"eng"}],"status":"public","type":"conference","publication":"Proceedings of the Genetic and Evolutionary Computation Conference"},{"publication_status":"published","publication_identifier":{"isbn":["978-1-4503-7128-5"]},"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>","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>.","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} }","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.","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>.","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>"},"page":"778–786","place":"New York, NY, USA","author":[{"last_name":"Bossek","orcid":"0000-0002-4121-4668","full_name":"Bossek, Jakob","id":"102979","first_name":"Jakob"},{"last_name":"Doerr","full_name":"Doerr, Carola","first_name":"Carola"},{"first_name":"Pascal","full_name":"Kerschke, Pascal","last_name":"Kerschke"}],"date_updated":"2023-12-13T10:44:01Z","doi":"10.1145/3377930.3390155","type":"conference","status":"public","series_title":"GECCO ’20","user_id":"102979","department":[{"_id":"819"}],"_id":"48850","extern":"1","year":"2020","date_created":"2023-11-14T15:58:53Z","publisher":"Association for Computing Machinery","title":"Initial Design Strategies and Their Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB","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."}],"language":[{"iso":"eng"}],"keyword":["continuous black-box optimization","design of experiments","initial design","sequential model-based optimization"]},{"status":"public","type":"conference","extern":"1","department":[{"_id":"819"}],"user_id":"102979","series_title":"GECCO’20","_id":"48879","page":"681–689","citation":{"apa":"Do, A. V., Bossek, J., Neumann, A., &#38; Neumann, F. (2020). Evolving Diverse Sets of Tours for the Travelling Salesperson Problem. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 681–689. <a href=\"https://doi.org/10.1145/3377930.3389844\">https://doi.org/10.1145/3377930.3389844</a>","bibtex":"@inproceedings{Do_Bossek_Neumann_Neumann_2020, place={New York, NY, USA}, series={GECCO’20}, title={Evolving Diverse Sets of Tours for the Travelling Salesperson Problem}, DOI={<a href=\"https://doi.org/10.1145/3377930.3389844\">10.1145/3377930.3389844</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Do, Anh Viet and Bossek, Jakob and Neumann, Aneta and Neumann, Frank}, year={2020}, pages={681–689}, collection={GECCO’20} }","mla":"Do, Anh Viet, et al. “Evolving Diverse Sets of Tours for the Travelling Salesperson Problem.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2020, pp. 681–689, doi:<a href=\"https://doi.org/10.1145/3377930.3389844\">10.1145/3377930.3389844</a>.","short":"A.V. Do, J. Bossek, A. Neumann, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2020, pp. 681–689.","ieee":"A. V. Do, J. Bossek, A. Neumann, and F. Neumann, “Evolving Diverse Sets of Tours for the Travelling Salesperson Problem,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2020, pp. 681–689, doi: <a href=\"https://doi.org/10.1145/3377930.3389844\">10.1145/3377930.3389844</a>.","chicago":"Do, Anh Viet, Jakob Bossek, Aneta Neumann, and Frank Neumann. “Evolving Diverse Sets of Tours for the Travelling Salesperson Problem.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 681–689. GECCO’20. New York, NY, USA: Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3377930.3389844\">https://doi.org/10.1145/3377930.3389844</a>.","ama":"Do AV, Bossek J, Neumann A, Neumann F. Evolving Diverse Sets of Tours for the Travelling Salesperson Problem. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. GECCO’20. Association for Computing Machinery; 2020:681–689. doi:<a href=\"https://doi.org/10.1145/3377930.3389844\">10.1145/3377930.3389844</a>"},"place":"New York, NY, USA","publication_identifier":{"isbn":["978-1-4503-7128-5"]},"doi":"10.1145/3377930.3389844","author":[{"full_name":"Do, Anh Viet","last_name":"Do","first_name":"Anh Viet"},{"first_name":"Jakob","full_name":"Bossek, Jakob","id":"102979","orcid":"0000-0002-4121-4668","last_name":"Bossek"},{"first_name":"Aneta","full_name":"Neumann, Aneta","last_name":"Neumann"},{"full_name":"Neumann, Frank","last_name":"Neumann","first_name":"Frank"}],"date_updated":"2023-12-13T10:48:50Z","abstract":[{"lang":"eng","text":"Evolving diverse sets of high quality solutions has gained increasing interest in the evolutionary computation literature in recent years. With this paper, we contribute to this area of research by examining evolutionary diversity optimisation approaches for the classical Traveling Salesperson Problem (TSP). We study the impact of using different diversity measures for a given set of tours and the ability of evolutionary algorithms to obtain a diverse set of high quality solutions when adopting these measures. Our studies show that a large variety of diverse high quality tours can be achieved by using our approaches. Furthermore, we compare our approaches in terms of theoretical properties and the final set of tours obtained by the evolutionary diversity optimisation algorithm."}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference","language":[{"iso":"eng"}],"keyword":["diversity maximisation","evolutionary algorithms","travelling salesperson problem"],"year":"2020","title":"Evolving Diverse Sets of Tours for the Travelling Salesperson Problem","date_created":"2023-11-14T15:58:58Z","publisher":"Association for Computing Machinery"},{"publication":"Proceedings of the 2020 Genetic and Evolutionary Computation Conference","type":"conference","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"}],"status":"public","_id":"48895","department":[{"_id":"819"}],"series_title":"{GECCO} ’20","user_id":"102979","keyword":["biased mutation","evolutionary algorithms","minimum spanning tree problem","runtime analysis"],"extern":"1","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-1-4503-7128-5"]},"place":"New York, NY, USA","year":"2020","page":"551–559","citation":{"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>","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.","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} }","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>.","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>.","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>.","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>"},"publisher":"Association for Computing Machinery","date_updated":"2023-12-13T10:49:38Z","date_created":"2023-11-14T15:59:00Z","author":[{"first_name":"Vahid","full_name":"Roostapour, Vahid","last_name":"Roostapour"},{"first_name":"Jakob","id":"102979","full_name":"Bossek, Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668"},{"last_name":"Neumann","full_name":"Neumann, Frank","first_name":"Frank"}],"title":"Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem","doi":"10.1145/3377930.3390168"},{"title":"Ironie als forcierte Form. Hans Magnus Enzensbergers Versepos Der Untergang der Titanic","author":[{"full_name":"Diedrich, Alena","id":"49513","last_name":"Diedrich","first_name":"Alena"}],"date_created":"2023-12-19T08:56:02Z","date_updated":"2023-12-19T09:05:26Z","publisher":"Metzler","citation":{"bibtex":"@inbook{Diedrich_2020, title={Ironie als forcierte Form. Hans Magnus Enzensbergers Versepos Der Untergang der Titanic}, booktitle={Forcierte Form: Deutschsprachige Versepik des 20. und 21. Jahrhunderts im europäischen Kontext}, publisher={Metzler}, author={Diedrich, Alena}, editor={Bremer, Kai and Elit, Stefan and Kroucheva, Katerina}, year={2020} }","mla":"Diedrich, Alena. “Ironie Als Forcierte Form. Hans Magnus Enzensbergers Versepos Der Untergang Der Titanic.” <i>Forcierte Form: Deutschsprachige Versepik Des 20. Und 21. Jahrhunderts Im Europäischen Kontext</i>, edited by Kai Bremer et al., Metzler, 2020.","short":"A. Diedrich, in: K. Bremer, S. Elit, K. Kroucheva (Eds.), Forcierte Form: Deutschsprachige Versepik Des 20. Und 21. Jahrhunderts Im Europäischen Kontext, Metzler, 2020.","apa":"Diedrich, A. (2020). Ironie als forcierte Form. Hans Magnus Enzensbergers Versepos Der Untergang der Titanic. In K. Bremer, S. Elit, &#38; K. Kroucheva (Eds.), <i>Forcierte Form: Deutschsprachige Versepik des 20. und 21. Jahrhunderts im europäischen Kontext</i>. Metzler.","chicago":"Diedrich, Alena. “Ironie Als Forcierte Form. Hans Magnus Enzensbergers Versepos Der Untergang Der Titanic.” In <i>Forcierte Form: Deutschsprachige Versepik Des 20. Und 21. Jahrhunderts Im Europäischen Kontext</i>, edited by Kai Bremer, Stefan Elit, and Katerina Kroucheva. Metzler, 2020.","ieee":"A. Diedrich, “Ironie als forcierte Form. Hans Magnus Enzensbergers Versepos Der Untergang der Titanic,” in <i>Forcierte Form: Deutschsprachige Versepik des 20. und 21. Jahrhunderts im europäischen Kontext</i>, K. Bremer, S. Elit, and K. Kroucheva, Eds. Metzler, 2020.","ama":"Diedrich A. Ironie als forcierte Form. Hans Magnus Enzensbergers Versepos Der Untergang der Titanic. In: Bremer K, Elit S, Kroucheva K, eds. <i>Forcierte Form: Deutschsprachige Versepik Des 20. Und 21. Jahrhunderts Im Europäischen Kontext</i>. Metzler; 2020."},"year":"2020","language":[{"iso":"eng"}],"user_id":"49513","_id":"49831","status":"public","editor":[{"last_name":"Bremer","full_name":"Bremer, Kai","first_name":"Kai"},{"first_name":"Stefan","full_name":"Elit, Stefan","last_name":"Elit"},{"first_name":"Katerina","last_name":"Kroucheva","full_name":"Kroucheva, Katerina"}],"publication":"Forcierte Form: Deutschsprachige Versepik des 20. und 21. Jahrhunderts im europäischen Kontext","type":"book_chapter"},{"language":[{"iso":"eng"}],"user_id":"3145","project":[{"grant_number":"01|H16005A","_id":"33","name":"HighPerMeshes"}],"_id":"16852","status":"public","type":"conference","publication":"Proceedings of the 17th ACM International Conference on Computing Frontiers (CF '2020)","doi":"10.1145/3387902.3392628","conference":{"location":"Catania, Sicily, Italy","end_date":"2020-05-13","start_date":"2020-05-11","name":"International Conference on Computing Frontiers (CF '20)"},"title":"A Runtime System for Finite Element Methods in a Partitioned Global Address Space","date_created":"2020-04-24T10:47:04Z","author":[{"last_name":"Groth","full_name":"Groth, Stefan","first_name":"Stefan"},{"last_name":"Grünewald","full_name":"Grünewald, Daniel","first_name":"Daniel"},{"first_name":"Jürgen","last_name":"Teich","full_name":"Teich, Jürgen"},{"last_name":"Hannig","full_name":"Hannig, Frank","first_name":"Frank"}],"date_updated":"2024-01-22T09:57:53Z","publisher":"ACM","citation":{"bibtex":"@inproceedings{Groth_Grünewald_Teich_Hannig_2020, title={A Runtime System for Finite Element Methods in a Partitioned Global Address Space}, DOI={<a href=\"https://doi.org/10.1145/3387902.3392628\">10.1145/3387902.3392628</a>}, booktitle={Proceedings of the 17th ACM International Conference on Computing Frontiers (CF ’2020)}, publisher={ACM}, author={Groth, Stefan and Grünewald, Daniel and Teich, Jürgen and Hannig, Frank}, year={2020} }","mla":"Groth, Stefan, et al. “A Runtime System for Finite Element Methods in a Partitioned Global Address Space.” <i>Proceedings of the 17th ACM International Conference on Computing Frontiers (CF ’2020)</i>, ACM, 2020, doi:<a href=\"https://doi.org/10.1145/3387902.3392628\">10.1145/3387902.3392628</a>.","short":"S. Groth, D. Grünewald, J. Teich, F. Hannig, in: Proceedings of the 17th ACM International Conference on Computing Frontiers (CF ’2020), ACM, 2020.","apa":"Groth, S., Grünewald, D., Teich, J., &#38; Hannig, F. (2020). A Runtime System for Finite Element Methods in a Partitioned Global Address Space. <i>Proceedings of the 17th ACM International Conference on Computing Frontiers (CF ’2020)</i>. International Conference on Computing Frontiers (CF ’20), Catania, Sicily, Italy. <a href=\"https://doi.org/10.1145/3387902.3392628\">https://doi.org/10.1145/3387902.3392628</a>","ama":"Groth S, Grünewald D, Teich J, Hannig F. A Runtime System for Finite Element Methods in a Partitioned Global Address Space. In: <i>Proceedings of the 17th ACM International Conference on Computing Frontiers (CF ’2020)</i>. ACM; 2020. doi:<a href=\"https://doi.org/10.1145/3387902.3392628\">10.1145/3387902.3392628</a>","ieee":"S. Groth, D. Grünewald, J. Teich, and F. Hannig, “A Runtime System for Finite Element Methods in a Partitioned Global Address Space,” presented at the International Conference on Computing Frontiers (CF ’20), Catania, Sicily, Italy, 2020, doi: <a href=\"https://doi.org/10.1145/3387902.3392628\">10.1145/3387902.3392628</a>.","chicago":"Groth, Stefan, Daniel Grünewald, Jürgen Teich, and Frank Hannig. “A Runtime System for Finite Element Methods in a Partitioned Global Address Space.” In <i>Proceedings of the 17th ACM International Conference on Computing Frontiers (CF ’2020)</i>. ACM, 2020. <a href=\"https://doi.org/10.1145/3387902.3392628\">https://doi.org/10.1145/3387902.3392628</a>."},"year":"2020"},{"department":[{"_id":"36"},{"_id":"20"},{"_id":"499"}],"user_id":"31047","_id":"53670","language":[{"iso":"ger"}],"publication":"Das Wissenschaftlich-Religionspädagogisches Lexikon im Internet","type":"encyclopedia_article","status":"public","editor":[{"full_name":"Zimmermann, Mirjam","last_name":"Zimmermann","first_name":"Mirjam"},{"first_name":"Heike","full_name":"Lindner, Heike","last_name":"Lindner"}],"date_created":"2024-04-26T13:13:42Z","author":[{"last_name":"Janus","full_name":"Janus, Richard","id":"31047","first_name":"Richard"}],"date_updated":"2024-04-26T13:13:56Z","publisher":"Deutsche Bibelgesellschaft","doi":"10.23768/wirelex.Populre_Kultur.200213","title":"Populäre Kultur","publication_status":"published","citation":{"ieee":"R. Janus, “Populäre Kultur,” in <i>Das Wissenschaftlich-Religionspädagogisches Lexikon im Internet</i>, M. Zimmermann and H. Lindner, Eds. Deutsche Bibelgesellschaft, 2020.","chicago":"Janus, Richard. “Populäre Kultur.” In <i>Das Wissenschaftlich-Religionspädagogisches Lexikon im Internet</i>, edited by Mirjam Zimmermann and Heike Lindner. Deutsche Bibelgesellschaft, 2020. <a href=\"https://doi.org/10.23768/wirelex.Populre_Kultur.200213\">https://doi.org/10.23768/wirelex.Populre_Kultur.200213</a>.","ama":"Janus R. Populäre Kultur. In: Zimmermann M, Lindner H, eds. <i>Das Wissenschaftlich-Religionspädagogisches Lexikon im Internet</i>. Deutsche Bibelgesellschaft; 2020. doi:<a href=\"https://doi.org/10.23768/wirelex.Populre_Kultur.200213\">10.23768/wirelex.Populre_Kultur.200213</a>","bibtex":"@inbook{Janus_2020, title={Populäre Kultur}, DOI={<a href=\"https://doi.org/10.23768/wirelex.Populre_Kultur.200213\">10.23768/wirelex.Populre_Kultur.200213</a>}, booktitle={Das Wissenschaftlich-Religionspädagogisches Lexikon im Internet}, publisher={Deutsche Bibelgesellschaft}, author={Janus, Richard}, editor={Zimmermann, Mirjam and Lindner, Heike}, year={2020} }","mla":"Janus, Richard. “Populäre Kultur.” <i>Das Wissenschaftlich-Religionspädagogisches Lexikon im Internet</i>, edited by Mirjam Zimmermann and Heike Lindner, Deutsche Bibelgesellschaft, 2020, doi:<a href=\"https://doi.org/10.23768/wirelex.Populre_Kultur.200213\">10.23768/wirelex.Populre_Kultur.200213</a>.","short":"R. Janus, in: M. Zimmermann, H. Lindner (Eds.), Das Wissenschaftlich-Religionspädagogisches Lexikon im Internet, Deutsche Bibelgesellschaft, 2020.","apa":"Janus, R. (2020). Populäre Kultur. In M. Zimmermann &#38; H. Lindner (Eds.), <i>Das Wissenschaftlich-Religionspädagogisches Lexikon im Internet</i>. Deutsche Bibelgesellschaft. <a href=\"https://doi.org/10.23768/wirelex.Populre_Kultur.200213\">https://doi.org/10.23768/wirelex.Populre_Kultur.200213</a>"},"year":"2020"},{"date_updated":"2024-05-07T12:26:20Z","publisher":"Gütersloher Verlagshaus","author":[{"first_name":"Harald","id":"480","full_name":"Schroeter-Wittke, Harald","last_name":"Schroeter-Wittke"},{"orcid":"https://orcid.org/0000-0002-1648-0796","last_name":"Flath","full_name":"Flath, Beate","id":"58896","first_name":"Beate"},{"first_name":"Bernhard","last_name":"König","full_name":"König, Bernhard"},{"full_name":"Venus, Viktoria","last_name":"Venus","first_name":"Viktoria"}],"date_created":"2023-01-31T00:16:14Z","title":"Hiob und das Leiden: Vertrauensfrage - Hiob 2,7-13. Bibelarbeit auf dem Weg am Donnerstag, 20. Juni 2019","publication_status":"published","publication_identifier":{"isbn":["9783579082134 "]},"year":"2020","place":"Gütersloh","citation":{"apa":"Schroeter-Wittke, H., Flath, B., König, B., &#38; Venus, V. (2020). Hiob und das Leiden: Vertrauensfrage - Hiob 2,7-13. Bibelarbeit auf dem Weg am Donnerstag, 20. Juni 2019. In J. Helmke &#38; S. Rentsch (Eds.), <i>Deutscher Evangelischer Kirchentag Dortmund 2019. Dokumente</i> (pp. 101–106). Gütersloher Verlagshaus.","mla":"Schroeter-Wittke, Harald, et al. “Hiob und das Leiden: Vertrauensfrage - Hiob 2,7-13. Bibelarbeit auf dem Weg am Donnerstag, 20. Juni 2019.” <i>Deutscher Evangelischer Kirchentag Dortmund 2019. Dokumente</i>, edited by Julia Helmke and Stefanie Rentsch, Gütersloher Verlagshaus, 2020, pp. 101–06.","bibtex":"@inbook{Schroeter-Wittke_Flath_König_Venus_2020, place={Gütersloh}, title={Hiob und das Leiden: Vertrauensfrage - Hiob 2,7-13. Bibelarbeit auf dem Weg am Donnerstag, 20. Juni 2019}, booktitle={Deutscher Evangelischer Kirchentag Dortmund 2019. Dokumente}, publisher={Gütersloher Verlagshaus}, author={Schroeter-Wittke, Harald and Flath, Beate and König, Bernhard and Venus, Viktoria}, editor={Helmke, Julia and Rentsch, Stefanie}, year={2020}, pages={101–106} }","short":"H. Schroeter-Wittke, B. Flath, B. König, V. Venus, in: J. Helmke, S. Rentsch (Eds.), Deutscher Evangelischer Kirchentag Dortmund 2019. Dokumente, Gütersloher Verlagshaus, Gütersloh, 2020, pp. 101–106.","chicago":"Schroeter-Wittke, Harald, Beate Flath, Bernhard König, and Viktoria Venus. “Hiob und das Leiden: Vertrauensfrage - Hiob 2,7-13. Bibelarbeit auf dem Weg am Donnerstag, 20. Juni 2019.” In <i>Deutscher Evangelischer Kirchentag Dortmund 2019. Dokumente</i>, edited by Julia Helmke and Stefanie Rentsch, 101–6. Gütersloh: Gütersloher Verlagshaus, 2020.","ieee":"H. Schroeter-Wittke, B. Flath, B. König, and V. Venus, “Hiob und das Leiden: Vertrauensfrage - Hiob 2,7-13. Bibelarbeit auf dem Weg am Donnerstag, 20. Juni 2019,” in <i>Deutscher Evangelischer Kirchentag Dortmund 2019. Dokumente</i>, J. Helmke and S. Rentsch, Eds. Gütersloh: Gütersloher Verlagshaus, 2020, pp. 101–106.","ama":"Schroeter-Wittke H, Flath B, König B, Venus V. Hiob und das Leiden: Vertrauensfrage - Hiob 2,7-13. Bibelarbeit auf dem Weg am Donnerstag, 20. Juni 2019. In: Helmke J, Rentsch S, eds. <i>Deutscher Evangelischer Kirchentag Dortmund 2019. Dokumente</i>. Gütersloher Verlagshaus; 2020:101-106."},"page":"101-106","_id":"41076","user_id":"14931","department":[{"_id":"735"},{"_id":"497"}],"language":[{"iso":"ger"}],"type":"book_chapter","publication":"Deutscher Evangelischer Kirchentag Dortmund 2019. Dokumente","editor":[{"first_name":"Julia","full_name":"Helmke, Julia","last_name":"Helmke"},{"first_name":"Stefanie","last_name":"Rentsch","full_name":"Rentsch, Stefanie"}],"status":"public"},{"type":"book_chapter","publication":"Reformation fmit Beethoven feiern. 31. Oktober 2020","editor":[{"first_name":"Richard","last_name":"Janus","full_name":"Janus, Richard"}],"status":"public","_id":"54254","user_id":"31047","series_title":"Predigtstudien des Evangelischen Bundes Rheinland","department":[{"_id":"36"},{"_id":"20"},{"_id":"499"}],"language":[{"iso":"ger"}],"publication_status":"published","year":"2020","place":"Düsseldorf","citation":{"ama":"Janus R. Beethoven und seine Zeit. In: Janus R, ed. <i>Reformation fmit Beethoven feiern. 31. Oktober 2020</i>. Vol 1. Predigtstudien des Evangelischen Bundes Rheinland. ; 2020:12-13.","ieee":"R. Janus, “Beethoven und seine Zeit,” in <i>Reformation fmit Beethoven feiern. 31. Oktober 2020</i>, vol. 1, R. Janus, Ed. Düsseldorf, 2020, pp. 12–13.","chicago":"Janus, Richard. “Beethoven und seine Zeit.” In <i>Reformation fmit Beethoven feiern. 31. Oktober 2020</i>, edited by Richard Janus, 1:12–13. Predigtstudien des Evangelischen Bundes Rheinland. Düsseldorf, 2020.","mla":"Janus, Richard. “Beethoven und seine Zeit.” <i>Reformation fmit Beethoven feiern. 31. Oktober 2020</i>, edited by Richard Janus, vol. 1, 2020, pp. 12–13.","short":"R. Janus, in: R. Janus (Ed.), Reformation fmit Beethoven feiern. 31. Oktober 2020, Düsseldorf, 2020, pp. 12–13.","bibtex":"@inbook{Janus_2020, place={Düsseldorf}, series={Predigtstudien des Evangelischen Bundes Rheinland}, title={Beethoven und seine Zeit}, volume={1}, booktitle={Reformation fmit Beethoven feiern. 31. Oktober 2020}, author={Janus, Richard}, editor={Janus, Richard}, year={2020}, pages={12–13}, collection={Predigtstudien des Evangelischen Bundes Rheinland} }","apa":"Janus, R. (2020). Beethoven und seine Zeit. In R. Janus (Ed.), <i>Reformation fmit Beethoven feiern. 31. Oktober 2020</i> (Vol. 1, pp. 12–13)."},"page":"12-13","intvolume":"         1","date_updated":"2024-05-13T20:57:30Z","author":[{"first_name":"Richard","id":"31047","full_name":"Janus, Richard","last_name":"Janus"}],"date_created":"2024-05-13T20:57:26Z","volume":1,"title":"Beethoven und seine Zeit"},{"type":"book_editor","editor":[{"first_name":"Richard","last_name":"Janus","full_name":"Janus, Richard","id":"31047"}],"status":"public","_id":"54253","series_title":"Predigtstudien des Evangelischen Bundes Rheinland","user_id":"31047","department":[{"_id":"36"},{"_id":"20"},{"_id":"499"}],"language":[{"iso":"ger"}],"publication_status":"published","place":"Düsseldorf","year":"2020","citation":{"apa":"Janus, R. (Ed.). (2020). <i>Reformation mit Beethoven feiern. 31. Oktober 2020</i> (Vol. 1).","mla":"Janus, Richard, editor. <i>Reformation mit Beethoven feiern. 31. Oktober 2020</i>. 2020.","bibtex":"@book{Janus_2020, place={Düsseldorf}, series={Predigtstudien des Evangelischen Bundes Rheinland}, title={Reformation mit Beethoven feiern. 31. Oktober 2020}, volume={1}, year={2020}, collection={Predigtstudien des Evangelischen Bundes Rheinland} }","short":"R. Janus, ed., Reformation mit Beethoven feiern. 31. Oktober 2020, Düsseldorf, 2020.","ieee":"R. Janus, Ed., <i>Reformation mit Beethoven feiern. 31. Oktober 2020</i>, vol. 1. Düsseldorf, 2020.","chicago":"Janus, Richard, ed. <i>Reformation mit Beethoven feiern. 31. Oktober 2020</i>. Vol. 1. Predigtstudien des Evangelischen Bundes Rheinland. Düsseldorf, 2020.","ama":"Janus R, ed. <i>Reformation mit Beethoven feiern. 31. Oktober 2020</i>. Vol 1.; 2020."},"page":"16","intvolume":"         1","date_updated":"2024-05-13T21:03:32Z","date_created":"2024-05-13T20:55:16Z","volume":1,"title":"Reformation mit Beethoven feiern. 31. Oktober 2020"},{"date_updated":"2024-06-10T12:01:57Z","publisher":"ACM","date_created":"2023-08-04T07:33:30Z","author":[{"orcid":"0000-0002-4121-4668","last_name":"Bossek","full_name":"Bossek, Jakob","id":"102979","first_name":"Jakob"},{"first_name":"Christian","last_name":"Grimme","full_name":"Grimme, Christian"},{"first_name":"Heike","full_name":"Trautmann, Heike","id":"100740","last_name":"Trautmann","orcid":"0000-0002-9788-8282"}],"title":"Dynamic Bi-Objective Routing of Multiple Vehicles","place":"Cancun, Mexico","year":"2020","page":"166–174","citation":{"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 (GECCO ’20)</i>, 166–174.","bibtex":"@inproceedings{Bossek_Grimme_Trautmann_2020, place={Cancun, Mexico}, title={Dynamic Bi-Objective Routing of Multiple Vehicles}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ’20)}, publisher={ACM}, author={Bossek, Jakob and Grimme, Christian and Trautmann, Heike}, year={2020}, pages={166–174} }","short":"J. Bossek, C. Grimme, H. Trautmann, in: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ’20), ACM, Cancun, Mexico, 2020, pp. 166–174.","mla":"Bossek, Jakob, et al. “Dynamic Bi-Objective Routing of Multiple Vehicles.” <i>Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ’20)</i>, ACM, 2020, pp. 166–174.","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 (GECCO ’20)</i>, 166–174. Cancun, Mexico: ACM, 2020.","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 (GECCO ’20)</i>, 2020, pp. 166–174.","ama":"Bossek J, Grimme C, Trautmann H. Dynamic Bi-Objective Routing of Multiple Vehicles. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ’20)</i>. ACM; 2020:166–174."},"_id":"46323","department":[{"_id":"34"},{"_id":"819"}],"user_id":"15504","language":[{"iso":"eng"}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ’20)","type":"conference","abstract":[{"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.","lang":"eng"}],"status":"public"}]