[{"doi":"10.1145/3377930.3390146","title":"Dynamic Bi-Objective Routing of Multiple Vehicles","date_created":"2023-11-14T15:58:52Z","author":[{"orcid":"0000-0002-4121-4668","last_name":"Bossek","full_name":"Bossek, Jakob","id":"102979","first_name":"Jakob"},{"last_name":"Grimme","full_name":"Grimme, Christian","first_name":"Christian"},{"first_name":"Heike","last_name":"Trautmann","full_name":"Trautmann, Heike"}],"date_updated":"2023-12-13T10:43:24Z","publisher":"Association for Computing Machinery","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>","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} }","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.","ieee":"J. Bossek, C. Grimme, and H. Trautmann, “Dynamic Bi-Objective Routing of Multiple Vehicles,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2020, pp. 166–174, doi: <a href=\"https://doi.org/10.1145/3377930.3390146\">10.1145/3377930.3390146</a>.","chicago":"Bossek, Jakob, Christian Grimme, and Heike Trautmann. “Dynamic Bi-Objective Routing of Multiple Vehicles.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 166–174. GECCO ’20. New York, NY, USA: Association for Computing Machinery, 2020. <a href=\"https://doi.org/10.1145/3377930.3390146\">https://doi.org/10.1145/3377930.3390146</a>.","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","place":"New York, NY, USA","year":"2020","publication_status":"published","publication_identifier":{"isbn":["978-1-4503-7128-5"]},"language":[{"iso":"eng"}],"extern":"1","keyword":["decision making","dynamic optimization","evolutionary algorithms","multi-objective optimization","vehicle routing"],"user_id":"102979","series_title":"GECCO ’20","department":[{"_id":"819"}],"_id":"48845","status":"public","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"}],"type":"conference","publication":"Proceedings of the Genetic and Evolutionary Computation Conference"},{"user_id":"102979","department":[{"_id":"819"}],"_id":"48844","language":[{"iso":"eng"}],"extern":"1","type":"conference","publication":"2020 IEEE Congress on Evolutionary Computation (CEC)","status":"public","abstract":[{"text":"The Traveling-Salesperson-Problem (TSP) is arguably one of the best-known NP-hard combinatorial optimization problems. The two sophisticated heuristic solvers LKH and EAX and respective (restart) variants manage to calculate close-to optimal or even optimal solutions, also for large instances with several thousand nodes in reasonable time. In this work we extend existing benchmarking studies by addressing anytime behaviour of inexact TSP solvers based on empirical runtime distributions leading to an increased understanding of solver behaviour and the respective relation to problem hardness. It turns out that performance ranking of solvers is highly dependent on the focused approximation quality. Insights on intersection points of performances offer huge potential for the construction of hybridized solvers depending on instance features. Moreover, instance features tailored to anytime performance and corresponding performance indicators will highly improve automated algorithm selection models by including comprehensive information on solver quality.","lang":"eng"}],"author":[{"last_name":"Bossek","orcid":"0000-0002-4121-4668","id":"102979","full_name":"Bossek, Jakob","first_name":"Jakob"},{"first_name":"Pascal","last_name":"Kerschke","full_name":"Kerschke, Pascal"},{"first_name":"Heike","full_name":"Trautmann, Heike","last_name":"Trautmann"}],"date_created":"2023-11-14T15:58:52Z","publisher":"IEEE Press","date_updated":"2023-12-13T10:43:16Z","doi":"10.1109/CEC48606.2020.9185613","title":"Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection","publication_status":"published","citation":{"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>","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>.","short":"J. Bossek, P. Kerschke, H. Trautmann, in: 2020 IEEE Congress on Evolutionary Computation (CEC), IEEE Press, Glasgow, United Kingdom, 2020, pp. 1–8.","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>.","bibtex":"@inproceedings{Bossek_Kerschke_Trautmann_2020, place={Glasgow, United Kingdom}, title={Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection}, DOI={<a href=\"https://doi.org/10.1109/CEC48606.2020.9185613\">10.1109/CEC48606.2020.9185613</a>}, booktitle={2020 IEEE Congress on Evolutionary Computation (CEC)}, publisher={IEEE Press}, author={Bossek, Jakob and Kerschke, Pascal and Trautmann, Heike}, year={2020}, pages={1–8} }","apa":"Bossek, J., Kerschke, P., &#38; Trautmann, H. (2020). Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection. <i>2020 IEEE Congress on Evolutionary Computation (CEC)</i>, 1–8. <a href=\"https://doi.org/10.1109/CEC48606.2020.9185613\">https://doi.org/10.1109/CEC48606.2020.9185613</a>"},"page":"1–8","place":"Glasgow, United Kingdom","year":"2020"},{"year":"2020","title":"Initial Design Strategies and Their Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB","date_created":"2023-11-14T15:58:53Z","publisher":"Association for Computing Machinery","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."}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference","language":[{"iso":"eng"}],"keyword":["continuous black-box optimization","design of experiments","initial design","sequential model-based optimization"],"citation":{"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.","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>","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>","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>."},"page":"778–786","place":"New York, NY, USA","publication_status":"published","publication_identifier":{"isbn":["978-1-4503-7128-5"]},"doi":"10.1145/3377930.3390155","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"},{"full_name":"Kerschke, Pascal","last_name":"Kerschke","first_name":"Pascal"}],"date_updated":"2023-12-13T10:44:01Z","status":"public","type":"conference","extern":"1","user_id":"102979","series_title":"GECCO ’20","department":[{"_id":"819"}],"_id":"48850"},{"citation":{"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>","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>.","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} }","short":"J. Bossek, A. Neumann, F. Neumann, in: Parallel Problem Solving from Nature (PPSN XVI), Springer-Verlag, Berlin, Heidelberg, 2020, pp. 346–359.","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>","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>.","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>."},"page":"346–359","place":"Berlin, Heidelberg","year":"2020","publication_status":"published","publication_identifier":{"isbn":["978-3-030-58111-4"]},"doi":"10.1007/978-3-030-58112-1_24","title":"Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of Solutions","date_created":"2023-11-14T15:58:54Z","author":[{"first_name":"Jakob","full_name":"Bossek, Jakob","id":"102979","orcid":"0000-0002-4121-4668","last_name":"Bossek"},{"full_name":"Neumann, Aneta","last_name":"Neumann","first_name":"Aneta"},{"full_name":"Neumann, Frank","last_name":"Neumann","first_name":"Frank"}],"date_updated":"2023-12-13T10:44:54Z","publisher":"Springer-Verlag","status":"public","abstract":[{"lang":"eng","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."}],"type":"conference","publication":"Parallel Problem Solving from Nature (PPSN XVI)","extern":"1","language":[{"iso":"eng"}],"keyword":["Evolutionary algorithms","Node weight dependent TSP","Traveling Thief Problem"],"user_id":"102979","department":[{"_id":"819"}],"_id":"48852"},{"extern":"1","language":[{"iso":"eng"}],"_id":"48846","department":[{"_id":"819"}],"user_id":"102979","abstract":[{"lang":"eng","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."}],"status":"public","publication":"2020 IEEE Congress on Evolutionary Computation (CEC)","type":"conference","title":"Towards Decision Support in Dynamic Bi-Objective Vehicle Routing","doi":"10.1109/CEC48606.2020.9185778","publisher":"IEEE Press","date_updated":"2023-12-13T10:44:17Z","author":[{"first_name":"Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668","full_name":"Bossek, Jakob","id":"102979"},{"first_name":"Christian","full_name":"Grimme, Christian","last_name":"Grimme"},{"full_name":"Rudolph, Günter","last_name":"Rudolph","first_name":"Günter"},{"first_name":"Heike","full_name":"Trautmann, Heike","last_name":"Trautmann"}],"date_created":"2023-11-14T15:58:53Z","year":"2020","place":"Glasgow, United Kingdom","page":"1–8","citation":{"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>.","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.","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} }","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>","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>","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>.","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>."},"publication_status":"published"},{"status":"public","type":"conference","extern":"1","_id":"48879","user_id":"102979","series_title":"GECCO’20","department":[{"_id":"819"}],"place":"New York, NY, USA","citation":{"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.","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} }","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>","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>","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>."},"page":"681–689","publication_identifier":{"isbn":["978-1-4503-7128-5"]},"doi":"10.1145/3377930.3389844","date_updated":"2023-12-13T10:48:50Z","author":[{"last_name":"Do","full_name":"Do, Anh Viet","first_name":"Anh Viet"},{"first_name":"Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668","full_name":"Bossek, Jakob","id":"102979"},{"full_name":"Neumann, Aneta","last_name":"Neumann","first_name":"Aneta"},{"last_name":"Neumann","full_name":"Neumann, Frank","first_name":"Frank"}],"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","keyword":["diversity maximisation","evolutionary algorithms","travelling salesperson problem"],"language":[{"iso":"eng"}],"year":"2020","title":"Evolving Diverse Sets of Tours for the Travelling Salesperson Problem","publisher":"Association for Computing Machinery","date_created":"2023-11-14T15:58:58Z"},{"publisher":"Association for Computing Machinery","date_updated":"2023-12-13T10:49:38Z","date_created":"2023-11-14T15:59:00Z","author":[{"full_name":"Roostapour, Vahid","last_name":"Roostapour","first_name":"Vahid"},{"first_name":"Jakob","full_name":"Bossek, Jakob","id":"102979","orcid":"0000-0002-4121-4668","last_name":"Bossek"},{"first_name":"Frank","full_name":"Neumann, Frank","last_name":"Neumann"}],"title":"Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem","doi":"10.1145/3377930.3390168","publication_identifier":{"isbn":["978-1-4503-7128-5"]},"year":"2020","place":"New York, NY, USA","citation":{"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>.","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>.","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>."},"page":"551–559","_id":"48895","series_title":"{GECCO} ’20","user_id":"102979","department":[{"_id":"819"}],"keyword":["biased mutation","evolutionary algorithms","minimum spanning tree problem","runtime analysis"],"language":[{"iso":"eng"}],"extern":"1","type":"conference","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."}],"status":"public"},{"publisher":"Springer-Verlag","date_updated":"2023-12-13T10:49:45Z","author":[{"last_name":"Seiler","full_name":"Seiler, Moritz","first_name":"Moritz"},{"full_name":"Pohl, Janina","last_name":"Pohl","first_name":"Janina"},{"id":"102979","full_name":"Bossek, Jakob","orcid":"0000-0002-4121-4668","last_name":"Bossek","first_name":"Jakob"},{"full_name":"Kerschke, Pascal","last_name":"Kerschke","first_name":"Pascal"},{"first_name":"Heike","last_name":"Trautmann","full_name":"Trautmann, Heike"}],"date_created":"2023-11-14T15:59:00Z","title":"Deep Learning as a Competitive Feature-Free Approach for Automated Algorithm Selection on the Traveling Salesperson Problem","doi":"10.1007/978-3-030-58112-1_4","publication_identifier":{"isbn":["978-3-030-58111-4"]},"place":"Berlin, Heidelberg","year":"2020","citation":{"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>","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} }","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>.","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>","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>.","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>."},"page":"48–64","_id":"48897","user_id":"102979","department":[{"_id":"819"}],"keyword":["Automated algorithm selection","Deep learning","Feature-based approaches","Traveling Salesperson Problem"],"extern":"1","language":[{"iso":"eng"}],"type":"conference","publication":"Parallel Problem Solving from {Nature} (PPSN XVI)","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"}],"status":"public"},{"citation":{"apa":"Bossek, J., Kerschke, P., &#38; Trautmann, H. (2020). A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms. <i>Applied Soft Computing</i>, <i>88</i>(C). <a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">https://doi.org/10.1016/j.asoc.2019.105901</a>","bibtex":"@article{Bossek_Kerschke_Trautmann_2020, title={A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms}, volume={88}, DOI={<a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">10.1016/j.asoc.2019.105901</a>}, number={C}, journal={Applied Soft Computing}, author={Bossek, Jakob and Kerschke, Pascal and Trautmann, Heike}, year={2020} }","short":"J. Bossek, P. Kerschke, H. Trautmann, Applied Soft Computing 88 (2020).","mla":"Bossek, Jakob, et al. “A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms.” <i>Applied Soft Computing</i>, vol. 88, no. C, 2020, doi:<a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">10.1016/j.asoc.2019.105901</a>.","ama":"Bossek J, Kerschke P, Trautmann H. A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms. <i>Applied Soft Computing</i>. 2020;88(C). doi:<a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">10.1016/j.asoc.2019.105901</a>","ieee":"J. Bossek, P. Kerschke, and H. Trautmann, “A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms,” <i>Applied Soft Computing</i>, vol. 88, no. C, 2020, doi: <a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">10.1016/j.asoc.2019.105901</a>.","chicago":"Bossek, Jakob, Pascal Kerschke, and Heike Trautmann. “A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms.” <i>Applied Soft Computing</i> 88, no. C (2020). <a href=\"https://doi.org/10.1016/j.asoc.2019.105901\">https://doi.org/10.1016/j.asoc.2019.105901</a>."},"intvolume":"        88","year":"2020","issue":"C","publication_identifier":{"issn":["1568-4946"]},"doi":"10.1016/j.asoc.2019.105901","title":"A Multi-Objective Perspective on Performance Assessment and Automated Selection of Single-Objective Optimization Algorithms","date_created":"2023-11-14T15:58:53Z","author":[{"orcid":"0000-0002-4121-4668","last_name":"Bossek","id":"102979","full_name":"Bossek, Jakob","first_name":"Jakob"},{"full_name":"Kerschke, Pascal","last_name":"Kerschke","first_name":"Pascal"},{"full_name":"Trautmann, Heike","last_name":"Trautmann","first_name":"Heike"}],"volume":88,"date_updated":"2023-12-13T10:52:17Z","status":"public","abstract":[{"lang":"eng","text":"We build upon a recently proposed multi-objective view onto performance measurement of single-objective stochastic solvers. The trade-off between the fraction of failed runs and the mean runtime of successful runs \\textendash both to be minimized \\textendash is directly analyzed based on a study on algorithm selection of inexact state-of-the-art solvers for the famous Traveling Salesperson Problem (TSP). Moreover, we adopt the hypervolume indicator (HV) commonly used in multi-objective optimization for simultaneously assessing both conflicting objectives and investigate relations to commonly used performance indicators, both theoretically and empirically. Next to Penalized Average Runtime (PAR) and Penalized Quantile Runtime (PQR), the HV measure is used as a core concept within the construction of per-instance algorithm selection models offering interesting insights into complementary behavior of inexact TSP solvers. \\textbullet The multi-objective perspective is naturally generalizable to multiple objectives. \\textbullet Proof of relationship between HV and the PAR in the considered bi-objective space. \\textbullet New insights into complementary behavior of stochastic optimization algorithms."}],"type":"journal_article","publication":"Applied Soft Computing","language":[{"iso":"eng"}],"keyword":["Algorithm selection","Combinatorial optimization","Multi-objective optimization","Performance measurement","Traveling Salesperson Problem"],"user_id":"102979","department":[{"_id":"819"}],"_id":"48848"},{"language":[{"iso":"eng"}],"_id":"48836","user_id":"102979","department":[{"_id":"819"}],"status":"public","type":"journal_article","publication":"Corr","title":"Benchmarking in Optimization: Best Practice and Open Issues","date_updated":"2023-12-13T10:52:24Z","date_created":"2023-11-14T15:58:51Z","author":[{"last_name":"Bartz-Beielstein","full_name":"Bartz-Beielstein, Thomas","first_name":"Thomas"},{"first_name":"Carola","full_name":"Doerr, Carola","last_name":"Doerr"},{"first_name":"Daan","full_name":"van den Berg, Daan","last_name":"van den Berg"},{"full_name":"Bossek, Jakob","id":"102979","orcid":"0000-0002-4121-4668","last_name":"Bossek","first_name":"Jakob"},{"full_name":"Chandrasekaran, Sowmya","last_name":"Chandrasekaran","first_name":"Sowmya"},{"first_name":"Tome","full_name":"Eftimov, Tome","last_name":"Eftimov"},{"first_name":"Andreas","full_name":"Fischbach, Andreas","last_name":"Fischbach"},{"last_name":"Kerschke","full_name":"Kerschke, Pascal","first_name":"Pascal"},{"last_name":"Cava","full_name":"Cava, William La","first_name":"William La"},{"last_name":"Lopez-Ibanez","full_name":"Lopez-Ibanez, Manuel","first_name":"Manuel"},{"full_name":"Malan, Katherine M.","last_name":"Malan","first_name":"Katherine M."},{"full_name":"Moore, Jason H.","last_name":"Moore","first_name":"Jason H."},{"full_name":"Naujoks, Boris","last_name":"Naujoks","first_name":"Boris"},{"first_name":"Patryk","last_name":"Orzechowski","full_name":"Orzechowski, Patryk"},{"first_name":"Vanessa","full_name":"Volz, Vanessa","last_name":"Volz"},{"first_name":"Markus","full_name":"Wagner, Markus","last_name":"Wagner"},{"first_name":"Thomas","last_name":"Weise","full_name":"Weise, Thomas"}],"year":"2020","citation":{"apa":"Bartz-Beielstein, T., Doerr, C., van den Berg, D., Bossek, J., Chandrasekaran, S., Eftimov, T., Fischbach, A., Kerschke, P., Cava, W. L., Lopez-Ibanez, M., Malan, K. M., Moore, J. H., Naujoks, B., Orzechowski, P., Volz, V., Wagner, M., &#38; Weise, T. (2020). Benchmarking in Optimization: Best Practice and Open Issues. <i>Corr</i>.","mla":"Bartz-Beielstein, Thomas, et al. “Benchmarking in Optimization: Best Practice and Open Issues.” <i>Corr</i>, 2020.","short":"T. Bartz-Beielstein, C. Doerr, D. van den Berg, J. Bossek, S. Chandrasekaran, T. Eftimov, A. Fischbach, P. Kerschke, W.L. Cava, M. Lopez-Ibanez, K.M. Malan, J.H. Moore, B. Naujoks, P. Orzechowski, V. Volz, M. Wagner, T. Weise, Corr (2020).","bibtex":"@article{Bartz-Beielstein_Doerr_van den Berg_Bossek_Chandrasekaran_Eftimov_Fischbach_Kerschke_Cava_Lopez-Ibanez_et al._2020, title={Benchmarking in Optimization: Best Practice and Open Issues}, journal={Corr}, author={Bartz-Beielstein, Thomas and Doerr, Carola and van den Berg, Daan and Bossek, Jakob and Chandrasekaran, Sowmya and Eftimov, Tome and Fischbach, Andreas and Kerschke, Pascal and Cava, William La and Lopez-Ibanez, Manuel and et al.}, year={2020} }","ieee":"T. Bartz-Beielstein <i>et al.</i>, “Benchmarking in Optimization: Best Practice and Open Issues,” <i>Corr</i>, 2020.","chicago":"Bartz-Beielstein, Thomas, Carola Doerr, Daan van den Berg, Jakob Bossek, Sowmya Chandrasekaran, Tome Eftimov, Andreas Fischbach, et al. “Benchmarking in Optimization: Best Practice and Open Issues.” <i>Corr</i>, 2020.","ama":"Bartz-Beielstein T, Doerr C, van den Berg D, et al. Benchmarking in Optimization: Best Practice and Open Issues. <i>Corr</i>. Published online 2020."}},{"author":[{"first_name":"Daniel","last_name":"Fastlabend-Vargas","id":"23102","full_name":"Fastlabend-Vargas, Daniel"}],"date_created":"2023-12-13T13:19:41Z","oa":"1","date_updated":"2023-12-13T20:31:09Z","publisher":"Zwischentöne.info ","main_file_link":[{"open_access":"1","url":"https://www.zwischentoene.info/unterrichtseinheit/praesentation?tx_uemat_uemat%5Bunterrichtseinheit%5D=65&cHash=ea39aadf818de9c990c1f542ba84741b"}],"title":"Geschichte(n) der deutschen Migrationsgesellschaft. Jugendliche erzählen begründete historische Geschichten Eine Unterrichtsreihe für das Portal Zwischentöne.info ","publication_status":"published","citation":{"mla":"Fastlabend-Vargas, Daniel. <i>Geschichte(n) der deutschen Migrationsgesellschaft. Jugendliche erzählen begründete historische Geschichten Eine Unterrichtsreihe für das Portal Zwischentöne.info </i>. Zwischentöne.info , 2020.","bibtex":"@book{Fastlabend-Vargas_2020, place={Zwischentöne.info }, title={Geschichte(n) der deutschen Migrationsgesellschaft. Jugendliche erzählen begründete historische Geschichten Eine Unterrichtsreihe für das Portal Zwischentöne.info }, publisher={Zwischentöne.info }, author={Fastlabend-Vargas, Daniel}, year={2020} }","short":"D. Fastlabend-Vargas, Geschichte(n) der deutschen Migrationsgesellschaft. Jugendliche erzählen begründete historische Geschichten Eine Unterrichtsreihe für das Portal Zwischentöne.info , Zwischentöne.info , Zwischentöne.info , 2020.","apa":"Fastlabend-Vargas, D. (2020). <i>Geschichte(n) der deutschen Migrationsgesellschaft. Jugendliche erzählen begründete historische Geschichten Eine Unterrichtsreihe für das Portal Zwischentöne.info </i>. Zwischentöne.info .","ieee":"D. Fastlabend-Vargas, <i>Geschichte(n) der deutschen Migrationsgesellschaft. Jugendliche erzählen begründete historische Geschichten Eine Unterrichtsreihe für das Portal Zwischentöne.info </i>. Zwischentöne.info : Zwischentöne.info , 2020.","chicago":"Fastlabend-Vargas, Daniel. <i>Geschichte(n) der deutschen Migrationsgesellschaft. Jugendliche erzählen begründete historische Geschichten Eine Unterrichtsreihe für das Portal Zwischentöne.info </i>. Zwischentöne.info : Zwischentöne.info , 2020.","ama":"Fastlabend-Vargas D. <i>Geschichte(n) der deutschen Migrationsgesellschaft. Jugendliche erzählen begründete historische Geschichten Eine Unterrichtsreihe für das Portal Zwischentöne.info </i>. Zwischentöne.info ; 2020."},"year":"2020","place":"Zwischentöne.info ","user_id":"23102","department":[{"_id":"6"},{"_id":"444"}],"_id":"49599","language":[{"iso":"ger"}],"type":"misc","status":"public"},{"language":[{"iso":"eng"}],"user_id":"84580","_id":"30869","status":"public","type":"book","title":"Erinnerung und Identität: Literarische Konstruktionen in Doeschka Meijsings Prosa","author":[{"first_name":"Christina","last_name":"Lammer","full_name":"Lammer, Christina","id":"84580"}],"date_created":"2022-04-12T14:18:30Z","date_updated":"2023-12-14T18:32:38Z","publisher":"transcript Verlag","citation":{"mla":"Lammer, Christina. <i>Erinnerung Und Identität: Literarische Konstruktionen in Doeschka Meijsings Prosa</i>. transcript Verlag, 2020.","bibtex":"@book{Lammer_2020, title={Erinnerung und Identität: Literarische Konstruktionen in Doeschka Meijsings Prosa}, publisher={transcript Verlag}, author={Lammer, Christina}, year={2020} }","short":"C. Lammer, Erinnerung Und Identität: Literarische Konstruktionen in Doeschka Meijsings Prosa, transcript Verlag, 2020.","apa":"Lammer, C. (2020). <i>Erinnerung und Identität: Literarische Konstruktionen in Doeschka Meijsings Prosa</i>. transcript Verlag.","chicago":"Lammer, Christina. <i>Erinnerung Und Identität: Literarische Konstruktionen in Doeschka Meijsings Prosa</i>. transcript Verlag, 2020.","ieee":"C. Lammer, <i>Erinnerung und Identität: Literarische Konstruktionen in Doeschka Meijsings Prosa</i>. transcript Verlag, 2020.","ama":"Lammer C. <i>Erinnerung Und Identität: Literarische Konstruktionen in Doeschka Meijsings Prosa</i>. transcript Verlag; 2020."},"year":"2020"},{"publication_status":"published","year":"2020","citation":{"apa":"Huybrechts, Y. (2020). <i>“Die Bombardierung von Brüssel - teil 1” (PODCAST)</i>. BelgienNet.","short":"Y. Huybrechts, “Die Bombardierung von Brüssel - teil 1” (PODCAST), BelgienNet, 2020.","bibtex":"@book{Huybrechts_2020, title={“Die Bombardierung von Brüssel - teil 1” (PODCAST)}, publisher={BelgienNet}, author={Huybrechts, Yves}, year={2020} }","mla":"Huybrechts, Yves. <i>“Die Bombardierung von Brüssel - teil 1” (PODCAST)</i>. BelgienNet, 2020.","ama":"Huybrechts Y. <i>“Die Bombardierung von Brüssel - teil 1” (PODCAST)</i>. BelgienNet; 2020.","ieee":"Y. Huybrechts, <i>“Die Bombardierung von Brüssel - teil 1” (PODCAST)</i>. BelgienNet, 2020.","chicago":"Huybrechts, Yves. <i>“Die Bombardierung von Brüssel - teil 1” (PODCAST)</i>. BelgienNet, 2020."},"date_updated":"2023-12-18T10:08:13Z","publisher":"BelgienNet","oa":"1","date_created":"2023-12-18T10:02:47Z","author":[{"first_name":"Yves","full_name":"Huybrechts, Yves","id":"78579","orcid":"0009-0009-2166-9794","last_name":"Huybrechts"}],"title":"\"Die Bombardierung von Brüssel - teil 1\" (PODCAST)","main_file_link":[{"url":"https://belgien.net/die-bombardierung-von-bruessel-teil-1/","open_access":"1"}],"type":"misc","status":"public","_id":"49767","department":[{"_id":"448"}],"user_id":"78579","language":[{"iso":"ger"},{"iso":"fre"}]},{"department":[{"_id":"446"}],"user_id":"78579","_id":"49736","language":[{"iso":"ger"}],"publication":"Historisches Jahrbuch","type":"journal_article","status":"public","volume":140,"author":[{"first_name":"Yves","id":"78579","full_name":"Huybrechts, Yves","orcid":"0009-0009-2166-9794","last_name":"Huybrechts"}],"date_created":"2023-12-18T09:15:32Z","date_updated":"2023-12-18T10:09:05Z","title":"Den Kaiser erpressen. Der Fall Jever zwischen Burgundischem Reichskreis und Reichskammergericht, 1737-1739","publication_identifier":{"issn":["00182621"],"isbn":["9783451032967"]},"publication_status":"published","page":"420-445","intvolume":"       140","citation":{"ama":"Huybrechts Y. Den Kaiser erpressen. Der Fall Jever zwischen Burgundischem Reichskreis und Reichskammergericht, 1737-1739. <i>Historisches Jahrbuch</i>. 2020;140:420-445.","ieee":"Y. Huybrechts, “Den Kaiser erpressen. Der Fall Jever zwischen Burgundischem Reichskreis und Reichskammergericht, 1737-1739,” <i>Historisches Jahrbuch</i>, vol. 140, pp. 420–445, 2020.","chicago":"Huybrechts, Yves. “Den Kaiser erpressen. Der Fall Jever zwischen Burgundischem Reichskreis und Reichskammergericht, 1737-1739.” <i>Historisches Jahrbuch</i> 140 (2020): 420–45.","mla":"Huybrechts, Yves. “Den Kaiser erpressen. Der Fall Jever zwischen Burgundischem Reichskreis und Reichskammergericht, 1737-1739.” <i>Historisches Jahrbuch</i>, vol. 140, 2020, pp. 420–45.","bibtex":"@article{Huybrechts_2020, title={Den Kaiser erpressen. Der Fall Jever zwischen Burgundischem Reichskreis und Reichskammergericht, 1737-1739}, volume={140}, journal={Historisches Jahrbuch}, author={Huybrechts, Yves}, year={2020}, pages={420–445} }","short":"Y. Huybrechts, Historisches Jahrbuch 140 (2020) 420–445.","apa":"Huybrechts, Y. (2020). Den Kaiser erpressen. Der Fall Jever zwischen Burgundischem Reichskreis und Reichskammergericht, 1737-1739. <i>Historisches Jahrbuch</i>, <i>140</i>, 420–445."},"year":"2020"},{"type":"misc","status":"public","_id":"49756","user_id":"78579","department":[{"_id":"448"}],"language":[{"iso":"dut"}],"publication_status":"published","year":"2020","citation":{"ieee":"Y. Huybrechts, <i>“Ein Gespräch mit Guy Vanhengel - Ein Gespräch mit dem Vizepräsidenten des Brüsseler Parlaments, in zwei Teilen.” (VIDEO)</i>. BelgienNet, 2020.","chicago":"Huybrechts, Yves. <i>“Ein Gespräch mit Guy Vanhengel - Ein Gespräch mit dem Vizepräsidenten des Brüsseler Parlaments, in zwei Teilen.” (VIDEO)</i>. BelgienNet, 2020.","ama":"Huybrechts Y. <i>“Ein Gespräch mit Guy Vanhengel - Ein Gespräch mit dem Vizepräsidenten des Brüsseler Parlaments, in zwei Teilen.” (VIDEO)</i>. BelgienNet; 2020.","mla":"Huybrechts, Yves. <i>“Ein Gespräch mit Guy Vanhengel - Ein Gespräch mit dem Vizepräsidenten des Brüsseler Parlaments, in zwei Teilen.” (VIDEO)</i>. BelgienNet, 2020.","bibtex":"@book{Huybrechts_2020, title={“Ein Gespräch mit Guy Vanhengel - Ein Gespräch mit dem Vizepräsidenten des Brüsseler Parlaments, in zwei Teilen.” (VIDEO)}, publisher={BelgienNet}, author={Huybrechts, Yves}, year={2020} }","short":"Y. Huybrechts, “Ein Gespräch mit Guy Vanhengel - Ein Gespräch mit dem Vizepräsidenten des Brüsseler Parlaments, in zwei Teilen.” (VIDEO), BelgienNet, 2020.","apa":"Huybrechts, Y. (2020). <i>“Ein Gespräch mit Guy Vanhengel - Ein Gespräch mit dem Vizepräsidenten des Brüsseler Parlaments, in zwei Teilen.” (VIDEO)</i>. BelgienNet."},"date_updated":"2023-12-18T10:08:33Z","publisher":"BelgienNet","oa":"1","date_created":"2023-12-18T09:48:13Z","author":[{"full_name":"Huybrechts, Yves","id":"78579","last_name":"Huybrechts","orcid":"0009-0009-2166-9794","first_name":"Yves"}],"title":"\"Ein Gespräch mit Guy Vanhengel - Ein Gespräch mit dem Vizepräsidenten des Brüsseler Parlaments, in zwei Teilen.\" (VIDEO)","main_file_link":[{"open_access":"1","url":"https://belgien.net/ein-gespraech-mit-guy-vanhengel/"}]},{"language":[{"iso":"ger"}],"department":[{"_id":"448"}],"user_id":"78579","_id":"49750","status":"public","type":"misc","main_file_link":[{"url":"https://belgien.net/interview-rubens-und-barock-im-norden/","open_access":"1"}],"title":"Interview zur Ausstellung \"Rubens und der Barock im Norden\" - 2 Teile (VIDEO)","author":[{"first_name":"Yves","full_name":"Huybrechts, Yves","id":"78579","last_name":"Huybrechts","orcid":"0009-0009-2166-9794"}],"date_created":"2023-12-18T09:41:06Z","publisher":"BelgienNet","date_updated":"2023-12-18T10:08:45Z","oa":"1","citation":{"ama":"Huybrechts Y. <i>Interview zur Ausstellung “Rubens und der Barock im Norden” - 2 Teile (VIDEO)</i>. BelgienNet; 2020.","ieee":"Y. Huybrechts, <i>Interview zur Ausstellung “Rubens und der Barock im Norden” - 2 Teile (VIDEO)</i>. BelgienNet, 2020.","chicago":"Huybrechts, Yves. <i>Interview zur Ausstellung “Rubens und der Barock im Norden” - 2 Teile (VIDEO)</i>. BelgienNet, 2020.","apa":"Huybrechts, Y. (2020). <i>Interview zur Ausstellung “Rubens und der Barock im Norden” - 2 Teile (VIDEO)</i>. BelgienNet.","mla":"Huybrechts, Yves. <i>Interview zur Ausstellung “Rubens und der Barock im Norden” - 2 Teile (VIDEO)</i>. BelgienNet, 2020.","bibtex":"@book{Huybrechts_2020, title={Interview zur Ausstellung “Rubens und der Barock im Norden” - 2 Teile (VIDEO)}, publisher={BelgienNet}, author={Huybrechts, Yves}, year={2020} }","short":"Y. Huybrechts, Interview zur Ausstellung “Rubens und der Barock im Norden” - 2 Teile (VIDEO), BelgienNet, 2020."},"year":"2020","publication_status":"published"},{"_id":"49831","user_id":"49513","language":[{"iso":"eng"}],"publication":"Forcierte Form: Deutschsprachige Versepik des 20. und 21. Jahrhunderts im europäischen Kontext","type":"book_chapter","editor":[{"last_name":"Bremer","full_name":"Bremer, Kai","first_name":"Kai"},{"first_name":"Stefan","full_name":"Elit, Stefan","last_name":"Elit"},{"last_name":"Kroucheva","full_name":"Kroucheva, Katerina","first_name":"Katerina"}],"status":"public","publisher":"Metzler","date_updated":"2023-12-19T09:05:26Z","author":[{"first_name":"Alena","id":"49513","full_name":"Diedrich, Alena","last_name":"Diedrich"}],"date_created":"2023-12-19T08:56:02Z","title":"Ironie als forcierte Form. Hans Magnus Enzensbergers Versepos Der Untergang der Titanic","year":"2020","citation":{"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.","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.","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.","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} }","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."}},{"citation":{"bibtex":"@inbook{Diedrich_2020, title={Lyrik im Vormärz}, booktitle={Handbuch Vormärz}, publisher={Aisthesis}, author={Diedrich, Alena}, editor={Eke, Norbert Otto }, year={2020} }","short":"A. Diedrich, in: N.O. Eke (Ed.), Handbuch Vormärz, Aisthesis, 2020.","mla":"Diedrich, Alena. “Lyrik Im Vormärz.” <i>Handbuch Vormärz</i>, edited by Norbert Otto  Eke, Aisthesis, 2020.","ama":"Diedrich A. Lyrik im Vormärz. In: Eke NO, ed. <i>Handbuch Vormärz</i>. Aisthesis; 2020.","apa":"Diedrich, A. (2020). Lyrik im Vormärz. In N. O. Eke (Ed.), <i>Handbuch Vormärz</i>. Aisthesis.","chicago":"Diedrich, Alena. “Lyrik Im Vormärz.” In <i>Handbuch Vormärz</i>, edited by Norbert Otto  Eke. Aisthesis, 2020.","ieee":"A. Diedrich, “Lyrik im Vormärz,” in <i>Handbuch Vormärz</i>, N. O. Eke, Ed. Aisthesis, 2020."},"year":"2020","date_created":"2023-12-19T08:57:06Z","author":[{"first_name":"Alena","last_name":"Diedrich","full_name":"Diedrich, Alena","id":"49513"}],"date_updated":"2023-12-19T09:05:31Z","publisher":"Aisthesis","title":"Lyrik im Vormärz","type":"book_chapter","publication":"Handbuch Vormärz","status":"public","editor":[{"first_name":"Norbert Otto ","last_name":"Eke","full_name":"Eke, Norbert Otto "}],"user_id":"49513","_id":"49832","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"_id":"49833","user_id":"49513","editor":[{"first_name":"Norbert Otto ","last_name":"Eke","full_name":"Eke, Norbert Otto "}],"status":"public","publication":"Handbuch Vormärz","type":"book_chapter","title":"Nikolaus Lenau","publisher":"Aisthesis","date_updated":"2023-12-19T09:05:36Z","date_created":"2023-12-19T08:57:52Z","author":[{"last_name":"Diedrich","full_name":"Diedrich, Alena","id":"49513","first_name":"Alena"}],"year":"2020","citation":{"ama":"Diedrich A. Nikolaus Lenau. In: Eke NO, ed. <i>Handbuch Vormärz</i>. Aisthesis; 2020.","chicago":"Diedrich, Alena. “Nikolaus Lenau.” In <i>Handbuch Vormärz</i>, edited by Norbert Otto  Eke. Aisthesis, 2020.","ieee":"A. Diedrich, “Nikolaus Lenau,” in <i>Handbuch Vormärz</i>, N. O. Eke, Ed. Aisthesis, 2020.","apa":"Diedrich, A. (2020). Nikolaus Lenau. In N. O. Eke (Ed.), <i>Handbuch Vormärz</i>. Aisthesis.","mla":"Diedrich, Alena. “Nikolaus Lenau.” <i>Handbuch Vormärz</i>, edited by Norbert Otto  Eke, Aisthesis, 2020.","short":"A. Diedrich, in: N.O. Eke (Ed.), Handbuch Vormärz, Aisthesis, 2020.","bibtex":"@inbook{Diedrich_2020, title={Nikolaus Lenau}, booktitle={Handbuch Vormärz}, publisher={Aisthesis}, author={Diedrich, Alena}, editor={Eke, Norbert Otto }, year={2020} }"}},{"publication_identifier":{"issn":["1424-3636"]},"publication_status":"published","year":"2020","page":"299-312","citation":{"chicago":"Neiske, Iris, and Diana Bücker. “Medienpädagogik und Hochschuldidaktik.” In <i>Medienpädagogik als Schlüsseldisziplin in einer mediatisierten Welt. Perspektiven aus Theorie, Empirie und Praxis 37</i>, 299–312, 2020.","ieee":"I. Neiske and D. Bücker, “Medienpädagogik und Hochschuldidaktik,” in <i>Medienpädagogik als Schlüsseldisziplin in einer mediatisierten Welt. Perspektiven aus Theorie, Empirie und Praxis 37</i>, 2020, pp. 299–312.","ama":"Neiske I, Bücker D. Medienpädagogik und Hochschuldidaktik. In: <i>Medienpädagogik als Schlüsseldisziplin in einer mediatisierten Welt. Perspektiven aus Theorie, Empirie und Praxis 37</i>. ; 2020:299-312.","mla":"Neiske, Iris, and Diana Bücker. “Medienpädagogik und Hochschuldidaktik.” <i>Medienpädagogik als Schlüsseldisziplin in einer mediatisierten Welt. Perspektiven aus Theorie, Empirie und Praxis 37</i>, 2020, pp. 299–312.","bibtex":"@inbook{Neiske_Bücker_2020, title={Medienpädagogik und Hochschuldidaktik}, booktitle={Medienpädagogik als Schlüsseldisziplin in einer mediatisierten Welt. Perspektiven aus Theorie, Empirie und Praxis 37}, author={Neiske, Iris and Bücker, Diana}, year={2020}, pages={299–312} }","short":"I. Neiske, D. Bücker, in: Medienpädagogik als Schlüsseldisziplin in einer mediatisierten Welt. Perspektiven aus Theorie, Empirie und Praxis 37, 2020, pp. 299–312.","apa":"Neiske, I., &#38; Bücker, D. (2020). Medienpädagogik und Hochschuldidaktik. In <i>Medienpädagogik als Schlüsseldisziplin in einer mediatisierten Welt. Perspektiven aus Theorie, Empirie und Praxis 37</i> (pp. 299–312)."},"date_updated":"2023-12-19T13:12:21Z","oa":"1","author":[{"first_name":"Iris","last_name":"Neiske","id":"53827","full_name":"Neiske, Iris"},{"last_name":"Bücker","full_name":"Bücker, Diana","first_name":"Diana"}],"date_created":"2023-12-19T13:12:11Z","title":"Medienpädagogik und Hochschuldidaktik","main_file_link":[{"url":"https://www.medienpaed.com/article/view/808/904","open_access":"1"}],"publication":"Medienpädagogik als Schlüsseldisziplin in einer mediatisierten Welt. Perspektiven aus Theorie, Empirie und Praxis 37","type":"book_chapter","status":"public","_id":"49869","department":[{"_id":"544"}],"user_id":"53827","language":[{"iso":"ger"}]}]