[{"user_id":"34289","_id":"29940","language":[{"iso":"eng"}],"publisher":"VDE","main_file_link":[{"url":"https://ieeexplore.ieee.org/abstract/document/9178138"}],"publication_status":"published","date_updated":"2023-10-20T11:52:39Z","publication_identifier":{"isbn":["978-3-8007-5245-4"]},"author":[{"id":"34289","first_name":"Roland","last_name":"Unruh","full_name":"Unruh, Roland"},{"first_name":"Frank","last_name":"Schafmeister","full_name":"Schafmeister, Frank","id":"71291"},{"full_name":"Fröhleke, Norbert","first_name":"Norbert","last_name":"Fröhleke"},{"id":"66","full_name":"Böcker, Joachim","last_name":"Böcker","orcid":"0000-0002-8480-7295","first_name":"Joachim"}],"conference":{"location":"Germany","name":"PCIM Europe digital days 2020","start_date":"2020-07-07","end_date":"2020-07-08"},"year":"2020","title":"1-MW Full-Bridge MMC for High-Current Low-Voltage (100V-400V) DC-Applications","status":"public","department":[{"_id":"52"}],"keyword":["Cascaded H-Bridge","Solid-State Transformer","Capacitor voltage ripple","Zero sequence voltage","Full-Bridge"],"type":"conference","date_created":"2022-02-21T16:42:30Z","abstract":[{"lang":"eng","text":"A full-bridge modular multilevel converter (MMC) is compared to a half-bridge-based MMC for high-current low-voltage DC-applications such as electrolysis, arc welding or datacenters with DC-power distribution. Usually, modular multilevel converters are used in high-voltage DC-applications (HVDC) in the multiple kV-range, but to meet the needs of a high-current demand at low output voltage levels, the modular converter concept requires adaptations. In the proposed concept, the MMC is used to step-down the three-phase medium-voltage of 10 kV. Therefore, each module is extended by an LLC resonant converter to adapt to the specific electrolyzers DC-voltage range of 142-220V and to provide galvanic isolation. The proposed MMC converter with full-bridge modules uses half the number of modules compared to a half-bridge-based MMC while reducing the voltage ripple by 78% and capacitor losses by 64% by rearranging the same components to ensure identical costs and volume. For additional reliability, a new robust algorithm for balancing conduction losses during the bypass phase is presented."}],"citation":{"apa":"Unruh, R., Schafmeister, F., Fröhleke, N., &#38; Böcker, J. (2020). 1-MW Full-Bridge MMC for High-Current Low-Voltage (100V-400V) DC-Applications. <i>PCIM Europe Digital Days 2020; International Exhibition and Conference for Power Electronics, Intelligent Motion, Renewable Energy and Energy Management</i>. PCIM Europe digital days 2020, Germany.","mla":"Unruh, Roland, et al. “1-MW Full-Bridge MMC for High-Current Low-Voltage (100V-400V) DC-Applications.” <i>PCIM Europe Digital Days 2020; International Exhibition and Conference for Power Electronics, Intelligent Motion, Renewable Energy and Energy Management</i>, VDE, 2020.","ieee":"R. Unruh, F. Schafmeister, N. Fröhleke, and J. Böcker, “1-MW Full-Bridge MMC for High-Current Low-Voltage (100V-400V) DC-Applications,” presented at the PCIM Europe digital days 2020, Germany, 2020.","ama":"Unruh R, Schafmeister F, Fröhleke N, Böcker J. 1-MW Full-Bridge MMC for High-Current Low-Voltage (100V-400V) DC-Applications. In: <i>PCIM Europe Digital Days 2020; International Exhibition and Conference for Power Electronics, Intelligent Motion, Renewable Energy and Energy Management</i>. VDE; 2020.","short":"R. Unruh, F. Schafmeister, N. Fröhleke, J. Böcker, in: PCIM Europe Digital Days 2020; International Exhibition and Conference for Power Electronics, Intelligent Motion, Renewable Energy and Energy Management, VDE, 2020.","chicago":"Unruh, Roland, Frank Schafmeister, Norbert Fröhleke, and Joachim Böcker. “1-MW Full-Bridge MMC for High-Current Low-Voltage (100V-400V) DC-Applications.” In <i>PCIM Europe Digital Days 2020; International Exhibition and Conference for Power Electronics, Intelligent Motion, Renewable Energy and Energy Management</i>. VDE, 2020.","bibtex":"@inproceedings{Unruh_Schafmeister_Fröhleke_Böcker_2020, title={1-MW Full-Bridge MMC for High-Current Low-Voltage (100V-400V) DC-Applications}, booktitle={PCIM Europe digital days 2020; International Exhibition and Conference for Power Electronics, Intelligent Motion, Renewable Energy and Energy Management}, publisher={VDE}, author={Unruh, Roland and Schafmeister, Frank and Fröhleke, Norbert and Böcker, Joachim}, year={2020} }"},"publication":"PCIM Europe digital days 2020; International Exhibition and Conference for Power Electronics, Intelligent Motion, Renewable Energy and Energy Management"},{"date_created":"2022-02-23T14:14:58Z","type":"conference","department":[{"_id":"52"}],"publication":"PCIM Europe digital days 2020; International Exhibition and Conference for Power Electronics, Intelligent Motion, Renewable Energy and Energy Management","citation":{"apa":"Strothmann, B., Piepenbrock, T., Schafmeister, F., &#38; Böcker, J. (2020). Heat dissipation strategies for silicon carbide power SMDs and their use in different applications. <i>PCIM Europe Digital Days 2020; International Exhibition and Conference for Power Electronics, Intelligent Motion, Renewable Energy and Energy Management</i>, 1–7.","mla":"Strothmann, Benjamin, et al. “Heat Dissipation Strategies for Silicon Carbide Power SMDs and Their Use in Different Applications.” <i>PCIM Europe Digital Days 2020; International Exhibition and Conference for Power Electronics, Intelligent Motion, Renewable Energy and Energy Management</i>, 2020, pp. 1–7.","ieee":"B. Strothmann, T. Piepenbrock, F. Schafmeister, and J. Böcker, “Heat dissipation strategies for silicon carbide power SMDs and their use in different applications,” in <i>PCIM Europe digital days 2020; International Exhibition and Conference for Power Electronics, Intelligent Motion, Renewable Energy and Energy Management</i>, 2020, pp. 1–7.","chicago":"Strothmann, Benjamin, Till Piepenbrock, Frank Schafmeister, and Joachim Böcker. “Heat Dissipation Strategies for Silicon Carbide Power SMDs and Their Use in Different Applications.” In <i>PCIM Europe Digital Days 2020; International Exhibition and Conference for Power Electronics, Intelligent Motion, Renewable Energy and Energy Management</i>, 1–7, 2020.","short":"B. Strothmann, T. Piepenbrock, F. Schafmeister, J. Böcker, in: PCIM Europe Digital Days 2020; International Exhibition and Conference for Power Electronics, Intelligent Motion, Renewable Energy and Energy Management, 2020, pp. 1–7.","ama":"Strothmann B, Piepenbrock T, Schafmeister F, Böcker J. Heat dissipation strategies for silicon carbide power SMDs and their use in different applications. In: <i>PCIM Europe Digital Days 2020; International Exhibition and Conference for Power Electronics, Intelligent Motion, Renewable Energy and Energy Management</i>. ; 2020:1-7.","bibtex":"@inproceedings{Strothmann_Piepenbrock_Schafmeister_Böcker_2020, title={Heat dissipation strategies for silicon carbide power SMDs and their use in different applications}, booktitle={PCIM Europe digital days 2020; International Exhibition and Conference for Power Electronics, Intelligent Motion, Renewable Energy and Energy Management}, author={Strothmann, Benjamin and Piepenbrock, Till and Schafmeister, Frank and Böcker, Joachim}, year={2020}, pages={1–7} }"},"abstract":[{"text":"Heat dissipation is a limiting factor in the performance of many power electronic components. Especially in the TO-263-7 package, which is used for several SiC-MOSFETs, the heat transfer must take place through the cross section of the printed circuit board (PCB) to the heatsink at the bottom side. Most commonly, thermal vias are used to form this path in a perpendicular direction through all PCB-layers. In a given soft- and hard switched example applications with the use of C3M0065090J SiC-MOSFETs, this conventional approach limited the component’s maximum heat dissipation to approx. 13 W. A recent alternative approach are massive copper blocks (”pedestals”) being integrated in PCBs and reaching from their top- to the bottom-side in relevant footprint areas under SMD-housed power semiconductors. Pedestals allowing to increase the heat dissipation in the given case to even 36 W. This step is achieved due to the clearly superior heat spreading capability of that massive thermal connection between SiC-MOSFET and heatsink. For the hard switched example application the number of switch-elements can be halved to one, by using the pedestal instead of thermal vias. Independently of optimizing the heat transfer path, the up-front avoidance of losses helps to stay within existing heat dissipation limits, of course. The dominant conduction losses of the mentioned soft-switched example application could be halved by changing to SiC-MOSFET types with significant lowered RDSon. By using pedestals and changing to SiC-MOSFETs with lowered RDSon, the number of switch-elements can also be halved for the soft switched application.","lang":"eng"}],"page":"1-7","language":[{"iso":"eng"}],"_id":"30001","user_id":"66","year":"2020","title":"Heat dissipation strategies for silicon carbide power SMDs and their use in different applications","status":"public","author":[{"full_name":"Strothmann, Benjamin","first_name":"Benjamin","last_name":"Strothmann","id":"22556"},{"first_name":"Till","last_name":"Piepenbrock","full_name":"Piepenbrock, Till"},{"id":"71291","full_name":"Schafmeister, Frank","last_name":"Schafmeister","first_name":"Frank"},{"id":"66","first_name":"Joachim","last_name":"Böcker","orcid":"0000-0002-8480-7295","full_name":"Böcker, Joachim"}],"publication_status":"published","date_updated":"2023-10-20T12:23:18Z"},{"department":[{"_id":"98"}],"type":"conference","date_created":"2023-05-31T07:18:51Z","place":"Münster","citation":{"apa":"Dröse, J. (2020). Verstehensgrundlagen diagnostizieren - Welche Wissenselemente fokussieren Lehrkräfte? In H.-S. Siller, W. Weigel, &#38; J. F. Wöler (Eds.), <i>Beiträge zum Mathematikunterricht 2020 </i> (pp. 233–236). WTM.","ieee":"J. Dröse, “Verstehensgrundlagen diagnostizieren - Welche Wissenselemente fokussieren Lehrkräfte?,” in <i>Beiträge zum Mathematikunterricht 2020 </i>, 2020, pp. 233–236.","chicago":"Dröse, Jennifer. “Verstehensgrundlagen diagnostizieren - Welche Wissenselemente fokussieren Lehrkräfte?” In <i>Beiträge zum Mathematikunterricht 2020 </i>, edited by H.-S. Siller, W. Weigel, and J. F. Wöler, 233–36. Münster: WTM, 2020.","short":"J. Dröse, in: H.-S. Siller, W. Weigel, J.F. Wöler (Eds.), Beiträge zum Mathematikunterricht 2020 , WTM, Münster, 2020, pp. 233–236.","mla":"Dröse, Jennifer. “Verstehensgrundlagen diagnostizieren - Welche Wissenselemente fokussieren Lehrkräfte?” <i>Beiträge zum Mathematikunterricht 2020 </i>, edited by H.-S. Siller et al., WTM, 2020, pp. 233–36.","ama":"Dröse J. Verstehensgrundlagen diagnostizieren - Welche Wissenselemente fokussieren Lehrkräfte? In: Siller H-S, Weigel W, Wöler JF, eds. <i>Beiträge zum Mathematikunterricht 2020 </i>. WTM; 2020:233-236.","bibtex":"@inproceedings{Dröse_2020, place={Münster}, title={Verstehensgrundlagen diagnostizieren - Welche Wissenselemente fokussieren Lehrkräfte?}, booktitle={Beiträge zum Mathematikunterricht 2020 }, publisher={WTM}, author={Dröse, Jennifer}, editor={Siller, H.-S. and Weigel, W. and Wöler, J. F.}, year={2020}, pages={233–236} }"},"publication":"Beiträge zum Mathematikunterricht 2020 ","editor":[{"full_name":"Siller, H.-S.","first_name":"H.-S.","last_name":"Siller"},{"full_name":"Weigel, W.","last_name":"Weigel","first_name":"W."},{"full_name":"Wöler, J. F.","last_name":"Wöler","first_name":"J. F."}],"user_id":"85820","language":[{"iso":"ger"}],"_id":"45384","publisher":"WTM","page":"233-236","date_updated":"2023-11-02T08:09:21Z","author":[{"id":"85820","full_name":"Dröse, Jennifer","first_name":"Jennifer","last_name":"Dröse"}],"title":"Verstehensgrundlagen diagnostizieren - Welche Wissenselemente fokussieren Lehrkräfte?","status":"public","year":"2020"},{"publication":"Mathematik lehren 223","citation":{"mla":"Dröse, Jennifer, et al. “Textaufgaben lesen lernen – eine digital gestützte Einheit mit App .” <i>Mathematik lehren 223</i>, 2020, pp. 38–40.","ama":"Dröse J, Eisen V, Prediger S, Altieri M, Schellenbach M, Menning R. Textaufgaben lesen lernen – eine digital gestützte Einheit mit App . In: <i>Mathematik lehren 223</i>. ; 2020:38-40.","bibtex":"@inbook{Dröse_Eisen_Prediger_Altieri_Schellenbach_Menning_2020, title={Textaufgaben lesen lernen – eine digital gestützte Einheit mit App }, booktitle={Mathematik lehren 223}, author={Dröse, Jennifer and Eisen, V. and Prediger, Susanne and Altieri, M. and Schellenbach, M. and Menning, R.}, year={2020}, pages={38–40} }","apa":"Dröse, J., Eisen, V., Prediger, S., Altieri, M., Schellenbach, M., &#38; Menning, R. (2020). Textaufgaben lesen lernen – eine digital gestützte Einheit mit App . In <i>Mathematik lehren 223</i> (pp. 38–40).","ieee":"J. Dröse, V. Eisen, S. Prediger, M. Altieri, M. Schellenbach, and R. Menning, “Textaufgaben lesen lernen – eine digital gestützte Einheit mit App ,” in <i>Mathematik lehren 223</i>, 2020, pp. 38–40.","short":"J. Dröse, V. Eisen, S. Prediger, M. Altieri, M. Schellenbach, R. Menning, in: Mathematik lehren 223, 2020, pp. 38–40.","chicago":"Dröse, Jennifer, V. Eisen, Susanne Prediger, M. Altieri, M. Schellenbach, and R. Menning. “Textaufgaben lesen lernen – eine digital gestützte Einheit mit App .” In <i>Mathematik lehren 223</i>, 38–40, 2020."},"type":"book_chapter","department":[{"_id":"98"}],"date_created":"2023-05-31T07:42:06Z","date_updated":"2023-11-02T08:09:54Z","title":"Textaufgaben lesen lernen – eine digital gestützte Einheit mit App ","status":"public","year":"2020","author":[{"id":"85820","first_name":"Jennifer","last_name":"Dröse","full_name":"Dröse, Jennifer"},{"full_name":"Eisen, V.","last_name":"Eisen","first_name":"V."},{"first_name":"Susanne","last_name":"Prediger","full_name":"Prediger, Susanne"},{"last_name":"Altieri","first_name":"M.","full_name":"Altieri, M."},{"first_name":"M.","last_name":"Schellenbach","full_name":"Schellenbach, M."},{"full_name":"Menning, R.","first_name":"R.","last_name":"Menning"}],"user_id":"85820","page":"38-40","_id":"45386","language":[{"iso":"ger"}]},{"language":[{"iso":"eng"}],"doi":"10.21437/Interspeech.2020-2388","title":"Multi-Path RNN for Hierarchical Modeling of Long Sequential Data and its Application to Speaker Stream Separation","year":"2020","author":[{"last_name":"Kinoshita","first_name":"Keisuke","full_name":"Kinoshita, Keisuke"},{"id":"49870","last_name":"von Neumann","orcid":"https://orcid.org/0000-0002-7717-8670","first_name":"Thilo","full_name":"von Neumann, Thilo"},{"full_name":"Delcroix, Marc","last_name":"Delcroix","first_name":"Marc"},{"full_name":"Nakatani, Tomohiro","first_name":"Tomohiro","last_name":"Nakatani"},{"id":"242","full_name":"Haeb-Umbach, Reinhold","last_name":"Haeb-Umbach","first_name":"Reinhold"}],"date_updated":"2023-11-15T12:14:25Z","file":[{"relation":"main_file","date_updated":"2020-12-16T14:16:32Z","file_name":"INTERSPEECH_2020_vonNeumann1_Paper.pdf","access_level":"open_access","file_size":1725219,"file_id":"20767","content_type":"application/pdf","creator":"huesera","date_created":"2020-12-16T14:16:32Z"}],"date_created":"2020-12-16T14:15:24Z","type":"conference","department":[{"_id":"54"}],"publication":"Proc. Interspeech 2020","abstract":[{"lang":"eng","text":"Recently, the source separation performance was greatly improved by time-domain audio source separation based on dual-path recurrent neural network (DPRNN). DPRNN is a simple but effective model for a long sequential data. While DPRNN is quite efficient in modeling a sequential data of the length of an utterance, i.e., about 5 to 10 second data, it is harder to apply it to longer sequences such as whole conversations consisting of multiple utterances. It is simply because, in such a case, the number of time steps consumed by its internal module called inter-chunk RNN becomes extremely large. To mitigate this problem, this paper proposes a multi-path RNN (MPRNN), a generalized version of DPRNN, that models the input data in a hierarchical manner. In the MPRNN framework, the input data is represented at several (>_ 3) time-resolutions, each of which is modeled by a specific RNN sub-module. For example, the RNN sub-module that deals with the finest resolution may model temporal relationship only within a phoneme, while the RNN sub-module handling the most coarse resolution may capture only the relationship between utterances such as speaker information. We perform experiments using simulated dialogue-like mixtures and show that MPRNN has greater model capacity, and it outperforms the current state-of-the-art DPRNN framework especially in online processing scenarios."}],"page":"2652-2656","_id":"20766","ddc":["000"],"user_id":"49870","status":"public","has_accepted_license":"1","oa":"1","file_date_updated":"2020-12-16T14:16:32Z","citation":{"mla":"Kinoshita, Keisuke, et al. “Multi-Path RNN for Hierarchical Modeling of Long Sequential Data and Its Application to Speaker Stream Separation.” <i>Proc. Interspeech 2020</i>, 2020, pp. 2652–56, doi:<a href=\"https://doi.org/10.21437/Interspeech.2020-2388\">10.21437/Interspeech.2020-2388</a>.","bibtex":"@inproceedings{Kinoshita_von Neumann_Delcroix_Nakatani_Haeb-Umbach_2020, title={Multi-Path RNN for Hierarchical Modeling of Long Sequential Data and its Application to Speaker Stream Separation}, DOI={<a href=\"https://doi.org/10.21437/Interspeech.2020-2388\">10.21437/Interspeech.2020-2388</a>}, booktitle={Proc. Interspeech 2020}, author={Kinoshita, Keisuke and von Neumann, Thilo and Delcroix, Marc and Nakatani, Tomohiro and Haeb-Umbach, Reinhold}, year={2020}, pages={2652–2656} }","ama":"Kinoshita K, von Neumann T, Delcroix M, Nakatani T, Haeb-Umbach R. Multi-Path RNN for Hierarchical Modeling of Long Sequential Data and its Application to Speaker Stream Separation. In: <i>Proc. Interspeech 2020</i>. ; 2020:2652-2656. doi:<a href=\"https://doi.org/10.21437/Interspeech.2020-2388\">10.21437/Interspeech.2020-2388</a>","ieee":"K. Kinoshita, T. von Neumann, M. Delcroix, T. Nakatani, and R. Haeb-Umbach, “Multi-Path RNN for Hierarchical Modeling of Long Sequential Data and its Application to Speaker Stream Separation,” in <i>Proc. Interspeech 2020</i>, 2020, pp. 2652–2656, doi: <a href=\"https://doi.org/10.21437/Interspeech.2020-2388\">10.21437/Interspeech.2020-2388</a>.","apa":"Kinoshita, K., von Neumann, T., Delcroix, M., Nakatani, T., &#38; Haeb-Umbach, R. (2020). Multi-Path RNN for Hierarchical Modeling of Long Sequential Data and its Application to Speaker Stream Separation. <i>Proc. Interspeech 2020</i>, 2652–2656. <a href=\"https://doi.org/10.21437/Interspeech.2020-2388\">https://doi.org/10.21437/Interspeech.2020-2388</a>","short":"K. Kinoshita, T. von Neumann, M. Delcroix, T. Nakatani, R. Haeb-Umbach, in: Proc. Interspeech 2020, 2020, pp. 2652–2656.","chicago":"Kinoshita, Keisuke, Thilo von Neumann, Marc Delcroix, Tomohiro Nakatani, and Reinhold Haeb-Umbach. “Multi-Path RNN for Hierarchical Modeling of Long Sequential Data and Its Application to Speaker Stream Separation.” In <i>Proc. Interspeech 2020</i>, 2652–56, 2020. <a href=\"https://doi.org/10.21437/Interspeech.2020-2388\">https://doi.org/10.21437/Interspeech.2020-2388</a>."},"quality_controlled":"1"},{"publication":"Advances in Dynamics, Optimization and Computation","abstract":[{"lang":"eng","text":"In this work we review the novel framework for the computation of finite dimensional invariant sets of infinite dimensional dynamical systems developed in [6] and [36]. By utilizing results on embedding techniques for infinite dimensional systems we extend a classical subdivision scheme [8] as well as a continuation algorithm [7] for the computation of attractors and invariant manifolds of finite dimensional systems to the infinite dimensional case. We show how to implement this approach for the analysis of delay differential equations and partial differential equations and illustrate the feasibility of our implementation by computing the attractor of the Mackey-Glass equation and the unstable manifold of the one-dimensional Kuramoto-Sivashinsky equation."}],"date_created":"2020-08-14T15:02:22Z","type":"book_chapter","department":[{"_id":"101"}],"year":"2020","title":"The Approximation of Invariant Sets in Infinite Dimensional Dynamical Systems","author":[{"first_name":"Raphael","last_name":"Gerlach","full_name":"Gerlach, Raphael","id":"32655"},{"full_name":"Ziessler, Adrian","first_name":"Adrian","last_name":"Ziessler"}],"publication_identifier":{"issn":["2198-4182","2198-4190"],"isbn":["9783030512637","9783030512644"]},"publication_status":"published","date_updated":"2023-11-17T13:13:25Z","intvolume":"       304","main_file_link":[{"url":"https://link.springer.com/chapter/10.1007/978-3-030-51264-4_3"}],"series_title":"Studies in Systems, Decision and Control","language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-51264-4_3","citation":{"apa":"Gerlach, R., &#38; Ziessler, A. (2020). The Approximation of Invariant Sets in Infinite Dimensional Dynamical Systems. In O. Junge, O. Schütze, S. Ober-Blöbaum, &#38; K. Padberg-Gehle (Eds.), <i>Advances in Dynamics, Optimization and Computation</i> (Vol. 304, pp. 66–85). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-030-51264-4_3\">https://doi.org/10.1007/978-3-030-51264-4_3</a>","ieee":"R. Gerlach and A. Ziessler, “The Approximation of Invariant Sets in Infinite Dimensional Dynamical Systems,” in <i>Advances in Dynamics, Optimization and Computation</i>, vol. 304, O. Junge, O. Schütze, S. Ober-Blöbaum, and K. Padberg-Gehle, Eds. Cham: Springer International Publishing, 2020, pp. 66–85.","short":"R. Gerlach, A. Ziessler, in: O. Junge, O. Schütze, S. Ober-Blöbaum, K. Padberg-Gehle (Eds.), Advances in Dynamics, Optimization and Computation, Springer International Publishing, Cham, 2020, pp. 66–85.","chicago":"Gerlach, Raphael, and Adrian Ziessler. “The Approximation of Invariant Sets in Infinite Dimensional Dynamical Systems.” In <i>Advances in Dynamics, Optimization and Computation</i>, edited by Oliver Junge, Oliver Schütze, Sina Ober-Blöbaum, and Kathrin Padberg-Gehle, 304:66–85. Studies in Systems, Decision and Control. Cham: Springer International Publishing, 2020. <a href=\"https://doi.org/10.1007/978-3-030-51264-4_3\">https://doi.org/10.1007/978-3-030-51264-4_3</a>.","mla":"Gerlach, Raphael, and Adrian Ziessler. “The Approximation of Invariant Sets in Infinite Dimensional Dynamical Systems.” <i>Advances in Dynamics, Optimization and Computation</i>, edited by Oliver Junge et al., vol. 304, Springer International Publishing, 2020, pp. 66–85, doi:<a href=\"https://doi.org/10.1007/978-3-030-51264-4_3\">10.1007/978-3-030-51264-4_3</a>.","ama":"Gerlach R, Ziessler A. The Approximation of Invariant Sets in Infinite Dimensional Dynamical Systems. In: Junge O, Schütze O, Ober-Blöbaum S, Padberg-Gehle K, eds. <i>Advances in Dynamics, Optimization and Computation</i>. Vol 304. Studies in Systems, Decision and Control. Springer International Publishing; 2020:66-85. doi:<a href=\"https://doi.org/10.1007/978-3-030-51264-4_3\">10.1007/978-3-030-51264-4_3</a>","bibtex":"@inbook{Gerlach_Ziessler_2020, place={Cham}, series={Studies in Systems, Decision and Control}, title={The Approximation of Invariant Sets in Infinite Dimensional Dynamical Systems}, volume={304}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-51264-4_3\">10.1007/978-3-030-51264-4_3</a>}, booktitle={Advances in Dynamics, Optimization and Computation}, publisher={Springer International Publishing}, author={Gerlach, Raphael and Ziessler, Adrian}, editor={Junge, Oliver and Schütze, Oliver and Ober-Blöbaum, Sina and Padberg-Gehle, Kathrin}, year={2020}, pages={66–85}, collection={Studies in Systems, Decision and Control} }"},"place":"Cham","status":"public","page":"66-85","publisher":"Springer International Publishing","_id":"17994","user_id":"32655","volume":304,"editor":[{"last_name":"Junge","first_name":"Oliver","full_name":"Junge, Oliver"},{"full_name":"Schütze, Oliver","first_name":"Oliver","last_name":"Schütze"},{"full_name":"Ober-Blöbaum, Sina","last_name":"Ober-Blöbaum","first_name":"Sina"},{"full_name":"Padberg-Gehle, Kathrin","first_name":"Kathrin","last_name":"Padberg-Gehle"}]},{"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.1080/14689367.2019.1661355"}],"doi":"10.1080/14689367.2019.1661355","author":[{"first_name":"Michael","last_name":"Dellnitz","full_name":"Dellnitz, Michael"},{"first_name":"Bennet","last_name":"Gebken","full_name":"Gebken, Bennet","id":"32643"},{"id":"32655","last_name":"Gerlach","first_name":"Raphael","full_name":"Gerlach, Raphael"},{"last_name":"Klus","first_name":"Stefan","full_name":"Klus, Stefan"}],"publication_identifier":{"issn":["1468-9367","1468-9375"]},"title":"On the equivariance properties of self-adjoint matrices","year":"2020","intvolume":"        35","publication_status":"published","date_updated":"2023-11-17T13:12:59Z","date_created":"2020-04-16T14:07:25Z","department":[{"_id":"101"}],"type":"journal_article","issue":"2","publication":"Dynamical Systems","abstract":[{"text":"We investigate self-adjoint matrices A∈Rn,n with respect to their equivariance properties. We show in particular that a matrix is self-adjoint if and only if it is equivariant with respect to the action of a group Γ2(A)⊂O(n) which is isomorphic to ⊗nk=1Z2. If the self-adjoint matrix possesses multiple eigenvalues – this may, for instance, be induced by symmetry properties of an underlying dynamical system – then A is even equivariant with respect to the action of a group Γ(A)≃∏ki=1O(mi) where m1,…,mk are the multiplicities of the eigenvalues λ1,…,λk of A. We discuss implications of this result for equivariant bifurcation problems, and we briefly address further applications for the Procrustes problem, graph symmetries and Taylor expansions.","lang":"eng"}],"_id":"16712","page":"197-215","volume":35,"user_id":"32655","status":"public","citation":{"mla":"Dellnitz, Michael, et al. “On the Equivariance Properties of Self-Adjoint Matrices.” <i>Dynamical Systems</i>, vol. 35, no. 2, 2020, pp. 197–215, doi:<a href=\"https://doi.org/10.1080/14689367.2019.1661355\">10.1080/14689367.2019.1661355</a>.","bibtex":"@article{Dellnitz_Gebken_Gerlach_Klus_2020, title={On the equivariance properties of self-adjoint matrices}, volume={35}, DOI={<a href=\"https://doi.org/10.1080/14689367.2019.1661355\">10.1080/14689367.2019.1661355</a>}, number={2}, journal={Dynamical Systems}, author={Dellnitz, Michael and Gebken, Bennet and Gerlach, Raphael and Klus, Stefan}, year={2020}, pages={197–215} }","ama":"Dellnitz M, Gebken B, Gerlach R, Klus S. On the equivariance properties of self-adjoint matrices. <i>Dynamical Systems</i>. 2020;35(2):197-215. doi:<a href=\"https://doi.org/10.1080/14689367.2019.1661355\">10.1080/14689367.2019.1661355</a>","ieee":"M. Dellnitz, B. Gebken, R. Gerlach, and S. Klus, “On the equivariance properties of self-adjoint matrices,” <i>Dynamical Systems</i>, vol. 35, no. 2, pp. 197–215, 2020, doi: <a href=\"https://doi.org/10.1080/14689367.2019.1661355\">10.1080/14689367.2019.1661355</a>.","apa":"Dellnitz, M., Gebken, B., Gerlach, R., &#38; Klus, S. (2020). On the equivariance properties of self-adjoint matrices. <i>Dynamical Systems</i>, <i>35</i>(2), 197–215. <a href=\"https://doi.org/10.1080/14689367.2019.1661355\">https://doi.org/10.1080/14689367.2019.1661355</a>","short":"M. Dellnitz, B. Gebken, R. Gerlach, S. Klus, Dynamical Systems 35 (2020) 197–215.","chicago":"Dellnitz, Michael, Bennet Gebken, Raphael Gerlach, and Stefan Klus. “On the Equivariance Properties of Self-Adjoint Matrices.” <i>Dynamical Systems</i> 35, no. 2 (2020): 197–215. <a href=\"https://doi.org/10.1080/14689367.2019.1661355\">https://doi.org/10.1080/14689367.2019.1661355</a>."}},{"abstract":[{"lang":"eng","text":"In this paper we present our system for the detection and classification of acoustic scenes and events (DCASE) 2020 Challenge Task 4: Sound event detection and separation in domestic environments. We introduce two new models: the forward-backward convolutional recurrent neural network (FBCRNN) and the tag-conditioned convolutional neural network (CNN). The FBCRNN employs two recurrent neural network (RNN) classifiers sharing the same CNN for preprocessing. With one RNN processing a recording in forward direction and the other in backward direction, the two networks are trained to jointly predict audio tags, i.e., weak labels, at each time step within a recording, given that at each time step they have jointly processed the whole recording. The proposed training encourages the classifiers to tag events as soon as possible. Therefore, after training, the networks can be applied to shorter audio segments of, e.g., 200ms, allowing sound event detection (SED). Further, we propose a tag-conditioned CNN to complement SED. It is trained to predict strong labels while using (predicted) tags, i.e., weak labels, as additional input. For training pseudo strong labels from a FBCRNN ensemble are used. The presented system scored the fourth and third place in the systems and teams rankings, respectively. Subsequent improvements allow our system to even outperform the challenge baseline and winner systems in average by, respectively, 18.0% and 2.2% event-based F1-score on the validation set. Source code is publicly available at https://github.com/fgnt/pb_sed."}],"publication":"Proceedings of the Detection and Classification of Acoustic Scenes and Events 2020 Workshop (DCASE2020)","type":"conference","department":[{"_id":"54"}],"file":[{"creator":"huesera","date_created":"2020-12-16T08:57:22Z","file_name":"DCASE2020Workshop_Ebbers_Paper.pdf","access_level":"open_access","file_size":108326,"relation":"main_file","date_updated":"2020-12-16T08:57:22Z","file_id":"20754","content_type":"application/pdf"}],"date_created":"2020-12-16T08:55:27Z","date_updated":"2023-11-22T08:27:32Z","title":"Forward-Backward Convolutional Recurrent Neural Networks and Tag-Conditioned Convolutional Neural Networks for Weakly Labeled Semi-Supervised Sound Event Detection","year":"2020","author":[{"full_name":"Ebbers, Janek","last_name":"Ebbers","first_name":"Janek","id":"34851"},{"full_name":"Haeb-Umbach, Reinhold","last_name":"Haeb-Umbach","first_name":"Reinhold","id":"242"}],"language":[{"iso":"eng"}],"quality_controlled":"1","project":[{"_id":"52","name":"PC2: Computing Resources Provided by the Paderborn Center for Parallel Computing"}],"file_date_updated":"2020-12-16T08:57:22Z","citation":{"apa":"Ebbers, J., &#38; Haeb-Umbach, R. (2020). Forward-Backward Convolutional Recurrent Neural Networks and Tag-Conditioned Convolutional Neural Networks for Weakly Labeled Semi-Supervised Sound Event Detection. <i>Proceedings of the Detection and Classification of Acoustic Scenes and Events 2020 Workshop (DCASE2020)</i>.","ieee":"J. Ebbers and R. Haeb-Umbach, “Forward-Backward Convolutional Recurrent Neural Networks and Tag-Conditioned Convolutional Neural Networks for Weakly Labeled Semi-Supervised Sound Event Detection,” 2020.","chicago":"Ebbers, Janek, and Reinhold Haeb-Umbach. “Forward-Backward Convolutional Recurrent Neural Networks and Tag-Conditioned Convolutional Neural Networks for Weakly Labeled Semi-Supervised Sound Event Detection.” In <i>Proceedings of the Detection and Classification of Acoustic Scenes and Events 2020 Workshop (DCASE2020)</i>, 2020.","short":"J. Ebbers, R. Haeb-Umbach, in: Proceedings of the Detection and Classification of Acoustic Scenes and Events 2020 Workshop (DCASE2020), 2020.","mla":"Ebbers, Janek, and Reinhold Haeb-Umbach. “Forward-Backward Convolutional Recurrent Neural Networks and Tag-Conditioned Convolutional Neural Networks for Weakly Labeled Semi-Supervised Sound Event Detection.” <i>Proceedings of the Detection and Classification of Acoustic Scenes and Events 2020 Workshop (DCASE2020)</i>, 2020.","ama":"Ebbers J, Haeb-Umbach R. Forward-Backward Convolutional Recurrent Neural Networks and Tag-Conditioned Convolutional Neural Networks for Weakly Labeled Semi-Supervised Sound Event Detection. In: <i>Proceedings of the Detection and Classification of Acoustic Scenes and Events 2020 Workshop (DCASE2020)</i>. ; 2020.","bibtex":"@inproceedings{Ebbers_Haeb-Umbach_2020, title={Forward-Backward Convolutional Recurrent Neural Networks and Tag-Conditioned Convolutional Neural Networks for Weakly Labeled Semi-Supervised Sound Event Detection}, booktitle={Proceedings of the Detection and Classification of Acoustic Scenes and Events 2020 Workshop (DCASE2020)}, author={Ebbers, Janek and Haeb-Umbach, Reinhold}, year={2020} }"},"oa":"1","has_accepted_license":"1","status":"public","ddc":["000"],"user_id":"34851","_id":"20753"},{"user_id":"8447","doi":"10.1145/3393672.3398640","language":[{"iso":"eng"}],"_id":"16790","date_updated":"2023-12-07T10:42:15Z","publication_identifier":{"isbn":["978-1-4503-7984-7/20/06"]},"author":[{"last_name":"Krings","orcid":"0000-0001-8040-7553","first_name":"Sarah Claudia","full_name":"Krings, Sarah Claudia","id":"64063"},{"full_name":"Yigitbas, Enes","orcid":"0000-0002-5967-833X","first_name":"Enes","last_name":"Yigitbas","id":"8447"},{"id":"39187","full_name":"Jovanovikj, Ivan","last_name":"Jovanovikj","first_name":"Ivan","orcid":"https://orcid.org/0000-0002-1838-794X"},{"first_name":"Stefan","last_name":"Sauer","orcid":"0000-0003-3084-0409","full_name":"Sauer, Stefan","id":"447"},{"last_name":"Engels","first_name":"Gregor","full_name":"Engels, Gregor","id":"107"}],"title":"Development Framework for Context-Aware Augmented Reality Applications","status":"public","year":"2020","department":[{"_id":"66"},{"_id":"534"}],"type":"conference","date_created":"2020-04-21T11:49:52Z","citation":{"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>","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} }","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.","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>.","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>."},"publication":"Proceedings of the 12th ACM SIGCHI Symposium on Engineering Interactive Computing Systems (EICS 2020)"},{"status":"public","_id":"48847","publisher":"Association for Computing Machinery","page":"1277–1285","user_id":"102979","citation":{"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} }","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>","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.","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>."},"place":"New York, NY, USA","publication_identifier":{"isbn":["978-1-4503-7128-5"]},"author":[{"id":"102979","full_name":"Bossek, Jakob","last_name":"Bossek","first_name":"Jakob","orcid":"0000-0002-4121-4668"},{"full_name":"Neumann, Frank","first_name":"Frank","last_name":"Neumann"},{"full_name":"Peng, Pan","last_name":"Peng","first_name":"Pan"},{"last_name":"Sudholt","first_name":"Dirk","full_name":"Sudholt, Dirk"}],"year":"2020","title":"More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization","publication_status":"published","date_updated":"2023-12-13T10:43:41Z","language":[{"iso":"eng"}],"series_title":"GECCO ’20","doi":"10.1145/3377930.3390174","publication":"Proceedings of the Genetic and Evolutionary Computation Conference","extern":"1","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."}],"date_created":"2023-11-14T15:58:53Z","department":[{"_id":"819"}],"keyword":["dynamic optimization","evolutionary algorithms","running time analysis","theory"],"type":"conference"},{"place":"Berlin, Heidelberg","citation":{"mla":"Bossek, Jakob, et al. “Evolving Sampling Strategies for One-Shot Optimization Tasks.” <i>Parallel Problem Solving from Nature (PPSN XVI)</i>, Springer-Verlag, 2020, pp. 111–124, doi:<a href=\"https://doi.org/10.1007/978-3-030-58112-1_8\">10.1007/978-3-030-58112-1_8</a>.","ama":"Bossek J, Doerr C, Kerschke P, Neumann A, Neumann F. Evolving Sampling Strategies for One-Shot Optimization Tasks. In: <i>Parallel Problem Solving from Nature (PPSN XVI)</i>. Springer-Verlag; 2020:111–124. doi:<a href=\"https://doi.org/10.1007/978-3-030-58112-1_8\">10.1007/978-3-030-58112-1_8</a>","bibtex":"@inproceedings{Bossek_Doerr_Kerschke_Neumann_Neumann_2020, place={Berlin, Heidelberg}, title={Evolving Sampling Strategies for One-Shot Optimization Tasks}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-58112-1_8\">10.1007/978-3-030-58112-1_8</a>}, booktitle={Parallel Problem Solving from Nature (PPSN XVI)}, publisher={Springer-Verlag}, author={Bossek, Jakob and Doerr, Carola and Kerschke, Pascal and Neumann, Aneta and Neumann, Frank}, year={2020}, pages={111–124} }","apa":"Bossek, J., Doerr, C., Kerschke, P., Neumann, A., &#38; Neumann, F. (2020). Evolving Sampling Strategies for One-Shot Optimization Tasks. <i>Parallel Problem Solving from Nature (PPSN XVI)</i>, 111–124. <a href=\"https://doi.org/10.1007/978-3-030-58112-1_8\">https://doi.org/10.1007/978-3-030-58112-1_8</a>","ieee":"J. Bossek, C. Doerr, P. Kerschke, A. Neumann, and F. Neumann, “Evolving Sampling Strategies for One-Shot Optimization Tasks,” in <i>Parallel Problem Solving from Nature (PPSN XVI)</i>, 2020, pp. 111–124, doi: <a href=\"https://doi.org/10.1007/978-3-030-58112-1_8\">10.1007/978-3-030-58112-1_8</a>.","short":"J. Bossek, C. Doerr, P. Kerschke, A. Neumann, F. Neumann, in: Parallel Problem Solving from Nature (PPSN XVI), Springer-Verlag, Berlin, Heidelberg, 2020, pp. 111–124.","chicago":"Bossek, Jakob, Carola Doerr, Pascal Kerschke, Aneta Neumann, and Frank Neumann. “Evolving Sampling Strategies for One-Shot Optimization Tasks.” In <i>Parallel Problem Solving from Nature (PPSN XVI)</i>, 111–124. Berlin, Heidelberg: Springer-Verlag, 2020. <a href=\"https://doi.org/10.1007/978-3-030-58112-1_8\">https://doi.org/10.1007/978-3-030-58112-1_8</a>."},"user_id":"102979","page":"111–124","_id":"48849","publisher":"Springer-Verlag","status":"public","type":"conference","keyword":["Continuous optimization","Fully parallel search","One-shot optimization","Regression","Surrogate-assisted optimization"],"department":[{"_id":"819"}],"date_created":"2023-11-14T15:58:53Z","abstract":[{"text":"One-shot optimization tasks require to determine the set of solution candidates prior to their evaluation, i.e., without possibility for adaptive sampling. We consider two variants, classic one-shot optimization (where our aim is to find at least one solution of high quality) and one-shot regression (where the goal is to fit a model that resembles the true problem as well as possible). For both tasks it seems intuitive that well-distributed samples should perform better than uniform or grid-based samples, since they show a better coverage of the decision space. In practice, quasi-random designs such as Latin Hypercube Samples and low-discrepancy point sets are indeed very commonly used designs for one-shot optimization tasks. We study in this work how well low star discrepancy correlates with performance in one-shot optimization. Our results confirm an advantage of low-discrepancy designs, but also indicate the correlation between discrepancy values and overall performance is rather weak. We then demonstrate that commonly used designs may be far from optimal. More precisely, we evolve 24 very specific designs that each achieve good performance on one of our benchmark problems. Interestingly, we find that these specifically designed samples yield surprisingly good performance across the whole benchmark set. Our results therefore give strong indication that significant performance gains over state-of-the-art one-shot sampling techniques are possible, and that evolutionary algorithms can be an efficient means to evolve these.","lang":"eng"}],"extern":"1","publication":"Parallel Problem Solving from Nature (PPSN XVI)","doi":"10.1007/978-3-030-58112-1_8","language":[{"iso":"eng"}],"date_updated":"2023-12-13T10:43:53Z","publication_status":"published","year":"2020","title":"Evolving Sampling Strategies for One-Shot Optimization Tasks","publication_identifier":{"isbn":["978-3-030-58111-4"]},"author":[{"orcid":"0000-0002-4121-4668","last_name":"Bossek","first_name":"Jakob","full_name":"Bossek, Jakob","id":"102979"},{"full_name":"Doerr, Carola","first_name":"Carola","last_name":"Doerr"},{"last_name":"Kerschke","first_name":"Pascal","full_name":"Kerschke, Pascal"},{"full_name":"Neumann, Aneta","last_name":"Neumann","first_name":"Aneta"},{"full_name":"Neumann, Frank","first_name":"Frank","last_name":"Neumann"}]},{"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>","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.","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>","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>."},"place":"New York, NY, USA","status":"public","user_id":"102979","page":"1286–1294","_id":"48851","publisher":"Association for Computing Machinery","extern":"1","abstract":[{"text":"Several important optimization problems in the area of vehicle routing can be seen as variants of the classical Traveling Salesperson Problem (TSP). In the area of evolutionary computation, the Traveling Thief Problem (TTP) has gained increasing interest over the last 5 years. In this paper, we investigate the effect of weights on such problems, in the sense that the cost of traveling increases with respect to the weights of nodes already visited during a tour. This provides abstractions of important TSP variants such as the Traveling Thief Problem and time dependent TSP variants, and allows to study precisely the increase in difficulty caused by weight dependence. We provide a 3.59-approximation for this weight dependent version of TSP with metric distances and bounded positive weights. Furthermore, we conduct experimental investigations for simple randomized local search with classical mutation operators and two variants of the state-of-the-art evolutionary algorithm EAX adapted to the weighted TSP. Our results show the impact of the node weights on the position of the nodes in the resulting tour.","lang":"eng"}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference","type":"conference","keyword":["dynamic optimization","evolutionary algorithms","running time analysis","theory"],"department":[{"_id":"819"}],"date_created":"2023-11-14T15:58:53Z","publication_status":"published","date_updated":"2023-12-13T10:43:33Z","year":"2020","title":"The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics","publication_identifier":{"isbn":["978-1-4503-7128-5"]},"author":[{"id":"102979","full_name":"Bossek, Jakob","last_name":"Bossek","first_name":"Jakob","orcid":"0000-0002-4121-4668"},{"first_name":"Katrin","last_name":"Casel","full_name":"Casel, Katrin"},{"full_name":"Kerschke, Pascal","last_name":"Kerschke","first_name":"Pascal"},{"full_name":"Neumann, Frank","last_name":"Neumann","first_name":"Frank"}],"doi":"10.1145/3377930.3390243","series_title":"GECCO ’20","language":[{"iso":"eng"}]},{"date_updated":"2023-12-13T10:43:24Z","publication_status":"published","author":[{"first_name":"Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668","full_name":"Bossek, Jakob","id":"102979"},{"last_name":"Grimme","first_name":"Christian","full_name":"Grimme, Christian"},{"full_name":"Trautmann, Heike","first_name":"Heike","last_name":"Trautmann"}],"publication_identifier":{"isbn":["978-1-4503-7128-5"]},"title":"Dynamic Bi-Objective Routing of Multiple Vehicles","year":"2020","doi":"10.1145/3377930.3390146","series_title":"GECCO ’20","language":[{"iso":"eng"}],"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"}],"extern":"1","publication":"Proceedings of the Genetic and Evolutionary Computation Conference","department":[{"_id":"819"}],"keyword":["decision making","dynamic optimization","evolutionary algorithms","multi-objective optimization","vehicle routing"],"type":"conference","date_created":"2023-11-14T15:58:52Z","status":"public","user_id":"102979","publisher":"Association for Computing Machinery","_id":"48845","page":"166–174","citation":{"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.","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>.","apa":"Bossek, J., Grimme, C., &#38; Trautmann, H. (2020). Dynamic Bi-Objective Routing of Multiple Vehicles. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 166–174. <a href=\"https://doi.org/10.1145/3377930.3390146\">https://doi.org/10.1145/3377930.3390146</a>","ieee":"J. Bossek, C. Grimme, and H. Trautmann, “Dynamic Bi-Objective Routing of Multiple Vehicles,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2020, pp. 166–174, doi: <a href=\"https://doi.org/10.1145/3377930.3390146\">10.1145/3377930.3390146</a>.","ama":"Bossek J, Grimme C, Trautmann H. Dynamic Bi-Objective Routing of Multiple Vehicles. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. GECCO ’20. Association for Computing Machinery; 2020:166–174. doi:<a href=\"https://doi.org/10.1145/3377930.3390146\">10.1145/3377930.3390146</a>","bibtex":"@inproceedings{Bossek_Grimme_Trautmann_2020, place={New York, NY, USA}, series={GECCO ’20}, title={Dynamic Bi-Objective Routing of Multiple Vehicles}, DOI={<a href=\"https://doi.org/10.1145/3377930.3390146\">10.1145/3377930.3390146</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Grimme, Christian and Trautmann, Heike}, year={2020}, pages={166–174}, collection={GECCO ’20} }","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>."},"place":"New York, NY, USA"},{"citation":{"bibtex":"@inproceedings{Bossek_Kerschke_Trautmann_2020, place={Glasgow, United Kingdom}, title={Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection}, DOI={<a href=\"https://doi.org/10.1109/CEC48606.2020.9185613\">10.1109/CEC48606.2020.9185613</a>}, booktitle={2020 IEEE Congress on Evolutionary Computation (CEC)}, publisher={IEEE Press}, author={Bossek, Jakob and Kerschke, Pascal and Trautmann, Heike}, year={2020}, pages={1–8} }","ama":"Bossek J, Kerschke P, Trautmann H. Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection. In: <i>2020 IEEE Congress on Evolutionary Computation (CEC)</i>. IEEE Press; 2020:1–8. doi:<a href=\"https://doi.org/10.1109/CEC48606.2020.9185613\">10.1109/CEC48606.2020.9185613</a>","mla":"Bossek, Jakob, et al. “Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection.” <i>2020 IEEE Congress on Evolutionary Computation (CEC)</i>, IEEE Press, 2020, pp. 1–8, doi:<a href=\"https://doi.org/10.1109/CEC48606.2020.9185613\">10.1109/CEC48606.2020.9185613</a>.","short":"J. Bossek, P. Kerschke, H. Trautmann, in: 2020 IEEE Congress on Evolutionary Computation (CEC), IEEE Press, Glasgow, United Kingdom, 2020, pp. 1–8.","chicago":"Bossek, Jakob, Pascal Kerschke, and Heike Trautmann. “Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection.” In <i>2020 IEEE Congress on Evolutionary Computation (CEC)</i>, 1–8. Glasgow, United Kingdom: IEEE Press, 2020. <a href=\"https://doi.org/10.1109/CEC48606.2020.9185613\">https://doi.org/10.1109/CEC48606.2020.9185613</a>.","ieee":"J. Bossek, P. Kerschke, and H. Trautmann, “Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection,” in <i>2020 IEEE Congress on Evolutionary Computation (CEC)</i>, 2020, pp. 1–8, doi: <a href=\"https://doi.org/10.1109/CEC48606.2020.9185613\">10.1109/CEC48606.2020.9185613</a>.","apa":"Bossek, J., Kerschke, P., &#38; Trautmann, H. (2020). Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection. <i>2020 IEEE Congress on Evolutionary Computation (CEC)</i>, 1–8. <a href=\"https://doi.org/10.1109/CEC48606.2020.9185613\">https://doi.org/10.1109/CEC48606.2020.9185613</a>"},"publication":"2020 IEEE Congress on Evolutionary Computation (CEC)","abstract":[{"lang":"eng","text":"The Traveling-Salesperson-Problem (TSP) is arguably one of the best-known NP-hard combinatorial optimization problems. The two sophisticated heuristic solvers LKH and EAX and respective (restart) variants manage to calculate close-to optimal or even optimal solutions, also for large instances with several thousand nodes in reasonable time. In this work we extend existing benchmarking studies by addressing anytime behaviour of inexact TSP solvers based on empirical runtime distributions leading to an increased understanding of solver behaviour and the respective relation to problem hardness. It turns out that performance ranking of solvers is highly dependent on the focused approximation quality. Insights on intersection points of performances offer huge potential for the construction of hybridized solvers depending on instance features. Moreover, instance features tailored to anytime performance and corresponding performance indicators will highly improve automated algorithm selection models by including comprehensive information on solver quality."}],"extern":"1","place":"Glasgow, United Kingdom","date_created":"2023-11-14T15:58:52Z","department":[{"_id":"819"}],"type":"conference","author":[{"last_name":"Bossek","first_name":"Jakob","orcid":"0000-0002-4121-4668","full_name":"Bossek, Jakob","id":"102979"},{"full_name":"Kerschke, Pascal","last_name":"Kerschke","first_name":"Pascal"},{"last_name":"Trautmann","first_name":"Heike","full_name":"Trautmann, Heike"}],"year":"2020","status":"public","title":"Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection","date_updated":"2023-12-13T10:43:16Z","publication_status":"published","publisher":"IEEE Press","_id":"48844","language":[{"iso":"eng"}],"page":"1–8","doi":"10.1109/CEC48606.2020.9185613","user_id":"102979"},{"series_title":"GECCO ’20","language":[{"iso":"eng"}],"doi":"10.1145/3377930.3390155","publication_identifier":{"isbn":["978-1-4503-7128-5"]},"author":[{"id":"102979","orcid":"0000-0002-4121-4668","first_name":"Jakob","last_name":"Bossek","full_name":"Bossek, Jakob"},{"full_name":"Doerr, Carola","last_name":"Doerr","first_name":"Carola"},{"full_name":"Kerschke, Pascal","last_name":"Kerschke","first_name":"Pascal"}],"year":"2020","title":"Initial Design Strategies and Their Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB","publication_status":"published","date_updated":"2023-12-13T10:44:01Z","date_created":"2023-11-14T15:58:53Z","department":[{"_id":"819"}],"type":"conference","keyword":["continuous black-box optimization","design of experiments","initial design","sequential model-based optimization"],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference","extern":"1","abstract":[{"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.","lang":"eng"}],"_id":"48850","publisher":"Association for Computing Machinery","page":"778–786","user_id":"102979","status":"public","place":"New York, NY, USA","citation":{"chicago":"Bossek, Jakob, Carola Doerr, and Pascal Kerschke. “Initial Design Strategies and Their Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 778–786. GECCO ’20. New York, NY, USA: Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3377930.3390155\">https://doi.org/10.1145/3377930.3390155</a>.","short":"J. Bossek, C. Doerr, P. Kerschke, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2020, pp. 778–786.","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>.","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>","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} }","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>","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>."}},{"type":"conference","keyword":["Evolutionary algorithms","Node weight dependent TSP","Traveling Thief Problem"],"department":[{"_id":"819"}],"date_created":"2023-11-14T15:58:54Z","extern":"1","abstract":[{"text":"The Traveling Salesperson Problem (TSP) is one of the best-known combinatorial optimisation problems. However, many real-world problems are composed of several interacting components. The Traveling Thief Problem (TTP) addresses such interactions by combining two combinatorial optimisation problems, namely the TSP and the Knapsack Problem (KP). Recently, a new problem called the node weight dependent Traveling Salesperson Problem (W-TSP) has been introduced where nodes have weights that influence the cost of the tour. In this paper, we compare W-TSP and TTP. We investigate the structure of the optimised tours for W-TSP and TTP and the impact of using each others fitness function. Our experimental results suggest (1) that the W-TSP often can be solved better using the TTP fitness function and (2) final W-TSP and TTP solutions show different distributions when compared with optimal TSP or weighted greedy solutions.","lang":"eng"}],"publication":"Parallel Problem Solving from Nature (PPSN XVI)","doi":"10.1007/978-3-030-58112-1_24","language":[{"iso":"eng"}],"publication_status":"published","date_updated":"2023-12-13T10:44:54Z","year":"2020","title":"Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions","author":[{"orcid":"0000-0002-4121-4668","first_name":"Jakob","last_name":"Bossek","full_name":"Bossek, Jakob","id":"102979"},{"last_name":"Neumann","first_name":"Aneta","full_name":"Neumann, Aneta"},{"last_name":"Neumann","first_name":"Frank","full_name":"Neumann, Frank"}],"publication_identifier":{"isbn":["978-3-030-58111-4"]},"place":"Berlin, Heidelberg","citation":{"ama":"Bossek J, Neumann A, Neumann F. Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions. In: <i>Parallel Problem Solving from Nature (PPSN XVI)</i>. Springer-Verlag; 2020:346–359. doi:<a href=\"https://doi.org/10.1007/978-3-030-58112-1_24\">10.1007/978-3-030-58112-1_24</a>","bibtex":"@inproceedings{Bossek_Neumann_Neumann_2020, place={Berlin, Heidelberg}, title={Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-58112-1_24\">10.1007/978-3-030-58112-1_24</a>}, booktitle={Parallel Problem Solving from Nature (PPSN XVI)}, publisher={Springer-Verlag}, author={Bossek, Jakob and Neumann, Aneta and Neumann, Frank}, year={2020}, pages={346–359} }","mla":"Bossek, Jakob, et al. “Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions.” <i>Parallel Problem Solving from Nature (PPSN XVI)</i>, Springer-Verlag, 2020, pp. 346–359, doi:<a href=\"https://doi.org/10.1007/978-3-030-58112-1_24\">10.1007/978-3-030-58112-1_24</a>.","chicago":"Bossek, Jakob, Aneta Neumann, and Frank Neumann. “Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions.” In <i>Parallel Problem Solving from Nature (PPSN XVI)</i>, 346–359. Berlin, Heidelberg: Springer-Verlag, 2020. <a href=\"https://doi.org/10.1007/978-3-030-58112-1_24\">https://doi.org/10.1007/978-3-030-58112-1_24</a>.","short":"J. Bossek, A. Neumann, F. Neumann, in: Parallel Problem Solving from Nature (PPSN XVI), Springer-Verlag, Berlin, Heidelberg, 2020, pp. 346–359.","apa":"Bossek, J., Neumann, A., &#38; Neumann, F. (2020). Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions. <i>Parallel Problem Solving from Nature (PPSN XVI)</i>, 346–359. <a href=\"https://doi.org/10.1007/978-3-030-58112-1_24\">https://doi.org/10.1007/978-3-030-58112-1_24</a>","ieee":"J. Bossek, A. Neumann, and F. Neumann, “Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions,” in <i>Parallel Problem Solving from Nature (PPSN XVI)</i>, 2020, pp. 346–359, doi: <a href=\"https://doi.org/10.1007/978-3-030-58112-1_24\">10.1007/978-3-030-58112-1_24</a>."},"user_id":"102979","page":"346–359","_id":"48852","publisher":"Springer-Verlag","status":"public"},{"extern":"1","abstract":[{"text":"We consider a dynamic bi-objective vehicle routing problem, where a subset of customers ask for service over time. Therein, the distance traveled by a single vehicle and the number of unserved dynamic requests is minimized by a dynamic evolutionary multi-objective algorithm (DEMOA), which operates on discrete time windows (eras). A decision is made at each era by a decision-maker, thus any decision depends on irreversible decisions made in foregoing eras. To understand effects of sequences of decision-making and interactions/dependencies between decisions made, we conduct a series of experiments. More precisely, we fix a set of decision-maker preferences D and the number of eras n{$<$}inf{$>$}t{$<$}/inf{$>$} and analyze all $|D|\\^{n_t}$ combinations of decision-maker options. We find that for random uniform instances (a) the final selected solutions mainly depend on the final decision and not on the decision history, (b) solutions are quite robust with respect to the number of unvisited dynamic customers, and (c) solutions of the dynamic approach can even dominate solutions obtained by a clairvoyant EMOA. In contrast, for instances with clustered customers, we observe a strong dependency on decision-making history as well as more variance in solution diversity.","lang":"eng"}],"publication":"2020 IEEE Congress on Evolutionary Computation (CEC)","citation":{"chicago":"Bossek, Jakob, Christian Grimme, Günter Rudolph, and Heike Trautmann. “Towards Decision Support in Dynamic Bi-Objective Vehicle Routing.” In <i>2020 IEEE Congress on Evolutionary Computation (CEC)</i>, 1–8. Glasgow, United Kingdom: IEEE Press, 2020. <a href=\"https://doi.org/10.1109/CEC48606.2020.9185778\">https://doi.org/10.1109/CEC48606.2020.9185778</a>.","short":"J. Bossek, C. Grimme, G. Rudolph, H. Trautmann, in: 2020 IEEE Congress on Evolutionary Computation (CEC), IEEE Press, Glasgow, United Kingdom, 2020, pp. 1–8.","apa":"Bossek, J., Grimme, C., Rudolph, G., &#38; Trautmann, H. (2020). Towards Decision Support in Dynamic Bi-Objective Vehicle Routing. <i>2020 IEEE Congress on Evolutionary Computation (CEC)</i>, 1–8. <a href=\"https://doi.org/10.1109/CEC48606.2020.9185778\">https://doi.org/10.1109/CEC48606.2020.9185778</a>","ieee":"J. Bossek, C. Grimme, G. Rudolph, and H. Trautmann, “Towards Decision Support in Dynamic Bi-Objective Vehicle Routing,” in <i>2020 IEEE Congress on Evolutionary Computation (CEC)</i>, 2020, pp. 1–8, doi: <a href=\"https://doi.org/10.1109/CEC48606.2020.9185778\">10.1109/CEC48606.2020.9185778</a>.","ama":"Bossek J, Grimme C, Rudolph G, Trautmann H. Towards Decision Support in Dynamic Bi-Objective Vehicle Routing. In: <i>2020 IEEE Congress on Evolutionary Computation (CEC)</i>. IEEE Press; 2020:1–8. doi:<a href=\"https://doi.org/10.1109/CEC48606.2020.9185778\">10.1109/CEC48606.2020.9185778</a>","bibtex":"@inproceedings{Bossek_Grimme_Rudolph_Trautmann_2020, place={Glasgow, United Kingdom}, title={Towards Decision Support in Dynamic Bi-Objective Vehicle Routing}, DOI={<a href=\"https://doi.org/10.1109/CEC48606.2020.9185778\">10.1109/CEC48606.2020.9185778</a>}, booktitle={2020 IEEE Congress on Evolutionary Computation (CEC)}, publisher={IEEE Press}, author={Bossek, Jakob and Grimme, Christian and Rudolph, Günter and Trautmann, Heike}, year={2020}, pages={1–8} }","mla":"Bossek, Jakob, et al. “Towards Decision Support in Dynamic Bi-Objective Vehicle Routing.” <i>2020 IEEE Congress on Evolutionary Computation (CEC)</i>, IEEE Press, 2020, pp. 1–8, doi:<a href=\"https://doi.org/10.1109/CEC48606.2020.9185778\">10.1109/CEC48606.2020.9185778</a>."},"type":"conference","department":[{"_id":"819"}],"date_created":"2023-11-14T15:58:53Z","place":"Glasgow, United Kingdom","publication_status":"published","date_updated":"2023-12-13T10:44:17Z","title":"Towards Decision Support in Dynamic Bi-Objective Vehicle Routing","status":"public","year":"2020","author":[{"id":"102979","orcid":"0000-0002-4121-4668","first_name":"Jakob","last_name":"Bossek","full_name":"Bossek, Jakob"},{"last_name":"Grimme","first_name":"Christian","full_name":"Grimme, Christian"},{"full_name":"Rudolph, Günter","last_name":"Rudolph","first_name":"Günter"},{"full_name":"Trautmann, Heike","last_name":"Trautmann","first_name":"Heike"}],"user_id":"102979","doi":"10.1109/CEC48606.2020.9185778","page":"1–8","language":[{"iso":"eng"}],"_id":"48846","publisher":"IEEE Press"},{"status":"public","_id":"48879","publisher":"Association for Computing Machinery","page":"681–689","user_id":"102979","citation":{"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>","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.","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>.","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>","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>."},"place":"New York, NY, USA","author":[{"last_name":"Do","first_name":"Anh Viet","full_name":"Do, Anh Viet"},{"full_name":"Bossek, Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668","first_name":"Jakob","id":"102979"},{"last_name":"Neumann","first_name":"Aneta","full_name":"Neumann, Aneta"},{"full_name":"Neumann, Frank","last_name":"Neumann","first_name":"Frank"}],"publication_identifier":{"isbn":["978-1-4503-7128-5"]},"year":"2020","title":"Evolving Diverse Sets of Tours for the Travelling Salesperson Problem","date_updated":"2023-12-13T10:48:50Z","series_title":"GECCO’20","language":[{"iso":"eng"}],"doi":"10.1145/3377930.3389844","publication":"Proceedings of the Genetic and Evolutionary Computation Conference","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."}],"extern":"1","date_created":"2023-11-14T15:58:58Z","department":[{"_id":"819"}],"keyword":["diversity maximisation","evolutionary algorithms","travelling salesperson problem"],"type":"conference"},{"status":"public","_id":"48895","publisher":"Association for Computing Machinery","page":"551–559","user_id":"102979","citation":{"mla":"Roostapour, Vahid, et al. “Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem.” <i>Proceedings of the 2020 Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2020, pp. 551–559, doi:<a href=\"https://doi.org/10.1145/3377930.3390168\">10.1145/3377930.3390168</a>.","bibtex":"@inproceedings{Roostapour_Bossek_Neumann_2020, place={New York, NY, USA}, series={{GECCO} ’20}, title={Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem}, DOI={<a href=\"https://doi.org/10.1145/3377930.3390168\">10.1145/3377930.3390168</a>}, booktitle={Proceedings of the 2020 Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Roostapour, Vahid and Bossek, Jakob and Neumann, Frank}, year={2020}, pages={551–559}, collection={{GECCO} ’20} }","ama":"Roostapour V, Bossek J, Neumann F. Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem. In: <i>Proceedings of the 2020 Genetic and Evolutionary Computation Conference</i>. {GECCO} ’20. Association for Computing Machinery; 2020:551–559. doi:<a href=\"https://doi.org/10.1145/3377930.3390168\">10.1145/3377930.3390168</a>","ieee":"V. Roostapour, J. Bossek, and F. Neumann, “Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem,” in <i>Proceedings of the 2020 Genetic and Evolutionary Computation Conference</i>, 2020, pp. 551–559, doi: <a href=\"https://doi.org/10.1145/3377930.3390168\">10.1145/3377930.3390168</a>.","apa":"Roostapour, V., Bossek, J., &#38; Neumann, F. (2020). Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem. <i>Proceedings of the 2020 Genetic and Evolutionary Computation Conference</i>, 551–559. <a href=\"https://doi.org/10.1145/3377930.3390168\">https://doi.org/10.1145/3377930.3390168</a>","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.","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>."},"place":"New York, NY, USA","publication_identifier":{"isbn":["978-1-4503-7128-5"]},"author":[{"full_name":"Roostapour, Vahid","first_name":"Vahid","last_name":"Roostapour"},{"full_name":"Bossek, Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668","first_name":"Jakob","id":"102979"},{"full_name":"Neumann, Frank","first_name":"Frank","last_name":"Neumann"}],"year":"2020","title":"Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem","date_updated":"2023-12-13T10:49:38Z","series_title":"{GECCO} ’20","language":[{"iso":"eng"}],"doi":"10.1145/3377930.3390168","publication":"Proceedings of the 2020 Genetic and Evolutionary Computation Conference","abstract":[{"lang":"eng","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."}],"extern":"1","date_created":"2023-11-14T15:59:00Z","department":[{"_id":"819"}],"keyword":["biased mutation","evolutionary algorithms","minimum spanning tree problem","runtime analysis"],"type":"conference"},{"user_id":"102979","page":"48–64","_id":"48897","publisher":"Springer-Verlag","status":"public","place":"Berlin, Heidelberg","citation":{"mla":"Seiler, Moritz, et al. “Deep Learning as a Competitive Feature-Free Approach for Automated Algorithm Selection on the Traveling Salesperson Problem.” <i>Parallel Problem Solving from {Nature} (PPSN XVI)</i>, Springer-Verlag, 2020, pp. 48–64, doi:<a href=\"https://doi.org/10.1007/978-3-030-58112-1_4\">10.1007/978-3-030-58112-1_4</a>.","apa":"Seiler, M., Pohl, J., Bossek, J., Kerschke, P., &#38; Trautmann, H. (2020). Deep Learning as a Competitive Feature-Free Approach for Automated Algorithm Selection on the Traveling Salesperson Problem. <i>Parallel Problem Solving from {Nature} (PPSN XVI)</i>, 48–64. <a href=\"https://doi.org/10.1007/978-3-030-58112-1_4\">https://doi.org/10.1007/978-3-030-58112-1_4</a>","ieee":"M. Seiler, J. Pohl, J. Bossek, P. Kerschke, and H. Trautmann, “Deep Learning as a Competitive Feature-Free Approach for Automated Algorithm Selection on the Traveling Salesperson Problem,” in <i>Parallel Problem Solving from {Nature} (PPSN XVI)</i>, 2020, pp. 48–64, doi: <a href=\"https://doi.org/10.1007/978-3-030-58112-1_4\">10.1007/978-3-030-58112-1_4</a>.","chicago":"Seiler, Moritz, Janina Pohl, Jakob Bossek, Pascal Kerschke, and Heike Trautmann. “Deep Learning as a Competitive Feature-Free Approach for Automated Algorithm Selection on the Traveling Salesperson Problem.” In <i>Parallel Problem Solving from {Nature} (PPSN XVI)</i>, 48–64. Berlin, Heidelberg: Springer-Verlag, 2020. <a href=\"https://doi.org/10.1007/978-3-030-58112-1_4\">https://doi.org/10.1007/978-3-030-58112-1_4</a>.","ama":"Seiler M, Pohl J, Bossek J, Kerschke P, Trautmann H. Deep Learning as a Competitive Feature-Free Approach for Automated Algorithm Selection on the Traveling Salesperson Problem. In: <i>Parallel Problem Solving from {Nature} (PPSN XVI)</i>. Springer-Verlag; 2020:48–64. doi:<a href=\"https://doi.org/10.1007/978-3-030-58112-1_4\">10.1007/978-3-030-58112-1_4</a>","short":"M. Seiler, J. Pohl, J. Bossek, P. Kerschke, H. Trautmann, in: Parallel Problem Solving from {Nature} (PPSN XVI), Springer-Verlag, Berlin, Heidelberg, 2020, pp. 48–64.","bibtex":"@inproceedings{Seiler_Pohl_Bossek_Kerschke_Trautmann_2020, place={Berlin, Heidelberg}, title={Deep Learning as a Competitive Feature-Free Approach for Automated Algorithm Selection on the Traveling Salesperson Problem}, DOI={<a href=\"https://doi.org/10.1007/978-3-030-58112-1_4\">10.1007/978-3-030-58112-1_4</a>}, booktitle={Parallel Problem Solving from {Nature} (PPSN XVI)}, publisher={Springer-Verlag}, author={Seiler, Moritz and Pohl, Janina and Bossek, Jakob and Kerschke, Pascal and Trautmann, Heike}, year={2020}, pages={48–64} }"},"doi":"10.1007/978-3-030-58112-1_4","language":[{"iso":"eng"}],"date_updated":"2023-12-13T10:49:45Z","title":"Deep Learning as a Competitive Feature-Free Approach for Automated Algorithm Selection on the Traveling Salesperson Problem","year":"2020","publication_identifier":{"isbn":["978-3-030-58111-4"]},"author":[{"last_name":"Seiler","first_name":"Moritz","full_name":"Seiler, Moritz"},{"last_name":"Pohl","first_name":"Janina","full_name":"Pohl, Janina"},{"id":"102979","full_name":"Bossek, Jakob","first_name":"Jakob","orcid":"0000-0002-4121-4668","last_name":"Bossek"},{"full_name":"Kerschke, Pascal","last_name":"Kerschke","first_name":"Pascal"},{"last_name":"Trautmann","first_name":"Heike","full_name":"Trautmann, Heike"}],"keyword":["Automated algorithm selection","Deep learning","Feature-based approaches","Traveling Salesperson Problem"],"type":"conference","department":[{"_id":"819"}],"date_created":"2023-11-14T15:59:00Z","extern":"1","abstract":[{"text":"In this work we focus on the well-known Euclidean Traveling Salesperson Problem (TSP) and two highly competitive inexact heuristic TSP solvers, EAX and LKH, in the context of per-instance algorithm selection (AS). We evolve instances with nodes where the solvers show strongly different performance profiles. These instances serve as a basis for an exploratory study on the identification of well-discriminating problem characteristics (features). Our results in a nutshell: we show that even though (1) promising features exist, (2) these are in line with previous results from the literature, and (3) models trained with these features are more accurate than models adopting sophisticated feature selection methods, the advantage is not close to the virtual best solver in terms of penalized average runtime and so is the performance gain over the single best solver. However, we show that a feature-free deep neural network based approach solely based on visual representation of the instances already matches classical AS model results and thus shows huge potential for future studies.","lang":"eng"}],"publication":"Parallel Problem Solving from {Nature} (PPSN XVI)"}]