[{"date_created":"2020-02-24T14:59:47Z","department":[{"_id":"9"},{"_id":"321"},{"_id":"149"}],"type":"conference","citation":{"ama":"Camberg AA, Tröster T. Optimization-based material design of tailored stacked hybrids for further improvement in lightweight car body structures. In: <i>HYBRID - MATERIALS AND STRUCTURES 2018 - PROCEEDINGS</i>. DGM - Deutsche Gesellschaft für Materialkunde e.V.; 2018.","bibtex":"@inproceedings{Camberg_Tröster_2018, title={Optimization-based material design of tailored stacked hybrids for further improvement in lightweight car body structures}, booktitle={HYBRID - MATERIALS AND STRUCTURES 2018 - PROCEEDINGS}, publisher={DGM - Deutsche Gesellschaft für Materialkunde e.V.}, author={Camberg, Alan Adam and Tröster, Thomas}, year={2018} }","mla":"Camberg, Alan Adam, and Thomas Tröster. “Optimization-Based Material Design of Tailored Stacked Hybrids for Further Improvement in Lightweight Car Body Structures.” <i>HYBRID - MATERIALS AND STRUCTURES 2018 - PROCEEDINGS</i>, DGM - Deutsche Gesellschaft für Materialkunde e.V., 2018.","short":"A.A. Camberg, T. Tröster, in: HYBRID - MATERIALS AND STRUCTURES 2018 - PROCEEDINGS, DGM - Deutsche Gesellschaft für Materialkunde e.V., 2018.","chicago":"Camberg, Alan Adam, and Thomas Tröster. “Optimization-Based Material Design of Tailored Stacked Hybrids for Further Improvement in Lightweight Car Body Structures.” In <i>HYBRID - MATERIALS AND STRUCTURES 2018 - PROCEEDINGS</i>. DGM - Deutsche Gesellschaft für Materialkunde e.V., 2018.","apa":"Camberg, A. A., &#38; Tröster, T. (2018). Optimization-based material design of tailored stacked hybrids for further improvement in lightweight car body structures. In <i>HYBRID - MATERIALS AND STRUCTURES 2018 - PROCEEDINGS</i>. Bremen: DGM - Deutsche Gesellschaft für Materialkunde e.V.","ieee":"A. A. Camberg and T. Tröster, “Optimization-based material design of tailored stacked hybrids for further improvement in lightweight car body structures,” in <i>HYBRID - MATERIALS AND STRUCTURES 2018 - PROCEEDINGS</i>, Bremen, 2018."},"publication":"HYBRID - MATERIALS AND STRUCTURES 2018 - PROCEEDINGS","_id":"16034","publisher":"DGM - Deutsche Gesellschaft für Materialkunde e.V.","language":[{"iso":"eng"}],"user_id":"60544","publication_identifier":{"isbn":["978-3-88355-417-4"]},"author":[{"full_name":"Camberg, Alan Adam","last_name":"Camberg","first_name":"Alan Adam","id":"60544"},{"first_name":"Thomas","last_name":"Tröster","full_name":"Tröster, Thomas","id":"553"}],"conference":{"start_date":"2018-04-18","name":"3rd International Conference on Hybrid Materials and Structures","location":"Bremen","end_date":"2018-04-19"},"year":"2018","title":"Optimization-based material design of tailored stacked hybrids for further improvement in lightweight car body structures","status":"public","publication_status":"published","date_updated":"2022-01-06T06:52:42Z"},{"date_created":"2020-03-13T12:44:12Z","type":"preprint","oa":"1","department":[{"_id":"101"}],"publication":"arXiv:1805.10118","citation":{"mla":"Klus, Stefan, et al. “Analyzing High-Dimensional Time-Series Data Using Kernel Transfer  Operator Eigenfunctions.” <i>ArXiv:1805.10118</i>, 2018.","ama":"Klus S, Peitz S, Schuster I. Analyzing high-dimensional time-series data using kernel transfer  operator eigenfunctions. <i>arXiv:180510118</i>. 2018.","bibtex":"@article{Klus_Peitz_Schuster_2018, title={Analyzing high-dimensional time-series data using kernel transfer  operator eigenfunctions}, journal={arXiv:1805.10118}, author={Klus, Stefan and Peitz, Sebastian and Schuster, Ingmar}, year={2018} }","apa":"Klus, S., Peitz, S., &#38; Schuster, I. (2018). Analyzing high-dimensional time-series data using kernel transfer  operator eigenfunctions. <i>ArXiv:1805.10118</i>.","ieee":"S. Klus, S. Peitz, and I. Schuster, “Analyzing high-dimensional time-series data using kernel transfer  operator eigenfunctions,” <i>arXiv:1805.10118</i>. 2018.","short":"S. Klus, S. Peitz, I. Schuster, ArXiv:1805.10118 (2018).","chicago":"Klus, Stefan, Sebastian Peitz, and Ingmar Schuster. “Analyzing High-Dimensional Time-Series Data Using Kernel Transfer  Operator Eigenfunctions.” <i>ArXiv:1805.10118</i>, 2018."},"abstract":[{"lang":"eng","text":"Kernel transfer operators, which can be regarded as approximations of\r\ntransfer operators such as the Perron-Frobenius or Koopman operator in\r\nreproducing kernel Hilbert spaces, are defined in terms of covariance and\r\ncross-covariance operators and have been shown to be closely related to the\r\nconditional mean embedding framework developed by the machine learning\r\ncommunity. The goal of this paper is to show how the dominant eigenfunctions of\r\nthese operators in combination with gradient-based optimization techniques can\r\nbe used to detect long-lived coherent patterns in high-dimensional time-series\r\ndata. The results will be illustrated using video data and a fluid flow\r\nexample."}],"project":[{"name":"Computing Resources Provided by the Paderborn Center for Parallel Computing","_id":"52"}],"main_file_link":[{"url":"https://arxiv.org/pdf/1805.10118.pdf","open_access":"1"}],"_id":"16293","language":[{"iso":"eng"}],"user_id":"47427","status":"public","title":"Analyzing high-dimensional time-series data using kernel transfer  operator eigenfunctions","year":"2018","author":[{"full_name":"Klus, Stefan","first_name":"Stefan","last_name":"Klus"},{"id":"47427","last_name":"Peitz","first_name":"Sebastian","orcid":"https://orcid.org/0000-0002-3389-793X","full_name":"Peitz, Sebastian"},{"full_name":"Schuster, Ingmar","last_name":"Schuster","first_name":"Ingmar"}],"date_updated":"2022-01-06T06:52:48Z"},{"doi":"10.1007/s10878-018-0269-7","language":[{"iso":"eng"}],"date_updated":"2022-01-06T06:51:42Z","publication_status":"epub_ahead","author":[{"full_name":"Drees, Maximilian","first_name":"Maximilian","last_name":"Drees"},{"full_name":"Feldotto, Matthias","orcid":"0000-0003-1348-6516","last_name":"Feldotto","first_name":"Matthias","id":"14052"},{"full_name":"Riechers, Sören","first_name":"Sören","last_name":"Riechers"},{"full_name":"Skopalik, Alexander","last_name":"Skopalik","first_name":"Alexander","id":"40384"}],"publication_identifier":{"issn":["1382-6905","1573-2886"]},"title":"Pure Nash equilibria in restricted budget games","year":"2018","department":[{"_id":"63"},{"_id":"541"}],"type":"journal_article","date_created":"2018-03-18T11:12:49Z","file":[{"file_name":"Drees2018_Article_PureNashEquilibriaInRestricted.pdf","file_size":561187,"access_level":"closed","relation":"main_file","date_updated":"2018-10-31T16:56:13Z","file_id":"5225","content_type":"application/pdf","creator":"feldi","date_created":"2018-10-31T16:56:13Z"}],"abstract":[{"text":"In budget games, players compete over resources with finite budgets. For every resource, a player has a specific demand and as a strategy, he chooses a subset of resources. If the total demand on a resource does not exceed its budget, the utility of each player who chose that resource equals his demand. Otherwise, the budget is shared proportionally. In the general case, pure Nash equilibria (NE) do not exist for such games. In this paper, we consider the natural classes of singleton and matroid budget games with additional constraints and show that for each, pure NE can be guaranteed. In addition, we introduce a lexicographical potential function to prove that every matroid budget game has an approximate pure NE which depends on the largest ratio between the different demands of each individual player.","lang":"eng"}],"publication":"Journal of Combinatorial Optimization","ddc":["000"],"user_id":"14052","publisher":"Springer Nature","_id":"1369","has_accepted_license":"1","status":"public","project":[{"_id":"1","name":"SFB 901"},{"name":"SFB 901 - Project Area A","_id":"2"},{"_id":"7","name":"SFB 901 - Subproject A3"},{"_id":"4","name":"SFB 901 - Project Area C"},{"_id":"16","name":"SFB 901 - Subproject C4"}],"citation":{"mla":"Drees, Maximilian, et al. “Pure Nash Equilibria in Restricted Budget Games.” <i>Journal of Combinatorial Optimization</i>, Springer Nature, 2018, doi:<a href=\"https://doi.org/10.1007/s10878-018-0269-7\">10.1007/s10878-018-0269-7</a>.","ama":"Drees M, Feldotto M, Riechers S, Skopalik A. Pure Nash equilibria in restricted budget games. <i>Journal of Combinatorial Optimization</i>. 2018. doi:<a href=\"https://doi.org/10.1007/s10878-018-0269-7\">10.1007/s10878-018-0269-7</a>","bibtex":"@article{Drees_Feldotto_Riechers_Skopalik_2018, title={Pure Nash equilibria in restricted budget games}, DOI={<a href=\"https://doi.org/10.1007/s10878-018-0269-7\">10.1007/s10878-018-0269-7</a>}, journal={Journal of Combinatorial Optimization}, publisher={Springer Nature}, author={Drees, Maximilian and Feldotto, Matthias and Riechers, Sören and Skopalik, Alexander}, year={2018} }","apa":"Drees, M., Feldotto, M., Riechers, S., &#38; Skopalik, A. (2018). Pure Nash equilibria in restricted budget games. <i>Journal of Combinatorial Optimization</i>. <a href=\"https://doi.org/10.1007/s10878-018-0269-7\">https://doi.org/10.1007/s10878-018-0269-7</a>","ieee":"M. Drees, M. Feldotto, S. Riechers, and A. Skopalik, “Pure Nash equilibria in restricted budget games,” <i>Journal of Combinatorial Optimization</i>, 2018.","chicago":"Drees, Maximilian, Matthias Feldotto, Sören Riechers, and Alexander Skopalik. “Pure Nash Equilibria in Restricted Budget Games.” <i>Journal of Combinatorial Optimization</i>, 2018. <a href=\"https://doi.org/10.1007/s10878-018-0269-7\">https://doi.org/10.1007/s10878-018-0269-7</a>.","short":"M. Drees, M. Feldotto, S. Riechers, A. Skopalik, Journal of Combinatorial Optimization (2018)."},"file_date_updated":"2018-10-31T16:56:13Z"},{"language":[{"iso":"eng"}],"doi":"10.1007/s10440-018-0209-7","title":"Multiobjective Optimal Control Methods for the Navier-Stokes Equations Using Reduced Order Modeling","year":"2018","publication_identifier":{"issn":["0167-8019","1572-9036"]},"author":[{"id":"47427","full_name":"Peitz, Sebastian","first_name":"Sebastian","orcid":"https://orcid.org/0000-0002-3389-793X","last_name":"Peitz"},{"last_name":"Ober-Blöbaum","first_name":"Sina","full_name":"Ober-Blöbaum, Sina","id":"16494"},{"full_name":"Dellnitz, Michael","first_name":"Michael","last_name":"Dellnitz"}],"date_updated":"2022-01-21T10:01:41Z","publication_status":"published","intvolume":"       161","date_created":"2019-03-29T13:30:41Z","type":"journal_article","department":[{"_id":"101"}],"issue":"1","publication":"Acta Applicandae Mathematicae","abstract":[{"text":"In a wide range of applications it is desirable to optimally control a dynamical system with respect to concurrent, potentially competing goals. This gives rise to a multiobjective optimal control problem where, instead of computing a single optimal solution, the set of optimal compromises, the so-called Pareto set, has to be approximated. When the problem under consideration is described by a partial differential equation (PDE), as is the case for fluid flow, the computational cost rapidly increases and makes its direct treatment infeasible. Reduced order modeling is a very popular method to reduce the computational cost, in particular in a multi query context such as uncertainty quantification, parameter estimation or optimization. In this article, we show how to combine reduced order modeling and multiobjective optimal control techniques in order to efficiently solve multiobjective optimal control problems constrained by PDEs. We consider a global, derivative free optimization method as well as a local, gradient-based approach for which the optimality system is derived in two different ways. The methods are compared with regard to the solution quality as well as the computational effort and they are illustrated using the example of the flow around a cylinder and a backward-facing-step channel flow.","lang":"eng"}],"page":"171–199","_id":"8753","user_id":"15694","volume":161,"status":"public","citation":{"mla":"Peitz, Sebastian, et al. “Multiobjective Optimal Control Methods for the Navier-Stokes Equations Using Reduced Order Modeling.” <i>Acta Applicandae Mathematicae</i>, vol. 161, no. 1, 2018, pp. 171–199, doi:<a href=\"https://doi.org/10.1007/s10440-018-0209-7\">10.1007/s10440-018-0209-7</a>.","bibtex":"@article{Peitz_Ober-Blöbaum_Dellnitz_2018, title={Multiobjective Optimal Control Methods for the Navier-Stokes Equations Using Reduced Order Modeling}, volume={161}, DOI={<a href=\"https://doi.org/10.1007/s10440-018-0209-7\">10.1007/s10440-018-0209-7</a>}, number={1}, journal={Acta Applicandae Mathematicae}, author={Peitz, Sebastian and Ober-Blöbaum, Sina and Dellnitz, Michael}, year={2018}, pages={171–199} }","ama":"Peitz S, Ober-Blöbaum S, Dellnitz M. Multiobjective Optimal Control Methods for the Navier-Stokes Equations Using Reduced Order Modeling. <i>Acta Applicandae Mathematicae</i>. 2018;161(1):171–199. doi:<a href=\"https://doi.org/10.1007/s10440-018-0209-7\">10.1007/s10440-018-0209-7</a>","ieee":"S. Peitz, S. Ober-Blöbaum, and M. Dellnitz, “Multiobjective Optimal Control Methods for the Navier-Stokes Equations Using Reduced Order Modeling,” <i>Acta Applicandae Mathematicae</i>, vol. 161, no. 1, pp. 171–199, 2018, doi: <a href=\"https://doi.org/10.1007/s10440-018-0209-7\">10.1007/s10440-018-0209-7</a>.","apa":"Peitz, S., Ober-Blöbaum, S., &#38; Dellnitz, M. (2018). Multiobjective Optimal Control Methods for the Navier-Stokes Equations Using Reduced Order Modeling. <i>Acta Applicandae Mathematicae</i>, <i>161</i>(1), 171–199. <a href=\"https://doi.org/10.1007/s10440-018-0209-7\">https://doi.org/10.1007/s10440-018-0209-7</a>","short":"S. Peitz, S. Ober-Blöbaum, M. Dellnitz, Acta Applicandae Mathematicae 161 (2018) 171–199.","chicago":"Peitz, Sebastian, Sina Ober-Blöbaum, and Michael Dellnitz. “Multiobjective Optimal Control Methods for the Navier-Stokes Equations Using Reduced Order Modeling.” <i>Acta Applicandae Mathematicae</i> 161, no. 1 (2018): 171–199. <a href=\"https://doi.org/10.1007/s10440-018-0209-7\">https://doi.org/10.1007/s10440-018-0209-7</a>."},"project":[{"_id":"52","name":"Computing Resources Provided by the Paderborn Center for Parallel Computing"}]},{"doi":"10.3390/nu10050582","user_id":"89838","article_number":"582","language":[{"iso":"eng"}],"_id":"27027","date_updated":"2022-09-15T09:50:24Z","publication_status":"published","year":"2018","status":"public","title":"Dietary Acid Load and Mental Health Outcomes in Children and Adolescents: Results from the GINIplus and LISA Birth Cohort Studies","author":[{"last_name":"Bühlmeier","first_name":"Judith","full_name":"Bühlmeier, Judith","id":"89838"},{"last_name":"Harris","first_name":"Carla","full_name":"Harris, Carla"},{"first_name":"Sibylle","last_name":"Koletzko","full_name":"Koletzko, Sibylle"},{"last_name":"Lehmann","first_name":"Irina","full_name":"Lehmann, Irina"},{"last_name":"Bauer","first_name":"Carl-Peter","full_name":"Bauer, Carl-Peter"},{"full_name":"Schikowski, Tamara","last_name":"Schikowski","first_name":"Tamara"},{"first_name":"Andrea","last_name":"von Berg","full_name":"von Berg, Andrea"},{"first_name":"Dietrich","last_name":"Berdel","full_name":"Berdel, Dietrich"},{"last_name":"Heinrich","first_name":"Joachim","full_name":"Heinrich, Joachim"},{"full_name":"Hebebrand, Johannes","first_name":"Johannes","last_name":"Hebebrand"},{"last_name":"Föcker","first_name":"Manuel","full_name":"Föcker, Manuel"},{"full_name":"Standl, Marie","first_name":"Marie","last_name":"Standl"},{"full_name":"Libuda, Lars","first_name":"Lars","orcid":"0000-0003-1603-3133","last_name":"Libuda","id":"88682"}],"publication_identifier":{"issn":["2072-6643"]},"type":"journal_article","department":[{"_id":"35"},{"_id":"22"},{"_id":"395"}],"date_created":"2021-11-01T19:29:28Z","extern":"1","publication":"Nutrients","citation":{"chicago":"Bühlmeier, Judith, Carla Harris, Sibylle Koletzko, Irina Lehmann, Carl-Peter Bauer, Tamara Schikowski, Andrea von Berg, et al. “Dietary Acid Load and Mental Health Outcomes in Children and Adolescents: Results from the GINIplus and LISA Birth Cohort Studies.” <i>Nutrients</i>, 2018. <a href=\"https://doi.org/10.3390/nu10050582\">https://doi.org/10.3390/nu10050582</a>.","short":"J. Bühlmeier, C. Harris, S. Koletzko, I. Lehmann, C.-P. Bauer, T. Schikowski, A. von Berg, D. Berdel, J. Heinrich, J. Hebebrand, M. Föcker, M. Standl, L. Libuda, Nutrients (2018).","ieee":"J. Bühlmeier <i>et al.</i>, “Dietary Acid Load and Mental Health Outcomes in Children and Adolescents: Results from the GINIplus and LISA Birth Cohort Studies,” <i>Nutrients</i>, Art. no. 582, 2018, doi: <a href=\"https://doi.org/10.3390/nu10050582\">10.3390/nu10050582</a>.","apa":"Bühlmeier, J., Harris, C., Koletzko, S., Lehmann, I., Bauer, C.-P., Schikowski, T., von Berg, A., Berdel, D., Heinrich, J., Hebebrand, J., Föcker, M., Standl, M., &#38; Libuda, L. (2018). Dietary Acid Load and Mental Health Outcomes in Children and Adolescents: Results from the GINIplus and LISA Birth Cohort Studies. <i>Nutrients</i>, Article 582. <a href=\"https://doi.org/10.3390/nu10050582\">https://doi.org/10.3390/nu10050582</a>","bibtex":"@article{Bühlmeier_Harris_Koletzko_Lehmann_Bauer_Schikowski_von Berg_Berdel_Heinrich_Hebebrand_et al._2018, title={Dietary Acid Load and Mental Health Outcomes in Children and Adolescents: Results from the GINIplus and LISA Birth Cohort Studies}, DOI={<a href=\"https://doi.org/10.3390/nu10050582\">10.3390/nu10050582</a>}, number={582}, journal={Nutrients}, author={Bühlmeier, Judith and Harris, Carla and Koletzko, Sibylle and Lehmann, Irina and Bauer, Carl-Peter and Schikowski, Tamara and von Berg, Andrea and Berdel, Dietrich and Heinrich, Joachim and Hebebrand, Johannes and et al.}, year={2018} }","ama":"Bühlmeier J, Harris C, Koletzko S, et al. Dietary Acid Load and Mental Health Outcomes in Children and Adolescents: Results from the GINIplus and LISA Birth Cohort Studies. <i>Nutrients</i>. Published online 2018. doi:<a href=\"https://doi.org/10.3390/nu10050582\">10.3390/nu10050582</a>","mla":"Bühlmeier, Judith, et al. “Dietary Acid Load and Mental Health Outcomes in Children and Adolescents: Results from the GINIplus and LISA Birth Cohort Studies.” <i>Nutrients</i>, 582, 2018, doi:<a href=\"https://doi.org/10.3390/nu10050582\">10.3390/nu10050582</a>."}},{"status":"public","editor":[{"full_name":"Braubach, Lars","first_name":"Lars","last_name":"Braubach"},{"full_name":"Murillo, Juan M.","last_name":"Murillo","first_name":"Juan M."},{"full_name":"Kaviani, Nima","first_name":"Nima","last_name":"Kaviani"},{"first_name":"Manuel","last_name":"Lama","full_name":"Lama, Manuel"},{"last_name":"Burgueño","first_name":"Loli","full_name":"Burgueño, Loli"},{"last_name":"Moha","first_name":"Naouel","full_name":"Moha, Naouel"},{"last_name":"Oriol","first_name":"Marc","full_name":"Oriol, Marc"}],"user_id":"11871","_id":"5831","publisher":"Springer International Publishing","page":"388-392","citation":{"short":"D. Wolters, S. Heindorf, J. Kirchhoff, G. Engels, in: L. Braubach, J.M. Murillo, N. Kaviani, M. Lama, L. Burgueño, N. Moha, M. Oriol (Eds.), Service-Oriented Computing -- ICSOC 2017 Workshops, Springer International Publishing, Cham, 2018, pp. 388–392.","chicago":"Wolters, Dennis, Stefan Heindorf, Jonas Kirchhoff, and Gregor Engels. “Semantic Data Mediator: Linking Services to Websites.” In <i>Service-Oriented Computing -- ICSOC 2017 Workshops</i>, edited by Lars Braubach, Juan M. Murillo, Nima Kaviani, Manuel Lama, Loli Burgueño, Naouel Moha, and Marc Oriol, 388–92. Cham: Springer International Publishing, 2018. <a href=\"https://doi.org/10.1007/978-3-319-91764-1_36\">https://doi.org/10.1007/978-3-319-91764-1_36</a>.","ieee":"D. Wolters, S. Heindorf, J. Kirchhoff, and G. Engels, “Semantic Data Mediator: Linking Services to Websites,” in <i>Service-Oriented Computing -- ICSOC 2017 Workshops</i>, 2018, pp. 388–392, doi: <a href=\"https://doi.org/10.1007/978-3-319-91764-1_36\">10.1007/978-3-319-91764-1_36</a>.","apa":"Wolters, D., Heindorf, S., Kirchhoff, J., &#38; Engels, G. (2018). Semantic Data Mediator: Linking Services to Websites. In L. Braubach, J. M. Murillo, N. Kaviani, M. Lama, L. Burgueño, N. Moha, &#38; M. Oriol (Eds.), <i>Service-Oriented Computing -- ICSOC 2017 Workshops</i> (pp. 388–392). Springer International Publishing. <a href=\"https://doi.org/10.1007/978-3-319-91764-1_36\">https://doi.org/10.1007/978-3-319-91764-1_36</a>","bibtex":"@inproceedings{Wolters_Heindorf_Kirchhoff_Engels_2018, place={Cham}, title={Semantic Data Mediator: Linking Services to Websites}, DOI={<a href=\"https://doi.org/10.1007/978-3-319-91764-1_36\">10.1007/978-3-319-91764-1_36</a>}, booktitle={Service-Oriented Computing -- ICSOC 2017 Workshops}, publisher={Springer International Publishing}, author={Wolters, Dennis and Heindorf, Stefan and Kirchhoff, Jonas and Engels, Gregor}, editor={Braubach, Lars and Murillo, Juan M. and Kaviani, Nima and Lama, Manuel and Burgueño, Loli and Moha, Naouel and Oriol, Marc}, year={2018}, pages={388–392} }","ama":"Wolters D, Heindorf S, Kirchhoff J, Engels G. Semantic Data Mediator: Linking Services to Websites. In: Braubach L, Murillo JM, Kaviani N, et al., eds. <i>Service-Oriented Computing -- ICSOC 2017 Workshops</i>. Springer International Publishing; 2018:388-392. doi:<a href=\"https://doi.org/10.1007/978-3-319-91764-1_36\">10.1007/978-3-319-91764-1_36</a>","mla":"Wolters, Dennis, et al. “Semantic Data Mediator: Linking Services to Websites.” <i>Service-Oriented Computing -- ICSOC 2017 Workshops</i>, edited by Lars Braubach et al., Springer International Publishing, 2018, pp. 388–92, doi:<a href=\"https://doi.org/10.1007/978-3-319-91764-1_36\">10.1007/978-3-319-91764-1_36</a>."},"oa":"1","place":"Cham","date_updated":"2022-10-15T20:00:17Z","author":[{"id":"11308","first_name":"Dennis","last_name":"Wolters","full_name":"Wolters, Dennis"},{"orcid":"0000-0002-4525-6865","last_name":"Heindorf","first_name":"Stefan","full_name":"Heindorf, Stefan","id":"11871"},{"id":"39928","full_name":"Kirchhoff, Jonas","last_name":"Kirchhoff","first_name":"Jonas"},{"full_name":"Engels, Gregor","first_name":"Gregor","last_name":"Engels","id":"107"}],"publication_identifier":{"isbn":["978-3-319-91764-1"]},"title":"Semantic Data Mediator: Linking Services to Websites","year":"2018","doi":"10.1007/978-3-319-91764-1_36","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://groups.uni-paderborn.de/fg-engels/publications_pdfs/Konferenzbeitraege/wolters2017_ICSOC_demo.pdf","open_access":"1"}],"abstract":[{"lang":"eng","text":"Many websites offer links to social media sites for convenient content sharing. Unfortunately, those sharing capabilities are quite restricted and it is seldom possible to share content with other services, like those provided by a user's favorite applications or smart devices. In this paper, we present Semantic Data Mediator (SDM) --- a flexible middleware linking a vast number of services to millions of websites. Based on reusable repositories of service descriptions defined by the crowd, users can easily fill a personal registry with their favorite services, which can then be linked to websites by SDM. For this, SDM leverages semantic data, which is already available on millions of websites due to search engine optimization. Further support for our approach from website or service developers is not required. To enable the use of a broad range of services, data conversion services are automatically composed by SDM to transform data according to the needs of the different services. In addition to linking web services, various service adapters allow services of applications and smart devices to be linked as well. We have fully implemented our approach and present a real-world case study demonstrating its feasibility and usefulness."}],"publication":"Service-Oriented Computing -- ICSOC 2017 Workshops","department":[{"_id":"66"}],"type":"conference","date_created":"2018-11-26T11:52:59Z"},{"user_id":"33229","main_file_link":[{"open_access":"1","url":"https://networks.h-net.org/node/79435/discussions/3144255/tagb-kulturen-der-moral-moral-cultures-19-220918-paderborn"}],"_id":"36411","series_title":"H-Net","language":[{"iso":"ger"}],"publication_status":"published","date_updated":"2023-01-12T13:53:03Z","year":"2018","status":"public","title":"Tagungsbericht: Kulturen der Moral – Moral Cultures. Internationale und interdisziplinäre Tagung in Kooperation mit der DGEJ vom 19. bis 22. September 2018 an der Universität Paderborn.","author":[{"id":"33229","last_name":"Becker","first_name":"Rieke","full_name":"Becker, Rieke"},{"first_name":"Michael","last_name":"Heidgen","full_name":"Heidgen, Michael"},{"first_name":"Markus","last_name":"Lauert","full_name":"Lauert, Markus","id":"33619"},{"full_name":"Witschel, Verena","first_name":"Verena","last_name":"Witschel"}],"type":"report","department":[{"_id":"446"}],"oa":"1","date_created":"2023-01-12T11:42:01Z","citation":{"apa":"Becker, R., Heidgen, M., Lauert, M., &#38; Witschel, V. (2018). <i>Tagungsbericht: Kulturen der Moral – Moral Cultures. Internationale und interdisziplinäre Tagung in Kooperation mit der DGEJ vom 19. bis 22. September 2018 an der Universität Paderborn.</i>","ieee":"R. Becker, M. Heidgen, M. Lauert, and V. Witschel, <i>Tagungsbericht: Kulturen der Moral – Moral Cultures. Internationale und interdisziplinäre Tagung in Kooperation mit der DGEJ vom 19. bis 22. September 2018 an der Universität Paderborn.</i> 2018.","chicago":"Becker, Rieke, Michael Heidgen, Markus Lauert, and Verena Witschel. <i>Tagungsbericht: Kulturen der Moral – Moral Cultures. Internationale und interdisziplinäre Tagung in Kooperation mit der DGEJ vom 19. bis 22. September 2018 an der Universität Paderborn.</i> H-Net, 2018.","short":"R. Becker, M. Heidgen, M. Lauert, V. Witschel, Tagungsbericht: Kulturen der Moral – Moral Cultures. Internationale und interdisziplinäre Tagung in Kooperation mit der DGEJ vom 19. bis 22. September 2018 an der Universität Paderborn., 2018.","mla":"Becker, Rieke, et al. <i>Tagungsbericht: Kulturen der Moral – Moral Cultures. Internationale und interdisziplinäre Tagung in Kooperation mit der DGEJ vom 19. bis 22. September 2018 an der Universität Paderborn.</i> 2018.","ama":"Becker R, Heidgen M, Lauert M, Witschel V. <i>Tagungsbericht: Kulturen der Moral – Moral Cultures. Internationale und interdisziplinäre Tagung in Kooperation mit der DGEJ vom 19. bis 22. September 2018 an der Universität Paderborn.</i>; 2018.","bibtex":"@book{Becker_Heidgen_Lauert_Witschel_2018, series={H-Net}, title={Tagungsbericht: Kulturen der Moral – Moral Cultures. Internationale und interdisziplinäre Tagung in Kooperation mit der DGEJ vom 19. bis 22. September 2018 an der Universität Paderborn.}, author={Becker, Rieke and Heidgen, Michael and Lauert, Markus and Witschel, Verena}, year={2018}, collection={H-Net} }"}},{"publication":"Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Database (ECML/PKDD)","citation":{"bibtex":"@inproceedings{van Engelen_van Lier_Takes_Trautmann_2018, place={Dublin, Ireland}, title={Accurate WiFi based indoor positioning with continuous location sampling}, booktitle={Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Database (ECML/PKDD)}, publisher={Springer}, author={van Engelen, J.E. and van Lier, J.J. and Takes, F.W. and Trautmann, Heike}, year={2018}, pages={524–540} }","ama":"van Engelen JE, van Lier JJ, Takes FW, Trautmann H. Accurate WiFi based indoor positioning with continuous location sampling. In: <i>Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Database (ECML/PKDD)</i>. Springer; 2018:524–540.","mla":"van Engelen, J. E., et al. “Accurate WiFi Based Indoor Positioning with Continuous Location Sampling.” <i>Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Database (ECML/PKDD)</i>, Springer, 2018, pp. 524–540.","chicago":"Engelen, J.E. van, J.J. van Lier, F.W. Takes, and Heike Trautmann. “Accurate WiFi Based Indoor Positioning with Continuous Location Sampling.” In <i>Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Database (ECML/PKDD)</i>, 524–540. Dublin, Ireland: Springer, 2018.","short":"J.E. van Engelen, J.J. van Lier, F.W. Takes, H. Trautmann, in: Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Database (ECML/PKDD), Springer, Dublin, Ireland, 2018, pp. 524–540.","ieee":"J. E. van Engelen, J. J. van Lier, F. W. Takes, and H. Trautmann, “Accurate WiFi based indoor positioning with continuous location sampling,” in <i>Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Database (ECML/PKDD)</i>, 2018, pp. 524–540.","apa":"van Engelen, J. E., van Lier, J. J., Takes, F. W., &#38; Trautmann, H. (2018). Accurate WiFi based indoor positioning with continuous location sampling. <i>Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Database (ECML/PKDD)</i>, 524–540."},"abstract":[{"lang":"eng","text":"The ubiquity of WiFi access points and the sharp increase in WiFi-enabled devices carried by humans have paved the way for WiFi-based indoor positioning and location analysis. Locating people in indoor environments has numerous applications in robotics, crowd control, indoor facility optimization, and automated environment mapping. However, existing WiFi-based positioning systems suffer from two major problems: (1) their accuracy and precision is limited due to inherent noise induced by indoor obstacles, and (2) they only occasionally provide location estimates, namely when a WiFi-equipped device emits a signal. To mitigate these two issues, we propose a novel Gaussian process (GP) model for WiFi signal strength measurements. It allows for simultaneous smoothing (increasing accuracy and precision of estimators) and interpolation (enabling continuous sampling of location estimates). Furthermore, simple and efficient smoothing methods for location estimates are introduced to improve localization performance in real-time settings. Experiments are conducted on two data sets from a large real-world commercial indoor retail environment. Results demonstrate that our approach provides significant improvements in terms of precision and accuracy with respect to unfiltered data. Ultimately, the GP model realizes continuous location sampling with consistently high quality location estimates."}],"place":"Dublin, Ireland","date_created":"2023-08-04T07:54:43Z","type":"conference","department":[{"_id":"34"},{"_id":"819"}],"status":"public","year":"2018","title":"Accurate WiFi based indoor positioning with continuous location sampling","author":[{"full_name":"van Engelen, J.E.","last_name":"van Engelen","first_name":"J.E."},{"first_name":"J.J.","last_name":"van Lier","full_name":"van Lier, J.J."},{"last_name":"Takes","first_name":"F.W.","full_name":"Takes, F.W."},{"full_name":"Trautmann, Heike","orcid":"0000-0002-9788-8282","first_name":"Heike","last_name":"Trautmann","id":"100740"}],"date_updated":"2023-10-16T13:33:18Z","page":"524–540","_id":"46350","publisher":"Springer","language":[{"iso":"eng"}],"user_id":"15504"},{"author":[{"full_name":"Carnein, Matthias","last_name":"Carnein","first_name":"Matthias"},{"id":"100740","full_name":"Trautmann, Heike","first_name":"Heike","last_name":"Trautmann","orcid":"0000-0002-9788-8282"}],"title":"evoStream — Evolutionary Stream Clustering Utilizing Idle Times","year":"2018","status":"public","intvolume":"        14","date_updated":"2023-10-16T13:33:43Z","language":[{"iso":"eng"}],"_id":"46351","page":"101–111","volume":14,"doi":"10.1016/j.bdr.2018.05.005","user_id":"15504","citation":{"ama":"Carnein M, Trautmann H. evoStream — Evolutionary Stream Clustering Utilizing Idle Times. <i>Big Data Research</i>. 2018;14:101–111. doi:<a href=\"https://doi.org/10.1016/j.bdr.2018.05.005\">10.1016/j.bdr.2018.05.005</a>","bibtex":"@article{Carnein_Trautmann_2018, title={evoStream — Evolutionary Stream Clustering Utilizing Idle Times}, volume={14}, DOI={<a href=\"https://doi.org/10.1016/j.bdr.2018.05.005\">10.1016/j.bdr.2018.05.005</a>}, journal={Big Data Research}, author={Carnein, Matthias and Trautmann, Heike}, year={2018}, pages={101–111} }","mla":"Carnein, Matthias, and Heike Trautmann. “EvoStream — Evolutionary Stream Clustering Utilizing Idle Times.” <i>Big Data Research</i>, vol. 14, 2018, pp. 101–111, doi:<a href=\"https://doi.org/10.1016/j.bdr.2018.05.005\">10.1016/j.bdr.2018.05.005</a>.","short":"M. Carnein, H. Trautmann, Big Data Research 14 (2018) 101–111.","chicago":"Carnein, Matthias, and Heike Trautmann. “EvoStream — Evolutionary Stream Clustering Utilizing Idle Times.” <i>Big Data Research</i> 14 (2018): 101–111. <a href=\"https://doi.org/10.1016/j.bdr.2018.05.005\">https://doi.org/10.1016/j.bdr.2018.05.005</a>.","apa":"Carnein, M., &#38; Trautmann, H. (2018). evoStream — Evolutionary Stream Clustering Utilizing Idle Times. <i>Big Data Research</i>, <i>14</i>, 101–111. <a href=\"https://doi.org/10.1016/j.bdr.2018.05.005\">https://doi.org/10.1016/j.bdr.2018.05.005</a>","ieee":"M. Carnein and H. Trautmann, “evoStream — Evolutionary Stream Clustering Utilizing Idle Times,” <i>Big Data Research</i>, vol. 14, pp. 101–111, 2018, doi: <a href=\"https://doi.org/10.1016/j.bdr.2018.05.005\">10.1016/j.bdr.2018.05.005</a>."},"publication":"Big Data Research","abstract":[{"text":"Clustering is an important field in data mining that aims to reveal hidden patterns in data sets. It is widely popular in marketing or medical applications and used to identify groups of similar objects. Clustering possibly unbounded and evolving data streams is of particular interest due to the widespread deployment of large and fast data sources such as sensors. The vast majority of stream clustering algorithms employ a two-phase approach where the stream is first summarized in an online phase. Upon request, an offline phase reclusters the aggregations into the final clusters. In this setup, the online component will idle and wait for the next observation in times where the stream is slow. This paper proposes a new stream clustering algorithm called evoStream which performs evolutionary optimization in the idle times of the online phase to incrementally build and refine the final clusters. Since the online phase would idle otherwise, our approach does not reduce the processing speed while effectively removing the computational overhead of the offline phase. In extensive experiments on real data streams we show that the proposed algorithm allows to output clusters of high quality at any time within the stream without the need for additional computational resources.","lang":"eng"}],"date_created":"2023-08-04T07:55:33Z","department":[{"_id":"34"},{"_id":"819"}],"type":"journal_article"},{"citation":{"mla":"Li, L., et al. “Multiobjective Evolutionary Algorithms Based on Target Region Preferences.” <i>Swarm and Evolutionary Computation</i>, vol. 40, 2018, pp. 196–215, doi:<a href=\"https://doi.org/10.1016/j.swevo.2018.02.006\">10.1016/j.swevo.2018.02.006</a>.","ama":"Li L, Wang Y, Trautmann H, Jing N, Emmerich M. Multiobjective evolutionary algorithms based on target region preferences. <i>Swarm and Evolutionary Computation</i>. 2018;40:196–215. doi:<a href=\"https://doi.org/10.1016/j.swevo.2018.02.006\">10.1016/j.swevo.2018.02.006</a>","bibtex":"@article{Li_Wang_Trautmann_Jing_Emmerich_2018, title={Multiobjective evolutionary algorithms based on target region preferences}, volume={40}, DOI={<a href=\"https://doi.org/10.1016/j.swevo.2018.02.006\">10.1016/j.swevo.2018.02.006</a>}, journal={Swarm and Evolutionary Computation}, author={Li, L and Wang, Y and Trautmann, Heike and Jing, N and Emmerich, M}, year={2018}, pages={196–215} }","apa":"Li, L., Wang, Y., Trautmann, H., Jing, N., &#38; Emmerich, M. (2018). Multiobjective evolutionary algorithms based on target region preferences. <i>Swarm and Evolutionary Computation</i>, <i>40</i>, 196–215. <a href=\"https://doi.org/10.1016/j.swevo.2018.02.006\">https://doi.org/10.1016/j.swevo.2018.02.006</a>","ieee":"L. Li, Y. Wang, H. Trautmann, N. Jing, and M. Emmerich, “Multiobjective evolutionary algorithms based on target region preferences,” <i>Swarm and Evolutionary Computation</i>, vol. 40, pp. 196–215, 2018, doi: <a href=\"https://doi.org/10.1016/j.swevo.2018.02.006\">10.1016/j.swevo.2018.02.006</a>.","short":"L. Li, Y. Wang, H. Trautmann, N. Jing, M. Emmerich, Swarm and Evolutionary Computation 40 (2018) 196–215.","chicago":"Li, L, Y Wang, Heike Trautmann, N Jing, and M Emmerich. “Multiobjective Evolutionary Algorithms Based on Target Region Preferences.” <i>Swarm and Evolutionary Computation</i> 40 (2018): 196–215. <a href=\"https://doi.org/10.1016/j.swevo.2018.02.006\">https://doi.org/10.1016/j.swevo.2018.02.006</a>."},"publication":"Swarm and Evolutionary Computation","abstract":[{"text":"Incorporating decision makers' preferences is of great significance in multiobjective optimization. Target region-based multiobjective evolutionary algorithms (TMOEAs), aiming at a well-distributed subset of Pareto optimal solutions within the user-provided region(s), are extensively investigated in this paper. An empirical comparison is performed among three TMOEA instantiations: T-NSGA-II, T-SMS-EMOA and T-R2-EMOA. Experimental results show that T-SMS-EMOA has the best overall performance regarding the hypervolume indicator within the target region, while T-NSGA-II is the fastest algorithm. We also compare TMOEAs with other state-of-the-art preference-based approaches, i.e., DF-SMS-EMOA, RVEA, AS-EMOA and R-NSGA-II to show the advantages of TMOEAs. A case study in the mission planning of earth observation satellite is carried out to verify the capabilities of TMOEAs in the real-world application. Experimental results indicate that preferences can improve the searching ability of MOEAs, and TMOEAs can successfully find nondominated solutions preferred by the decision maker.","lang":"eng"}],"date_created":"2023-08-04T07:56:57Z","department":[{"_id":"34"},{"_id":"819"}],"type":"journal_article","author":[{"last_name":"Li","first_name":"L","full_name":"Li, L"},{"full_name":"Wang, Y","last_name":"Wang","first_name":"Y"},{"orcid":"0000-0002-9788-8282","first_name":"Heike","last_name":"Trautmann","full_name":"Trautmann, Heike","id":"100740"},{"first_name":"N","last_name":"Jing","full_name":"Jing, N"},{"full_name":"Emmerich, M","first_name":"M","last_name":"Emmerich"}],"title":"Multiobjective evolutionary algorithms based on target region preferences","status":"public","year":"2018","intvolume":"        40","date_updated":"2023-10-16T13:34:21Z","_id":"46353","language":[{"iso":"eng"}],"page":"196–215","volume":40,"user_id":"15504","doi":"10.1016/j.swevo.2018.02.006"},{"type":"working_paper","date_created":"2023-09-16T11:28:51Z","citation":{"ama":"Kesternich M. <i> Bottom-up Climate Mitigation Efforts</i>. Vol 1. EAERE Magazine 1, 19-22; 2018:19-22.","short":"M. Kesternich,  Bottom-up Climate Mitigation Efforts, EAERE Magazine 1, 19-22, 2018.","chicago":"Kesternich, Martin. <i> Bottom-up Climate Mitigation Efforts</i>. Vol. 1. EAERE Magazine 1, 19-22, 2018.","bibtex":"@book{Kesternich_2018, title={ Bottom-up climate mitigation efforts}, volume={1}, publisher={EAERE Magazine 1, 19-22}, author={Kesternich, Martin}, year={2018}, pages={19–22} }","apa":"Kesternich, M. (2018). <i> Bottom-up climate mitigation efforts</i> (Vol. 1, pp. 19–22). EAERE Magazine 1, 19-22.","mla":"Kesternich, Martin. <i> Bottom-up Climate Mitigation Efforts</i>. EAERE Magazine 1, 19-22, 2018, pp. 19–22.","ieee":"M. Kesternich, <i> Bottom-up climate mitigation efforts</i>, vol. 1. EAERE Magazine 1, 19-22, 2018, pp. 19–22."},"volume":1,"user_id":"98922","publisher":"EAERE Magazine 1, 19-22","_id":"47090","language":[{"iso":"eng"}],"page":"19-22","intvolume":"         1","date_updated":"2023-12-06T18:31:10Z","author":[{"full_name":"Kesternich, Martin","first_name":"Martin","last_name":"Kesternich","id":"98922"}],"title":" Bottom-up climate mitigation efforts","year":"2018","status":"public"},{"extern":"1","abstract":[{"lang":"eng","text":"We analyze the effects of including local search techniques into a multi-objective evolutionary algorithm for solving a bi-objective orienteering problem with a single vehicle while the two conflicting objectives are minimization of travel time and maximization of the number of visited customer locations. Experiments are based on a large set of specifically designed problem instances with different characteristics and it is shown that local search techniques focusing on one of the objectives only improve the performance of the evolutionary algorithm in terms of both objectives. The analysis also shows that local search techniques are capable of sending locally optimal solutions to foremost fronts of the multi-objective optimization process, and that these solutions then become the leading factors of the evolutionary process."}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference","department":[{"_id":"819"}],"keyword":["combinatorial optimization","metaheuristics","multi-objective optimization","orienteering","transportation"],"type":"conference","date_created":"2023-11-14T15:58:51Z","publication_status":"published","date_updated":"2023-12-13T10:42:14Z","publication_identifier":{"isbn":["978-1-4503-5618-3"]},"author":[{"id":"102979","first_name":"Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668","full_name":"Bossek, Jakob"},{"first_name":"Christian","last_name":"Grimme","full_name":"Grimme, Christian"},{"last_name":"Meisel","first_name":"Stephan","full_name":"Meisel, Stephan"},{"first_name":"Günter","last_name":"Rudolph","full_name":"Rudolph, Günter"},{"last_name":"Trautmann","first_name":"Heike","full_name":"Trautmann, Heike"}],"title":"Local Search Effects in Bi-Objective Orienteering","year":"2018","doi":"10.1145/3205455.3205548","series_title":"GECCO ’18","language":[{"iso":"eng"}],"citation":{"short":"J. Bossek, C. Grimme, S. Meisel, G. Rudolph, H. Trautmann, in: Proceedings of the Genetic and Evolutionary Computation Conference, Association for Computing Machinery, New York, NY, USA, 2018, pp. 585–592.","chicago":"Bossek, Jakob, Christian Grimme, Stephan Meisel, Günter Rudolph, and Heike Trautmann. “Local Search Effects in Bi-Objective Orienteering.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 585–592. GECCO ’18. New York, NY, USA: Association for Computing Machinery, 2018. <a href=\"https://doi.org/10.1145/3205455.3205548\">https://doi.org/10.1145/3205455.3205548</a>.","ieee":"J. Bossek, C. Grimme, S. Meisel, G. Rudolph, and H. Trautmann, “Local Search Effects in Bi-Objective Orienteering,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2018, pp. 585–592, doi: <a href=\"https://doi.org/10.1145/3205455.3205548\">10.1145/3205455.3205548</a>.","apa":"Bossek, J., Grimme, C., Meisel, S., Rudolph, G., &#38; Trautmann, H. (2018). Local Search Effects in Bi-Objective Orienteering. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 585–592. <a href=\"https://doi.org/10.1145/3205455.3205548\">https://doi.org/10.1145/3205455.3205548</a>","bibtex":"@inproceedings{Bossek_Grimme_Meisel_Rudolph_Trautmann_2018, place={New York, NY, USA}, series={GECCO ’18}, title={Local Search Effects in Bi-Objective Orienteering}, DOI={<a href=\"https://doi.org/10.1145/3205455.3205548\">10.1145/3205455.3205548</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={Association for Computing Machinery}, author={Bossek, Jakob and Grimme, Christian and Meisel, Stephan and Rudolph, Günter and Trautmann, Heike}, year={2018}, pages={585–592}, collection={GECCO ’18} }","ama":"Bossek J, Grimme C, Meisel S, Rudolph G, Trautmann H. Local Search Effects in Bi-Objective Orienteering. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. GECCO ’18. Association for Computing Machinery; 2018:585–592. doi:<a href=\"https://doi.org/10.1145/3205455.3205548\">10.1145/3205455.3205548</a>","mla":"Bossek, Jakob, et al. “Local Search Effects in Bi-Objective Orienteering.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, Association for Computing Machinery, 2018, pp. 585–592, doi:<a href=\"https://doi.org/10.1145/3205455.3205548\">10.1145/3205455.3205548</a>."},"place":"New York, NY, USA","status":"public","user_id":"102979","publisher":"Association for Computing Machinery","_id":"48839","page":"585–592"},{"publication":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","abstract":[{"text":"Assessing the performance of stochastic optimization algorithms in the field of multi-objective optimization is of utmost importance. Besides the visual comparison of the obtained approximation sets, more sophisticated methods have been proposed in the last decade, e. g., a variety of quantitative performance indicators or statistical tests. In this paper, we present tools implemented in the R package ecr, which assist in performing comprehensive and sound comparison and evaluation of multi-objective evolutionary algorithms following recommendations from the literature.","lang":"eng"}],"extern":"1","date_created":"2023-11-14T15:58:56Z","keyword":["evolutionary optimization","performance assessment","software-tools"],"type":"conference","department":[{"_id":"819"}],"title":"Performance Assessment of Multi-Objective Evolutionary Algorithms with the R Package ecr","year":"2018","author":[{"id":"102979","full_name":"Bossek, Jakob","orcid":"0000-0002-4121-4668","last_name":"Bossek","first_name":"Jakob"}],"publication_identifier":{"isbn":["978-1-4503-5764-7"]},"date_updated":"2023-12-13T10:46:04Z","publication_status":"published","series_title":"GECCO ’18","language":[{"iso":"eng"}],"doi":"10.1145/3205651.3208312","citation":{"chicago":"Bossek, Jakob. “Performance Assessment of Multi-Objective Evolutionary Algorithms with the R Package Ecr.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, 1350–1356. GECCO ’18. New York, NY, USA: Association for Computing Machinery, 2018. <a href=\"https://doi.org/10.1145/3205651.3208312\">https://doi.org/10.1145/3205651.3208312</a>.","short":"J. Bossek, in: Proceedings of the Genetic and Evolutionary Computation Conference Companion, Association for Computing Machinery, New York, NY, USA, 2018, pp. 1350–1356.","ieee":"J. Bossek, “Performance Assessment of Multi-Objective Evolutionary Algorithms with the R Package ecr,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, 2018, pp. 1350–1356, doi: <a href=\"https://doi.org/10.1145/3205651.3208312\">10.1145/3205651.3208312</a>.","apa":"Bossek, J. (2018). Performance Assessment of Multi-Objective Evolutionary Algorithms with the R Package ecr. <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, 1350–1356. <a href=\"https://doi.org/10.1145/3205651.3208312\">https://doi.org/10.1145/3205651.3208312</a>","bibtex":"@inproceedings{Bossek_2018, place={New York, NY, USA}, series={GECCO ’18}, title={Performance Assessment of Multi-Objective Evolutionary Algorithms with the R Package ecr}, DOI={<a href=\"https://doi.org/10.1145/3205651.3208312\">10.1145/3205651.3208312</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference Companion}, publisher={Association for Computing Machinery}, author={Bossek, Jakob}, year={2018}, pages={1350–1356}, collection={GECCO ’18} }","ama":"Bossek J. Performance Assessment of Multi-Objective Evolutionary Algorithms with the R Package ecr. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>. GECCO ’18. Association for Computing Machinery; 2018:1350–1356. doi:<a href=\"https://doi.org/10.1145/3205651.3208312\">10.1145/3205651.3208312</a>","mla":"Bossek, Jakob. “Performance Assessment of Multi-Objective Evolutionary Algorithms with the R Package Ecr.” <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, Association for Computing Machinery, 2018, pp. 1350–1356, doi:<a href=\"https://doi.org/10.1145/3205651.3208312\">10.1145/3205651.3208312</a>."},"place":"New York, NY, USA","status":"public","page":"1350–1356","_id":"48867","publisher":"Association for Computing Machinery","user_id":"102979"},{"status":"public","user_id":"102979","page":"1737–1744","_id":"48885","publisher":"Association for Computing Machinery","citation":{"bibtex":"@inproceedings{Kerschke_Bossek_Trautmann_2018, place={New York, NY, USA}, series={GECCO’18}, title={Parameterization of State-of-the-Art Performance Indicators: A Robustness Study Based on Inexact TSP Solvers}, DOI={<a href=\"https://doi.org/10.1145/3205651.3208233\">10.1145/3205651.3208233</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference Companion}, publisher={Association for Computing Machinery}, author={Kerschke, Pascal and Bossek, Jakob and Trautmann, Heike}, year={2018}, pages={1737–1744}, collection={GECCO’18} }","ama":"Kerschke P, Bossek J, Trautmann H. Parameterization of State-of-the-Art Performance Indicators: A Robustness Study Based on Inexact TSP Solvers. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>. GECCO’18. Association for Computing Machinery; 2018:1737–1744. doi:<a href=\"https://doi.org/10.1145/3205651.3208233\">10.1145/3205651.3208233</a>","mla":"Kerschke, Pascal, et al. “Parameterization of State-of-the-Art Performance Indicators: A Robustness Study Based on Inexact TSP Solvers.” <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, Association for Computing Machinery, 2018, pp. 1737–1744, doi:<a href=\"https://doi.org/10.1145/3205651.3208233\">10.1145/3205651.3208233</a>.","short":"P. Kerschke, J. Bossek, H. Trautmann, in: Proceedings of the Genetic and Evolutionary Computation Conference Companion, Association for Computing Machinery, New York, NY, USA, 2018, pp. 1737–1744.","chicago":"Kerschke, Pascal, Jakob Bossek, and Heike Trautmann. “Parameterization of State-of-the-Art Performance Indicators: A Robustness Study Based on Inexact TSP Solvers.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, 1737–1744. GECCO’18. New York, NY, USA: Association for Computing Machinery, 2018. <a href=\"https://doi.org/10.1145/3205651.3208233\">https://doi.org/10.1145/3205651.3208233</a>.","ieee":"P. Kerschke, J. Bossek, and H. Trautmann, “Parameterization of State-of-the-Art Performance Indicators: A Robustness Study Based on Inexact TSP Solvers,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, 2018, pp. 1737–1744, doi: <a href=\"https://doi.org/10.1145/3205651.3208233\">10.1145/3205651.3208233</a>.","apa":"Kerschke, P., Bossek, J., &#38; Trautmann, H. (2018). Parameterization of State-of-the-Art Performance Indicators: A Robustness Study Based on Inexact TSP Solvers. <i>Proceedings of the Genetic and Evolutionary Computation Conference Companion</i>, 1737–1744. <a href=\"https://doi.org/10.1145/3205651.3208233\">https://doi.org/10.1145/3205651.3208233</a>"},"place":"New York, NY, USA","date_updated":"2023-12-13T10:48:38Z","title":"Parameterization of State-of-the-Art Performance Indicators: A Robustness Study Based on Inexact TSP Solvers","year":"2018","author":[{"last_name":"Kerschke","first_name":"Pascal","full_name":"Kerschke, Pascal"},{"id":"102979","orcid":"0000-0002-4121-4668","last_name":"Bossek","first_name":"Jakob","full_name":"Bossek, Jakob"},{"full_name":"Trautmann, Heike","last_name":"Trautmann","first_name":"Heike"}],"publication_identifier":{"isbn":["978-1-4503-5764-7"]},"doi":"10.1145/3205651.3208233","series_title":"GECCO’18","language":[{"iso":"eng"}],"extern":"1","abstract":[{"lang":"eng","text":"Performance comparisons of optimization algorithms are heavily influenced by the underlying indicator(s). In this paper we investigate commonly used performance indicators for single-objective stochastic solvers, such as the Penalized Average Runtime (e.g., PAR10) or the Expected Running Time (ERT), based on exemplary benchmark performances of state-of-the-art inexact TSP solvers. Thereby, we introduce a methodology for analyzing the effects of (usually heuristically set) indicator parametrizations - such as the penalty factor and the method used for aggregating across multiple runs - w.r.t. the robustness of the considered optimization algorithms."}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference Companion","keyword":["algorithm selection","optimization","performance measures","transportation","travelling salesperson problem"],"type":"conference","department":[{"_id":"819"}],"date_created":"2023-11-14T15:58:59Z"},{"publication":"Journal of Open Source Software","issue":"22","citation":{"ieee":"J. Bossek, “Grapherator: A Modular Multi-Step Graph Generator,” <i>Journal of Open Source Software</i>, vol. 3, no. 22, p. 528, 2018, doi: <a href=\"https://doi.org/10.21105/joss.00528\">10.21105/joss.00528</a>.","apa":"Bossek, J. (2018). Grapherator: A Modular Multi-Step Graph Generator. <i>Journal of Open Source Software</i>, <i>3</i>(22), 528. <a href=\"https://doi.org/10.21105/joss.00528\">https://doi.org/10.21105/joss.00528</a>","chicago":"Bossek, Jakob. “Grapherator: A Modular Multi-Step Graph Generator.” <i>Journal of Open Source Software</i> 3, no. 22 (2018): 528. <a href=\"https://doi.org/10.21105/joss.00528\">https://doi.org/10.21105/joss.00528</a>.","short":"J. Bossek, Journal of Open Source Software 3 (2018) 528.","mla":"Bossek, Jakob. “Grapherator: A Modular Multi-Step Graph Generator.” <i>Journal of Open Source Software</i>, vol. 3, no. 22, 2018, p. 528, doi:<a href=\"https://doi.org/10.21105/joss.00528\">10.21105/joss.00528</a>.","bibtex":"@article{Bossek_2018, title={Grapherator: A Modular Multi-Step Graph Generator}, volume={3}, DOI={<a href=\"https://doi.org/10.21105/joss.00528\">10.21105/joss.00528</a>}, number={22}, journal={Journal of Open Source Software}, author={Bossek, Jakob}, year={2018}, pages={528} }","ama":"Bossek J. Grapherator: A Modular Multi-Step Graph Generator. <i>Journal of Open Source Software</i>. 2018;3(22):528. doi:<a href=\"https://doi.org/10.21105/joss.00528\">10.21105/joss.00528</a>"},"abstract":[{"lang":"eng","text":"Bossek, (2018). grapherator: A Modular Multi-Step Graph Generator. Journal of Open Source Software, 3(22), 528, https://doi.org/10.21105/joss.00528"}],"date_created":"2023-11-14T15:58:56Z","type":"journal_article","department":[{"_id":"819"}],"title":"Grapherator: A Modular Multi-Step Graph Generator","status":"public","year":"2018","publication_identifier":{"issn":["2475-9066"]},"author":[{"last_name":"Bossek","orcid":"0000-0002-4121-4668","first_name":"Jakob","full_name":"Bossek, Jakob","id":"102979"}],"date_updated":"2023-12-13T10:51:50Z","intvolume":"         3","page":"528","_id":"48866","language":[{"iso":"eng"}],"user_id":"102979","doi":"10.21105/joss.00528","volume":3},{"type":"journal_article","department":[{"_id":"277"}],"date_created":"2024-05-06T16:57:34Z","publication":"Measurement","citation":{"short":"M. Mobin, S.M. Mousavi, M. Komaki, M. Tavana, Measurement 114 (2018) 417–427.","chicago":"Mobin, Mohammadsadegh, Seyed Mohsen Mousavi, Mohammad Komaki, and Madjid Tavana. “A Hybrid Desirability Function Approach for Tuning Parameters in Evolutionary Optimization Algorithms.” <i>Measurement</i> 114 (2018): 417–27. <a href=\"https://doi.org/10.1016/j.measurement.2017.10.009\">https://doi.org/10.1016/j.measurement.2017.10.009</a>.","apa":"Mobin, M., Mousavi, S. M., Komaki, M., &#38; Tavana, M. (2018). A hybrid desirability function approach for tuning parameters in evolutionary optimization algorithms. <i>Measurement</i>, <i>114</i>, 417–427. <a href=\"https://doi.org/10.1016/j.measurement.2017.10.009\">https://doi.org/10.1016/j.measurement.2017.10.009</a>","ieee":"M. Mobin, S. M. Mousavi, M. Komaki, and M. Tavana, “A hybrid desirability function approach for tuning parameters in evolutionary optimization algorithms,” <i>Measurement</i>, vol. 114, pp. 417–427, 2018, doi: <a href=\"https://doi.org/10.1016/j.measurement.2017.10.009\">10.1016/j.measurement.2017.10.009</a>.","ama":"Mobin M, Mousavi SM, Komaki M, Tavana M. A hybrid desirability function approach for tuning parameters in evolutionary optimization algorithms. <i>Measurement</i>. 2018;114:417-427. doi:<a href=\"https://doi.org/10.1016/j.measurement.2017.10.009\">10.1016/j.measurement.2017.10.009</a>","bibtex":"@article{Mobin_Mousavi_Komaki_Tavana_2018, title={A hybrid desirability function approach for tuning parameters in evolutionary optimization algorithms}, volume={114}, DOI={<a href=\"https://doi.org/10.1016/j.measurement.2017.10.009\">10.1016/j.measurement.2017.10.009</a>}, journal={Measurement}, publisher={Elsevier BV}, author={Mobin, Mohammadsadegh and Mousavi, Seyed Mohsen and Komaki, Mohammad and Tavana, Madjid}, year={2018}, pages={417–427} }","mla":"Mobin, Mohammadsadegh, et al. “A Hybrid Desirability Function Approach for Tuning Parameters in Evolutionary Optimization Algorithms.” <i>Measurement</i>, vol. 114, Elsevier BV, 2018, pp. 417–27, doi:<a href=\"https://doi.org/10.1016/j.measurement.2017.10.009\">10.1016/j.measurement.2017.10.009</a>."},"user_id":"51811","doi":"10.1016/j.measurement.2017.10.009","volume":114,"page":"417-427","_id":"54012","language":[{"iso":"eng"}],"publisher":"Elsevier BV","publication_status":"published","date_updated":"2024-05-06T16:58:27Z","intvolume":"       114","year":"2018","title":"A hybrid desirability function approach for tuning parameters in evolutionary optimization algorithms","status":"public","publication_identifier":{"issn":["0263-2241"]},"author":[{"full_name":"Mobin, Mohammadsadegh","first_name":"Mohammadsadegh","last_name":"Mobin"},{"first_name":"Seyed Mohsen","last_name":"Mousavi","full_name":"Mousavi, Seyed Mohsen"},{"full_name":"Komaki, Mohammad","first_name":"Mohammad","last_name":"Komaki"},{"id":"31858","last_name":"Tavana","first_name":"Madjid","full_name":"Tavana, Madjid"}]},{"date_created":"2024-05-06T16:53:45Z","department":[{"_id":"277"}],"type":"journal_article","citation":{"ieee":"M. Esmaelian, M. Tavana, F. J. Santos-Arteaga, and M. Vali, “A novel genetic algorithm based method for solving continuous nonlinear optimization problems through subdividing and labeling,” <i>Measurement</i>, vol. 115, pp. 27–38, 2018, doi: <a href=\"https://doi.org/10.1016/j.measurement.2017.09.034\">10.1016/j.measurement.2017.09.034</a>.","apa":"Esmaelian, M., Tavana, M., Santos-Arteaga, F. J., &#38; Vali, M. (2018). A novel genetic algorithm based method for solving continuous nonlinear optimization problems through subdividing and labeling. <i>Measurement</i>, <i>115</i>, 27–38. <a href=\"https://doi.org/10.1016/j.measurement.2017.09.034\">https://doi.org/10.1016/j.measurement.2017.09.034</a>","short":"M. Esmaelian, M. Tavana, F.J. Santos-Arteaga, M. Vali, Measurement 115 (2018) 27–38.","chicago":"Esmaelian, Majid, Madjid Tavana, Francisco J. Santos-Arteaga, and Masoumeh Vali. “A Novel Genetic Algorithm Based Method for Solving Continuous Nonlinear Optimization Problems through Subdividing and Labeling.” <i>Measurement</i> 115 (2018): 27–38. <a href=\"https://doi.org/10.1016/j.measurement.2017.09.034\">https://doi.org/10.1016/j.measurement.2017.09.034</a>.","mla":"Esmaelian, Majid, et al. “A Novel Genetic Algorithm Based Method for Solving Continuous Nonlinear Optimization Problems through Subdividing and Labeling.” <i>Measurement</i>, vol. 115, Elsevier BV, 2018, pp. 27–38, doi:<a href=\"https://doi.org/10.1016/j.measurement.2017.09.034\">10.1016/j.measurement.2017.09.034</a>.","bibtex":"@article{Esmaelian_Tavana_Santos-Arteaga_Vali_2018, title={A novel genetic algorithm based method for solving continuous nonlinear optimization problems through subdividing and labeling}, volume={115}, DOI={<a href=\"https://doi.org/10.1016/j.measurement.2017.09.034\">10.1016/j.measurement.2017.09.034</a>}, journal={Measurement}, publisher={Elsevier BV}, author={Esmaelian, Majid and Tavana, Madjid and Santos-Arteaga, Francisco J. and Vali, Masoumeh}, year={2018}, pages={27–38} }","ama":"Esmaelian M, Tavana M, Santos-Arteaga FJ, Vali M. A novel genetic algorithm based method for solving continuous nonlinear optimization problems through subdividing and labeling. <i>Measurement</i>. 2018;115:27-38. doi:<a href=\"https://doi.org/10.1016/j.measurement.2017.09.034\">10.1016/j.measurement.2017.09.034</a>"},"publication":"Measurement","_id":"54006","publisher":"Elsevier BV","language":[{"iso":"eng"}],"page":"27-38","volume":115,"user_id":"51811","doi":"10.1016/j.measurement.2017.09.034","publication_identifier":{"issn":["0263-2241"]},"author":[{"last_name":"Esmaelian","first_name":"Majid","full_name":"Esmaelian, Majid"},{"id":"31858","full_name":"Tavana, Madjid","last_name":"Tavana","first_name":"Madjid"},{"first_name":"Francisco J.","last_name":"Santos-Arteaga","full_name":"Santos-Arteaga, Francisco J."},{"full_name":"Vali, Masoumeh","first_name":"Masoumeh","last_name":"Vali"}],"status":"public","year":"2018","title":"A novel genetic algorithm based method for solving continuous nonlinear optimization problems through subdividing and labeling","intvolume":"       115","publication_status":"published","date_updated":"2024-05-06T16:58:38Z"},{"page":"495-511","language":[{"iso":"eng"}],"_id":"53997","publisher":"Elsevier BV","user_id":"51811","doi":"10.1016/j.cie.2017.12.001","volume":115,"status":"public","title":"A discrete cuckoo optimization algorithm for consolidation in cloud computing","year":"2018","publication_identifier":{"issn":["0360-8352"]},"author":[{"full_name":"Tavana, Madjid","first_name":"Madjid","last_name":"Tavana","id":"31858"},{"full_name":"Shahdi-Pashaki, Saleh","last_name":"Shahdi-Pashaki","first_name":"Saleh"},{"last_name":"Teymourian","first_name":"Ehsan","full_name":"Teymourian, Ehsan"},{"first_name":"Francisco J.","last_name":"Santos-Arteaga","full_name":"Santos-Arteaga, Francisco J."},{"last_name":"Komaki","first_name":"Mohammad","full_name":"Komaki, Mohammad"}],"publication_status":"published","date_updated":"2024-05-06T16:58:58Z","intvolume":"       115","date_created":"2024-05-06T16:47:47Z","type":"journal_article","department":[{"_id":"277"}],"publication":"Computers &amp; Industrial Engineering","citation":{"chicago":"Tavana, Madjid, Saleh Shahdi-Pashaki, Ehsan Teymourian, Francisco J. Santos-Arteaga, and Mohammad Komaki. “A Discrete Cuckoo Optimization Algorithm for Consolidation in Cloud Computing.” <i>Computers &#38;amp; Industrial Engineering</i> 115 (2018): 495–511. <a href=\"https://doi.org/10.1016/j.cie.2017.12.001\">https://doi.org/10.1016/j.cie.2017.12.001</a>.","short":"M. Tavana, S. Shahdi-Pashaki, E. Teymourian, F.J. Santos-Arteaga, M. Komaki, Computers &#38;amp; Industrial Engineering 115 (2018) 495–511.","ieee":"M. Tavana, S. Shahdi-Pashaki, E. Teymourian, F. J. Santos-Arteaga, and M. Komaki, “A discrete cuckoo optimization algorithm for consolidation in cloud computing,” <i>Computers &#38;amp; Industrial Engineering</i>, vol. 115, pp. 495–511, 2018, doi: <a href=\"https://doi.org/10.1016/j.cie.2017.12.001\">10.1016/j.cie.2017.12.001</a>.","apa":"Tavana, M., Shahdi-Pashaki, S., Teymourian, E., Santos-Arteaga, F. J., &#38; Komaki, M. (2018). A discrete cuckoo optimization algorithm for consolidation in cloud computing. <i>Computers &#38;amp; Industrial Engineering</i>, <i>115</i>, 495–511. <a href=\"https://doi.org/10.1016/j.cie.2017.12.001\">https://doi.org/10.1016/j.cie.2017.12.001</a>","bibtex":"@article{Tavana_Shahdi-Pashaki_Teymourian_Santos-Arteaga_Komaki_2018, title={A discrete cuckoo optimization algorithm for consolidation in cloud computing}, volume={115}, DOI={<a href=\"https://doi.org/10.1016/j.cie.2017.12.001\">10.1016/j.cie.2017.12.001</a>}, journal={Computers &#38;amp; Industrial Engineering}, publisher={Elsevier BV}, author={Tavana, Madjid and Shahdi-Pashaki, Saleh and Teymourian, Ehsan and Santos-Arteaga, Francisco J. and Komaki, Mohammad}, year={2018}, pages={495–511} }","ama":"Tavana M, Shahdi-Pashaki S, Teymourian E, Santos-Arteaga FJ, Komaki M. A discrete cuckoo optimization algorithm for consolidation in cloud computing. <i>Computers &#38;amp; Industrial Engineering</i>. 2018;115:495-511. doi:<a href=\"https://doi.org/10.1016/j.cie.2017.12.001\">10.1016/j.cie.2017.12.001</a>","mla":"Tavana, Madjid, et al. “A Discrete Cuckoo Optimization Algorithm for Consolidation in Cloud Computing.” <i>Computers &#38;amp; Industrial Engineering</i>, vol. 115, Elsevier BV, 2018, pp. 495–511, doi:<a href=\"https://doi.org/10.1016/j.cie.2017.12.001\">10.1016/j.cie.2017.12.001</a>."}},{"citation":{"apa":"Bossek, J., Grimme, C., Meisel, S., Rudolph, G., &#38; Trautmann, H. (2018). Local Search Effects in Bi-Objective Orienteering. <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 585–592. <a href=\"https://doi.org/10.1145/3205455.3205548\">https://doi.org/10.1145/3205455.3205548</a>","ieee":"J. Bossek, C. Grimme, S. Meisel, G. Rudolph, and H. Trautmann, “Local Search Effects in Bi-Objective Orienteering,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 2018, pp. 585–592, doi: <a href=\"https://doi.org/10.1145/3205455.3205548\">10.1145/3205455.3205548</a>.","chicago":"Bossek, Jakob, Christian Grimme, Stephan Meisel, Guenter Rudolph, and Heike Trautmann. “Local Search Effects in Bi-Objective Orienteering.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, 585–592. GECCO ’18. New York, NY, USA: ACM, 2018. <a href=\"https://doi.org/10.1145/3205455.3205548\">https://doi.org/10.1145/3205455.3205548</a>.","short":"J. Bossek, C. Grimme, S. Meisel, G. Rudolph, H. Trautmann, in: Proceedings of the Genetic and Evolutionary Computation Conference, ACM, New York, NY, USA, 2018, pp. 585–592.","mla":"Bossek, Jakob, et al. “Local Search Effects in Bi-Objective Orienteering.” <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>, ACM, 2018, pp. 585–592, doi:<a href=\"https://doi.org/10.1145/3205455.3205548\">10.1145/3205455.3205548</a>.","ama":"Bossek J, Grimme C, Meisel S, Rudolph G, Trautmann H. Local Search Effects in Bi-Objective Orienteering. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference</i>. GECCO ’18. ACM; 2018:585–592. doi:<a href=\"https://doi.org/10.1145/3205455.3205548\">10.1145/3205455.3205548</a>","bibtex":"@inproceedings{Bossek_Grimme_Meisel_Rudolph_Trautmann_2018, place={New York, NY, USA}, series={GECCO ’18}, title={Local Search Effects in Bi-Objective Orienteering}, DOI={<a href=\"https://doi.org/10.1145/3205455.3205548\">10.1145/3205455.3205548</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference}, publisher={ACM}, author={Bossek, Jakob and Grimme, Christian and Meisel, Stephan and Rudolph, Guenter and Trautmann, Heike}, year={2018}, pages={585–592}, collection={GECCO ’18} }"},"place":"New York, NY, USA","status":"public","user_id":"15504","_id":"46348","publisher":"ACM","page":"585–592","abstract":[{"lang":"eng","text":"We analyze the effects of including local search techniques into a multi-objective evolutionary algorithm for solving a bi-objective orienteering problem with a single vehicle while the two conflicting objectives are minimization of travel time and maximization of the number of visited customer locations. Experiments are based on a large set of specifically designed problem instances with different characteristics and it is shown that local search techniques focusing on one of the objectives only improve the performance of the evolutionary algorithm in terms of both objectives. The analysis also shows that local search techniques are capable of sending locally optimal solutions to foremost fronts of the multi-objective optimization process, and that these solutions then become the leading factors of the evolutionary process."}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference","department":[{"_id":"34"},{"_id":"819"}],"type":"conference","date_created":"2023-08-04T07:53:16Z","date_updated":"2024-06-10T11:59:09Z","author":[{"full_name":"Bossek, Jakob","first_name":"Jakob","last_name":"Bossek","orcid":"0000-0002-4121-4668","id":"102979"},{"full_name":"Grimme, Christian","last_name":"Grimme","first_name":"Christian"},{"first_name":"Stephan","last_name":"Meisel","full_name":"Meisel, Stephan"},{"full_name":"Rudolph, Guenter","first_name":"Guenter","last_name":"Rudolph"},{"last_name":"Trautmann","orcid":"0000-0002-9788-8282","first_name":"Heike","full_name":"Trautmann, Heike","id":"100740"}],"publication_identifier":{"isbn":["978-1-4503-5618-3"]},"year":"2018","title":"Local Search Effects in Bi-Objective Orienteering","doi":"10.1145/3205455.3205548","language":[{"iso":"eng"}],"series_title":"GECCO ’18"},{"place":"Kyoto, Japan","date_created":"2023-08-04T07:53:59Z","type":"conference","department":[{"_id":"34"},{"_id":"819"}],"publication":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ’18) Companion","citation":{"short":"P. Kerschke, J. Bossek, H. Trautmann, in: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ’18) Companion, Kyoto, Japan, 2018, pp. 1737–1744.","chicago":"Kerschke, Pascal, Jakob Bossek, and Heike Trautmann. “Parameterization of State-of-the-Art Performance Indicators: A Robustness Study Based on Inexact TSP Solvers.” In <i>Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ’18) Companion</i>, 1737–1744. Kyoto, Japan, 2018. <a href=\"https://doi.org/10.1145/3205651.3208233\">https://doi.org/10.1145/3205651.3208233</a>.","ieee":"P. Kerschke, J. Bossek, and H. Trautmann, “Parameterization of State-of-the-Art Performance Indicators: A Robustness Study Based on Inexact TSP Solvers,” in <i>Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ’18) Companion</i>, 2018, pp. 1737–1744, doi: <a href=\"https://doi.org/10.1145/3205651.3208233\">10.1145/3205651.3208233</a>.","apa":"Kerschke, P., Bossek, J., &#38; Trautmann, H. (2018). Parameterization of State-of-the-Art Performance Indicators: A Robustness Study Based on Inexact TSP Solvers. <i>Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ’18) Companion</i>, 1737–1744. <a href=\"https://doi.org/10.1145/3205651.3208233\">https://doi.org/10.1145/3205651.3208233</a>","bibtex":"@inproceedings{Kerschke_Bossek_Trautmann_2018, place={Kyoto, Japan}, title={Parameterization of State-of-the-Art Performance Indicators: A Robustness Study Based on Inexact TSP Solvers}, DOI={<a href=\"https://doi.org/10.1145/3205651.3208233\">10.1145/3205651.3208233</a>}, booktitle={Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ’18) Companion}, author={Kerschke, Pascal and Bossek, Jakob and Trautmann, Heike}, year={2018}, pages={1737–1744} }","ama":"Kerschke P, Bossek J, Trautmann H. Parameterization of State-of-the-Art Performance Indicators: A Robustness Study Based on Inexact TSP Solvers. In: <i>Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ’18) Companion</i>. ; 2018:1737–1744. doi:<a href=\"https://doi.org/10.1145/3205651.3208233\">10.1145/3205651.3208233</a>","mla":"Kerschke, Pascal, et al. “Parameterization of State-of-the-Art Performance Indicators: A Robustness Study Based on Inexact TSP Solvers.” <i>Proceedings of the Genetic and Evolutionary Computation Conference (GECCO ’18) Companion</i>, 2018, pp. 1737–1744, doi:<a href=\"https://doi.org/10.1145/3205651.3208233\">10.1145/3205651.3208233</a>."},"abstract":[{"lang":"eng","text":"Performance comparisons of optimization algorithms are heavily influenced by the underlying indicator(s). In this paper we investigate commonly used performance indicators for single-objective stochastic solvers, such as the Penalized Average Runtime (e.g., PAR10) or the Expected Running Time (ERT), based on exemplary benchmark performances of state-of-the-art inexact TSP solvers. Thereby, we introduce a methodology for analyzing the effects of (usually heuristically set) indicator parametrizations - such as the penalty factor and the method used for aggregating across multiple runs - w.r.t. the robustness of the considered optimization algorithms."}],"page":"1737–1744","language":[{"iso":"eng"}],"_id":"46349","doi":"10.1145/3205651.3208233","user_id":"15504","title":"Parameterization of State-of-the-Art Performance Indicators: A Robustness Study Based on Inexact TSP Solvers","status":"public","year":"2018","publication_identifier":{"isbn":["978-1-4503-5764-7/18/07"]},"author":[{"full_name":"Kerschke, Pascal","first_name":"Pascal","last_name":"Kerschke"},{"full_name":"Bossek, Jakob","last_name":"Bossek","first_name":"Jakob","orcid":"0000-0002-4121-4668","id":"102979"},{"id":"100740","full_name":"Trautmann, Heike","orcid":"0000-0002-9788-8282","last_name":"Trautmann","first_name":"Heike"}],"date_updated":"2024-06-10T11:58:54Z"}]