[{"publication_identifier":{"isbn":["978-3-642-37140-0"]},"place":"Berlin, Heidelberg","year":"2013","page":"81–95","citation":{"apa":"Wagner, T., Trautmann, H., &#38; Brockhoff, D. (2013). Preference Articulation by Means of the R2 Indicator. In R. C. Purshouse, P. J. Fleming, C. M. Fonseca, S. Greco, &#38; J. Shaw (Eds.), <i>Evolutionary Multi-Criterion Optimization</i> (pp. 81–95). Springer Berlin Heidelberg.","bibtex":"@inproceedings{Wagner_Trautmann_Brockhoff_2013, place={Berlin, Heidelberg}, title={Preference Articulation by Means of the R2 Indicator}, booktitle={Evolutionary Multi-Criterion Optimization}, publisher={Springer Berlin Heidelberg}, author={Wagner, Tobias and Trautmann, Heike and Brockhoff, Dimo}, editor={Purshouse, Robin C. and Fleming, Peter J. and Fonseca, Carlos M. and Greco, Salvatore and Shaw, Jane}, year={2013}, pages={81–95} }","mla":"Wagner, Tobias, et al. “Preference Articulation by Means of the R2 Indicator.” <i>Evolutionary Multi-Criterion Optimization</i>, edited by Robin C. Purshouse et al., Springer Berlin Heidelberg, 2013, pp. 81–95.","short":"T. Wagner, H. Trautmann, D. Brockhoff, in: R.C. Purshouse, P.J. Fleming, C.M. Fonseca, S. Greco, J. Shaw (Eds.), Evolutionary Multi-Criterion Optimization, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 81–95.","ama":"Wagner T, Trautmann H, Brockhoff D. Preference Articulation by Means of the R2 Indicator. In: Purshouse RC, Fleming PJ, Fonseca CM, Greco S, Shaw J, eds. <i>Evolutionary Multi-Criterion Optimization</i>. Springer Berlin Heidelberg; 2013:81–95.","ieee":"T. Wagner, H. Trautmann, and D. Brockhoff, “Preference Articulation by Means of the R2 Indicator,” in <i>Evolutionary Multi-Criterion Optimization</i>, 2013, pp. 81–95.","chicago":"Wagner, Tobias, Heike Trautmann, and Dimo Brockhoff. “Preference Articulation by Means of the R2 Indicator.” In <i>Evolutionary Multi-Criterion Optimization</i>, edited by Robin C. Purshouse, Peter J. Fleming, Carlos M. Fonseca, Salvatore Greco, and Jane Shaw, 81–95. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013."},"publisher":"Springer Berlin Heidelberg","date_updated":"2023-10-16T13:47:58Z","date_created":"2023-08-04T15:47:49Z","author":[{"full_name":"Wagner, Tobias","last_name":"Wagner","first_name":"Tobias"},{"first_name":"Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","id":"100740","full_name":"Trautmann, Heike"},{"first_name":"Dimo","last_name":"Brockhoff","full_name":"Brockhoff, Dimo"}],"title":"Preference Articulation by Means of the R2 Indicator","publication":"Evolutionary Multi-Criterion Optimization","type":"conference","abstract":[{"lang":"eng","text":"In multi-objective optimization, set-based performance indicators have become the state of the art for assessing the quality of Pareto front approximations. As a consequence, they are also more and more used within the design of multi-objective optimization algorithms. The R2 and the Hypervolume (HV) indicator represent two popular examples. In order to understand the behavior and the approximations preferred by these indicators and algorithms, a comprehensive knowledge of the indicator’s properties is required. Whereas this knowledge is available for the HV, we presented a first approach in this direction for the R2 indicator just recently. In this paper, we build upon this knowledge and enhance the considerations with respect to the integration of preferences into the R2 indicator. More specifically, we analyze the effect of the reference point, the domain of the weights, and the distribution of weight vectors on the optimization of $\\mu$ solutions with respect to the R2 indicator. By means of theoretical findings and empirical evidence, we show the potentials of these three possibilities using the optimal distribution of $\\mu$ solutions for exemplary setups."}],"editor":[{"first_name":"Robin C.","last_name":"Purshouse","full_name":"Purshouse, Robin C."},{"full_name":"Fleming, Peter J.","last_name":"Fleming","first_name":"Peter J."},{"first_name":"Carlos M.","last_name":"Fonseca","full_name":"Fonseca, Carlos M."},{"last_name":"Greco","full_name":"Greco, Salvatore","first_name":"Salvatore"},{"last_name":"Shaw","full_name":"Shaw, Jane","first_name":"Jane"}],"status":"public","_id":"46393","department":[{"_id":"34"},{"_id":"819"}],"user_id":"15504","language":[{"iso":"eng"}]},{"type":"conference","publication":"Learning and Intelligent Optimization","abstract":[{"text":"An indicator-based evolutionary multiobjective optimization algorithm (EMOA) is introduced which incorporates the contribution to the unary R2-indicator as the secondary selection criterion. First experiments indicate that the R2-EMOA accurately approximates the Pareto front of the considered continuous multiobjective optimization problems. Furthermore, decision makers’ preferences can be included by adjusting the weight vector distributions of the indicator which results in a focused search behavior.","lang":"eng"}],"editor":[{"last_name":"Nicosia","full_name":"Nicosia, Giuseppe","first_name":"Giuseppe"},{"first_name":"Panos","full_name":"Pardalos, Panos","last_name":"Pardalos"}],"status":"public","_id":"46392","user_id":"15504","department":[{"_id":"34"},{"_id":"819"}],"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-3-642-44973-4"]},"place":"Berlin, Heidelberg","year":"2013","citation":{"bibtex":"@inproceedings{Trautmann_Wagner_Brockhoff_2013, place={Berlin, Heidelberg}, title={R2-EMOA: Focused Multiobjective Search Using R2-Indicator-Based Selection}, booktitle={Learning and Intelligent Optimization}, publisher={Springer Berlin Heidelberg}, author={Trautmann, Heike and Wagner, Tobias and Brockhoff, Dimo}, editor={Nicosia, Giuseppe and Pardalos, Panos}, year={2013}, pages={70–74} }","mla":"Trautmann, Heike, et al. “R2-EMOA: Focused Multiobjective Search Using R2-Indicator-Based Selection.” <i>Learning and Intelligent Optimization</i>, edited by Giuseppe Nicosia and Panos Pardalos, Springer Berlin Heidelberg, 2013, pp. 70–74.","short":"H. Trautmann, T. Wagner, D. Brockhoff, in: G. Nicosia, P. Pardalos (Eds.), Learning and Intelligent Optimization, Springer Berlin Heidelberg, Berlin, Heidelberg, 2013, pp. 70–74.","apa":"Trautmann, H., Wagner, T., &#38; Brockhoff, D. (2013). R2-EMOA: Focused Multiobjective Search Using R2-Indicator-Based Selection. In G. Nicosia &#38; P. Pardalos (Eds.), <i>Learning and Intelligent Optimization</i> (pp. 70–74). Springer Berlin Heidelberg.","ieee":"H. Trautmann, T. Wagner, and D. Brockhoff, “R2-EMOA: Focused Multiobjective Search Using R2-Indicator-Based Selection,” in <i>Learning and Intelligent Optimization</i>, 2013, pp. 70–74.","chicago":"Trautmann, Heike, Tobias Wagner, and Dimo Brockhoff. “R2-EMOA: Focused Multiobjective Search Using R2-Indicator-Based Selection.” In <i>Learning and Intelligent Optimization</i>, edited by Giuseppe Nicosia and Panos Pardalos, 70–74. Berlin, Heidelberg: Springer Berlin Heidelberg, 2013.","ama":"Trautmann H, Wagner T, Brockhoff D. R2-EMOA: Focused Multiobjective Search Using R2-Indicator-Based Selection. In: Nicosia G, Pardalos P, eds. <i>Learning and Intelligent Optimization</i>. Springer Berlin Heidelberg; 2013:70–74."},"page":"70–74","publisher":"Springer Berlin Heidelberg","date_updated":"2023-10-16T13:47:41Z","author":[{"first_name":"Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","id":"100740","full_name":"Trautmann, Heike"},{"full_name":"Wagner, Tobias","last_name":"Wagner","first_name":"Tobias"},{"last_name":"Brockhoff","full_name":"Brockhoff, Dimo","first_name":"Dimo"}],"date_created":"2023-08-04T15:47:00Z","title":"R2-EMOA: Focused Multiobjective Search Using R2-Indicator-Based Selection"},{"citation":{"ieee":"O. Mersmann, B. Bischl, H. Trautmann, M. Wagner, J. Bossek, and F. Neumann, “A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesperson Problem,” <i>Annals of Mathematics and Artificial Intelligence</i>, vol. 69, no. 2, pp. 151–182, 2013, doi: <a href=\"https://doi.org/10.1007/s10472-013-9341-2\">10.1007/s10472-013-9341-2</a>.","chicago":"Mersmann, Olaf, Bernd Bischl, Heike Trautmann, Markus Wagner, Jakob Bossek, and Frank Neumann. “A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesperson Problem.” <i>Annals of Mathematics and Artificial Intelligence</i> 69, no. 2 (2013): 151–182. <a href=\"https://doi.org/10.1007/s10472-013-9341-2\">https://doi.org/10.1007/s10472-013-9341-2</a>.","ama":"Mersmann O, Bischl B, Trautmann H, Wagner M, Bossek J, Neumann F. A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesperson Problem. <i>Annals of Mathematics and Artificial Intelligence</i>. 2013;69(2):151–182. doi:<a href=\"https://doi.org/10.1007/s10472-013-9341-2\">10.1007/s10472-013-9341-2</a>","mla":"Mersmann, Olaf, et al. “A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesperson Problem.” <i>Annals of Mathematics and Artificial Intelligence</i>, vol. 69, no. 2, 2013, pp. 151–182, doi:<a href=\"https://doi.org/10.1007/s10472-013-9341-2\">10.1007/s10472-013-9341-2</a>.","short":"O. Mersmann, B. Bischl, H. Trautmann, M. Wagner, J. Bossek, F. Neumann, Annals of Mathematics and Artificial Intelligence 69 (2013) 151–182.","bibtex":"@article{Mersmann_Bischl_Trautmann_Wagner_Bossek_Neumann_2013, title={A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesperson Problem}, volume={69}, DOI={<a href=\"https://doi.org/10.1007/s10472-013-9341-2\">10.1007/s10472-013-9341-2</a>}, number={2}, journal={Annals of Mathematics and Artificial Intelligence}, author={Mersmann, Olaf and Bischl, Bernd and Trautmann, Heike and Wagner, Markus and Bossek, Jakob and Neumann, Frank}, year={2013}, pages={151–182} }","apa":"Mersmann, O., Bischl, B., Trautmann, H., Wagner, M., Bossek, J., &#38; Neumann, F. (2013). A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesperson Problem. <i>Annals of Mathematics and Artificial Intelligence</i>, <i>69</i>(2), 151–182. <a href=\"https://doi.org/10.1007/s10472-013-9341-2\">https://doi.org/10.1007/s10472-013-9341-2</a>"},"intvolume":"        69","page":"151–182","year":"2013","issue":"2","publication_identifier":{"issn":["1012-2443"]},"doi":"10.1007/s10472-013-9341-2","title":"A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesperson Problem","date_created":"2023-11-14T15:58:59Z","author":[{"last_name":"Mersmann","full_name":"Mersmann, Olaf","first_name":"Olaf"},{"first_name":"Bernd","last_name":"Bischl","full_name":"Bischl, Bernd"},{"last_name":"Trautmann","full_name":"Trautmann, Heike","first_name":"Heike"},{"last_name":"Wagner","full_name":"Wagner, Markus","first_name":"Markus"},{"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"}],"volume":69,"date_updated":"2023-12-13T10:50:41Z","status":"public","abstract":[{"lang":"eng","text":"Meta-heuristics are frequently used to tackle NP-hard combinatorial optimization problems. With this paper we contribute to the understanding of the success of 2-opt based local search algorithms for solving the traveling salesperson problem (TSP). Although 2-opt is widely used in practice, it is hard to understand its success from a theoretical perspective. We take a statistical approach and examine the features of TSP instances that make the problem either hard or easy to solve. As a measure of problem difficulty for 2-opt we use the approximation ratio that it achieves on a given instance. Our investigations point out important features that make TSP instances hard or easy to be approximated by 2-opt."}],"type":"journal_article","publication":"Annals of Mathematics and Artificial Intelligence","language":[{"iso":"eng"}],"keyword":["2-opt","90B06","Classification","Feature selection","MARS","TSP"],"user_id":"102979","department":[{"_id":"819"}],"_id":"48889"},{"publication":"Annals of Mathematics and Artificial Intelligence","type":"journal_article","abstract":[{"text":"Meta-heuristics are frequently used to tackle NP-hard combinatorial optimization problems. With this paper we contribute to the understanding of the success of 2-opt based local search algorithms for solving the traveling salesperson problem (TSP). Although 2-opt is widely used in practice, it is hard to understand its success from a theoretical perspective. We take a statistical approach and examine the features of TSP instances that make the problem either hard or easy to solve. As a measure of problem difficulty for 2-opt we use the approximation ratio that it achieves on a given instance. Our investigations point out important features that make TSP instances hard or easy to be approximated by 2-opt.","lang":"eng"}],"status":"public","_id":"46394","department":[{"_id":"34"},{"_id":"819"}],"user_id":"15504","language":[{"iso":"eng"}],"year":"2013","page":"151–182","intvolume":"        69","citation":{"chicago":"Mersmann, O, B Bischl, Heike Trautmann, M Wagner, Jakob Bossek, and F Neumann. “A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem.” <i>Annals of Mathematics and Artificial Intelligence</i> 69 (2013): 151–182.","ieee":"O. Mersmann, B. Bischl, H. Trautmann, M. Wagner, J. Bossek, and F. Neumann, “A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem,” <i>Annals of Mathematics and Artificial Intelligence</i>, vol. 69, pp. 151–182, 2013.","bibtex":"@article{Mersmann_Bischl_Trautmann_Wagner_Bossek_Neumann_2013, title={A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem}, volume={69}, journal={Annals of Mathematics and Artificial Intelligence}, author={Mersmann, O and Bischl, B and Trautmann, Heike and Wagner, M and Bossek, Jakob and Neumann, F}, year={2013}, pages={151–182} }","short":"O. Mersmann, B. Bischl, H. Trautmann, M. Wagner, J. Bossek, F. Neumann, Annals of Mathematics and Artificial Intelligence 69 (2013) 151–182.","mla":"Mersmann, O., et al. “A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem.” <i>Annals of Mathematics and Artificial Intelligence</i>, vol. 69, 2013, pp. 151–182.","apa":"Mersmann, O., Bischl, B., Trautmann, H., Wagner, M., Bossek, J., &#38; Neumann, F. (2013). A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem. <i>Annals of Mathematics and Artificial Intelligence</i>, <i>69</i>, 151–182.","ama":"Mersmann O, Bischl B, Trautmann H, Wagner M, Bossek J, Neumann F. A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem. <i>Annals of Mathematics and Artificial Intelligence</i>. 2013;69:151–182."},"date_updated":"2024-06-10T11:57:43Z","volume":69,"author":[{"full_name":"Mersmann, O","last_name":"Mersmann","first_name":"O"},{"first_name":"B","full_name":"Bischl, B","last_name":"Bischl"},{"first_name":"Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","full_name":"Trautmann, Heike","id":"100740"},{"last_name":"Wagner","full_name":"Wagner, M","first_name":"M"},{"first_name":"Jakob","id":"102979","full_name":"Bossek, Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668"},{"first_name":"F","last_name":"Neumann","full_name":"Neumann, F"}],"date_created":"2023-08-04T15:48:57Z","title":"A Novel Feature-Based Approach to Characterize Algorithm Performance for the Traveling Salesman Problem"},{"place":"New York, NY, USA","year":"2012","citation":{"bibtex":"@inproceedings{Brockhoff_Wagner_Trautmann_2012, place={New York, NY, USA}, series={GECCO ’12}, title={On the Properties of the R2 Indicator}, DOI={<a href=\"https://doi.org/10.1145/2330163.2330230\">10.1145/2330163.2330230</a>}, booktitle={Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation}, publisher={Association for Computing Machinery}, author={Brockhoff, Dimo and Wagner, Tobias and Trautmann, Heike}, year={2012}, pages={465–472}, collection={GECCO ’12} }","short":"D. Brockhoff, T. Wagner, H. Trautmann, in: Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation, Association for Computing Machinery, New York, NY, USA, 2012, pp. 465–472.","mla":"Brockhoff, Dimo, et al. “On the Properties of the R2 Indicator.” <i>Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation</i>, Association for Computing Machinery, 2012, pp. 465–472, doi:<a href=\"https://doi.org/10.1145/2330163.2330230\">10.1145/2330163.2330230</a>.","apa":"Brockhoff, D., Wagner, T., &#38; Trautmann, H. (2012). On the Properties of the R2 Indicator. <i>Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation</i>, 465–472. <a href=\"https://doi.org/10.1145/2330163.2330230\">https://doi.org/10.1145/2330163.2330230</a>","ama":"Brockhoff D, Wagner T, Trautmann H. On the Properties of the R2 Indicator. In: <i>Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation</i>. GECCO ’12. Association for Computing Machinery; 2012:465–472. doi:<a href=\"https://doi.org/10.1145/2330163.2330230\">10.1145/2330163.2330230</a>","ieee":"D. Brockhoff, T. Wagner, and H. Trautmann, “On the Properties of the R2 Indicator,” in <i>Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation</i>, 2012, pp. 465–472, doi: <a href=\"https://doi.org/10.1145/2330163.2330230\">10.1145/2330163.2330230</a>.","chicago":"Brockhoff, Dimo, Tobias Wagner, and Heike Trautmann. “On the Properties of the R2 Indicator.” In <i>Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation</i>, 465–472. GECCO ’12. New York, NY, USA: Association for Computing Machinery, 2012. <a href=\"https://doi.org/10.1145/2330163.2330230\">https://doi.org/10.1145/2330163.2330230</a>."},"page":"465–472","publication_identifier":{"isbn":["9781450311779"]},"title":"On the Properties of the R2 Indicator","doi":"10.1145/2330163.2330230","publisher":"Association for Computing Machinery","date_updated":"2023-10-16T13:47:23Z","author":[{"full_name":"Brockhoff, Dimo","last_name":"Brockhoff","first_name":"Dimo"},{"last_name":"Wagner","full_name":"Wagner, Tobias","first_name":"Tobias"},{"full_name":"Trautmann, Heike","id":"100740","orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike"}],"date_created":"2023-08-04T15:52:42Z","abstract":[{"lang":"eng","text":"In multiobjective optimization, set-based performance indicators are commonly used to assess the quality of a Pareto front approximation. Based on the scalarization obtained by these indicators, a performance comparison of multiobjective optimization algorithms becomes possible. The R2 and the Hypervolume (HV) indicator represent two recommended approaches which have shown a correlated behavior in recent empirical studies. Whereas the HV indicator has been comprehensively analyzed in the last years, almost no studies on the R2 indicator exist. In this paper, we thus perform a comprehensive investigation of the properties of the R2 indicator in a theoretical and empirical way. The influence of the number and distribution of the weight vectors on the optimal distribution of μ solutions is analyzed. Based on a comparative analysis, specific characteristics and differences of the R2 and HV indicator are presented."}],"status":"public","type":"conference","publication":"Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation","keyword":["hypervolume indicator","multiobjective optimization","performance assessment","r2 indicator"],"language":[{"iso":"eng"}],"_id":"46397","series_title":"GECCO ’12","user_id":"15504","department":[{"_id":"34"},{"_id":"819"}]},{"publication":"Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation","type":"conference","status":"public","abstract":[{"text":"The steady supply of new optimization methods makes the algorithm selection problem (ASP) an increasingly pressing and challenging task, specially for real-world black-box optimization problems. The introduced approach considers the ASP as a cost-sensitive classification task which is based on Exploratory Landscape Analysis. Low-level features gathered by systematic sampling of the function on the feasible set are used to predict a well-performing algorithm out of a given portfolio. Example-specific label costs are defined by the expected runtime of each candidate algorithm. We use one-sided support vector regression to solve this learning problem. The approach is illustrated by means of the optimization problems and algorithms of the BBOB’09/10 workshop.","lang":"eng"}],"department":[{"_id":"34"},{"_id":"819"}],"user_id":"15504","series_title":"GECCO ’12","_id":"46396","language":[{"iso":"eng"}],"keyword":["machine learning","exploratory landscape analysis","fitness landscape","benchmarking","evolutionary optimization","bbob test set","algorithm selection"],"publication_identifier":{"isbn":["9781450311779"]},"page":"313–320","citation":{"short":"B. Bischl, O. Mersmann, H. Trautmann, M. Preuß, in: Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation, Association for Computing Machinery, New York, NY, USA, 2012, pp. 313–320.","bibtex":"@inproceedings{Bischl_Mersmann_Trautmann_Preuß_2012, place={New York, NY, USA}, series={GECCO ’12}, title={Algorithm Selection Based on Exploratory Landscape Analysis and Cost-Sensitive Learning}, DOI={<a href=\"https://doi.org/10.1145/2330163.2330209\">10.1145/2330163.2330209</a>}, booktitle={Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation}, publisher={Association for Computing Machinery}, author={Bischl, Bernd and Mersmann, Olaf and Trautmann, Heike and Preuß, Mike}, year={2012}, pages={313–320}, collection={GECCO ’12} }","mla":"Bischl, Bernd, et al. “Algorithm Selection Based on Exploratory Landscape Analysis and Cost-Sensitive Learning.” <i>Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation</i>, Association for Computing Machinery, 2012, pp. 313–320, doi:<a href=\"https://doi.org/10.1145/2330163.2330209\">10.1145/2330163.2330209</a>.","apa":"Bischl, B., Mersmann, O., Trautmann, H., &#38; Preuß, M. (2012). Algorithm Selection Based on Exploratory Landscape Analysis and Cost-Sensitive Learning. <i>Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation</i>, 313–320. <a href=\"https://doi.org/10.1145/2330163.2330209\">https://doi.org/10.1145/2330163.2330209</a>","ama":"Bischl B, Mersmann O, Trautmann H, Preuß M. Algorithm Selection Based on Exploratory Landscape Analysis and Cost-Sensitive Learning. In: <i>Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation</i>. GECCO ’12. Association for Computing Machinery; 2012:313–320. doi:<a href=\"https://doi.org/10.1145/2330163.2330209\">10.1145/2330163.2330209</a>","chicago":"Bischl, Bernd, Olaf Mersmann, Heike Trautmann, and Mike Preuß. “Algorithm Selection Based on Exploratory Landscape Analysis and Cost-Sensitive Learning.” In <i>Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation</i>, 313–320. GECCO ’12. New York, NY, USA: Association for Computing Machinery, 2012. <a href=\"https://doi.org/10.1145/2330163.2330209\">https://doi.org/10.1145/2330163.2330209</a>.","ieee":"B. Bischl, O. Mersmann, H. Trautmann, and M. Preuß, “Algorithm Selection Based on Exploratory Landscape Analysis and Cost-Sensitive Learning,” in <i>Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation</i>, 2012, pp. 313–320, doi: <a href=\"https://doi.org/10.1145/2330163.2330209\">10.1145/2330163.2330209</a>."},"place":"New York, NY, USA","year":"2012","date_created":"2023-08-04T15:51:56Z","author":[{"first_name":"Bernd","full_name":"Bischl, Bernd","last_name":"Bischl"},{"last_name":"Mersmann","full_name":"Mersmann, Olaf","first_name":"Olaf"},{"first_name":"Heike","id":"100740","full_name":"Trautmann, Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann"},{"first_name":"Mike","last_name":"Preuß","full_name":"Preuß, Mike"}],"date_updated":"2023-10-16T13:48:48Z","publisher":"Association for Computing Machinery","doi":"10.1145/2330163.2330209","title":"Algorithm Selection Based on Exploratory Landscape Analysis and Cost-Sensitive Learning"},{"issue":"2","year":"2012","citation":{"apa":"Bischl, B., Mersmann, O., Trautmann, H., &#38; Weihs, C. (2012). Resampling Methods in Model Validation. <i>Evolutionary Computation Journal</i>, <i>20</i>(2), 249–275. <a href=\"https://doi.org/10.1162/EVCO_a_00069\">https://doi.org/10.1162/EVCO_a_00069</a>","mla":"Bischl, B., et al. “Resampling Methods in Model Validation.” <i>Evolutionary Computation Journal</i>, vol. 20, no. 2, 2012, pp. 249–275, doi:<a href=\"https://doi.org/10.1162/EVCO_a_00069\">10.1162/EVCO_a_00069</a>.","short":"B. Bischl, O. Mersmann, H. Trautmann, C. Weihs, Evolutionary Computation Journal 20 (2012) 249–275.","bibtex":"@article{Bischl_Mersmann_Trautmann_Weihs_2012, title={Resampling Methods in Model Validation}, volume={20}, DOI={<a href=\"https://doi.org/10.1162/EVCO_a_00069\">10.1162/EVCO_a_00069</a>}, number={2}, journal={Evolutionary Computation Journal}, author={Bischl, B and Mersmann, O and Trautmann, Heike and Weihs, C}, year={2012}, pages={249–275} }","chicago":"Bischl, B, O Mersmann, Heike Trautmann, and C Weihs. “Resampling Methods in Model Validation.” <i>Evolutionary Computation Journal</i> 20, no. 2 (2012): 249–275. <a href=\"https://doi.org/10.1162/EVCO_a_00069\">https://doi.org/10.1162/EVCO_a_00069</a>.","ieee":"B. Bischl, O. Mersmann, H. Trautmann, and C. Weihs, “Resampling Methods in Model Validation,” <i>Evolutionary Computation Journal</i>, vol. 20, no. 2, pp. 249–275, 2012, doi: <a href=\"https://doi.org/10.1162/EVCO_a_00069\">10.1162/EVCO_a_00069</a>.","ama":"Bischl B, Mersmann O, Trautmann H, Weihs C. Resampling Methods in Model Validation. <i>Evolutionary Computation Journal</i>. 2012;20(2):249–275. doi:<a href=\"https://doi.org/10.1162/EVCO_a_00069\">10.1162/EVCO_a_00069</a>"},"intvolume":"        20","page":"249–275","date_updated":"2023-10-16T13:53:58Z","date_created":"2023-08-04T15:54:41Z","author":[{"first_name":"B","full_name":"Bischl, B","last_name":"Bischl"},{"first_name":"O","full_name":"Mersmann, O","last_name":"Mersmann"},{"last_name":"Trautmann","orcid":"0000-0002-9788-8282","full_name":"Trautmann, Heike","id":"100740","first_name":"Heike"},{"last_name":"Weihs","full_name":"Weihs, C","first_name":"C"}],"volume":20,"title":"Resampling Methods in Model Validation","doi":"10.1162/EVCO_a_00069","type":"journal_article","publication":"Evolutionary Computation Journal","abstract":[{"text":"Meta-modeling has become a crucial tool in solving expensive optimization problems. Much of the work in the past has focused on finding a good regression method to model the fitness function. Examples include classical linear regression, splines, neural networks, Kriging and support vector regression. This paper specifically draws attention to the fact that assessing model accuracy is a crucial aspect in the meta-modeling framework. Resampling strategies such as cross-validation, subsampling, bootstrapping, and nested resampling are prominent methods for model validation and are systematically discussed with respect to possible pitfalls, shortcomings, and specific features. A survey of meta-modeling techniques within evolutionary optimization is provided. In addition, practical examples illustrating some of the pitfalls associated with model selection and performance assessment are presented. Finally, recommendations are given for choosing a model validation technique for a particular setting.","lang":"eng"}],"status":"public","_id":"46399","user_id":"15504","department":[{"_id":"34"},{"_id":"819"}],"language":[{"iso":"eng"}]},{"date_updated":"2023-10-16T13:54:17Z","volume":60,"author":[{"last_name":"Rudolph","full_name":"Rudolph, G","first_name":"G"},{"full_name":"Trautmann, Heike","id":"100740","orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike"},{"first_name":"O","last_name":"Schütze","full_name":"Schütze, O"}],"date_created":"2023-08-04T15:55:34Z","title":"Homogene Approximation der Paretofront bei mehrkriteriellen Kontrollproblemen","doi":"10.1524/auto.2012.1033","year":"2012","intvolume":"        60","page":"610–621","citation":{"apa":"Rudolph, G., Trautmann, H., &#38; Schütze, O. (2012). Homogene Approximation der Paretofront bei mehrkriteriellen Kontrollproblemen. <i>At-Automatisierungstechnik</i>, <i>60</i>, 610–621. <a href=\"https://doi.org/10.1524/auto.2012.1033\">https://doi.org/10.1524/auto.2012.1033</a>","mla":"Rudolph, G., et al. “Homogene Approximation Der Paretofront Bei Mehrkriteriellen Kontrollproblemen.” <i>At-Automatisierungstechnik</i>, vol. 60, 2012, pp. 610–621, doi:<a href=\"https://doi.org/10.1524/auto.2012.1033\">10.1524/auto.2012.1033</a>.","short":"G. Rudolph, H. Trautmann, O. Schütze, At-Automatisierungstechnik 60 (2012) 610–621.","bibtex":"@article{Rudolph_Trautmann_Schütze_2012, title={Homogene Approximation der Paretofront bei mehrkriteriellen Kontrollproblemen}, volume={60}, DOI={<a href=\"https://doi.org/10.1524/auto.2012.1033\">10.1524/auto.2012.1033</a>}, journal={at-Automatisierungstechnik}, author={Rudolph, G and Trautmann, Heike and Schütze, O}, year={2012}, pages={610–621} }","ieee":"G. Rudolph, H. Trautmann, and O. Schütze, “Homogene Approximation der Paretofront bei mehrkriteriellen Kontrollproblemen,” <i>at-Automatisierungstechnik</i>, vol. 60, pp. 610–621, 2012, doi: <a href=\"https://doi.org/10.1524/auto.2012.1033\">10.1524/auto.2012.1033</a>.","chicago":"Rudolph, G, Heike Trautmann, and O Schütze. “Homogene Approximation Der Paretofront Bei Mehrkriteriellen Kontrollproblemen.” <i>At-Automatisierungstechnik</i> 60 (2012): 610–621. <a href=\"https://doi.org/10.1524/auto.2012.1033\">https://doi.org/10.1524/auto.2012.1033</a>.","ama":"Rudolph G, Trautmann H, Schütze O. Homogene Approximation der Paretofront bei mehrkriteriellen Kontrollproblemen. <i>at-Automatisierungstechnik</i>. 2012;60:610–621. doi:<a href=\"https://doi.org/10.1524/auto.2012.1033\">10.1524/auto.2012.1033</a>"},"_id":"46400","department":[{"_id":"34"},{"_id":"819"}],"user_id":"15504","language":[{"iso":"eng"}],"publication":"at-Automatisierungstechnik","type":"journal_article","abstract":[{"text":"Es   werden   mehrkriterielle   evolutio-näre   Algorithmen   (EMOA)   für   zwei-   und   höherdimensio-nale   Probleme   vorgestellt,   die   gleichmäßig   verteilte   Lö-sungen   entlang   der   wahren   Paretofront   generieren.   Diesist   insbesondere   wichtig   im   Kontext   mehrkriterieller   Kon-trollprobleme.   Die   Methodik   beruht   auf   der   Minimierungdes   gemittelten   Hausdorff-Abstandes in   Bezug   aufdie  Paretofront.  Die  EMOA-Varianten  werden  vergleichendzu  aktuellen   Verfahren  auf  Benchmarkproblemen   getestet.","lang":"ger"}],"status":"public"},{"publication_identifier":{"isbn":["978-3-642-34412-1"]},"citation":{"ama":"Mersmann O, Bischl B, Bossek J, Trautmann H, Wagner M, Neumann F. Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness. In: <i>Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219</i>. LION 6. Springer-Verlag; 2012:115–129.","chicago":"Mersmann, Olaf, Bernd Bischl, Jakob Bossek, Heike Trautmann, Markus Wagner, and Frank Neumann. “Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness.” In <i>Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219</i>, 115–129. LION 6. Berlin, Heidelberg: Springer-Verlag, 2012.","ieee":"O. Mersmann, B. Bischl, J. Bossek, H. Trautmann, M. Wagner, and F. Neumann, “Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness,” in <i>Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219</i>, 2012, pp. 115–129.","apa":"Mersmann, O., Bischl, B., Bossek, J., Trautmann, H., Wagner, M., &#38; Neumann, F. (2012). Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness. <i>Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219</i>, 115–129.","bibtex":"@inproceedings{Mersmann_Bischl_Bossek_Trautmann_Wagner_Neumann_2012, place={Berlin, Heidelberg}, series={LION 6}, title={Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness}, booktitle={Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219}, publisher={Springer-Verlag}, author={Mersmann, Olaf and Bischl, Bernd and Bossek, Jakob and Trautmann, Heike and Wagner, Markus and Neumann, Frank}, year={2012}, pages={115–129}, collection={LION 6} }","mla":"Mersmann, Olaf, et al. “Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness.” <i>Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219</i>, Springer-Verlag, 2012, pp. 115–129.","short":"O. Mersmann, B. Bischl, J. Bossek, H. Trautmann, M. Wagner, F. Neumann, in: Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219, Springer-Verlag, Berlin, Heidelberg, 2012, pp. 115–129."},"page":"115–129","year":"2012","place":"Berlin, Heidelberg","date_created":"2023-11-14T15:58:59Z","author":[{"first_name":"Olaf","full_name":"Mersmann, Olaf","last_name":"Mersmann"},{"last_name":"Bischl","full_name":"Bischl, Bernd","first_name":"Bernd"},{"last_name":"Bossek","orcid":"0000-0002-4121-4668","id":"102979","full_name":"Bossek, Jakob","first_name":"Jakob"},{"first_name":"Heike","full_name":"Trautmann, Heike","last_name":"Trautmann"},{"first_name":"Markus","last_name":"Wagner","full_name":"Wagner, Markus"},{"last_name":"Neumann","full_name":"Neumann, Frank","first_name":"Frank"}],"date_updated":"2023-12-13T10:48:58Z","publisher":"Springer-Verlag","title":"Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness","type":"conference","publication":"Revised Selected Papers of the 6th International Conference on Learning and Intelligent Optimization - Volume 7219","status":"public","abstract":[{"lang":"eng","text":"With this paper we contribute to the understanding of the success of 2-opt based local search algorithms for solving the traveling salesman problem TSP. Although 2-opt is widely used in practice, it is hard to understand its success from a theoretical perspective. We take a statistical approach and examine the features of TSP instances that make the problem either hard or easy to solve. As a measure of problem difficulty for 2-opt we use the approximation ratio that it achieves on a given instance. Our investigations point out important features that make TSP instances hard or easy to be approximated by 2-opt."}],"user_id":"102979","series_title":"LION 6","department":[{"_id":"819"}],"_id":"48890","extern":"1","language":[{"iso":"eng"}],"keyword":["2-opt","Classification","Feature Selection","MARS","TSP"]},{"language":[{"iso":"eng"}],"extern":"1","_id":"48888","department":[{"_id":"819"}],"user_id":"102979","abstract":[{"lang":"eng","text":"With this paper we contribute to the understanding of the success of 2-opt based local search algorithms for solving the traveling salesman problem (TSP). Although 2-opt is widely used in practice, it is hard to understand its success from a theoretical perspective. We take a statistical approach and examine the features of TSP instances that make the problem either hard or easy to solve. As a measure of problem difficulty for 2-opt we use the approximation ratio that it achieves on a given instance. Our investigations point out important features that make TSP instances hard or easy to be approximated by 2-opt."}],"status":"public","publication":"Learning and Intelligent Optimization","type":"book_chapter","title":"Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness","doi":"10.1007/978-3-642-34413-8_9","date_updated":"2023-12-13T10:49:15Z","publisher":"Springer Berlin Heidelberg","volume":7219,"author":[{"last_name":"Mersmann","full_name":"Mersmann, Olaf","first_name":"Olaf"},{"last_name":"Bischl","full_name":"Bischl, Bernd","first_name":"Bernd"},{"full_name":"Bossek, Jakob","id":"102979","orcid":"0000-0002-4121-4668","last_name":"Bossek","first_name":"Jakob"},{"full_name":"Trautmann, Heike","last_name":"Trautmann","first_name":"Heike"},{"first_name":"Markus","last_name":"Wagner","full_name":"Wagner, Markus"},{"first_name":"Frank","full_name":"Neumann, Frank","last_name":"Neumann"}],"date_created":"2023-11-14T15:58:59Z","year":"2012","place":"Berlin, Heidelberg","intvolume":"      7219","page":"115–129","citation":{"apa":"Mersmann, O., Bischl, B., Bossek, J., Trautmann, H., Wagner, M., &#38; Neumann, F. (2012). Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness. In <i>Learning and Intelligent Optimization</i> (Vol. 7219, pp. 115–129). Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-34413-8_9\">https://doi.org/10.1007/978-3-642-34413-8_9</a>","short":"O. Mersmann, B. Bischl, J. Bossek, H. Trautmann, M. Wagner, F. Neumann, in: Learning and Intelligent Optimization, Springer Berlin Heidelberg, Berlin, Heidelberg, 2012, pp. 115–129.","bibtex":"@inbook{Mersmann_Bischl_Bossek_Trautmann_Wagner_Neumann_2012, place={Berlin, Heidelberg}, title={Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness}, volume={7219}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-34413-8_9\">10.1007/978-3-642-34413-8_9</a>}, booktitle={Learning and Intelligent Optimization}, publisher={Springer Berlin Heidelberg}, author={Mersmann, Olaf and Bischl, Bernd and Bossek, Jakob and Trautmann, Heike and Wagner, Markus and Neumann, Frank}, year={2012}, pages={115–129} }","mla":"Mersmann, Olaf, et al. “Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness.” <i>Learning and Intelligent Optimization</i>, vol. 7219, Springer Berlin Heidelberg, 2012, pp. 115–129, doi:<a href=\"https://doi.org/10.1007/978-3-642-34413-8_9\">10.1007/978-3-642-34413-8_9</a>.","ieee":"O. Mersmann, B. Bischl, J. Bossek, H. Trautmann, M. Wagner, and F. Neumann, “Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness,” in <i>Learning and Intelligent Optimization</i>, vol. 7219, Berlin, Heidelberg: Springer Berlin Heidelberg, 2012, pp. 115–129.","chicago":"Mersmann, Olaf, Bernd Bischl, Jakob Bossek, Heike Trautmann, Markus Wagner, and Frank Neumann. “Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness.” In <i>Learning and Intelligent Optimization</i>, 7219:115–129. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. <a href=\"https://doi.org/10.1007/978-3-642-34413-8_9\">https://doi.org/10.1007/978-3-642-34413-8_9</a>.","ama":"Mersmann O, Bischl B, Bossek J, Trautmann H, Wagner M, Neumann F. Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness. In: <i>Learning and Intelligent Optimization</i>. Vol 7219. Springer Berlin Heidelberg; 2012:115–129. doi:<a href=\"https://doi.org/10.1007/978-3-642-34413-8_9\">10.1007/978-3-642-34413-8_9</a>"},"publication_identifier":{"isbn":["978-3-642-34412-1 978-3-642-34413-8"]}},{"user_id":"15504","department":[{"_id":"34"},{"_id":"819"}],"_id":"46398","language":[{"iso":"eng"}],"type":"conference","publication":"Learning and Intelligent Optimization","status":"public","abstract":[{"text":"With this paper we contribute to the understanding of the success of 2-opt based local search algorithms for solving the traveling salesman problem (TSP). Although 2-opt is widely used in practice, it is hard to understand its success from a theoretical perspective. We take a statistical approach and examine the features of TSP instances that make the problem either hard or easy to solve. As a measure of problem difficulty for 2-opt we use the approximation ratio that it achieves on a given instance. Our investigations point out important features that make TSP instances hard or easy to be approximated by 2-opt.","lang":"eng"}],"editor":[{"first_name":"Youssef","last_name":"Hamadi","full_name":"Hamadi, Youssef"},{"full_name":"Schoenauer, Marc","last_name":"Schoenauer","first_name":"Marc"}],"date_created":"2023-08-04T15:53:33Z","author":[{"last_name":"Mersmann","full_name":"Mersmann, Olaf","first_name":"Olaf"},{"first_name":"Bernd","full_name":"Bischl, Bernd","last_name":"Bischl"},{"first_name":"Jakob","full_name":"Bossek, Jakob","id":"102979","last_name":"Bossek","orcid":"0000-0002-4121-4668"},{"last_name":"Trautmann","orcid":"0000-0002-9788-8282","id":"100740","full_name":"Trautmann, Heike","first_name":"Heike"},{"first_name":"Markus","full_name":"Wagner, Markus","last_name":"Wagner"},{"first_name":"Frank","full_name":"Neumann, Frank","last_name":"Neumann"}],"date_updated":"2024-06-10T11:57:32Z","publisher":"Springer Berlin Heidelberg","doi":"https://doi.org/10.1007/978-3-642-34413-8_9","title":"Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness","publication_identifier":{"isbn":["978-3-642-34413-8"]},"citation":{"ieee":"O. Mersmann, B. Bischl, J. Bossek, H. Trautmann, M. Wagner, and F. Neumann, “Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness,” in <i>Learning and Intelligent Optimization</i>, 2012, pp. 115–129, doi: <a href=\"https://doi.org/10.1007/978-3-642-34413-8_9\">https://doi.org/10.1007/978-3-642-34413-8_9</a>.","chicago":"Mersmann, Olaf, Bernd Bischl, Jakob Bossek, Heike Trautmann, Markus Wagner, and Frank Neumann. “Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness.” In <i>Learning and Intelligent Optimization</i>, edited by Youssef Hamadi and Marc Schoenauer, 115–129. Berlin, Heidelberg: Springer Berlin Heidelberg, 2012. <a href=\"https://doi.org/10.1007/978-3-642-34413-8_9\">https://doi.org/10.1007/978-3-642-34413-8_9</a>.","ama":"Mersmann O, Bischl B, Bossek J, Trautmann H, Wagner M, Neumann F. Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness. In: Hamadi Y, Schoenauer M, eds. <i>Learning and Intelligent Optimization</i>. Springer Berlin Heidelberg; 2012:115–129. doi:<a href=\"https://doi.org/10.1007/978-3-642-34413-8_9\">https://doi.org/10.1007/978-3-642-34413-8_9</a>","apa":"Mersmann, O., Bischl, B., Bossek, J., Trautmann, H., Wagner, M., &#38; Neumann, F. (2012). Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness. In Y. Hamadi &#38; M. Schoenauer (Eds.), <i>Learning and Intelligent Optimization</i> (pp. 115–129). Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-34413-8_9\">https://doi.org/10.1007/978-3-642-34413-8_9</a>","short":"O. Mersmann, B. Bischl, J. Bossek, H. Trautmann, M. Wagner, F. Neumann, in: Y. Hamadi, M. Schoenauer (Eds.), Learning and Intelligent Optimization, Springer Berlin Heidelberg, Berlin, Heidelberg, 2012, pp. 115–129.","bibtex":"@inproceedings{Mersmann_Bischl_Bossek_Trautmann_Wagner_Neumann_2012, place={Berlin, Heidelberg}, title={Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-34413-8_9\">https://doi.org/10.1007/978-3-642-34413-8_9</a>}, booktitle={Learning and Intelligent Optimization}, publisher={Springer Berlin Heidelberg}, author={Mersmann, Olaf and Bischl, Bernd and Bossek, Jakob and Trautmann, Heike and Wagner, Markus and Neumann, Frank}, editor={Hamadi, Youssef and Schoenauer, Marc}, year={2012}, pages={115–129} }","mla":"Mersmann, Olaf, et al. “Local Search and the Traveling Salesman Problem: A Feature-Based Characterization of Problem Hardness.” <i>Learning and Intelligent Optimization</i>, edited by Youssef Hamadi and Marc Schoenauer, Springer Berlin Heidelberg, 2012, pp. 115–129, doi:<a href=\"https://doi.org/10.1007/978-3-642-34413-8_9\">https://doi.org/10.1007/978-3-642-34413-8_9</a>."},"page":"115–129","place":"Berlin, Heidelberg","year":"2012"},{"page":"185–200","intvolume":"       222","citation":{"short":"B. Grimme, J. Lipinski, G. Schöner, Experimental Brain Research 222 (2012) 185–200.","bibtex":"@article{Grimme_Lipinski_Schöner_2012, title={Naturalistic arm movements during obstacle avoidance in 3D and the identification of movement primitives}, volume={222}, journal={Experimental brain research}, publisher={Springer}, author={Grimme, Britta and Lipinski, John and Schöner, Gregor}, year={2012}, pages={185–200} }","mla":"Grimme, Britta, et al. “Naturalistic Arm Movements during Obstacle Avoidance in 3D and the Identification of Movement Primitives.” <i>Experimental Brain Research</i>, vol. 222, Springer, 2012, pp. 185–200.","apa":"Grimme, B., Lipinski, J., &#38; Schöner, G. (2012). Naturalistic arm movements during obstacle avoidance in 3D and the identification of movement primitives. <i>Experimental Brain Research</i>, <i>222</i>, 185–200.","ama":"Grimme B, Lipinski J, Schöner G. Naturalistic arm movements during obstacle avoidance in 3D and the identification of movement primitives. <i>Experimental brain research</i>. 2012;222:185–200.","ieee":"B. Grimme, J. Lipinski, and G. Schöner, “Naturalistic arm movements during obstacle avoidance in 3D and the identification of movement primitives,” <i>Experimental brain research</i>, vol. 222, pp. 185–200, 2012.","chicago":"Grimme, Britta, John Lipinski, and Gregor Schöner. “Naturalistic Arm Movements during Obstacle Avoidance in 3D and the Identification of Movement Primitives.” <i>Experimental Brain Research</i> 222 (2012): 185–200."},"year":"2012","volume":222,"author":[{"last_name":"Grimme","full_name":"Grimme, Britta","first_name":"Britta"},{"first_name":"John","full_name":"Lipinski, John","last_name":"Lipinski"},{"full_name":"Schöner, Gregor","last_name":"Schöner","first_name":"Gregor"}],"date_created":"2024-03-25T14:58:49Z","publisher":"Springer","date_updated":"2026-03-19T07:49:12Z","title":"Naturalistic arm movements during obstacle avoidance in 3D and the identification of movement primitives","publication":"Experimental brain research","type":"journal_article","status":"public","department":[{"_id":"819"}],"user_id":"103682","_id":"52868"},{"doi":"10.1145/2001576.2001690","title":"Exploratory Landscape Analysis","author":[{"first_name":"Olaf","last_name":"Mersmann","full_name":"Mersmann, Olaf"},{"last_name":"Bischl","full_name":"Bischl, Bernd","first_name":"Bernd"},{"id":"100740","full_name":"Trautmann, Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike"},{"last_name":"Preuss","full_name":"Preuss, Mike","first_name":"Mike"},{"first_name":"Claus","last_name":"Weihs","full_name":"Weihs, Claus"},{"last_name":"Rudolph","full_name":"Rudolph, Günter","first_name":"Günter"}],"date_created":"2023-08-04T15:58:22Z","publisher":"Association for Computing Machinery","date_updated":"2023-10-16T13:54:34Z","citation":{"bibtex":"@inproceedings{Mersmann_Bischl_Trautmann_Preuss_Weihs_Rudolph_2011, place={New York, NY, USA}, series={GECCO ’11}, title={Exploratory Landscape Analysis}, DOI={<a href=\"https://doi.org/10.1145/2001576.2001690\">10.1145/2001576.2001690</a>}, booktitle={Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation}, publisher={Association for Computing Machinery}, author={Mersmann, Olaf and Bischl, Bernd and Trautmann, Heike and Preuss, Mike and Weihs, Claus and Rudolph, Günter}, year={2011}, pages={829–836}, collection={GECCO ’11} }","mla":"Mersmann, Olaf, et al. “Exploratory Landscape Analysis.” <i>Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation</i>, Association for Computing Machinery, 2011, pp. 829–836, doi:<a href=\"https://doi.org/10.1145/2001576.2001690\">10.1145/2001576.2001690</a>.","short":"O. Mersmann, B. Bischl, H. Trautmann, M. Preuss, C. Weihs, G. Rudolph, in: Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation, Association for Computing Machinery, New York, NY, USA, 2011, pp. 829–836.","apa":"Mersmann, O., Bischl, B., Trautmann, H., Preuss, M., Weihs, C., &#38; Rudolph, G. (2011). Exploratory Landscape Analysis. <i>Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation</i>, 829–836. <a href=\"https://doi.org/10.1145/2001576.2001690\">https://doi.org/10.1145/2001576.2001690</a>","chicago":"Mersmann, Olaf, Bernd Bischl, Heike Trautmann, Mike Preuss, Claus Weihs, and Günter Rudolph. “Exploratory Landscape Analysis.” In <i>Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation</i>, 829–836. GECCO ’11. New York, NY, USA: Association for Computing Machinery, 2011. <a href=\"https://doi.org/10.1145/2001576.2001690\">https://doi.org/10.1145/2001576.2001690</a>.","ieee":"O. Mersmann, B. Bischl, H. Trautmann, M. Preuss, C. Weihs, and G. Rudolph, “Exploratory Landscape Analysis,” in <i>Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation</i>, 2011, pp. 829–836, doi: <a href=\"https://doi.org/10.1145/2001576.2001690\">10.1145/2001576.2001690</a>.","ama":"Mersmann O, Bischl B, Trautmann H, Preuss M, Weihs C, Rudolph G. Exploratory Landscape Analysis. In: <i>Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation</i>. GECCO ’11. Association for Computing Machinery; 2011:829–836. doi:<a href=\"https://doi.org/10.1145/2001576.2001690\">10.1145/2001576.2001690</a>"},"page":"829–836","place":"New York, NY, USA","year":"2011","publication_identifier":{"isbn":["9781450305570"]},"language":[{"iso":"eng"}],"keyword":["exploratory landscape analysis","evolutionary optimization","fitness landscape","benchmarking","BBOB test set"],"user_id":"15504","series_title":"GECCO ’11","department":[{"_id":"34"},{"_id":"819"}],"_id":"46401","status":"public","abstract":[{"text":"Exploratory Landscape Analysis subsumes a number of techniques employed to obtain knowledge about the properties of an unknown optimization problem, especially insofar as these properties are important for the performance of optimization algorithms. Where in a first attempt, one could rely on high-level features designed by experts, we approach the problem from a different angle here, namely by using relatively cheap low-level computer generated features. Interestingly, very few features are needed to separate the BBOB problem groups and also for relating a problem to high-level, expert designed features, paving the way for automatic algorithm selection.","lang":"eng"}],"type":"conference","publication":"Proceedings of the 13th Annual Conference on Genetic and Evolutionary Computation"},{"language":[{"iso":"eng"}],"department":[{"_id":"34"},{"_id":"819"}],"user_id":"15504","_id":"46402","status":"public","editor":[{"full_name":"Takahashi, Ricardo H. C.","last_name":"Takahashi","first_name":"Ricardo H. C."},{"first_name":"Kalyanmoy","full_name":"Deb, Kalyanmoy","last_name":"Deb"},{"first_name":"Elizabeth F.","last_name":"Wanner","full_name":"Wanner, Elizabeth F."},{"full_name":"Greco, Salvatore","last_name":"Greco","first_name":"Salvatore"}],"abstract":[{"text":"The use of multi-objective evolutionary algorithms for solving black-box problems with multiple conflicting objectives has become an important research area. However, when no gradient information is available, the examination of formal convergence or optimality criteria is often impossible. Thus, sophisticated heuristic online stopping criteria (OSC) have recently become subject of intensive research. In order to establish formal guidelines for a systematic research, we present a taxonomy of OSC in this paper. We integrate the known approaches within the taxonomy and discuss them by extracting their building blocks. The formal structure of the taxonomy is used as a basis for the implementation of a comprehensive MATLAB toolbox. Both contributions, the formal taxonomy and the MATLAB implementation, provide a framework for the analysis and evaluation of existing and new OSC approaches.","lang":"eng"}],"publication":"Evolutionary Multi-Criterion Optimization","type":"conference","doi":"https://doi.org/10.1007/978-3-642-19893-9_2","title":"A Taxonomy of Online Stopping Criteria for Multi-Objective Evolutionary Algorithms","author":[{"last_name":"Wagner","full_name":"Wagner, Tobias","first_name":"Tobias"},{"full_name":"Trautmann, Heike","id":"100740","orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike"},{"first_name":"Luis","full_name":"Martí, Luis","last_name":"Martí"}],"date_created":"2023-08-04T15:59:18Z","date_updated":"2023-10-16T13:54:50Z","publisher":"Springer Berlin Heidelberg","page":"16–30","citation":{"chicago":"Wagner, Tobias, Heike Trautmann, and Luis Martí. “A Taxonomy of Online Stopping Criteria for Multi-Objective Evolutionary Algorithms.” In <i>Evolutionary Multi-Criterion Optimization</i>, edited by Ricardo H. C. Takahashi, Kalyanmoy Deb, Elizabeth F. Wanner, and Salvatore Greco, 16–30. Berlin, Heidelberg: Springer Berlin Heidelberg, 2011. <a href=\"https://doi.org/10.1007/978-3-642-19893-9_2\">https://doi.org/10.1007/978-3-642-19893-9_2</a>.","ieee":"T. Wagner, H. Trautmann, and L. Martí, “A Taxonomy of Online Stopping Criteria for Multi-Objective Evolutionary Algorithms,” in <i>Evolutionary Multi-Criterion Optimization</i>, 2011, pp. 16–30, doi: <a href=\"https://doi.org/10.1007/978-3-642-19893-9_2\">https://doi.org/10.1007/978-3-642-19893-9_2</a>.","ama":"Wagner T, Trautmann H, Martí L. A Taxonomy of Online Stopping Criteria for Multi-Objective Evolutionary Algorithms. In: Takahashi RHC, Deb K, Wanner EF, Greco S, eds. <i>Evolutionary Multi-Criterion Optimization</i>. Springer Berlin Heidelberg; 2011:16–30. doi:<a href=\"https://doi.org/10.1007/978-3-642-19893-9_2\">https://doi.org/10.1007/978-3-642-19893-9_2</a>","apa":"Wagner, T., Trautmann, H., &#38; Martí, L. (2011). A Taxonomy of Online Stopping Criteria for Multi-Objective Evolutionary Algorithms. In R. H. C. Takahashi, K. Deb, E. F. Wanner, &#38; S. Greco (Eds.), <i>Evolutionary Multi-Criterion Optimization</i> (pp. 16–30). Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-19893-9_2\">https://doi.org/10.1007/978-3-642-19893-9_2</a>","bibtex":"@inproceedings{Wagner_Trautmann_Martí_2011, place={Berlin, Heidelberg}, title={A Taxonomy of Online Stopping Criteria for Multi-Objective Evolutionary Algorithms}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-19893-9_2\">https://doi.org/10.1007/978-3-642-19893-9_2</a>}, booktitle={Evolutionary Multi-Criterion Optimization}, publisher={Springer Berlin Heidelberg}, author={Wagner, Tobias and Trautmann, Heike and Martí, Luis}, editor={Takahashi, Ricardo H. C. and Deb, Kalyanmoy and Wanner, Elizabeth F. and Greco, Salvatore}, year={2011}, pages={16–30} }","mla":"Wagner, Tobias, et al. “A Taxonomy of Online Stopping Criteria for Multi-Objective Evolutionary Algorithms.” <i>Evolutionary Multi-Criterion Optimization</i>, edited by Ricardo H. C. Takahashi et al., Springer Berlin Heidelberg, 2011, pp. 16–30, doi:<a href=\"https://doi.org/10.1007/978-3-642-19893-9_2\">https://doi.org/10.1007/978-3-642-19893-9_2</a>.","short":"T. Wagner, H. Trautmann, L. Martí, in: R.H.C. Takahashi, K. Deb, E.F. Wanner, S. Greco (Eds.), Evolutionary Multi-Criterion Optimization, Springer Berlin Heidelberg, Berlin, Heidelberg, 2011, pp. 16–30."},"year":"2011","place":"Berlin, Heidelberg","publication_identifier":{"isbn":["978-3-642-19893-9"]}},{"publication":"Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering","type":"journal_article","abstract":[{"lang":"eng","text":" Evolutionary (multi-objective optimization) algorithms (EMOAs) are widely accepted to be competitive optimization methods in industry today. However, normally only standard techniques are employed by the engineering experts. Here, it is shown how these standard techniques can be completed and improved with respect to interactivity to other tools, runtime, and parameterization. The coupling with metamodels serves as an example for the interactivity to other tools, while the online convergence detection relates to runtime, i.e. stopping criteria. Finally, sequential parameter optimization improves results focussing on parameter tuning. We show that invoking all these methods on their own already enhances EMOAs for aerodynamic applications. It is concluded with an outlook on how these methods might come together to foster aerospace applications and, at a time, widen the application area to multi-disciplinary optimization tasks. "}],"status":"public","_id":"46403","department":[{"_id":"34"},{"_id":"819"}],"user_id":"15504","language":[{"iso":"eng"}],"issue":"10","year":"2011","page":"1081-1096","intvolume":"       225","citation":{"ama":"Naujoks B, Trautmann H, Wessing S, Weihs C. Advanced concepts for multi-objective evolutionary optimization in aircraft industry. <i>Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering</i>. 2011;225(10):1081-1096. doi:<a href=\"https://doi.org/10.1177/0954410011414120\">10.1177/0954410011414120</a>","chicago":"Naujoks, B, Heike Trautmann, S Wessing, and C Weihs. “Advanced Concepts for Multi-Objective Evolutionary Optimization in Aircraft Industry.” <i>Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering</i> 225, no. 10 (2011): 1081–96. <a href=\"https://doi.org/10.1177/0954410011414120\">https://doi.org/10.1177/0954410011414120</a>.","ieee":"B. Naujoks, H. Trautmann, S. Wessing, and C. Weihs, “Advanced concepts for multi-objective evolutionary optimization in aircraft industry,” <i>Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering</i>, vol. 225, no. 10, pp. 1081–1096, 2011, doi: <a href=\"https://doi.org/10.1177/0954410011414120\">10.1177/0954410011414120</a>.","apa":"Naujoks, B., Trautmann, H., Wessing, S., &#38; Weihs, C. (2011). Advanced concepts for multi-objective evolutionary optimization in aircraft industry. <i>Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering</i>, <i>225</i>(10), 1081–1096. <a href=\"https://doi.org/10.1177/0954410011414120\">https://doi.org/10.1177/0954410011414120</a>","bibtex":"@article{Naujoks_Trautmann_Wessing_Weihs_2011, title={Advanced concepts for multi-objective evolutionary optimization in aircraft industry}, volume={225}, DOI={<a href=\"https://doi.org/10.1177/0954410011414120\">10.1177/0954410011414120</a>}, number={10}, journal={Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering}, author={Naujoks, B and Trautmann, Heike and Wessing, S and Weihs, C}, year={2011}, pages={1081–1096} }","mla":"Naujoks, B., et al. “Advanced Concepts for Multi-Objective Evolutionary Optimization in Aircraft Industry.” <i>Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering</i>, vol. 225, no. 10, 2011, pp. 1081–96, doi:<a href=\"https://doi.org/10.1177/0954410011414120\">10.1177/0954410011414120</a>.","short":"B. Naujoks, H. Trautmann, S. Wessing, C. Weihs, Proceedings of the Institution of Mechanical Engineers, Part G: Journal of Aerospace Engineering 225 (2011) 1081–1096."},"date_updated":"2023-10-16T13:55:07Z","volume":225,"author":[{"first_name":"B","last_name":"Naujoks","full_name":"Naujoks, B"},{"first_name":"Heike","id":"100740","full_name":"Trautmann, Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann"},{"first_name":"S","full_name":"Wessing, S","last_name":"Wessing"},{"full_name":"Weihs, C","last_name":"Weihs","first_name":"C"}],"date_created":"2023-08-04T16:00:28Z","title":"Advanced concepts for multi-objective evolutionary optimization in aircraft industry","doi":"10.1177/0954410011414120"},{"publication":"Motor control","type":"journal_article","status":"public","department":[{"_id":"819"}],"user_id":"103682","_id":"52867","issue":"1","page":"5–33","intvolume":"        15","citation":{"ama":"Grimme B, Fuchs S, Perrier P, Schöner G. Limb versus speech motor control: A conceptual review. <i>Motor control</i>. 2011;15(1):5–33.","chicago":"Grimme, Britta, Susanne Fuchs, Pascal Perrier, and Gregor Schöner. “Limb versus Speech Motor Control: A Conceptual Review.” <i>Motor Control</i> 15, no. 1 (2011): 5–33.","ieee":"B. Grimme, S. Fuchs, P. Perrier, and G. Schöner, “Limb versus speech motor control: A conceptual review,” <i>Motor control</i>, vol. 15, no. 1, pp. 5–33, 2011.","bibtex":"@article{Grimme_Fuchs_Perrier_Schöner_2011, title={Limb versus speech motor control: A conceptual review}, volume={15}, number={1}, journal={Motor control}, publisher={Human Kinetics, Inc.}, author={Grimme, Britta and Fuchs, Susanne and Perrier, Pascal and Schöner, Gregor}, year={2011}, pages={5–33} }","mla":"Grimme, Britta, et al. “Limb versus Speech Motor Control: A Conceptual Review.” <i>Motor Control</i>, vol. 15, no. 1, Human Kinetics, Inc., 2011, pp. 5–33.","short":"B. Grimme, S. Fuchs, P. Perrier, G. Schöner, Motor Control 15 (2011) 5–33.","apa":"Grimme, B., Fuchs, S., Perrier, P., &#38; Schöner, G. (2011). Limb versus speech motor control: A conceptual review. <i>Motor Control</i>, <i>15</i>(1), 5–33."},"year":"2011","volume":15,"author":[{"first_name":"Britta","last_name":"Grimme","full_name":"Grimme, Britta"},{"first_name":"Susanne","full_name":"Fuchs, Susanne","last_name":"Fuchs"},{"first_name":"Pascal","last_name":"Perrier","full_name":"Perrier, Pascal"},{"full_name":"Schöner, Gregor","last_name":"Schöner","first_name":"Gregor"}],"date_created":"2024-03-25T14:55:45Z","publisher":"Human Kinetics, Inc.","date_updated":"2026-03-19T07:49:26Z","title":"Limb versus speech motor control: A conceptual review"},{"language":[{"iso":"eng"}],"user_id":"15504","department":[{"_id":"34"},{"_id":"819"}],"_id":"46408","status":"public","abstract":[{"text":"The integration of experts’ preferences is an important aspect in multi-objective optimization. Usually, one out of a set of Pareto optimal solutions has to be chosen based on expert knowledge. A combination of multi-objective particle swarm optimization (MOPSO) with the desirability concept is introduced to efficiently focus on desired and relevant regions of the true Pareto front of the optimization problem which facilitates the solution selection process. Desirability functions of the objectives are optimized, and the desirability index is used for selecting the global best particle in each iteration. The resulting MOPSO variant DF-MOPSO in most cases exclusively generates solutions in the desired area of the Pareto front. Approximations of the whole Pareto front result in cases of misspecified desired regions.","lang":"eng"}],"editor":[{"first_name":"Robert","full_name":"Schaefer, Robert","last_name":"Schaefer"},{"first_name":"Carlos","full_name":"Cotta, Carlos","last_name":"Cotta"},{"full_name":"Kołodziej, Joanna","last_name":"Kołodziej","first_name":"Joanna"},{"first_name":"Günter","last_name":"Rudolph","full_name":"Rudolph, Günter"}],"type":"conference","publication":"Parallel Problem Solving from Nature, PPSN XI","doi":"https://doi.org/10.1007/978-3-642-15871-1_11","title":"Preference-Based Multi-Objective Particle Swarm Optimization Using Desirabilities","date_created":"2023-08-04T16:06:43Z","author":[{"last_name":"Mostaghim","full_name":"Mostaghim, Sanaz","first_name":"Sanaz"},{"full_name":"Trautmann, Heike","id":"100740","orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike"},{"last_name":"Mersmann","full_name":"Mersmann, Olaf","first_name":"Olaf"}],"date_updated":"2023-10-16T13:56:31Z","publisher":"Springer Berlin Heidelberg","citation":{"ama":"Mostaghim S, Trautmann H, Mersmann O. Preference-Based Multi-Objective Particle Swarm Optimization Using Desirabilities. In: Schaefer R, Cotta C, Kołodziej J, Rudolph G, eds. <i>Parallel Problem Solving from Nature, PPSN XI</i>. Springer Berlin Heidelberg; 2010:101–110. doi:<a href=\"https://doi.org/10.1007/978-3-642-15871-1_11\">https://doi.org/10.1007/978-3-642-15871-1_11</a>","chicago":"Mostaghim, Sanaz, Heike Trautmann, and Olaf Mersmann. “Preference-Based Multi-Objective Particle Swarm Optimization Using Desirabilities.” In <i>Parallel Problem Solving from Nature, PPSN XI</i>, edited by Robert Schaefer, Carlos Cotta, Joanna Kołodziej, and Günter Rudolph, 101–110. Berlin, Heidelberg: Springer Berlin Heidelberg, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15871-1_11\">https://doi.org/10.1007/978-3-642-15871-1_11</a>.","ieee":"S. Mostaghim, H. Trautmann, and O. Mersmann, “Preference-Based Multi-Objective Particle Swarm Optimization Using Desirabilities,” in <i>Parallel Problem Solving from Nature, PPSN XI</i>, 2010, pp. 101–110, doi: <a href=\"https://doi.org/10.1007/978-3-642-15871-1_11\">https://doi.org/10.1007/978-3-642-15871-1_11</a>.","apa":"Mostaghim, S., Trautmann, H., &#38; Mersmann, O. (2010). Preference-Based Multi-Objective Particle Swarm Optimization Using Desirabilities. In R. Schaefer, C. Cotta, J. Kołodziej, &#38; G. Rudolph (Eds.), <i>Parallel Problem Solving from Nature, PPSN XI</i> (pp. 101–110). Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-642-15871-1_11\">https://doi.org/10.1007/978-3-642-15871-1_11</a>","mla":"Mostaghim, Sanaz, et al. “Preference-Based Multi-Objective Particle Swarm Optimization Using Desirabilities.” <i>Parallel Problem Solving from Nature, PPSN XI</i>, edited by Robert Schaefer et al., Springer Berlin Heidelberg, 2010, pp. 101–110, doi:<a href=\"https://doi.org/10.1007/978-3-642-15871-1_11\">https://doi.org/10.1007/978-3-642-15871-1_11</a>.","bibtex":"@inproceedings{Mostaghim_Trautmann_Mersmann_2010, place={Berlin, Heidelberg}, title={Preference-Based Multi-Objective Particle Swarm Optimization Using Desirabilities}, DOI={<a href=\"https://doi.org/10.1007/978-3-642-15871-1_11\">https://doi.org/10.1007/978-3-642-15871-1_11</a>}, booktitle={Parallel Problem Solving from Nature, PPSN XI}, publisher={Springer Berlin Heidelberg}, author={Mostaghim, Sanaz and Trautmann, Heike and Mersmann, Olaf}, editor={Schaefer, Robert and Cotta, Carlos and Kołodziej, Joanna and Rudolph, Günter}, year={2010}, pages={101–110} }","short":"S. Mostaghim, H. Trautmann, O. Mersmann, in: R. Schaefer, C. Cotta, J. Kołodziej, G. Rudolph (Eds.), Parallel Problem Solving from Nature, PPSN XI, Springer Berlin Heidelberg, Berlin, Heidelberg, 2010, pp. 101–110."},"page":"101–110","year":"2010","place":"Berlin, Heidelberg","publication_identifier":{"isbn":["978-3-642-15871-1"]}},{"publication_identifier":{"isbn":["3642158439"]},"page":"73–82","citation":{"mla":"Mersmann, Olaf, et al. “Benchmarking Evolutionary Algorithms: Towards Exploratory Landscape Analysis.” <i>Proceedings of the 11th International Conference on Parallel Problem Solving from Nature: Part I</i>, Springer-Verlag, 2010, pp. 73–82.","short":"O. Mersmann, M. Preuss, H. Trautmann, in: Proceedings of the 11th International Conference on Parallel Problem Solving from Nature: Part I, Springer-Verlag, Berlin, Heidelberg, 2010, pp. 73–82.","bibtex":"@inproceedings{Mersmann_Preuss_Trautmann_2010, place={Berlin, Heidelberg}, series={PPSN’10}, title={Benchmarking Evolutionary Algorithms: Towards Exploratory Landscape Analysis}, booktitle={Proceedings of the 11th International Conference on Parallel Problem Solving from Nature: Part I}, publisher={Springer-Verlag}, author={Mersmann, Olaf and Preuss, Mike and Trautmann, Heike}, year={2010}, pages={73–82}, collection={PPSN’10} }","apa":"Mersmann, O., Preuss, M., &#38; Trautmann, H. (2010). Benchmarking Evolutionary Algorithms: Towards Exploratory Landscape Analysis. <i>Proceedings of the 11th International Conference on Parallel Problem Solving from Nature: Part I</i>, 73–82.","ama":"Mersmann O, Preuss M, Trautmann H. Benchmarking Evolutionary Algorithms: Towards Exploratory Landscape Analysis. In: <i>Proceedings of the 11th International Conference on Parallel Problem Solving from Nature: Part I</i>. PPSN’10. Springer-Verlag; 2010:73–82.","chicago":"Mersmann, Olaf, Mike Preuss, and Heike Trautmann. “Benchmarking Evolutionary Algorithms: Towards Exploratory Landscape Analysis.” In <i>Proceedings of the 11th International Conference on Parallel Problem Solving from Nature: Part I</i>, 73–82. PPSN’10. Berlin, Heidelberg: Springer-Verlag, 2010.","ieee":"O. Mersmann, M. Preuss, and H. Trautmann, “Benchmarking Evolutionary Algorithms: Towards Exploratory Landscape Analysis,” in <i>Proceedings of the 11th International Conference on Parallel Problem Solving from Nature: Part I</i>, 2010, pp. 73–82."},"place":"Berlin, Heidelberg","year":"2010","date_created":"2023-08-04T16:02:28Z","author":[{"last_name":"Mersmann","full_name":"Mersmann, Olaf","first_name":"Olaf"},{"first_name":"Mike","last_name":"Preuss","full_name":"Preuss, Mike"},{"first_name":"Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","id":"100740","full_name":"Trautmann, Heike"}],"date_updated":"2023-10-16T13:55:43Z","publisher":"Springer-Verlag","title":"Benchmarking Evolutionary Algorithms: Towards Exploratory Landscape Analysis","publication":"Proceedings of the 11th International Conference on Parallel Problem Solving from Nature: Part I","type":"conference","status":"public","abstract":[{"text":"We present methods to answer two basic questions that arise when benchmarking optimization algorithms. The first one is: which algorithm is the ’best’ one? and the second one: which algorithm should I use for my real world problem? Both are connected and neither is easy to answer. We present methods which can be used to analyse the raw data of a benchmark experiment and derive some insight regarding the answers to these questions. We employ the presented methods to analyse the BBOB’09 benchmark results and present some initial findings.","lang":"eng"}],"department":[{"_id":"34"},{"_id":"819"}],"user_id":"15504","series_title":"PPSN’10","_id":"46405","language":[{"iso":"eng"}],"keyword":["benchmarking","multidimensional scaling","consensus ranking","evolutionary optimization","BBOB test set"]},{"status":"public","abstract":[{"lang":"eng","text":"We present methods to answer two basic questions that arise when benchmarking optimization algorithms. The first one is: which algorithm is the 'best' one? and the second one: which algorithm should I use for my real world problem? Both are connected and neither is easy to answer. We present methods which can be used to analyse the raw data of a benchmark experiment and derive some insight regarding the answers to these questions. We employ the presented methods to analyse the BBOB'09 benchmark results and present some initial findings."}],"editor":[{"last_name":"Blum","full_name":"Blum, C","first_name":"C"},{"first_name":"R","last_name":"Battiti","full_name":"Battiti, R"}],"type":"conference","publication":"Learning and Intelligent Optimization, 4$^th$ International Conference, LION 4, Venice, Italy","language":[{"iso":"eng"}],"series_title":"Lecture Notes in Computer Science","user_id":"15504","department":[{"_id":"34"},{"_id":"819"}],"_id":"46406","citation":{"ieee":"O. Mersmann, H. Trautmann, B. Naujoks, and C. Weihs, “On the Distribution of EMOA Hypervolumes,” in <i>Learning and Intelligent Optimization, 4$^th$ International Conference, LION 4, Venice, Italy</i>, 2010, vol. 6073, pp. 333–337.","chicago":"Mersmann, O, Heike Trautmann, B Naujoks, and C Weihs. “On the Distribution of EMOA Hypervolumes.” In <i>Learning and Intelligent Optimization, 4$^th$ International Conference, LION 4, Venice, Italy</i>, edited by C Blum and R Battiti, 6073:333–337. Lecture Notes in Computer Science. Springer, 2010.","short":"O. Mersmann, H. Trautmann, B. Naujoks, C. Weihs, in: C. Blum, R. Battiti (Eds.), Learning and Intelligent Optimization, 4$^th$ International Conference, LION 4, Venice, Italy, Springer, 2010, pp. 333–337.","bibtex":"@inproceedings{Mersmann_Trautmann_Naujoks_Weihs_2010, series={Lecture Notes in Computer Science}, title={On the Distribution of EMOA Hypervolumes}, volume={6073}, booktitle={Learning and Intelligent Optimization, 4$^th$ International Conference, LION 4, Venice, Italy}, publisher={Springer}, author={Mersmann, O and Trautmann, Heike and Naujoks, B and Weihs, C}, editor={Blum, C and Battiti, R}, year={2010}, pages={333–337}, collection={Lecture Notes in Computer Science} }","mla":"Mersmann, O., et al. “On the Distribution of EMOA Hypervolumes.” <i>Learning and Intelligent Optimization, 4$^th$ International Conference, LION 4, Venice, Italy</i>, edited by C Blum and R Battiti, vol. 6073, Springer, 2010, pp. 333–337.","ama":"Mersmann O, Trautmann H, Naujoks B, Weihs C. On the Distribution of EMOA Hypervolumes. In: Blum C, Battiti R, eds. <i>Learning and Intelligent Optimization, 4$^th$ International Conference, LION 4, Venice, Italy</i>. Vol 6073. Lecture Notes in Computer Science. Springer; 2010:333–337.","apa":"Mersmann, O., Trautmann, H., Naujoks, B., &#38; Weihs, C. (2010). On the Distribution of EMOA Hypervolumes. In C. Blum &#38; R. Battiti (Eds.), <i>Learning and Intelligent Optimization, 4$^th$ International Conference, LION 4, Venice, Italy</i> (Vol. 6073, pp. 333–337). Springer."},"page":"333–337","intvolume":"      6073","year":"2010","title":"On the Distribution of EMOA Hypervolumes","author":[{"last_name":"Mersmann","full_name":"Mersmann, O","first_name":"O"},{"full_name":"Trautmann, Heike","id":"100740","last_name":"Trautmann","orcid":"0000-0002-9788-8282","first_name":"Heike"},{"first_name":"B","full_name":"Naujoks, B","last_name":"Naujoks"},{"last_name":"Weihs","full_name":"Weihs, C","first_name":"C"}],"date_created":"2023-08-04T16:03:45Z","volume":6073,"date_updated":"2023-10-16T13:55:59Z","publisher":"Springer"},{"status":"public","abstract":[{"lang":"eng","text":"Choosing and tuning an optimization procedure for a given class of nonlinear optimization problems is not an easy task. One way to proceed is to consider this as a tournament, where each procedure will compete in different ‘disciplines’. Here, disciplines could either be different functions, which we want to optimize, or specific performance measures of the optimization procedure. We would then be interested in the algorithm that performs best in a majority of cases or whose average performance is maximal. We will focus on evolutionary multiobjective optimization algorithms (EMOA), and will present a novel approach to the design and analysis of evolutionary multiobjective benchmark experiments based on similar work from the context of machine learning. We focus on deriving a consensus among several benchmarks over different test problems and illustrate the methodology by reanalyzing the results of the CEC 2007 EMOA competition."}],"type":"conference","publication":"IEEE Congress on Evolutionary Computation","language":[{"iso":"eng"}],"user_id":"15504","department":[{"_id":"34"},{"_id":"819"}],"_id":"46407","citation":{"chicago":"Mersmann, Olaf, Heike Trautmann, Boris Naujoks, and Claus Weihs. “Benchmarking Evolutionary Multiobjective Optimization Algorithms.” In <i>IEEE Congress on Evolutionary Computation</i>, 1–8, 2010. <a href=\"https://doi.org/10.1109/CEC.2010.5586241\">https://doi.org/10.1109/CEC.2010.5586241</a>.","ieee":"O. Mersmann, H. Trautmann, B. Naujoks, and C. Weihs, “Benchmarking evolutionary multiobjective optimization algorithms,” in <i>IEEE Congress on Evolutionary Computation</i>, 2010, pp. 1–8, doi: <a href=\"https://doi.org/10.1109/CEC.2010.5586241\">10.1109/CEC.2010.5586241</a>.","ama":"Mersmann O, Trautmann H, Naujoks B, Weihs C. Benchmarking evolutionary multiobjective optimization algorithms. In: <i>IEEE Congress on Evolutionary Computation</i>. ; 2010:1-8. doi:<a href=\"https://doi.org/10.1109/CEC.2010.5586241\">10.1109/CEC.2010.5586241</a>","apa":"Mersmann, O., Trautmann, H., Naujoks, B., &#38; Weihs, C. (2010). Benchmarking evolutionary multiobjective optimization algorithms. <i>IEEE Congress on Evolutionary Computation</i>, 1–8. <a href=\"https://doi.org/10.1109/CEC.2010.5586241\">https://doi.org/10.1109/CEC.2010.5586241</a>","mla":"Mersmann, Olaf, et al. “Benchmarking Evolutionary Multiobjective Optimization Algorithms.” <i>IEEE Congress on Evolutionary Computation</i>, 2010, pp. 1–8, doi:<a href=\"https://doi.org/10.1109/CEC.2010.5586241\">10.1109/CEC.2010.5586241</a>.","short":"O. Mersmann, H. Trautmann, B. Naujoks, C. Weihs, in: IEEE Congress on Evolutionary Computation, 2010, pp. 1–8.","bibtex":"@inproceedings{Mersmann_Trautmann_Naujoks_Weihs_2010, title={Benchmarking evolutionary multiobjective optimization algorithms}, DOI={<a href=\"https://doi.org/10.1109/CEC.2010.5586241\">10.1109/CEC.2010.5586241</a>}, booktitle={IEEE Congress on Evolutionary Computation}, author={Mersmann, Olaf and Trautmann, Heike and Naujoks, Boris and Weihs, Claus}, year={2010}, pages={1–8} }"},"page":"1-8","year":"2010","publication_identifier":{"issn":["1941-0026"]},"doi":"10.1109/CEC.2010.5586241","title":"Benchmarking evolutionary multiobjective optimization algorithms","date_created":"2023-08-04T16:05:53Z","author":[{"first_name":"Olaf","last_name":"Mersmann","full_name":"Mersmann, Olaf"},{"last_name":"Trautmann","orcid":"0000-0002-9788-8282","full_name":"Trautmann, Heike","id":"100740","first_name":"Heike"},{"first_name":"Boris","full_name":"Naujoks, Boris","last_name":"Naujoks"},{"first_name":"Claus","last_name":"Weihs","full_name":"Weihs, Claus"}],"date_updated":"2023-10-16T13:56:15Z"}]