[{"year":"2025","citation":{"mla":"Hernández, Carlos, et al. “An Evolutionary Approach for the Computation of ∈-Locally Optimal Solutions for Multi-Objective Multimodal Optimization.” <i>IEEE Transactions on Evolutionary Computation</i>, 2025, pp. 1–1, doi:<a href=\"https://doi.org/10.1109/TEVC.2025.3637276\">10.1109/TEVC.2025.3637276</a>.","short":"C. Hernández, A.E. Rodriguez-Fernandez, L. Schäpermeier, O. Cuate, H. Trautmann, O. Schütze, IEEE Transactions on Evolutionary Computation (2025) 1–1.","bibtex":"@article{Hernández_Rodriguez-Fernandez_Schäpermeier_Cuate_Trautmann_Schütze_2025, title={An Evolutionary Approach for the Computation of ∈-Locally Optimal Solutions for Multi-Objective Multimodal Optimization}, DOI={<a href=\"https://doi.org/10.1109/TEVC.2025.3637276\">10.1109/TEVC.2025.3637276</a>}, journal={IEEE Transactions on Evolutionary Computation}, author={Hernández, Carlos and Rodriguez-Fernandez, Angel E. and Schäpermeier, Lennart and Cuate, Oliver and Trautmann, Heike and Schütze, Oliver}, year={2025}, pages={1–1} }","apa":"Hernández, C., Rodriguez-Fernandez, A. E., Schäpermeier, L., Cuate, O., Trautmann, H., &#38; Schütze, O. (2025). An Evolutionary Approach for the Computation of ∈-Locally Optimal Solutions for Multi-Objective Multimodal Optimization. <i>IEEE Transactions on Evolutionary Computation</i>, 1–1. <a href=\"https://doi.org/10.1109/TEVC.2025.3637276\">https://doi.org/10.1109/TEVC.2025.3637276</a>","chicago":"Hernández, Carlos, Angel E. Rodriguez-Fernandez, Lennart Schäpermeier, Oliver Cuate, Heike Trautmann, and Oliver Schütze. “An Evolutionary Approach for the Computation of ∈-Locally Optimal Solutions for Multi-Objective Multimodal Optimization.” <i>IEEE Transactions on Evolutionary Computation</i>, 2025, 1–1. <a href=\"https://doi.org/10.1109/TEVC.2025.3637276\">https://doi.org/10.1109/TEVC.2025.3637276</a>.","ieee":"C. Hernández, A. E. Rodriguez-Fernandez, L. Schäpermeier, O. Cuate, H. Trautmann, and O. Schütze, “An Evolutionary Approach for the Computation of ∈-Locally Optimal Solutions for Multi-Objective Multimodal Optimization,” <i>IEEE Transactions on Evolutionary Computation</i>, pp. 1–1, 2025, doi: <a href=\"https://doi.org/10.1109/TEVC.2025.3637276\">10.1109/TEVC.2025.3637276</a>.","ama":"Hernández C, Rodriguez-Fernandez AE, Schäpermeier L, Cuate O, Trautmann H, Schütze O. An Evolutionary Approach for the Computation of ∈-Locally Optimal Solutions for Multi-Objective Multimodal Optimization. <i>IEEE Transactions on Evolutionary Computation</i>. Published online 2025:1-1. doi:<a href=\"https://doi.org/10.1109/TEVC.2025.3637276\">10.1109/TEVC.2025.3637276</a>"},"page":"1-1","title":"An Evolutionary Approach for the Computation of ∈-Locally Optimal Solutions for Multi-Objective Multimodal Optimization","doi":"10.1109/TEVC.2025.3637276","date_updated":"2025-12-12T06:13:51Z","date_created":"2025-12-12T06:13:06Z","author":[{"full_name":"Hernández, Carlos","last_name":"Hernández","first_name":"Carlos"},{"full_name":"Rodriguez-Fernandez, Angel E.","last_name":"Rodriguez-Fernandez","first_name":"Angel E."},{"full_name":"Schäpermeier, Lennart","last_name":"Schäpermeier","first_name":"Lennart"},{"first_name":"Oliver","full_name":"Cuate, Oliver","last_name":"Cuate"},{"id":"100740","full_name":"Trautmann, Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282","first_name":"Heike"},{"first_name":"Oliver","last_name":"Schütze","full_name":"Schütze, Oliver"}],"status":"public","type":"journal_article","publication":"IEEE Transactions on Evolutionary Computation","keyword":["Optimization","Evolutionary computation","Hands","Proposals","Convergence","Computational efficiency","Artificial intelligence","Accuracy","Approximation algorithms","Aerospace electronics","Multi-objective optimization","evolutionary algorithms","nearly optimal solutions","multimodal optimization","archiving","continuation"],"language":[{"iso":"eng"}],"_id":"63053","user_id":"15504","department":[{"_id":"819"}]},{"_id":"56221","user_id":"15504","keyword":["Optimization","Evolutionary computation","Approximation algorithms","Benchmark testing","Vectors","Surveys","Pareto optimization","multi-objective optimization","evolutionary computation","multimodal optimization","local solutions"],"language":[{"iso":"eng"}],"type":"journal_article","publication":"IEEE Transactions on Evolutionary Computation","status":"public","date_updated":"2024-09-24T08:01:47Z","date_created":"2024-09-24T08:01:14Z","author":[{"first_name":"Angel E.","full_name":"Rodriguez-Fernandez, Angel E.","last_name":"Rodriguez-Fernandez"},{"last_name":"Schäpermeier","full_name":"Schäpermeier, Lennart","first_name":"Lennart"},{"first_name":"Carlos","last_name":"Hernández","full_name":"Hernández, Carlos"},{"last_name":"Kerschke","full_name":"Kerschke, Pascal","first_name":"Pascal"},{"first_name":"Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282","full_name":"Trautmann, Heike","id":"100740"},{"full_name":"Schütze, Oliver","last_name":"Schütze","first_name":"Oliver"}],"title":"Finding ϵ-Locally Optimal Solutions for Multi-Objective Multimodal Optimization","doi":"10.1109/TEVC.2024.3458855","year":"2024","citation":{"mla":"Rodriguez-Fernandez, Angel E., et al. “Finding ϵ-Locally Optimal Solutions for Multi-Objective Multimodal Optimization.” <i>IEEE Transactions on Evolutionary Computation</i>, 2024, pp. 1–1, doi:<a href=\"https://doi.org/10.1109/TEVC.2024.3458855\">10.1109/TEVC.2024.3458855</a>.","short":"A.E. Rodriguez-Fernandez, L. Schäpermeier, C. Hernández, P. Kerschke, H. Trautmann, O. Schütze, IEEE Transactions on Evolutionary Computation (2024) 1–1.","bibtex":"@article{Rodriguez-Fernandez_Schäpermeier_Hernández_Kerschke_Trautmann_Schütze_2024, title={Finding ϵ-Locally Optimal Solutions for Multi-Objective Multimodal Optimization}, DOI={<a href=\"https://doi.org/10.1109/TEVC.2024.3458855\">10.1109/TEVC.2024.3458855</a>}, journal={IEEE Transactions on Evolutionary Computation}, author={Rodriguez-Fernandez, Angel E. and Schäpermeier, Lennart and Hernández, Carlos and Kerschke, Pascal and Trautmann, Heike and Schütze, Oliver}, year={2024}, pages={1–1} }","apa":"Rodriguez-Fernandez, A. E., Schäpermeier, L., Hernández, C., Kerschke, P., Trautmann, H., &#38; Schütze, O. (2024). Finding ϵ-Locally Optimal Solutions for Multi-Objective Multimodal Optimization. <i>IEEE Transactions on Evolutionary Computation</i>, 1–1. <a href=\"https://doi.org/10.1109/TEVC.2024.3458855\">https://doi.org/10.1109/TEVC.2024.3458855</a>","chicago":"Rodriguez-Fernandez, Angel E., Lennart Schäpermeier, Carlos Hernández, Pascal Kerschke, Heike Trautmann, and Oliver Schütze. “Finding ϵ-Locally Optimal Solutions for Multi-Objective Multimodal Optimization.” <i>IEEE Transactions on Evolutionary Computation</i>, 2024, 1–1. <a href=\"https://doi.org/10.1109/TEVC.2024.3458855\">https://doi.org/10.1109/TEVC.2024.3458855</a>.","ieee":"A. E. Rodriguez-Fernandez, L. Schäpermeier, C. Hernández, P. Kerschke, H. Trautmann, and O. Schütze, “Finding ϵ-Locally Optimal Solutions for Multi-Objective Multimodal Optimization,” <i>IEEE Transactions on Evolutionary Computation</i>, pp. 1–1, 2024, doi: <a href=\"https://doi.org/10.1109/TEVC.2024.3458855\">10.1109/TEVC.2024.3458855</a>.","ama":"Rodriguez-Fernandez AE, Schäpermeier L, Hernández C, Kerschke P, Trautmann H, Schütze O. Finding ϵ-Locally Optimal Solutions for Multi-Objective Multimodal Optimization. <i>IEEE Transactions on Evolutionary Computation</i>. Published online 2024:1-1. doi:<a href=\"https://doi.org/10.1109/TEVC.2024.3458855\">10.1109/TEVC.2024.3458855</a>"},"page":"1-1"},{"author":[{"orcid":"0000-0002-4121-4668","last_name":"Bossek","full_name":"Bossek, Jakob","id":"102979","first_name":"Jakob"},{"last_name":"Neumann","full_name":"Neumann, Aneta","first_name":"Aneta"},{"last_name":"Neumann","full_name":"Neumann, Frank","first_name":"Frank"}],"date_created":"2023-11-14T15:58:56Z","publisher":"Association for Computing Machinery","date_updated":"2023-12-13T10:46:27Z","doi":"10.1145/3583131.3590384","title":"On the Impact of Basic Mutation Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem","publication_identifier":{"isbn":["9798400701191"]},"citation":{"short":"J. Bossek, A. Neumann, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2023, pp. 248–256.","mla":"Bossek, Jakob, et al. “On the Impact of Basic Mutation Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2023, pp. 248–256, doi:<a href=\"https://doi.org/10.1145/3583131.3590384\">10.1145/3583131.3590384</a>.","bibtex":"@inproceedings{Bossek_Neumann_Neumann_2023, place={New York, NY, USA}, series={GECCO’23}, title={On the Impact of Basic Mutation Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem}, DOI={<a href=\"https://doi.org/10.1145/3583131.3590384\">10.1145/3583131.3590384</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Neumann, Aneta and Neumann, Frank}, year={2023}, pages={248–256}, collection={GECCO’23} }","apa":"Bossek, J., Neumann, A., &#38; Neumann, F. (2023). On the Impact of Basic Mutation Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 248–256. <a href=\"https://doi.org/10.1145/3583131.3590384\">https://doi.org/10.1145/3583131.3590384</a>","ieee":"J. Bossek, A. Neumann, and F. Neumann, “On the Impact of Basic Mutation Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2023, pp. 248–256, doi: <a href=\"https://doi.org/10.1145/3583131.3590384\">10.1145/3583131.3590384</a>.","chicago":"Bossek, Jakob, Aneta Neumann, and Frank Neumann. “On the Impact of Basic Mutation Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 248–256. GECCO’23. New York, NY, USA: Association for Computing Machinery, 2023. <a href=\"https://doi.org/10.1145/3583131.3590384\">https://doi.org/10.1145/3583131.3590384</a>.","ama":"Bossek J, Neumann A, Neumann F. On the Impact of Basic Mutation Operators and Populations within Evolutionary Algorithms for the Dynamic Weighted Traveling Salesperson Problem. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. GECCO’23. Association for Computing Machinery; 2023:248–256. doi:<a href=\"https://doi.org/10.1145/3583131.3590384\">10.1145/3583131.3590384</a>"},"page":"248–256","year":"2023","place":"New York, NY, USA","series_title":"GECCO’23","user_id":"102979","department":[{"_id":"819"}],"_id":"48869","language":[{"iso":"eng"}],"extern":"1","keyword":["dynamic optimization","evolutionary algorithms","re-optimization","weighted traveling salesperson problem"],"type":"conference","publication":"Proceedings of the Genetic and Evolutionary Computation Conference","status":"public","abstract":[{"text":"Evolutionary algorithms have been shown to obtain good solutions for complex optimization problems in static and dynamic environments. It is important to understand the behaviour of evolutionary algorithms for complex optimization problems that also involve dynamic and/or stochastic components in a systematic way in order to further increase their applicability to real-world problems. We investigate the node weighted traveling salesperson problem (W-TSP), which provides an abstraction of a wide range of weighted TSP problems, in dynamic settings. In the dynamic setting of the problem, items that have to be collected as part of a TSP tour change over time. We first present a dynamic setup for the dynamic W-TSP parameterized by different types of changes that are applied to the set of items to be collected when traversing the tour. Our first experimental investigations study the impact of such changes on resulting optimized tours in order to provide structural insights of optimization solutions. Afterwards, we investigate simple mutation-based evolutionary algorithms and study the impact of the mutation operators and the use of populations with dealing with the dynamic changes to the node weights of the problem.","lang":"eng"}]},{"type":"journal_article","publication":"Theoretical Computer Science","status":"public","abstract":[{"lang":"eng","text":"Most runtime analyses of randomised search heuristics focus on the expected number of function evaluations to find a unique global optimum. We ask a fundamental question: if additional search points are declared optimal, or declared as desirable target points, do these additional optima speed up evolutionary algorithms? More formally, we analyse the expected hitting time of a target set OPT{$\\cup$}S where S is a set of non-optimal search points and OPT is the set of optima and compare it to the expected hitting time of OPT. We show that the answer to our question depends on the number and placement of search points in S. For all black-box algorithms and all fitness functions with polynomial expected optimisation times we show that, if additional optima are placed randomly, even an exponential number of optima has a negligible effect on the expected optimisation time. Considering Hamming balls around all global optima gives an easier target for some algorithms and functions and can shift the phase transition with respect to offspring population sizes in the (1,{$\\lambda$}) EA on OneMax. However, for the one-dimensional Ising model the time to reach Hamming balls of radius (1/2-{$ϵ$})n around optima does not reduce the asymptotic expected optimisation time in the worst case. Finally, on functions where search trajectories typically join in a single search point, turning one search point into an optimum drastically reduces the expected optimisation time."}],"user_id":"102979","department":[{"_id":"819"}],"_id":"48871","language":[{"iso":"eng"}],"keyword":["Evolutionary algorithms","pseudo-Boolean functions","runtime analysis"],"publication_identifier":{"issn":["0304-3975"]},"citation":{"chicago":"Bossek, Jakob, and Dirk Sudholt. “Do Additional Target Points Speed Up Evolutionary Algorithms?” <i>Theoretical Computer Science</i>, 2023, 113757. <a href=\"https://doi.org/10.1016/j.tcs.2023.113757\">https://doi.org/10.1016/j.tcs.2023.113757</a>.","ieee":"J. Bossek and D. Sudholt, “Do Additional Target Points Speed Up Evolutionary Algorithms?,” <i>Theoretical Computer Science</i>, p. 113757, 2023, doi: <a href=\"https://doi.org/10.1016/j.tcs.2023.113757\">10.1016/j.tcs.2023.113757</a>.","ama":"Bossek J, Sudholt D. Do Additional Target Points Speed Up Evolutionary Algorithms? <i>Theoretical Computer Science</i>. Published online 2023:113757. doi:<a href=\"https://doi.org/10.1016/j.tcs.2023.113757\">10.1016/j.tcs.2023.113757</a>","apa":"Bossek, J., &#38; Sudholt, D. (2023). Do Additional Target Points Speed Up Evolutionary Algorithms? <i>Theoretical Computer Science</i>, 113757. <a href=\"https://doi.org/10.1016/j.tcs.2023.113757\">https://doi.org/10.1016/j.tcs.2023.113757</a>","bibtex":"@article{Bossek_Sudholt_2023, title={Do Additional Target Points Speed Up Evolutionary Algorithms?}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2023.113757\">10.1016/j.tcs.2023.113757</a>}, journal={Theoretical Computer Science}, author={Bossek, Jakob and Sudholt, Dirk}, year={2023}, pages={113757} }","mla":"Bossek, Jakob, and Dirk Sudholt. “Do Additional Target Points Speed Up Evolutionary Algorithms?” <i>Theoretical Computer Science</i>, 2023, p. 113757, doi:<a href=\"https://doi.org/10.1016/j.tcs.2023.113757\">10.1016/j.tcs.2023.113757</a>.","short":"J. Bossek, D. Sudholt, Theoretical Computer Science (2023) 113757."},"page":"113757","year":"2023","date_created":"2023-11-14T15:58:56Z","author":[{"id":"102979","full_name":"Bossek, Jakob","orcid":"0000-0002-4121-4668","last_name":"Bossek","first_name":"Jakob"},{"first_name":"Dirk","full_name":"Sudholt, Dirk","last_name":"Sudholt"}],"date_updated":"2023-12-13T10:51:07Z","doi":"10.1016/j.tcs.2023.113757","title":"Do Additional Target Points Speed Up Evolutionary Algorithms?"},{"_id":"52127","series_title":"Dagstuhl Reports","user_id":"70420","keyword":["automorphism groups","combinatorial algorithms","finite geometries","subspace designs"],"language":[{"iso":"eng"}],"type":"report","abstract":[{"text":"This report documents the program and the outcomes of Dagstuhl Seminar 23161 \"Pushing the Limits of Computational Combinatorial Constructions\". In this Dagstuhl Seminar, we focused on computational methods for challenging problems in combinatorial construction. This includes algorithms for construction of combinatorial objects with prescribed symmetry, for isomorph-free exhaustive generation, and for combinatorial search. Examples of specific algorithmic techniques are tactical decomposition, the Kramer-Mesner method, algebraic methods, graph isomorphism software, isomorph-free generation, clique-finding methods, heuristic search, SAT solvers, and combinatorial optimization. There was an emphasis on problems involving graphs, designs and codes, also including topics in related fields such as finite geometry, graph decomposition, Hadamard matrices, Latin squares, and q-analogs of designs and codes.","lang":"eng"}],"status":"public","date_updated":"2024-02-27T15:48:12Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","volume":"13, Issue 4","author":[{"full_name":"Moura, Lucia","last_name":"Moura","first_name":"Lucia"},{"full_name":"Nakic, Anamari","last_name":"Nakic","first_name":"Anamari"},{"first_name":"Patric","full_name":"Östergård, Patric","last_name":"Östergård"},{"first_name":"Alfred","last_name":"Wassermann","full_name":"Wassermann, Alfred"},{"id":"70420","full_name":"Weiß, Charlene","last_name":"Weiß","first_name":"Charlene"}],"date_created":"2024-02-27T15:44:41Z","title":"Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161)","doi":"10.4230/DagRep.13.4.40","year":"2023","page":"40-57","citation":{"ieee":"L. Moura, A. Nakic, P. Östergård, A. Wassermann, and C. Weiß, <i>Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161)</i>, vol. 13, Issue 4. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, pp. 40–57.","chicago":"Moura, Lucia, Anamari Nakic, Patric Östergård, Alfred Wassermann, and Charlene Weiß. <i>Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161)</i>. Vol. 13, Issue 4. Dagstuhl Reports. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. <a href=\"https://doi.org/10.4230/DagRep.13.4.40\">https://doi.org/10.4230/DagRep.13.4.40</a>.","ama":"Moura L, Nakic A, Östergård P, Wassermann A, Weiß C. <i>Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161)</i>. Vol 13, Issue 4. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023:40-57. doi:<a href=\"https://doi.org/10.4230/DagRep.13.4.40\">10.4230/DagRep.13.4.40</a>","apa":"Moura, L., Nakic, A., Östergård, P., Wassermann, A., &#38; Weiß, C. (2023). <i>Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161)</i> (Vols. 13, Issue 4, pp. 40–57). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/DagRep.13.4.40\">https://doi.org/10.4230/DagRep.13.4.40</a>","short":"L. Moura, A. Nakic, P. Östergård, A. Wassermann, C. Weiß, Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","bibtex":"@book{Moura_Nakic_Östergård_Wassermann_Weiß_2023, series={Dagstuhl Reports}, title={Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161)}, volume={13, Issue 4}, DOI={<a href=\"https://doi.org/10.4230/DagRep.13.4.40\">10.4230/DagRep.13.4.40</a>}, publisher={Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, author={Moura, Lucia and Nakic, Anamari and Östergård, Patric and Wassermann, Alfred and Weiß, Charlene}, year={2023}, pages={40–57}, collection={Dagstuhl Reports} }","mla":"Moura, Lucia, et al. <i>Pushing the Limits of Computational Combinatorial Constructions (Dagstuhl Seminar 23161)</i>. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, pp. 40–57, doi:<a href=\"https://doi.org/10.4230/DagRep.13.4.40\">10.4230/DagRep.13.4.40</a>."}},{"date_updated":"2023-02-06T14:39:51Z","date_created":"2022-09-27T12:39:12Z","author":[{"first_name":"Jonas","last_name":"Rieskamp","full_name":"Rieskamp, Jonas","id":"77643"},{"full_name":"Hofeditz, Lennart","last_name":"Hofeditz","first_name":"Lennart"},{"id":"88691","full_name":"Mirbabaie, Milad","last_name":"Mirbabaie","first_name":"Milad"},{"full_name":"Stieglitz, Stefan","last_name":"Stieglitz","first_name":"Stefan"}],"title":"Approaches to Improve Fairness when Deploying AI-based Algorithms in Hiring – Using a Systematic Literature Review to Guide Future Research","conference":{"end_date":"2023-01-06","start_date":"2023-01-03","name":"Proceedings of the Annual Hawaii International Conference on System Sciences (HICSS)"},"main_file_link":[{"url":"https://hdl.handle.net/10125/102654"}],"year":"2023","citation":{"short":"J. Rieskamp, L. Hofeditz, M. Mirbabaie, S. Stieglitz, in: Proceedings of the Annual Hawaii International Conference on System Sciences (HICSS), 2023.","bibtex":"@inproceedings{Rieskamp_Hofeditz_Mirbabaie_Stieglitz_2023, title={Approaches to Improve Fairness when Deploying AI-based Algorithms in Hiring – Using a Systematic Literature Review to Guide Future Research}, booktitle={Proceedings of the Annual Hawaii International Conference on System Sciences (HICSS)}, author={Rieskamp, Jonas and Hofeditz, Lennart and Mirbabaie, Milad and Stieglitz, Stefan}, year={2023} }","mla":"Rieskamp, Jonas, et al. “Approaches to Improve Fairness When Deploying AI-Based Algorithms in Hiring – Using a Systematic Literature Review to Guide Future Research.” <i>Proceedings of the Annual Hawaii International Conference on System Sciences (HICSS)</i>, 2023.","apa":"Rieskamp, J., Hofeditz, L., Mirbabaie, M., &#38; Stieglitz, S. (2023). Approaches to Improve Fairness when Deploying AI-based Algorithms in Hiring – Using a Systematic Literature Review to Guide Future Research. <i>Proceedings of the Annual Hawaii International Conference on System Sciences (HICSS)</i>. Proceedings of the Annual Hawaii International Conference on System Sciences (HICSS).","ama":"Rieskamp J, Hofeditz L, Mirbabaie M, Stieglitz S. Approaches to Improve Fairness when Deploying AI-based Algorithms in Hiring – Using a Systematic Literature Review to Guide Future Research. In: <i>Proceedings of the Annual Hawaii International Conference on System Sciences (HICSS)</i>. ; 2023.","ieee":"J. Rieskamp, L. Hofeditz, M. Mirbabaie, and S. Stieglitz, “Approaches to Improve Fairness when Deploying AI-based Algorithms in Hiring – Using a Systematic Literature Review to Guide Future Research,” presented at the Proceedings of the Annual Hawaii International Conference on System Sciences (HICSS), 2023.","chicago":"Rieskamp, Jonas, Lennart Hofeditz, Milad Mirbabaie, and Stefan Stieglitz. “Approaches to Improve Fairness When Deploying AI-Based Algorithms in Hiring – Using a Systematic Literature Review to Guide Future Research.” In <i>Proceedings of the Annual Hawaii International Conference on System Sciences (HICSS)</i>, 2023."},"_id":"33490","user_id":"77643","keyword":["fairness in AI","SLR","hiring","AI implementation","AI-based algorithms"],"language":[{"iso":"eng"}],"publication":"Proceedings of the Annual Hawaii International Conference on System Sciences (HICSS)","type":"conference","abstract":[{"lang":"eng","text":"Algorithmic fairness in Information Systems (IS) is a concept that aims to mitigate systematic discrimination and bias in automated decision-making. However, previous research argued that different fairness criteria are often incompatible. In hiring, AI is used to assess and rank applicants according to their fit for vacant positions. However, various types of bias also exist for AI-based algorithms (e.g., using biased historical data). To reduce AI’s bias and thereby unfair treatment, we conducted a systematic literature review to identify suitable strategies for the context of hiring. We identified nine fundamental articles in this context and extracted four types of approaches to address unfairness in AI, namely pre-process, in-process, post-process, and feature selection. Based on our findings, we (a) derived a research agenda for future studies and (b) proposed strategies for practitioners who design and develop AIs for hiring purposes."}],"status":"public"},{"publication":"Parallel Problem Solving from Nature (PPSN XVII)","abstract":[{"lang":"eng","text":"Recently different evolutionary computation approaches have been developed that generate sets of high quality diverse solutions for a given optimisation problem. Many studies have considered diversity 1) as a mean to explore niches in behavioural space (quality diversity) or 2) to increase the structural differences of solutions (evolutionary diversity optimisation). In this study, we introduce a co-evolutionary algorithm to simultaneously explore the two spaces for the multi-component traveling thief problem. The results show the capability of the co-evolutionary algorithm to achieve significantly higher diversity compared to the baseline evolutionary diversity algorithms from the literature."}],"language":[{"iso":"eng"}],"keyword":["Co-evolutionary algorithms","Evolutionary diversity optimisation","Quality diversity","Traveling thief problem"],"year":"2022","date_created":"2023-11-14T15:59:00Z","publisher":"Springer International Publishing","title":"Co-Evolutionary Diversity Optimisation for the Traveling Thief Problem","type":"conference","status":"public","editor":[{"first_name":"Günter","last_name":"Rudolph","full_name":"Rudolph, Günter"},{"first_name":"Anna V.","full_name":"Kononova, Anna V.","last_name":"Kononova"},{"full_name":"Aguirre, Hernán","last_name":"Aguirre","first_name":"Hernán"},{"first_name":"Pascal","full_name":"Kerschke, Pascal","last_name":"Kerschke"},{"first_name":"Gabriela","last_name":"Ochoa","full_name":"Ochoa, Gabriela"},{"last_name":"Tu\\v sar","full_name":"Tu\\v sar, Tea","first_name":"Tea"}],"series_title":"Lecture Notes in Computer Science","user_id":"102979","department":[{"_id":"819"}],"_id":"48894","extern":"1","publication_status":"published","publication_identifier":{"isbn":["978-3-031-14714-2"]},"citation":{"short":"A. Nikfarjam, A. Neumann, J. Bossek, F. Neumann, in: G. Rudolph, A.V. Kononova, H. Aguirre, P. Kerschke, G. Ochoa, T. Tu\\v sar (Eds.), Parallel Problem Solving from Nature (PPSN XVII), Springer International Publishing, Cham, 2022, pp. 237–249.","bibtex":"@inproceedings{Nikfarjam_Neumann_Bossek_Neumann_2022, place={Cham}, series={Lecture Notes in Computer Science}, title={Co-Evolutionary Diversity Optimisation for the Traveling Thief Problem}, DOI={<a href=\"https://doi.org/10.1007/978-3-031-14714-2_17\">10.1007/978-3-031-14714-2_17</a>}, booktitle={Parallel Problem Solving from Nature (PPSN XVII)}, publisher={Springer International Publishing}, author={Nikfarjam, Adel and Neumann, Aneta and Bossek, Jakob and Neumann, Frank}, editor={Rudolph, Günter and Kononova, Anna V. and Aguirre, Hernán and Kerschke, Pascal and Ochoa, Gabriela and Tu\\v sar, Tea}, year={2022}, pages={237–249}, collection={Lecture Notes in Computer Science} }","mla":"Nikfarjam, Adel, et al. “Co-Evolutionary Diversity Optimisation for the Traveling Thief Problem.” <i>Parallel Problem Solving from Nature (PPSN XVII)</i>, edited by Günter Rudolph et al., Springer International Publishing, 2022, pp. 237–249, doi:<a href=\"https://doi.org/10.1007/978-3-031-14714-2_17\">10.1007/978-3-031-14714-2_17</a>.","apa":"Nikfarjam, A., Neumann, A., Bossek, J., &#38; Neumann, F. (2022). Co-Evolutionary Diversity Optimisation for the Traveling Thief Problem. In G. Rudolph, A. V. Kononova, H. Aguirre, P. Kerschke, G. Ochoa, &#38; T. Tu\\v sar (Eds.), <i>Parallel Problem Solving from Nature (PPSN XVII)</i> (pp. 237–249). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-031-14714-2_17\">https://doi.org/10.1007/978-3-031-14714-2_17</a>","ama":"Nikfarjam A, Neumann A, Bossek J, Neumann F. Co-Evolutionary Diversity Optimisation for the Traveling Thief Problem. In: Rudolph G, Kononova AV, Aguirre H, Kerschke P, Ochoa G, Tu\\v sar T, eds. <i>Parallel Problem Solving from Nature (PPSN XVII)</i>. Lecture Notes in Computer Science. Springer International Publishing; 2022:237–249. doi:<a href=\"https://doi.org/10.1007/978-3-031-14714-2_17\">10.1007/978-3-031-14714-2_17</a>","ieee":"A. Nikfarjam, A. Neumann, J. Bossek, and F. Neumann, “Co-Evolutionary Diversity Optimisation for the Traveling Thief Problem,” in <i>Parallel Problem Solving from Nature (PPSN XVII)</i>, 2022, pp. 237–249, doi: <a href=\"https://doi.org/10.1007/978-3-031-14714-2_17\">10.1007/978-3-031-14714-2_17</a>.","chicago":"Nikfarjam, Adel, Aneta Neumann, Jakob Bossek, and Frank Neumann. “Co-Evolutionary Diversity Optimisation for the Traveling Thief Problem.” In <i>Parallel Problem Solving from Nature (PPSN XVII)</i>, edited by Günter Rudolph, Anna V. Kononova, Hernán Aguirre, Pascal Kerschke, Gabriela Ochoa, and Tea Tu\\v sar, 237–249. Lecture Notes in Computer Science. Cham: Springer International Publishing, 2022. <a href=\"https://doi.org/10.1007/978-3-031-14714-2_17\">https://doi.org/10.1007/978-3-031-14714-2_17</a>."},"page":"237–249","place":"Cham","author":[{"last_name":"Nikfarjam","full_name":"Nikfarjam, Adel","first_name":"Adel"},{"full_name":"Neumann, Aneta","last_name":"Neumann","first_name":"Aneta"},{"full_name":"Bossek, Jakob","id":"102979","orcid":"0000-0002-4121-4668","last_name":"Bossek","first_name":"Jakob"},{"last_name":"Neumann","full_name":"Neumann, Frank","first_name":"Frank"}],"date_updated":"2023-12-13T10:49:51Z","doi":"10.1007/978-3-031-14714-2_17"},{"_id":"22510","department":[{"_id":"63"}],"user_id":"15415","keyword":["Local algorithms","Distributed algorithms","Collisionless gathering","Mobile robots","Multiagent system"],"language":[{"iso":"eng"}],"publication":"Theoretical Computer Science","type":"journal_article","abstract":[{"lang":"eng","text":"Over the past decades, the Gathering problem, which asks to gather a group of robots in finite time given some restrictions, has been intensively studied. In this paper, we are given a group of n autonomous, dimensionless, deterministic, and anonymous robots, with bounded viewing range. Assuming a continuous time model, the goal is to gather these robots into one point in finite time. We introduce a simple convergence criterion that defines a new class of algorithms which perform gathering in O(nd) time, where d is the diameter of the initial robot configuration. We show that some gathering algorithms in the literature belong to this class and propose two new algorithms that belong to this class and have quadratic running time, namely, Go-To-The-Relative-Center algorithm (GTRC) and Safe-Go-To-The-Relative-Center algorithm (S-GTRC). We prove that the latter can perform gathering without collision by using a slightly more complex robot model: non oblivious, chiral, and luminous (i.e. robots have observable external memory, as in [8]). We also consider a variant of the Gathering problem, the Near-Gathering problem, in which robots must get close to each other without colliding. We show that S-GTRC solves the Near-Gathering problem in quadratic time and assumes a weaker robot model than the one assumed in the current state-of-the-art."}],"status":"public","date_updated":"2022-01-06T06:55:35Z","volume":852,"author":[{"first_name":"Shouwei","last_name":"Li","full_name":"Li, Shouwei"},{"last_name":"Markarian","full_name":"Markarian, Christine","first_name":"Christine"},{"full_name":"Meyer auf der Heide, Friedhelm","id":"15523","last_name":"Meyer auf der Heide","first_name":"Friedhelm"},{"last_name":"Podlipyan","full_name":"Podlipyan, Pavel","first_name":"Pavel"}],"date_created":"2021-06-28T09:24:15Z","title":"A continuous strategy for collisionless gathering","doi":"10.1016/j.tcs.2020.10.037","publication_identifier":{"issn":["0304-3975"]},"publication_status":"published","year":"2021","page":"41-60","intvolume":"       852","citation":{"apa":"Li, S., Markarian, C., Meyer auf der Heide, F., &#38; Podlipyan, P. (2021). A continuous strategy for collisionless gathering. <i>Theoretical Computer Science</i>, <i>852</i>, 41–60. <a href=\"https://doi.org/10.1016/j.tcs.2020.10.037\">https://doi.org/10.1016/j.tcs.2020.10.037</a>","mla":"Li, Shouwei, et al. “A Continuous Strategy for Collisionless Gathering.” <i>Theoretical Computer Science</i>, vol. 852, 2021, pp. 41–60, doi:<a href=\"https://doi.org/10.1016/j.tcs.2020.10.037\">10.1016/j.tcs.2020.10.037</a>.","short":"S. Li, C. Markarian, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer Science 852 (2021) 41–60.","bibtex":"@article{Li_Markarian_Meyer auf der Heide_Podlipyan_2021, title={A continuous strategy for collisionless gathering}, volume={852}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2020.10.037\">10.1016/j.tcs.2020.10.037</a>}, journal={Theoretical Computer Science}, author={Li, Shouwei and Markarian, Christine and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2021}, pages={41–60} }","ieee":"S. Li, C. Markarian, F. Meyer auf der Heide, and P. Podlipyan, “A continuous strategy for collisionless gathering,” <i>Theoretical Computer Science</i>, vol. 852, pp. 41–60, 2021.","chicago":"Li, Shouwei, Christine Markarian, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “A Continuous Strategy for Collisionless Gathering.” <i>Theoretical Computer Science</i> 852 (2021): 41–60. <a href=\"https://doi.org/10.1016/j.tcs.2020.10.037\">https://doi.org/10.1016/j.tcs.2020.10.037</a>.","ama":"Li S, Markarian C, Meyer auf der Heide F, Podlipyan P. A continuous strategy for collisionless gathering. <i>Theoretical Computer Science</i>. 2021;852:41-60. doi:<a href=\"https://doi.org/10.1016/j.tcs.2020.10.037\">10.1016/j.tcs.2020.10.037</a>"}},{"publication_status":"published","publication_identifier":{"issn":["0304-3975"]},"citation":{"ama":"Li S, Meyer auf der Heide F, Podlipyan P. The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. <i>Theoretical Computer Science</i>. 2021;852:29-40. doi:<a href=\"https://doi.org/10.1016/j.tcs.2020.11.009\">10.1016/j.tcs.2020.11.009</a>","chicago":"Li, Shouwei, Friedhelm Meyer auf der Heide, and Pavel Podlipyan. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.” <i>Theoretical Computer Science</i> 852 (2021): 29–40. <a href=\"https://doi.org/10.1016/j.tcs.2020.11.009\">https://doi.org/10.1016/j.tcs.2020.11.009</a>.","ieee":"S. Li, F. Meyer auf der Heide, and P. Podlipyan, “The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots,” <i>Theoretical Computer Science</i>, vol. 852, pp. 29–40, 2021.","apa":"Li, S., Meyer auf der Heide, F., &#38; Podlipyan, P. (2021). The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots. <i>Theoretical Computer Science</i>, <i>852</i>, 29–40. <a href=\"https://doi.org/10.1016/j.tcs.2020.11.009\">https://doi.org/10.1016/j.tcs.2020.11.009</a>","bibtex":"@article{Li_Meyer auf der Heide_Podlipyan_2021, title={The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots}, volume={852}, DOI={<a href=\"https://doi.org/10.1016/j.tcs.2020.11.009\">10.1016/j.tcs.2020.11.009</a>}, journal={Theoretical Computer Science}, author={Li, Shouwei and Meyer auf der Heide, Friedhelm and Podlipyan, Pavel}, year={2021}, pages={29–40} }","short":"S. Li, F. Meyer auf der Heide, P. Podlipyan, Theoretical Computer Science 852 (2021) 29–40.","mla":"Li, Shouwei, et al. “The Impact of the Gabriel Subgraph of the Visibility Graph on the Gathering of Mobile Autonomous Robots.” <i>Theoretical Computer Science</i>, vol. 852, 2021, pp. 29–40, doi:<a href=\"https://doi.org/10.1016/j.tcs.2020.11.009\">10.1016/j.tcs.2020.11.009</a>."},"page":"29-40","intvolume":"       852","year":"2021","date_created":"2021-06-28T09:34:45Z","author":[{"first_name":"Shouwei","full_name":"Li, Shouwei","last_name":"Li"},{"first_name":"Friedhelm","id":"15523","full_name":"Meyer auf der Heide, Friedhelm","last_name":"Meyer auf der Heide"},{"first_name":"Pavel","full_name":"Podlipyan, Pavel","last_name":"Podlipyan"}],"volume":852,"date_updated":"2022-01-06T06:55:35Z","doi":"10.1016/j.tcs.2020.11.009","title":"The impact of the Gabriel subgraph of the visibility graph on the gathering of mobile autonomous robots","type":"journal_article","publication":"Theoretical Computer Science","status":"public","abstract":[{"text":"In this paper, we reconsider the well-known discrete, round-based Go-To-The-Center algorithm due to Ando, Suzuki, and Yamashita [2] for gathering n autonomous mobile robots with limited viewing range in the plane. Remarquably, this algorithm exploits the fact that during its execution, many collisions of robots occur. Such collisions are interpreted as a success because it is assumed that such collided robots behave the same from now on. This is acceptable under the assumption that each robot is represented by a single point. Otherwise, collisions should be avoided. In this paper, we consider a continuous Go-To-The-Center algorithm in which the robots continuously observe the positions of their neighbors and adapt their speed (assuming a speed limit) and direction. Our first results are time bounds of O(n2) for gathering in two dimensions Euclidean space, and Θ(n) for the one dimension. Our main contribution is the introduction and evaluation of a continuous algorithm which performs Go-To-The-Center considering only the neighbors of a robot with respect to the Gabriel subgraph of the visibility graph, i.e. Go-To-The-Gabriel-Center algorithm. We show that this modification still correctly executes gathering in one and two dimensions, with the same time bounds as above. Simulations exhibit a severe difference of the behavior of the Go-To-The-Center and the Go-To-The-Gabriel-Center algorithms: Whereas lots of collisions occur during a run of the Go-To-The-Center algorithm, typically only one, namely the final collision occurs during a run of the Go-To-The-Gabriel-Center algorithm. We can prove this “collisionless property” of the Go-To-The-Gabriel-Center algorithm for one dimension. In two-dimensional Euclidean space, we conjecture that the “collisionless property” holds for almost every initial configuration. We support our conjecture with measurements obtained from the simulation where robots execute both continuous Go-To-The-Center and Go-To-The-Gabriel-Center algorithms.\r\n","lang":"eng"}],"user_id":"15415","department":[{"_id":"63"}],"_id":"22511","language":[{"iso":"eng"}],"keyword":["Local algorithms","Distributed algorithms","Collisionless gathering","Mobile robots","Multiagent system"]},{"_id":"46318","department":[{"_id":"34"},{"_id":"819"}],"user_id":"15504","keyword":["Multimodal optimization","Multi-objective continuous optimization","Landscape analysis","Visualization","Benchmarking","Theory","Algorithms"],"language":[{"iso":"eng"}],"publication":"Computers & Operations Research","type":"journal_article","abstract":[{"lang":"eng","text":"Multi-objective (MO) optimization, i.e., the simultaneous optimization of multiple conflicting objectives, is gaining more and more attention in various research areas, such as evolutionary computation, machine learning (e.g., (hyper-)parameter optimization), or logistics (e.g., vehicle routing). Many works in this domain mention the structural problem property of multimodality as a challenge from two classical perspectives: (1) finding all globally optimal solution sets, and (2) avoiding to get trapped in local optima. Interestingly, these streams seem to transfer many traditional concepts of single-objective (SO) optimization into claims, assumptions, or even terminology regarding the MO domain, but mostly neglect the understanding of the structural properties as well as the algorithmic search behavior on a problem’s landscape. However, some recent works counteract this trend, by investigating the fundamentals and characteristics of MO problems using new visualization techniques and gaining surprising insights. Using these visual insights, this work proposes a step towards a unified terminology to capture multimodality and locality in a broader way than it is usually done. This enables us to investigate current research activities in multimodal continuous MO optimization and to highlight new implications and promising research directions for the design of benchmark suites, the discovery of MO landscape features, the development of new MO (or even SO) optimization algorithms, and performance indicators. For all these topics, we provide a review of ideas and methods but also an outlook on future challenges, research potential and perspectives that result from recent developments."}],"status":"public","date_updated":"2023-10-16T12:58:42Z","volume":136,"author":[{"first_name":"Christian","last_name":"Grimme","full_name":"Grimme, Christian"},{"last_name":"Kerschke","full_name":"Kerschke, Pascal","first_name":"Pascal"},{"first_name":"Pelin","full_name":"Aspar, Pelin","last_name":"Aspar"},{"first_name":"Heike","id":"100740","full_name":"Trautmann, Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann"},{"last_name":"Preuss","full_name":"Preuss, Mike","first_name":"Mike"},{"first_name":"André H.","full_name":"Deutz, André H.","last_name":"Deutz"},{"first_name":"Hao","full_name":"Wang, Hao","last_name":"Wang"},{"first_name":"Michael","last_name":"Emmerich","full_name":"Emmerich, Michael"}],"date_created":"2023-08-04T07:28:34Z","title":"Peeking beyond peaks: Challenges and research potentials of continuous multimodal multi-objective optimization","doi":"https://doi.org/10.1016/j.cor.2021.105489","publication_identifier":{"issn":["0305-0548"]},"year":"2021","page":"105489","intvolume":"       136","citation":{"apa":"Grimme, C., Kerschke, P., Aspar, P., Trautmann, H., Preuss, M., Deutz, A. H., Wang, H., &#38; Emmerich, M. (2021). Peeking beyond peaks: Challenges and research potentials of continuous multimodal multi-objective optimization. <i>Computers &#38; Operations Research</i>, <i>136</i>, 105489. <a href=\"https://doi.org/10.1016/j.cor.2021.105489\">https://doi.org/10.1016/j.cor.2021.105489</a>","mla":"Grimme, Christian, et al. “Peeking beyond Peaks: Challenges and Research Potentials of Continuous Multimodal Multi-Objective Optimization.” <i>Computers &#38; Operations Research</i>, vol. 136, 2021, p. 105489, doi:<a href=\"https://doi.org/10.1016/j.cor.2021.105489\">https://doi.org/10.1016/j.cor.2021.105489</a>.","short":"C. Grimme, P. Kerschke, P. Aspar, H. Trautmann, M. Preuss, A.H. Deutz, H. Wang, M. Emmerich, Computers &#38; Operations Research 136 (2021) 105489.","bibtex":"@article{Grimme_Kerschke_Aspar_Trautmann_Preuss_Deutz_Wang_Emmerich_2021, title={Peeking beyond peaks: Challenges and research potentials of continuous multimodal multi-objective optimization}, volume={136}, DOI={<a href=\"https://doi.org/10.1016/j.cor.2021.105489\">https://doi.org/10.1016/j.cor.2021.105489</a>}, journal={Computers &#38; Operations Research}, author={Grimme, Christian and Kerschke, Pascal and Aspar, Pelin and Trautmann, Heike and Preuss, Mike and Deutz, André H. and Wang, Hao and Emmerich, Michael}, year={2021}, pages={105489} }","ama":"Grimme C, Kerschke P, Aspar P, et al. Peeking beyond peaks: Challenges and research potentials of continuous multimodal multi-objective optimization. <i>Computers &#38; Operations Research</i>. 2021;136:105489. doi:<a href=\"https://doi.org/10.1016/j.cor.2021.105489\">https://doi.org/10.1016/j.cor.2021.105489</a>","ieee":"C. Grimme <i>et al.</i>, “Peeking beyond peaks: Challenges and research potentials of continuous multimodal multi-objective optimization,” <i>Computers &#38; Operations Research</i>, vol. 136, p. 105489, 2021, doi: <a href=\"https://doi.org/10.1016/j.cor.2021.105489\">https://doi.org/10.1016/j.cor.2021.105489</a>.","chicago":"Grimme, Christian, Pascal Kerschke, Pelin Aspar, Heike Trautmann, Mike Preuss, André H. Deutz, Hao Wang, and Michael Emmerich. “Peeking beyond Peaks: Challenges and Research Potentials of Continuous Multimodal Multi-Objective Optimization.” <i>Computers &#38; Operations Research</i> 136 (2021): 105489. <a href=\"https://doi.org/10.1016/j.cor.2021.105489\">https://doi.org/10.1016/j.cor.2021.105489</a>."}},{"language":[{"iso":"eng"}],"keyword":["evolutionary algorithms","evolutionary diversity optimization","knapsack problem","tailored operators"],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference","abstract":[{"lang":"eng","text":"In practise, it is often desirable to provide the decision-maker with a rich set of diverse solutions of decent quality instead of just a single solution. In this paper we study evolutionary diversity optimization for the knapsack problem (KP). Our goal is to evolve a population of solutions that all have a profit of at least (1 - {$ϵ$}) {$\\cdot$} OPT, where OPT is the value of an optimal solution. Furthermore, they should differ in structure with respect to an entropy-based diversity measure. To this end we propose a simple ({$\\mu$} + 1)-EA with initial approximate solutions calculated by a well-known FPTAS for the KP. We investigate the effect of different standard mutation operators and introduce biased mutation and crossover which puts strong probability on flipping bits of low and/or high frequency within the population. An experimental study on different instances and settings shows that the proposed mutation operators in most cases perform slightly inferior in the long term, but show strong benefits if the number of function evaluations is severely limited."}],"date_created":"2023-11-14T15:58:54Z","publisher":"Association for Computing Machinery","title":"Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms","year":"2021","series_title":"GECCO ’21","user_id":"102979","department":[{"_id":"819"}],"_id":"48853","extern":"1","type":"conference","status":"public","author":[{"first_name":"Jakob","id":"102979","full_name":"Bossek, Jakob","orcid":"0000-0002-4121-4668","last_name":"Bossek"},{"first_name":"Aneta","full_name":"Neumann, Aneta","last_name":"Neumann"},{"last_name":"Neumann","full_name":"Neumann, Frank","first_name":"Frank"}],"date_updated":"2023-12-13T10:45:22Z","doi":"10.1145/3449639.3459364","publication_status":"published","publication_identifier":{"isbn":["978-1-4503-8350-9"]},"citation":{"ama":"Bossek J, Neumann A, Neumann F. Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. GECCO ’21. Association for Computing Machinery; 2021:556–564. doi:<a href=\"https://doi.org/10.1145/3449639.3459364\">10.1145/3449639.3459364</a>","ieee":"J. Bossek, A. Neumann, and F. Neumann, “Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2021, pp. 556–564, doi: <a href=\"https://doi.org/10.1145/3449639.3459364\">10.1145/3449639.3459364</a>.","chicago":"Bossek, Jakob, Aneta Neumann, and Frank Neumann. “Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 556–564. GECCO ’21. New York, NY, USA: Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3449639.3459364\">https://doi.org/10.1145/3449639.3459364</a>.","apa":"Bossek, J., Neumann, A., &#38; Neumann, F. (2021). Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 556–564. <a href=\"https://doi.org/10.1145/3449639.3459364\">https://doi.org/10.1145/3449639.3459364</a>","mla":"Bossek, Jakob, et al. “Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2021, pp. 556–564, doi:<a href=\"https://doi.org/10.1145/3449639.3459364\">10.1145/3449639.3459364</a>.","short":"J. Bossek, A. Neumann, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2021, pp. 556–564.","bibtex":"@inproceedings{Bossek_Neumann_Neumann_2021, place={New York, NY, USA}, series={GECCO ’21}, title={Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms}, DOI={<a href=\"https://doi.org/10.1145/3449639.3459364\">10.1145/3449639.3459364</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Neumann, Aneta and Neumann, Frank}, year={2021}, pages={556–564}, collection={GECCO ’21} }"},"page":"556–564","place":"New York, NY, USA"},{"place":"New York, NY, USA","year":"2021","page":"198–206","citation":{"chicago":"Bossek, Jakob, and Frank Neumann. “Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 198–206. GECCO ’21. New York, NY, USA: Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3449639.3459363\">https://doi.org/10.1145/3449639.3459363</a>.","ieee":"J. Bossek and F. Neumann, “Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2021, pp. 198–206, doi: <a href=\"https://doi.org/10.1145/3449639.3459363\">10.1145/3449639.3459363</a>.","ama":"Bossek J, Neumann F. Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. GECCO ’21. Association for Computing Machinery; 2021:198–206. doi:<a href=\"https://doi.org/10.1145/3449639.3459363\">10.1145/3449639.3459363</a>","bibtex":"@inproceedings{Bossek_Neumann_2021, place={New York, NY, USA}, series={GECCO ’21}, title={Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem}, DOI={<a href=\"https://doi.org/10.1145/3449639.3459363\">10.1145/3449639.3459363</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Neumann, Frank}, year={2021}, pages={198–206}, collection={GECCO ’21} }","short":"J. Bossek, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2021, pp. 198–206.","mla":"Bossek, Jakob, and Frank Neumann. “Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2021, pp. 198–206, doi:<a href=\"https://doi.org/10.1145/3449639.3459363\">10.1145/3449639.3459363</a>.","apa":"Bossek, J., &#38; Neumann, F. (2021). Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 198–206. <a href=\"https://doi.org/10.1145/3449639.3459363\">https://doi.org/10.1145/3449639.3459363</a>"},"publication_identifier":{"isbn":["978-1-4503-8350-9"]},"publication_status":"published","title":"Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem","doi":"10.1145/3449639.3459363","date_updated":"2023-12-13T10:45:37Z","publisher":"Association for Computing Machinery","author":[{"first_name":"Jakob","id":"102979","full_name":"Bossek, Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668"},{"first_name":"Frank","last_name":"Neumann","full_name":"Neumann, Frank"}],"date_created":"2023-11-14T15:58:55Z","abstract":[{"lang":"eng","text":"In the area of evolutionary computation the calculation of diverse sets of high-quality solutions to a given optimization problem has gained momentum in recent years under the term evolutionary diversity optimization. Theoretical insights into the working principles of baseline evolutionary algorithms for diversity optimization are still rare. In this paper we study the well-known Minimum Spanning Tree problem (MST) in the context of diversity optimization where population diversity is measured by the sum of pairwise edge overlaps. Theoretical results provide insights into the fitness landscape of the MST diversity optimization problem pointing out that even for a population of {$\\mu$} = 2 fitness plateaus (of constant length) can be reached, but nevertheless diverse sets can be calculated in polynomial time. We supplement our theoretical results with a series of experiments for the unconstrained and constraint case where all solutions need to fulfill a minimal quality threshold. Our results show that a simple ({$\\mu$} + 1)-EA can effectively compute a diversified population of spanning trees of high quality."}],"status":"public","publication":"Proceedings of the Genetic and Evolutionary Computation Conference","type":"conference","keyword":["evolutionary algorithms","evolutionary diversity optimization","minimum spanning tree","runtime analysis"],"extern":"1","language":[{"iso":"eng"}],"_id":"48860","department":[{"_id":"819"}],"user_id":"102979","series_title":"GECCO ’21"},{"type":"book_chapter","publication":"Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms","status":"public","abstract":[{"text":"Most runtime analyses of randomised search heuristics focus on the expected number of function evaluations to find a unique global optimum. We ask a fundamental question: if additional search points are declared optimal, or declared as desirable target points, do these additional optima speed up evolutionary algorithms? More formally, we analyse the expected hitting time of a target set OPT {$\\cup$} S where S is a set of non-optimal search points and OPT is the set of optima and compare it to the expected hitting time of OPT. We show that the answer to our question depends on the number and placement of search points in S. For all black-box algorithms and all fitness functions we show that, if additional optima are placed randomly, even an exponential number of optima has a negligible effect on the expected optimisation time. Considering Hamming balls around all global optima gives an easier target for some algorithms and functions and can shift the phase transition with respect to offspring population sizes in the (1,{$\\lambda$}) EA on One-Max. Finally, on functions where search trajectories typically join in a single search point, turning one search point into an optimum drastically reduces the expected optimisation time.","lang":"eng"}],"user_id":"102979","department":[{"_id":"819"}],"_id":"48862","extern":"1","language":[{"iso":"eng"}],"keyword":["evolutionary algorithms","pseudo-boolean functions","runtime analysis","theory"],"publication_status":"published","publication_identifier":{"isbn":["978-1-4503-8352-3"]},"citation":{"chicago":"Bossek, Jakob, and Dirk Sudholt. “Do Additional Optima Speed up Evolutionary Algorithms?” In <i>Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, 1–11. New York, NY, USA: Association for Computing Machinery, 2021.","ieee":"J. Bossek and D. Sudholt, “Do Additional Optima Speed up Evolutionary Algorithms?,” in <i>Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, New York, NY, USA: Association for Computing Machinery, 2021, pp. 1–11.","ama":"Bossek J, Sudholt D. Do Additional Optima Speed up Evolutionary Algorithms? In: <i>Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>. Association for Computing Machinery; 2021:1–11.","apa":"Bossek, J., &#38; Sudholt, D. (2021). Do Additional Optima Speed up Evolutionary Algorithms? In <i>Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i> (pp. 1–11). Association for Computing Machinery.","mla":"Bossek, Jakob, and Dirk Sudholt. “Do Additional Optima Speed up Evolutionary Algorithms?” <i>Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms</i>, Association for Computing Machinery, 2021, pp. 1–11.","short":"J. Bossek, D. Sudholt, in: Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms, Association for Computing Machinery, New York, NY, USA, 2021, pp. 1–11.","bibtex":"@inbook{Bossek_Sudholt_2021, place={New York, NY, USA}, title={Do Additional Optima Speed up Evolutionary Algorithms?}, booktitle={Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Sudholt, Dirk}, year={2021}, pages={1–11} }"},"page":"1–11","year":"2021","place":"New York, NY, USA","author":[{"orcid":"0000-0002-4121-4668","last_name":"Bossek","full_name":"Bossek, Jakob","id":"102979","first_name":"Jakob"},{"last_name":"Sudholt","full_name":"Sudholt, Dirk","first_name":"Dirk"}],"date_created":"2023-11-14T15:58:55Z","publisher":"Association for Computing Machinery","date_updated":"2023-12-13T10:45:31Z","title":"Do Additional Optima Speed up Evolutionary Algorithms?"},{"status":"public","type":"conference","extern":"1","_id":"48876","department":[{"_id":"819"}],"series_title":"GECCO’21","user_id":"102979","place":"New York, NY, USA","page":"1423–1432","citation":{"ieee":"J. Bossek and M. Wagner, “Generating Instances with Performance Differences for More than Just Two Algorithms,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, 2021, pp. 1423–1432, doi: <a href=\"https://doi.org/10.1145/3449726.3463165\">10.1145/3449726.3463165</a>.","chicago":"Bossek, Jakob, and Markus Wagner. “Generating Instances with Performance Differences for More than Just Two Algorithms.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, 1423–1432. GECCO’21. New York, NY, USA: Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3449726.3463165\">https://doi.org/10.1145/3449726.3463165</a>.","ama":"Bossek J, Wagner M. Generating Instances with Performance Differences for More than Just Two Algorithms. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>. GECCO’21. Association for Computing Machinery; 2021:1423–1432. doi:<a href=\"https://doi.org/10.1145/3449726.3463165\">10.1145/3449726.3463165</a>","short":"J. Bossek, M. Wagner, in: Proceedings of the Genetic and Evolutionary Computation Conference Companion, Association for Computing Machinery, New York, NY, USA, 2021, pp. 1423–1432.","bibtex":"@inproceedings{Bossek_Wagner_2021, place={New York, NY, USA}, series={GECCO’21}, title={Generating Instances with Performance Differences for More than Just Two Algorithms}, DOI={<a href=\"https://doi.org/10.1145/3449726.3463165\">10.1145/3449726.3463165</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference Companion}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Wagner, Markus}, year={2021}, pages={1423–1432}, collection={GECCO’21} }","mla":"Bossek, Jakob, and Markus Wagner. “Generating Instances with Performance Differences for More than Just Two Algorithms.” <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, Association for Computing Machinery, 2021, pp. 1423–1432, doi:<a href=\"https://doi.org/10.1145/3449726.3463165\">10.1145/3449726.3463165</a>.","apa":"Bossek, J., &#38; Wagner, M. (2021). Generating Instances with Performance Differences for More than Just Two Algorithms. <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, 1423–1432. <a href=\"https://doi.org/10.1145/3449726.3463165\">https://doi.org/10.1145/3449726.3463165</a>"},"publication_identifier":{"isbn":["978-1-4503-8351-6"]},"doi":"10.1145/3449726.3463165","date_updated":"2023-12-13T10:47:41Z","author":[{"first_name":"Jakob","full_name":"Bossek, Jakob","id":"102979","orcid":"0000-0002-4121-4668","last_name":"Bossek"},{"full_name":"Wagner, Markus","last_name":"Wagner","first_name":"Markus"}],"abstract":[{"text":"In recent years, Evolutionary Algorithms (EAs) have frequently been adopted to evolve instances for optimization problems that pose difficulties for one algorithm while being rather easy for a competitor and vice versa. Typically, this is achieved by either minimizing or maximizing the performance difference or ratio which serves as the fitness function. Repeating this process is useful to gain insights into strengths/weaknesses of certain algorithms or to build a set of instances with strong performance differences as a foundation for automatic per-instance algorithm selection or configuration. We contribute to this branch of research by proposing fitness-functions to evolve instances that show large performance differences for more than just two algorithms simultaneously. As a proof-of-principle, we evolve instances of the multi-component Traveling Thief Problem (TTP) for three incomplete TTP-solvers. Our results point out that our strategies are promising, but unsurprisingly their success strongly relies on the algorithms’ performance complementarity.","lang":"eng"}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","keyword":["evolutionary algorithms","evolving instances","fitness function","instance hardness","traveling thief problem (TTP)"],"language":[{"iso":"eng"}],"year":"2021","title":"Generating Instances with Performance Differences for More than Just Two Algorithms","publisher":"Association for Computing Machinery","date_created":"2023-11-14T15:58:57Z"},{"publication_identifier":{"isbn":["978-1-4503-8350-9"]},"year":"2021","place":"New York, NY, USA","page":"600–608","citation":{"chicago":"Nikfarjam, Adel, Jakob Bossek, Aneta Neumann, and Frank Neumann. “Entropy-Based Evolutionary Diversity Optimisation for the Traveling Salesperson Problem.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 600–608. GECCO’21. New York, NY, USA: Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3449639.3459384\">https://doi.org/10.1145/3449639.3459384</a>.","ieee":"A. Nikfarjam, J. Bossek, A. Neumann, and F. Neumann, “Entropy-Based Evolutionary Diversity Optimisation for the Traveling Salesperson Problem,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2021, pp. 600–608, doi: <a href=\"https://doi.org/10.1145/3449639.3459384\">10.1145/3449639.3459384</a>.","ama":"Nikfarjam A, Bossek J, Neumann A, Neumann F. Entropy-Based Evolutionary Diversity Optimisation for the Traveling Salesperson Problem. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. GECCO’21. Association for Computing Machinery; 2021:600–608. doi:<a href=\"https://doi.org/10.1145/3449639.3459384\">10.1145/3449639.3459384</a>","apa":"Nikfarjam, A., Bossek, J., Neumann, A., &#38; Neumann, F. (2021). Entropy-Based Evolutionary Diversity Optimisation for the Traveling Salesperson Problem. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 600–608. <a href=\"https://doi.org/10.1145/3449639.3459384\">https://doi.org/10.1145/3449639.3459384</a>","bibtex":"@inproceedings{Nikfarjam_Bossek_Neumann_Neumann_2021, place={New York, NY, USA}, series={GECCO’21}, title={Entropy-Based Evolutionary Diversity Optimisation for the Traveling Salesperson Problem}, DOI={<a href=\"https://doi.org/10.1145/3449639.3459384\">10.1145/3449639.3459384</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Nikfarjam, Adel and Bossek, Jakob and Neumann, Aneta and Neumann, Frank}, year={2021}, pages={600–608}, collection={GECCO’21} }","short":"A. Nikfarjam, J. Bossek, A. Neumann, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2021, pp. 600–608.","mla":"Nikfarjam, Adel, et al. “Entropy-Based Evolutionary Diversity Optimisation for the Traveling Salesperson Problem.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2021, pp. 600–608, doi:<a href=\"https://doi.org/10.1145/3449639.3459384\">10.1145/3449639.3459384</a>."},"date_updated":"2023-12-13T10:50:06Z","publisher":"Association for Computing Machinery","author":[{"full_name":"Nikfarjam, Adel","last_name":"Nikfarjam","first_name":"Adel"},{"last_name":"Bossek","orcid":"0000-0002-4121-4668","full_name":"Bossek, Jakob","id":"102979","first_name":"Jakob"},{"full_name":"Neumann, Aneta","last_name":"Neumann","first_name":"Aneta"},{"last_name":"Neumann","full_name":"Neumann, Frank","first_name":"Frank"}],"date_created":"2023-11-14T15:59:00Z","title":"Entropy-Based Evolutionary Diversity Optimisation for the Traveling Salesperson Problem","doi":"10.1145/3449639.3459384","publication":"Proceedings of the Genetic and Evolutionary Computation Conference","type":"conference","abstract":[{"lang":"eng","text":"Computing diverse sets of high-quality solutions has gained increasing attention among the evolutionary computation community in recent years. It allows practitioners to choose from a set of high-quality alternatives. In this paper, we employ a population diversity measure, called the high-order entropy measure, in an evolutionary algorithm to compute a diverse set of high-quality solutions for the Traveling Salesperson Problem. In contrast to previous studies, our approach allows diversifying segments of tours containing several edges based on the entropy measure. We examine the resulting evolutionary diversity optimisation approach precisely in terms of the final set of solutions and theoretical properties. Experimental results show significant improvements compared to a recently proposed edge-based diversity optimisation approach when working with a large population of solutions or long segments."}],"status":"public","_id":"48893","department":[{"_id":"819"}],"user_id":"102979","series_title":"GECCO’21","keyword":["evolutionary algorithms","evolutionary diversity optimisation","high-order entropy","traveling salesperson problem"],"language":[{"iso":"eng"}],"extern":"1"},{"title":"Diversifying Greedy Sampling and Evolutionary Diversity Optimisation for Constrained Monotone Submodular Functions","date_created":"2023-11-14T15:58:59Z","publisher":"Association for Computing Machinery","year":"2021","language":[{"iso":"eng"}],"keyword":["evolutionary algorithms","evolutionary diversity optimisation","sub-modular functions"],"abstract":[{"lang":"eng","text":"Submodular functions allow to model many real-world optimisation problems. This paper introduces approaches for computing diverse sets of high quality solutions for submodular optimisation problems with uniform and knapsack constraints. We first present diversifying greedy sampling approaches and analyse them with respect to the diversity measured by entropy and the approximation quality of the obtained solutions. Afterwards, we introduce an evolutionary diversity optimisation (EDO) approach to further improve diversity of the set of solutions. We carry out experimental investigations on popular submodular benchmark problems and analyse trade-offs in terms of solution quality and diversity of the resulting solution sets."}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference","doi":"10.1145/3449639.3459385","author":[{"full_name":"Neumann, Aneta","last_name":"Neumann","first_name":"Aneta"},{"first_name":"Jakob","full_name":"Bossek, Jakob","id":"102979","orcid":"0000-0002-4121-4668","last_name":"Bossek"},{"last_name":"Neumann","full_name":"Neumann, Frank","first_name":"Frank"}],"date_updated":"2023-12-13T10:49:25Z","page":"261–269","citation":{"ama":"Neumann A, Bossek J, Neumann F. Diversifying Greedy Sampling and Evolutionary Diversity Optimisation for Constrained Monotone Submodular Functions. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. GECCO’21. Association for Computing Machinery; 2021:261–269. doi:<a href=\"https://doi.org/10.1145/3449639.3459385\">10.1145/3449639.3459385</a>","ieee":"A. Neumann, J. Bossek, and F. Neumann, “Diversifying Greedy Sampling and Evolutionary Diversity Optimisation for Constrained Monotone Submodular Functions,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2021, pp. 261–269, doi: <a href=\"https://doi.org/10.1145/3449639.3459385\">10.1145/3449639.3459385</a>.","chicago":"Neumann, Aneta, Jakob Bossek, and Frank Neumann. “Diversifying Greedy Sampling and Evolutionary Diversity Optimisation for Constrained Monotone Submodular Functions.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 261–269. GECCO’21. New York, NY, USA: Association for Computing Machinery, 2021. <a href=\"https://doi.org/10.1145/3449639.3459385\">https://doi.org/10.1145/3449639.3459385</a>.","mla":"Neumann, Aneta, et al. “Diversifying Greedy Sampling and Evolutionary Diversity Optimisation for Constrained Monotone Submodular Functions.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2021, pp. 261–269, doi:<a href=\"https://doi.org/10.1145/3449639.3459385\">10.1145/3449639.3459385</a>.","short":"A. Neumann, J. Bossek, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2021, pp. 261–269.","bibtex":"@inproceedings{Neumann_Bossek_Neumann_2021, place={New York, NY, USA}, series={GECCO’21}, title={Diversifying Greedy Sampling and Evolutionary Diversity Optimisation for Constrained Monotone Submodular Functions}, DOI={<a href=\"https://doi.org/10.1145/3449639.3459385\">10.1145/3449639.3459385</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Neumann, Aneta and Bossek, Jakob and Neumann, Frank}, year={2021}, pages={261–269}, collection={GECCO’21} }","apa":"Neumann, A., Bossek, J., &#38; Neumann, F. (2021). Diversifying Greedy Sampling and Evolutionary Diversity Optimisation for Constrained Monotone Submodular Functions. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 261–269. <a href=\"https://doi.org/10.1145/3449639.3459385\">https://doi.org/10.1145/3449639.3459385</a>"},"place":"New York, NY, USA","publication_identifier":{"isbn":["978-1-4503-8350-9"]},"extern":"1","department":[{"_id":"819"}],"series_title":"GECCO’21","user_id":"102979","_id":"48891","status":"public","type":"conference"},{"citation":{"mla":"Nikfarjam, Adel, et al. “Computing Diverse Sets of High Quality TSP Tours by EAX-Based Evolutionary Diversity Optimisation.” <i>Proceedings of the 16th ACM}/SIGEVO Conference on Foundations of Genetic Algorithms</i>, Association for Computing Machinery, 2021, pp. 1–11.","short":"A. Nikfarjam, J. Bossek, A. Neumann, F. Neumann, in: Proceedings of the 16th ACM}/SIGEVO Conference on Foundations of Genetic Algorithms, Association for Computing Machinery, New York, NY, USA, 2021, pp. 1–11.","bibtex":"@inbook{Nikfarjam_Bossek_Neumann_Neumann_2021, place={New York, NY, USA}, title={Computing Diverse Sets of High Quality TSP Tours by EAX-based Evolutionary Diversity Optimisation}, booktitle={Proceedings of the 16th ACM}/SIGEVO Conference on Foundations of Genetic Algorithms}, publisher={Association for Computing Machinery}, author={Nikfarjam, Adel and Bossek, Jakob and Neumann, Aneta and Neumann, Frank}, year={2021}, pages={1–11} }","apa":"Nikfarjam, A., Bossek, J., Neumann, A., &#38; Neumann, F. (2021). Computing Diverse Sets of High Quality TSP Tours by EAX-based Evolutionary Diversity Optimisation. In <i>Proceedings of the 16th ACM}/SIGEVO Conference on Foundations of Genetic Algorithms</i> (pp. 1–11). Association for Computing Machinery.","ama":"Nikfarjam A, Bossek J, Neumann A, Neumann F. Computing Diverse Sets of High Quality TSP Tours by EAX-based Evolutionary Diversity Optimisation. In: <i>Proceedings of the 16th ACM}/SIGEVO Conference on Foundations of Genetic Algorithms</i>. Association for Computing Machinery; 2021:1–11.","chicago":"Nikfarjam, Adel, Jakob Bossek, Aneta Neumann, and Frank Neumann. “Computing Diverse Sets of High Quality TSP Tours by EAX-Based Evolutionary Diversity Optimisation.” In <i>Proceedings of the 16th ACM}/SIGEVO Conference on Foundations of Genetic Algorithms</i>, 1–11. New York, NY, USA: Association for Computing Machinery, 2021.","ieee":"A. Nikfarjam, J. Bossek, A. Neumann, and F. Neumann, “Computing Diverse Sets of High Quality TSP Tours by EAX-based Evolutionary Diversity Optimisation,” in <i>Proceedings of the 16th ACM}/SIGEVO Conference on Foundations of Genetic Algorithms</i>, New York, NY, USA: Association for Computing Machinery, 2021, pp. 1–11."},"page":"1–11","year":"2021","place":"New York, NY, USA","publication_identifier":{"isbn":["978-1-4503-8352-3"]},"title":"Computing Diverse Sets of High Quality TSP Tours by EAX-based Evolutionary Diversity Optimisation","date_created":"2023-11-14T15:59:00Z","author":[{"first_name":"Adel","last_name":"Nikfarjam","full_name":"Nikfarjam, Adel"},{"full_name":"Bossek, Jakob","id":"102979","orcid":"0000-0002-4121-4668","last_name":"Bossek","first_name":"Jakob"},{"first_name":"Aneta","full_name":"Neumann, Aneta","last_name":"Neumann"},{"first_name":"Frank","full_name":"Neumann, Frank","last_name":"Neumann"}],"publisher":"Association for Computing Machinery","date_updated":"2023-12-13T10:49:59Z","status":"public","abstract":[{"text":"Evolutionary algorithms based on edge assembly crossover (EAX) constitute some of the best performing incomplete solvers for the well-known traveling salesperson problem (TSP). Often, it is desirable to compute not just a single solution for a given problem, but a diverse set of high quality solutions from which a decision maker can choose one for implementation. Currently, there are only a few approaches for computing a diverse solution set for the TSP. Furthermore, almost all of them assume that the optimal solution is known. In this paper, we introduce evolutionary diversity optimisation (EDO) approaches for the TSP that find a diverse set of tours when the optimal tour is known or unknown. We show how to adopt EAX to not only find a high-quality solution but also to maximise the diversity of the population. The resulting EAX-based EDO approach, termed EAX-EDO is capable of obtaining diverse high-quality tours when the optimal solution for the TSP is known or unknown. A comparison to existing approaches shows that they are clearly outperformed by EAX-EDO.","lang":"eng"}],"type":"book_chapter","publication":"Proceedings of the 16th ACM}/SIGEVO Conference on Foundations of Genetic Algorithms","extern":"1","language":[{"iso":"eng"}],"keyword":["edge assembly crossover (EAX)","evolutionary algorithms","evolutionary diversity optimisation (EDO)","traveling salesperson problem (TSP)"],"user_id":"102979","department":[{"_id":"819"}],"_id":"48892"},{"type":"journal_article","publication":"Algorithmica","status":"public","abstract":[{"lang":"eng","text":"We contribute to the theoretical understanding of randomized search heuristics for dynamic problems. We consider the classical vertex coloring problem on graphs and investigate the dynamic setting where edges are added to the current graph. We then analyze the expected time for randomized search heuristics to recompute high quality solutions. The (1+1) Evolutionary Algorithm and RLS operate in a setting where the number of colors is bounded and we are minimizing the number of conflicts. Iterated local search algorithms use an unbounded color palette and aim to use the smallest colors and, consequently, the smallest number of colors. We identify classes of bipartite graphs where reoptimization is as hard as or even harder than optimization from scratch, i.e., starting with a random initialization. Even adding a single edge can lead to hard symmetry problems. However, graph classes that are hard for one algorithm turn out to be easy for others. In most cases our bounds show that reoptimization is faster than optimizing from scratch. We further show that tailoring mutation operators to parts of the graph where changes have occurred can significantly reduce the expected reoptimization time. In most settings the expected reoptimization time for such tailored algorithms is linear in the number of added edges. However, tailored algorithms cannot prevent exponential times in settings where the original algorithm is inefficient."}],"user_id":"102979","department":[{"_id":"819"}],"_id":"48854","language":[{"iso":"eng"}],"keyword":["Dynamic optimization","Evolutionary algorithms","Running time analysis"],"issue":"10","publication_identifier":{"issn":["0178-4617"]},"citation":{"ieee":"J. Bossek, F. Neumann, P. Peng, and D. Sudholt, “Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem,” <i>Algorithmica</i>, vol. 83, no. 10, pp. 3148–3179, 2021, doi: <a href=\"https://doi.org/10.1007/s00453-021-00838-3\">10.1007/s00453-021-00838-3</a>.","chicago":"Bossek, Jakob, Frank Neumann, Pan Peng, and Dirk Sudholt. “Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem.” <i>Algorithmica</i> 83, no. 10 (2021): 3148–3179. <a href=\"https://doi.org/10.1007/s00453-021-00838-3\">https://doi.org/10.1007/s00453-021-00838-3</a>.","ama":"Bossek J, Neumann F, Peng P, Sudholt D. Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem. <i>Algorithmica</i>. 2021;83(10):3148–3179. doi:<a href=\"https://doi.org/10.1007/s00453-021-00838-3\">10.1007/s00453-021-00838-3</a>","bibtex":"@article{Bossek_Neumann_Peng_Sudholt_2021, title={Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem}, volume={83}, DOI={<a href=\"https://doi.org/10.1007/s00453-021-00838-3\">10.1007/s00453-021-00838-3</a>}, number={10}, journal={Algorithmica}, author={Bossek, Jakob and Neumann, Frank and Peng, Pan and Sudholt, Dirk}, year={2021}, pages={3148–3179} }","mla":"Bossek, Jakob, et al. “Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem.” <i>Algorithmica</i>, vol. 83, no. 10, 2021, pp. 3148–3179, doi:<a href=\"https://doi.org/10.1007/s00453-021-00838-3\">10.1007/s00453-021-00838-3</a>.","short":"J. Bossek, F. Neumann, P. Peng, D. Sudholt, Algorithmica 83 (2021) 3148–3179.","apa":"Bossek, J., Neumann, F., Peng, P., &#38; Sudholt, D. (2021). Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem. <i>Algorithmica</i>, <i>83</i>(10), 3148–3179. <a href=\"https://doi.org/10.1007/s00453-021-00838-3\">https://doi.org/10.1007/s00453-021-00838-3</a>"},"intvolume":"        83","page":"3148–3179","year":"2021","author":[{"full_name":"Bossek, Jakob","id":"102979","last_name":"Bossek","orcid":"0000-0002-4121-4668","first_name":"Jakob"},{"last_name":"Neumann","full_name":"Neumann, Frank","first_name":"Frank"},{"last_name":"Peng","full_name":"Peng, Pan","first_name":"Pan"},{"last_name":"Sudholt","full_name":"Sudholt, Dirk","first_name":"Dirk"}],"date_created":"2023-11-14T15:58:54Z","volume":83,"date_updated":"2023-12-13T10:51:34Z","doi":"10.1007/s00453-021-00838-3","title":"Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem"},{"series_title":"GECCO ’20","user_id":"102979","department":[{"_id":"819"}],"_id":"48847","extern":"1","language":[{"iso":"eng"}],"keyword":["dynamic optimization","evolutionary algorithms","running time analysis","theory"],"type":"conference","publication":"Proceedings of the Genetic and Evolutionary Computation Conference","status":"public","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."}],"author":[{"orcid":"0000-0002-4121-4668","last_name":"Bossek","id":"102979","full_name":"Bossek, Jakob","first_name":"Jakob"},{"first_name":"Frank","last_name":"Neumann","full_name":"Neumann, Frank"},{"full_name":"Peng, Pan","last_name":"Peng","first_name":"Pan"},{"last_name":"Sudholt","full_name":"Sudholt, Dirk","first_name":"Dirk"}],"date_created":"2023-11-14T15:58:53Z","date_updated":"2023-12-13T10:43:41Z","publisher":"Association for Computing Machinery","doi":"10.1145/3377930.3390174","title":"More Effective Randomized Search Heuristics for Graph Coloring through Dynamic Optimization","publication_status":"published","publication_identifier":{"isbn":["978-1-4503-7128-5"]},"citation":{"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>","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} }","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.","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>.","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>."},"page":"1277–1285","place":"New York, NY, USA","year":"2020"},{"date_updated":"2023-12-13T10:43:33Z","author":[{"full_name":"Bossek, Jakob","id":"102979","orcid":"0000-0002-4121-4668","last_name":"Bossek","first_name":"Jakob"},{"first_name":"Katrin","last_name":"Casel","full_name":"Casel, Katrin"},{"last_name":"Kerschke","full_name":"Kerschke, Pascal","first_name":"Pascal"},{"first_name":"Frank","full_name":"Neumann, Frank","last_name":"Neumann"}],"doi":"10.1145/3377930.3390243","publication_status":"published","publication_identifier":{"isbn":["978-1-4503-7128-5"]},"place":"New York, NY, USA","citation":{"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>","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.","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>.","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} }","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>","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>.","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>."},"page":"1286–1294","_id":"48851","user_id":"102979","series_title":"GECCO ’20","department":[{"_id":"819"}],"extern":"1","type":"conference","status":"public","publisher":"Association for Computing Machinery","date_created":"2023-11-14T15:58:53Z","title":"The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics","year":"2020","keyword":["dynamic optimization","evolutionary algorithms","running time analysis","theory"],"language":[{"iso":"eng"}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference","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"}]}]