---
_id: '32558'
abstract:
- lang: eng
text: With the rapid progress of technological development, self-efficacy in reference
to digital devices (i.e., information and computer technology [ICT] self-efficacy)
is an important driver that helps students to deal with technological problems
and support their lifelong learning processes. Schools, peers, and home learning
environments are important sources for the development of positive self-efficacy.
Expanding on previous research, we investigated the associations between different
aspects of the digital home learning environment and students’ ICT self-efficacy.
The moderation effects of gender were also tested. A total of 651 children answered
a questionnaire about different digital home learning environment dimensions and
estimated their ICT self-efficacy using an adapted scale—Schwarzer and Jerusalem’s
(1999) general self-efficacy scale. Using the structural equation modeling technique,
a digital home learning environment containing six different qualities of parental
support was investigated. Families’ cultural capital, parents’ attitudes toward
the Internet, and shared Internet activities at home contributed positively to
ICT self-efficacy. We observed small gender differences, with the moderation effect
being nonsignificant. The results help researchers and practitioners to understand
how different dimensions of the digital home learning environment support ICT
self-efficacy. We will discuss how parents can enhance the home learning environment
and how teachers can integrate this knowledge into formal education.
author:
- first_name: Sabrina
full_name: Bonanati, Sabrina
last_name: Bonanati
- first_name: Heike M.
full_name: Buhl, Heike M.
id: '27152'
last_name: Buhl
citation:
ama: Bonanati S, Buhl HM. The digital home learning environment and its relation
to children’s ICT self-efficacy. Learning Environments Research. 2021;25(2):485-505.
doi:10.1007/s10984-021-09377-8
apa: Bonanati, S., & Buhl, H. M. (2021). The digital home learning environment
and its relation to children’s ICT self-efficacy. Learning Environments Research,
25(2), 485–505. https://doi.org/10.1007/s10984-021-09377-8
bibtex: '@article{Bonanati_Buhl_2021, title={The digital home learning environment
and its relation to children’s ICT self-efficacy}, volume={25}, DOI={10.1007/s10984-021-09377-8},
number={2}, journal={Learning Environments Research}, publisher={Springer Science
and Business Media LLC}, author={Bonanati, Sabrina and Buhl, Heike M.}, year={2021},
pages={485–505} }'
chicago: 'Bonanati, Sabrina, and Heike M. Buhl. “The Digital Home Learning Environment
and Its Relation to Children’s ICT Self-Efficacy.” Learning Environments Research
25, no. 2 (2021): 485–505. https://doi.org/10.1007/s10984-021-09377-8.'
ieee: 'S. Bonanati and H. M. Buhl, “The digital home learning environment and its
relation to children’s ICT self-efficacy,” Learning Environments Research,
vol. 25, no. 2, pp. 485–505, 2021, doi: 10.1007/s10984-021-09377-8.'
mla: Bonanati, Sabrina, and Heike M. Buhl. “The Digital Home Learning Environment
and Its Relation to Children’s ICT Self-Efficacy.” Learning Environments Research,
vol. 25, no. 2, Springer Science and Business Media LLC, 2021, pp. 485–505, doi:10.1007/s10984-021-09377-8.
short: S. Bonanati, H.M. Buhl, Learning Environments Research 25 (2021) 485–505.
date_created: 2022-08-03T05:53:48Z
date_updated: 2025-07-16T08:38:51Z
department:
- _id: '427'
doi: 10.1007/s10984-021-09377-8
intvolume: ' 25'
issue: '2'
keyword:
- Digital media use
- Gender
- Home learning environment
- ICT self-efcacy
- Motivation
- Parental involvement
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://link.springer.com/content/pdf/10.1007/s10984-021-09377-8.pdf
oa: '1'
page: 485-505
project:
- _id: '378'
grant_number: 01JD1814A
name: 'DigHomE: DigHomE: Digital Home Learning Environment – Gelingensbedingungen
elterlicher Unterstützung bei der informationsorientierten Internetnutzung'
publication: Learning Environments Research
publication_identifier:
issn:
- 1387-1579
- 1573-1855
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: The digital home learning environment and its relation to children’s ICT self-efficacy
type: journal_article
user_id: '27152'
volume: 25
year: '2021'
...
---
_id: '19609'
abstract:
- lang: eng
text: "Modern services comprise interconnected components,\r\ne.g., microservices
in a service mesh, that can scale and\r\nrun on multiple nodes across the network
on demand. To process\r\nincoming traffic, service components have to be instantiated
and\r\ntraffic assigned to these instances, taking capacities and changing\r\ndemands
into account. This challenge is usually solved with\r\ncustom approaches designed
by experts. While this typically\r\nworks well for the considered scenario, the
models often rely\r\non unrealistic assumptions or on knowledge that is not available\r\nin
practice (e.g., a priori knowledge).\r\n\r\nWe propose a novel deep reinforcement
learning approach that\r\nlearns how to best coordinate services and is geared
towards\r\nrealistic assumptions. It interacts with the network and relies on\r\navailable,
possibly delayed monitoring information. Rather than\r\ndefining a complex model
or an algorithm how to achieve an\r\nobjective, our model-free approach adapts
to various objectives\r\nand traffic patterns. An agent is trained offline without
expert\r\nknowledge and then applied online with minimal overhead. Compared\r\nto
a state-of-the-art heuristic, it significantly improves flow\r\nthroughput and
overall network utility on real-world network\r\ntopologies and traffic traces.
It also learns to optimize different\r\nobjectives, generalizes to scenarios with
unseen, stochastic traffic\r\npatterns, and scales to large real-world networks."
author:
- first_name: Stefan Balthasar
full_name: Schneider, Stefan Balthasar
id: '35343'
last_name: Schneider
orcid: 0000-0001-8210-4011
- first_name: Adnan
full_name: Manzoor, Adnan
last_name: Manzoor
- first_name: Haydar
full_name: Qarawlus, Haydar
last_name: Qarawlus
- first_name: Rafael
full_name: Schellenberg, Rafael
last_name: Schellenberg
- first_name: Holger
full_name: Karl, Holger
id: '126'
last_name: Karl
- first_name: Ramin
full_name: Khalili, Ramin
last_name: Khalili
- first_name: Artur
full_name: Hecker, Artur
last_name: Hecker
citation:
ama: 'Schneider SB, Manzoor A, Qarawlus H, et al. Self-Driving Network and Service
Coordination Using Deep Reinforcement Learning. In: IEEE International Conference
on Network and Service Management (CNSM). IEEE; 2020.'
apa: Schneider, S. B., Manzoor, A., Qarawlus, H., Schellenberg, R., Karl, H., Khalili,
R., & Hecker, A. (2020). Self-Driving Network and Service Coordination Using
Deep Reinforcement Learning. In IEEE International Conference on Network and
Service Management (CNSM). IEEE.
bibtex: '@inproceedings{Schneider_Manzoor_Qarawlus_Schellenberg_Karl_Khalili_Hecker_2020,
title={Self-Driving Network and Service Coordination Using Deep Reinforcement
Learning}, booktitle={IEEE International Conference on Network and Service Management
(CNSM)}, publisher={IEEE}, author={Schneider, Stefan Balthasar and Manzoor, Adnan
and Qarawlus, Haydar and Schellenberg, Rafael and Karl, Holger and Khalili, Ramin
and Hecker, Artur}, year={2020} }'
chicago: Schneider, Stefan Balthasar, Adnan Manzoor, Haydar Qarawlus, Rafael Schellenberg,
Holger Karl, Ramin Khalili, and Artur Hecker. “Self-Driving Network and Service
Coordination Using Deep Reinforcement Learning.” In IEEE International Conference
on Network and Service Management (CNSM). IEEE, 2020.
ieee: S. B. Schneider et al., “Self-Driving Network and Service Coordination
Using Deep Reinforcement Learning,” in IEEE International Conference on Network
and Service Management (CNSM), 2020.
mla: Schneider, Stefan Balthasar, et al. “Self-Driving Network and Service Coordination
Using Deep Reinforcement Learning.” IEEE International Conference on Network
and Service Management (CNSM), IEEE, 2020.
short: 'S.B. Schneider, A. Manzoor, H. Qarawlus, R. Schellenberg, H. Karl, R. Khalili,
A. Hecker, in: IEEE International Conference on Network and Service Management
(CNSM), IEEE, 2020.'
date_created: 2020-09-22T06:28:22Z
date_updated: 2022-01-06T06:54:08Z
ddc:
- '006'
department:
- _id: '75'
file:
- access_level: open_access
content_type: application/pdf
creator: stschn
date_created: 2020-09-22T06:29:16Z
date_updated: 2020-09-22T06:36:00Z
file_id: '19610'
file_name: ris_with_copyright.pdf
file_size: 642999
relation: main_file
file_date_updated: 2020-09-22T06:36:00Z
has_accepted_license: '1'
keyword:
- self-driving networks
- self-learning
- network coordination
- service coordination
- reinforcement learning
- deep learning
- nfv
language:
- iso: eng
oa: '1'
project:
- _id: '1'
name: SFB 901
- _id: '4'
name: SFB 901 - Project Area C
- _id: '16'
name: SFB 901 - Subproject C4
publication: IEEE International Conference on Network and Service Management (CNSM)
publisher: IEEE
status: public
title: Self-Driving Network and Service Coordination Using Deep Reinforcement Learning
type: conference
user_id: '35343'
year: '2020'
...
---
_id: '17370'
abstract:
- lang: eng
text: " We consider a natural extension to the metric uncapacitated Facility Location
Problem (FLP) in which requests ask for different commodities out of a finite
set \\( S \\) of commodities.\r\n Ravi and Sinha (SODA 2004) introduced the model
as the \\emph{Multi-Commodity Facility Location Problem} (MFLP) and considered
it an offline optimization problem.\r\n The model itself is similar to the FLP:
i.e., requests are located at points of a finite metric space and the task of
an algorithm is to construct facilities and assign requests to facilities while
minimizing the construction cost and the sum over all assignment distances.\r\n
\ In addition, requests and facilities are heterogeneous; they request or offer
multiple commodities out of $S$.\r\n A request has to be connected to a set of
facilities jointly offering the commodities demanded by it.\r\n In comparison
to the FLP, an algorithm has to decide not only if and where to place facilities,
but also which commodities to offer at each.\r\n\r\n To the best of our knowledge
we are the first to study the problem in its online variant in which requests,
their positions and their commodities are not known beforehand but revealed over
time.\r\n We present results regarding the competitive ratio.\r\n On the one
hand, we show that heterogeneity influences the competitive ratio by developing
a lower bound on the competitive ratio for any randomized online algorithm of
\\( \\Omega ( \\sqrt{|S|} + \\frac{\\log n}{\\log \\log n} ) \\) that already
holds for simple line metrics.\r\n Here, \\( n \\) is the number of requests.\r\n
\ On the other side, we establish a deterministic \\( \\mathcal{O}(\\sqrt{|S|}
\\cdot \\log n) \\)-competitive algorithm and a randomized \\( \\mathcal{O}(\\sqrt{|S|}
\\cdot \\frac{\\log n}{\\log \\log n} ) \\)-competitive algorithm.\r\n Further,
we show that when considering a more special class of cost functions for the construction
cost of a facility, the competitive ratio decreases given by our deterministic
algorithm depending on the function."
author:
- first_name: Jannik
full_name: Castenow, Jannik
id: '38705'
last_name: Castenow
- first_name: Björn
full_name: Feldkord, Björn
id: '22704'
last_name: Feldkord
- first_name: Till
full_name: Knollmann, Till
id: '39241'
last_name: Knollmann
orcid: 0000-0003-2014-4696
- first_name: Manuel
full_name: Malatyali, Manuel
last_name: Malatyali
- first_name: Friedhelm
full_name: Meyer auf der Heide, Friedhelm
id: '15523'
last_name: Meyer auf der Heide
citation:
ama: 'Castenow J, Feldkord B, Knollmann T, Malatyali M, Meyer auf der Heide F. The
Online Multi-Commodity Facility Location Problem. In: Proceedings of the 32nd
ACM Symposium on Parallelism in Algorithms and Architectures. ; 2020. doi:10.1145/3350755.3400281'
apa: Castenow, J., Feldkord, B., Knollmann, T., Malatyali, M., & Meyer auf der
Heide, F. (2020). The Online Multi-Commodity Facility Location Problem. In Proceedings
of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures.
https://doi.org/10.1145/3350755.3400281
bibtex: '@inproceedings{Castenow_Feldkord_Knollmann_Malatyali_Meyer auf der Heide_2020,
title={The Online Multi-Commodity Facility Location Problem}, DOI={10.1145/3350755.3400281},
booktitle={Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms
and Architectures}, author={Castenow, Jannik and Feldkord, Björn and Knollmann,
Till and Malatyali, Manuel and Meyer auf der Heide, Friedhelm}, year={2020} }'
chicago: Castenow, Jannik, Björn Feldkord, Till Knollmann, Manuel Malatyali, and
Friedhelm Meyer auf der Heide. “The Online Multi-Commodity Facility Location Problem.”
In Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures,
2020. https://doi.org/10.1145/3350755.3400281.
ieee: J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, and F. Meyer auf der
Heide, “The Online Multi-Commodity Facility Location Problem,” in Proceedings
of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures,
2020.
mla: Castenow, Jannik, et al. “The Online Multi-Commodity Facility Location Problem.”
Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures,
2020, doi:10.1145/3350755.3400281.
short: 'J. Castenow, B. Feldkord, T. Knollmann, M. Malatyali, F. Meyer auf der Heide,
in: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures,
2020.'
date_created: 2020-07-14T07:53:20Z
date_updated: 2022-01-06T06:53:10Z
ddc:
- '000'
department:
- _id: '63'
doi: 10.1145/3350755.3400281
external_id:
arxiv:
- '2005.08391'
file:
- access_level: closed
content_type: application/pdf
creator: tillk
date_created: 2020-07-14T07:56:52Z
date_updated: 2020-07-14T07:56:52Z
file_id: '17373'
file_name: 3350755.3400281.pdf
file_size: 1271416
relation: main_file
success: 1
file_date_updated: 2020-07-14T07:56:52Z
has_accepted_license: '1'
keyword:
- Online Multi-Commodity Facility Location
- Competitive Ratio
- Online Optimization
- Facility Location Problem
language:
- iso: eng
project:
- _id: '1'
name: SFB 901
- _id: '2'
name: SFB 901 - Project Area A
- _id: '5'
name: SFB 901 - Subproject A1
publication: Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and
Architectures
publication_identifier:
isbn:
- '9781450369350'
publication_status: published
status: public
title: The Online Multi-Commodity Facility Location Problem
type: conference
user_id: '39241'
year: '2020'
...
---
_id: '20143'
author:
- first_name: Mortaza
full_name: Otroshi, Mortaza
id: '71269'
last_name: Otroshi
orcid: 0000-0002-8652-9209
- first_name: Moritz
full_name: Rossel, Moritz
last_name: Rossel
- first_name: Gerson
full_name: Meschut, Gerson
id: '32056'
last_name: Meschut
orcid: 0000-0002-2763-1246
citation:
ama: Otroshi M, Rossel M, Meschut G. Stress state dependent damage modeling of self-pierce
riveting process simulation using GISSMO damage model. Journal of Advanced
Joining Processes. 2020;1. doi:10.1016/j.jajp.2020.100015
apa: Otroshi, M., Rossel, M., & Meschut, G. (2020). Stress state dependent damage
modeling of self-pierce riveting process simulation using GISSMO damage model.
Journal of Advanced Joining Processes, 1. https://doi.org/10.1016/j.jajp.2020.100015
bibtex: '@article{Otroshi_Rossel_Meschut_2020, title={Stress state dependent damage
modeling of self-pierce riveting process simulation using GISSMO damage model},
volume={1}, DOI={10.1016/j.jajp.2020.100015},
journal={Journal of Advanced Joining Processes}, publisher={Elsevier}, author={Otroshi,
Mortaza and Rossel, Moritz and Meschut, Gerson}, year={2020} }'
chicago: Otroshi, Mortaza, Moritz Rossel, and Gerson Meschut. “Stress State Dependent
Damage Modeling of Self-Pierce Riveting Process Simulation Using GISSMO Damage
Model.” Journal of Advanced Joining Processes 1 (2020). https://doi.org/10.1016/j.jajp.2020.100015.
ieee: 'M. Otroshi, M. Rossel, and G. Meschut, “Stress state dependent damage modeling
of self-pierce riveting process simulation using GISSMO damage model,” Journal
of Advanced Joining Processes, vol. 1, 2020, doi: 10.1016/j.jajp.2020.100015.'
mla: Otroshi, Mortaza, et al. “Stress State Dependent Damage Modeling of Self-Pierce
Riveting Process Simulation Using GISSMO Damage Model.” Journal of Advanced
Joining Processes, vol. 1, Elsevier, 2020, doi:10.1016/j.jajp.2020.100015.
short: M. Otroshi, M. Rossel, G. Meschut, Journal of Advanced Joining Processes
1 (2020).
date_created: 2020-10-20T14:49:15Z
date_updated: 2022-04-25T07:49:50Z
department:
- _id: '157'
doi: 10.1016/j.jajp.2020.100015
intvolume: ' 1'
keyword:
- Self-pierce riveting
- Ductile fracture
- Damage modeling
- GISSMO damage model
language:
- iso: eng
main_file_link:
- open_access: '1'
oa: '1'
publication: Journal of Advanced Joining Processes
publisher: Elsevier
quality_controlled: '1'
status: public
title: Stress state dependent damage modeling of self-pierce riveting process simulation
using GISSMO damage model
type: journal_article
user_id: '71269'
volume: 1
year: '2020'
...
---
_id: '35298'
abstract:
- lang: ger
text: Im Artikel werden drei verschiedene Lernzugänge (kom-petenzorientiertes, ästhetisches und biographisches Lernen) vorgestellt und aus
theoretischer Perspektive deren motivierender Gehalt für selbstreguliertes Lernen
in Praxisphasen des Lehramtsstudiumsherausgearbeitet. Als theoretische Grund-lage
dient die Selbstbestimmungstheorie als zentrale motivationale Theorie zur Erklärung
selbstbestimmten Handelns.
- lang: eng
text: The article addresses how motivational learning approaches (competency-oriented, aesthetic and biographical) can contribute to the professionalization
of preservice teachers during a long-term internship. As a theoretical basis,
the self-determination theory serves as a central motivational theory for explaining
self-determined action.
alternative_title:
- Ein Blick auf kompetenzorientiertes, ästhetisches und biographisches Lernen im Lehramtsstudium
author:
- first_name: Carina
full_name: Caruso, Carina
id: '23123'
last_name: Caruso
- first_name: Christine
full_name: Adammek, Christine
last_name: Adammek
- first_name: Sabrina
full_name: Bonanati, Sabrina
last_name: Bonanati
- first_name: Sybille
full_name: Wiescholek, Sybille
last_name: Wiescholek
citation:
ama: Caruso C, Adammek C, Bonanati S, Wiescholek S. Motivierende Lernzugänge als
Ausgangspunkt der Professionalisierung angehender Lehrer_innen. Herausforderung
Lehrer*innenbildung - Zeitschrift Zur Konzeption, Gestaltung Und Diskussion.
2020;3(1):18-33. doi:10.4119/hlz-2540
apa: Caruso, C., Adammek, C., Bonanati, S., & Wiescholek, S. (2020). Motivierende
Lernzugänge als Ausgangspunkt der Professionalisierung angehender Lehrer_innen.
Herausforderung Lehrer*innenbildung - Zeitschrift Zur Konzeption, Gestaltung
Und Diskussion, 3(1), 18–33. https://doi.org/10.4119/hlz-2540
bibtex: '@article{Caruso_Adammek_Bonanati_Wiescholek_2020, title={Motivierende Lernzugänge
als Ausgangspunkt der Professionalisierung angehender Lehrer_innen}, volume={3},
DOI={10.4119/hlz-2540}, number={1},
journal={Herausforderung Lehrer*innenbildung - Zeitschrift Zur Konzeption, Gestaltung
Und Diskussion}, author={Caruso, Carina and Adammek, Christine and Bonanati, Sabrina
and Wiescholek, Sybille}, year={2020}, pages={18–33} }'
chicago: 'Caruso, Carina, Christine Adammek, Sabrina Bonanati, and Sybille Wiescholek.
“Motivierende Lernzugänge als Ausgangspunkt der Professionalisierung angehender
Lehrer_innen.” Herausforderung Lehrer*innenbildung - Zeitschrift Zur Konzeption,
Gestaltung Und Diskussion 3, no. 1 (2020): 18–33. https://doi.org/10.4119/hlz-2540.'
ieee: 'C. Caruso, C. Adammek, S. Bonanati, and S. Wiescholek, “Motivierende Lernzugänge
als Ausgangspunkt der Professionalisierung angehender Lehrer_innen,” Herausforderung
Lehrer*innenbildung - Zeitschrift Zur Konzeption, Gestaltung Und Diskussion,
vol. 3, no. 1, pp. 18–33, 2020, doi: 10.4119/hlz-2540.'
mla: Caruso, Carina, et al. “Motivierende Lernzugänge als Ausgangspunkt der Professionalisierung
angehender Lehrer_innen.” Herausforderung Lehrer*innenbildung - Zeitschrift
Zur Konzeption, Gestaltung Und Diskussion, vol. 3, no. 1, 2020, pp. 18–33,
doi:10.4119/hlz-2540.
short: C. Caruso, C. Adammek, S. Bonanati, S. Wiescholek, Herausforderung Lehrer*innenbildung
- Zeitschrift Zur Konzeption, Gestaltung Und Diskussion 3 (2020) 18–33.
date_created: 2023-01-05T13:58:28Z
date_updated: 2023-01-06T12:18:16Z
doi: 10.4119/hlz-2540
intvolume: ' 3'
issue: '1'
keyword:
- ästhetische Forschung
- Biographiearbeit
- Praxissemester
- Professionalisierung
- selbstreguliertes Lernen
- Motivation / aesthetic research
- biographical work
- long-term internship
- profes-sionalization
- self-regulated learning
- motivation
language:
- iso: other
page: 18-33
publication: Herausforderung Lehrer*innenbildung - Zeitschrift Zur Konzeption, Gestaltung
Und Diskussion
publication_identifier:
issn:
- 2625-0675
publication_status: published
status: public
title: Motivierende Lernzugänge als Ausgangspunkt der Professionalisierung angehender
Lehrer_innen
type: journal_article
user_id: '86519'
volume: 3
year: '2020'
...
---
_id: '48847'
abstract:
- lang: eng
text: Dynamic optimization problems have gained significant attention in evolutionary
computation as evolutionary algorithms (EAs) can easily adapt to changing environments.
We show that EAs can solve the graph coloring problem for bipartite graphs more
efficiently by using dynamic optimization. In our approach the graph instance
is given incrementally such that the EA can reoptimize its coloring when a new
edge introduces a conflict. We show that, when edges are inserted in a way that
preserves graph connectivity, Randomized Local Search (RLS) efficiently finds
a proper 2-coloring for all bipartite graphs. This includes graphs for which RLS
and other EAs need exponential expected time in a static optimization scenario.
We investigate different ways of building up the graph by popular graph traversals
such as breadth-first-search and depth-first-search and analyse the resulting
runtime behavior. We further show that offspring populations (e. g. a (1 + {$\lambda$})
RLS) lead to an exponential speedup in {$\lambda$}. Finally, an island model using
3 islands succeeds in an optimal time of {$\Theta$}(m) on every m-edge bipartite
graph, outperforming offspring populations. This is the first example where an
island model guarantees a speedup that is not bounded in the number of islands.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
- first_name: Pan
full_name: Peng, Pan
last_name: Peng
- first_name: Dirk
full_name: Sudholt, Dirk
last_name: Sudholt
citation:
ama: 'Bossek J, Neumann F, Peng P, Sudholt D. More Effective Randomized Search Heuristics
for Graph Coloring through Dynamic Optimization. In: Proceedings of the Genetic
and Evolutionary Computation Conference. GECCO ’20. Association for Computing
Machinery; 2020:1277–1285. doi:10.1145/3377930.3390174'
apa: Bossek, J., Neumann, F., Peng, P., & Sudholt, D. (2020). More Effective
Randomized Search Heuristics for Graph Coloring through Dynamic Optimization.
Proceedings of the Genetic and Evolutionary Computation Conference, 1277–1285.
https://doi.org/10.1145/3377930.3390174
bibtex: '@inproceedings{Bossek_Neumann_Peng_Sudholt_2020, place={New York, NY, USA},
series={GECCO ’20}, title={More Effective Randomized Search Heuristics for Graph
Coloring through Dynamic Optimization}, DOI={10.1145/3377930.3390174},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
publisher={Association for Computing Machinery}, author={Bossek, Jakob and Neumann,
Frank and Peng, Pan and Sudholt, Dirk}, year={2020}, pages={1277–1285}, collection={GECCO
’20} }'
chicago: 'Bossek, Jakob, Frank Neumann, Pan Peng, and Dirk Sudholt. “More Effective
Randomized Search Heuristics for Graph Coloring through Dynamic Optimization.”
In Proceedings of the Genetic and Evolutionary Computation Conference,
1277–1285. GECCO ’20. New York, NY, USA: Association for Computing Machinery,
2020. https://doi.org/10.1145/3377930.3390174.'
ieee: 'J. Bossek, F. Neumann, P. Peng, and D. Sudholt, “More Effective Randomized
Search Heuristics for Graph Coloring through Dynamic Optimization,” in Proceedings
of the Genetic and Evolutionary Computation Conference, 2020, pp. 1277–1285,
doi: 10.1145/3377930.3390174.'
mla: Bossek, Jakob, et al. “More Effective Randomized Search Heuristics for Graph
Coloring through Dynamic Optimization.” Proceedings of the Genetic and Evolutionary
Computation Conference, Association for Computing Machinery, 2020, pp. 1277–1285,
doi:10.1145/3377930.3390174.
short: 'J. Bossek, F. Neumann, P. Peng, D. Sudholt, in: Proceedings of the Genetic
and Evolutionary Computation Conference, Association for Computing Machinery,
New York, NY, USA, 2020, pp. 1277–1285.'
date_created: 2023-11-14T15:58:53Z
date_updated: 2023-12-13T10:43:41Z
department:
- _id: '819'
doi: 10.1145/3377930.3390174
extern: '1'
keyword:
- dynamic optimization
- evolutionary algorithms
- running time analysis
- theory
language:
- iso: eng
page: 1277–1285
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- 978-1-4503-7128-5
publication_status: published
publisher: Association for Computing Machinery
series_title: GECCO ’20
status: public
title: More Effective Randomized Search Heuristics for Graph Coloring through Dynamic
Optimization
type: conference
user_id: '102979'
year: '2020'
...
---
_id: '48849'
abstract:
- lang: eng
text: One-shot optimization tasks require to determine the set of solution candidates
prior to their evaluation, i.e., without possibility for adaptive sampling. We
consider two variants, classic one-shot optimization (where our aim is to find
at least one solution of high quality) and one-shot regression (where the goal
is to fit a model that resembles the true problem as well as possible). For both
tasks it seems intuitive that well-distributed samples should perform better than
uniform or grid-based samples, since they show a better coverage of the decision
space. In practice, quasi-random designs such as Latin Hypercube Samples and low-discrepancy
point sets are indeed very commonly used designs for one-shot optimization tasks.
We study in this work how well low star discrepancy correlates with performance
in one-shot optimization. Our results confirm an advantage of low-discrepancy
designs, but also indicate the correlation between discrepancy values and overall
performance is rather weak. We then demonstrate that commonly used designs may
be far from optimal. More precisely, we evolve 24 very specific designs that each
achieve good performance on one of our benchmark problems. Interestingly, we find
that these specifically designed samples yield surprisingly good performance across
the whole benchmark set. Our results therefore give strong indication that significant
performance gains over state-of-the-art one-shot sampling techniques are possible,
and that evolutionary algorithms can be an efficient means to evolve these.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Carola
full_name: Doerr, Carola
last_name: Doerr
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
- first_name: Aneta
full_name: Neumann, Aneta
last_name: Neumann
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
citation:
ama: 'Bossek J, Doerr C, Kerschke P, Neumann A, Neumann F. Evolving Sampling Strategies
for One-Shot Optimization Tasks. In: Parallel Problem Solving from Nature (PPSN
XVI). Springer-Verlag; 2020:111–124. doi:10.1007/978-3-030-58112-1_8'
apa: Bossek, J., Doerr, C., Kerschke, P., Neumann, A., & Neumann, F. (2020).
Evolving Sampling Strategies for One-Shot Optimization Tasks. Parallel Problem
Solving from Nature (PPSN XVI), 111–124. https://doi.org/10.1007/978-3-030-58112-1_8
bibtex: '@inproceedings{Bossek_Doerr_Kerschke_Neumann_Neumann_2020, place={Berlin,
Heidelberg}, title={Evolving Sampling Strategies for One-Shot Optimization Tasks},
DOI={10.1007/978-3-030-58112-1_8},
booktitle={Parallel Problem Solving from Nature (PPSN XVI)}, publisher={Springer-Verlag},
author={Bossek, Jakob and Doerr, Carola and Kerschke, Pascal and Neumann, Aneta
and Neumann, Frank}, year={2020}, pages={111–124} }'
chicago: 'Bossek, Jakob, Carola Doerr, Pascal Kerschke, Aneta Neumann, and Frank
Neumann. “Evolving Sampling Strategies for One-Shot Optimization Tasks.” In Parallel
Problem Solving from Nature (PPSN XVI), 111–124. Berlin, Heidelberg: Springer-Verlag,
2020. https://doi.org/10.1007/978-3-030-58112-1_8.'
ieee: 'J. Bossek, C. Doerr, P. Kerschke, A. Neumann, and F. Neumann, “Evolving Sampling
Strategies for One-Shot Optimization Tasks,” in Parallel Problem Solving from
Nature (PPSN XVI), 2020, pp. 111–124, doi: 10.1007/978-3-030-58112-1_8.'
mla: Bossek, Jakob, et al. “Evolving Sampling Strategies for One-Shot Optimization
Tasks.” Parallel Problem Solving from Nature (PPSN XVI), Springer-Verlag,
2020, pp. 111–124, doi:10.1007/978-3-030-58112-1_8.
short: 'J. Bossek, C. Doerr, P. Kerschke, A. Neumann, F. Neumann, in: Parallel Problem
Solving from Nature (PPSN XVI), Springer-Verlag, Berlin, Heidelberg, 2020, pp.
111–124.'
date_created: 2023-11-14T15:58:53Z
date_updated: 2023-12-13T10:43:53Z
department:
- _id: '819'
doi: 10.1007/978-3-030-58112-1_8
extern: '1'
keyword:
- Continuous optimization
- Fully parallel search
- One-shot optimization
- Regression
- Surrogate-assisted optimization
language:
- iso: eng
page: 111–124
place: Berlin, Heidelberg
publication: Parallel Problem Solving from Nature (PPSN XVI)
publication_identifier:
isbn:
- 978-3-030-58111-4
publication_status: published
publisher: Springer-Verlag
status: public
title: Evolving Sampling Strategies for One-Shot Optimization Tasks
type: conference
user_id: '102979'
year: '2020'
...
---
_id: '48851'
abstract:
- lang: eng
text: Several important optimization problems in the area of vehicle routing can
be seen as variants of the classical Traveling Salesperson Problem (TSP). In the
area of evolutionary computation, the Traveling Thief Problem (TTP) has gained
increasing interest over the last 5 years. In this paper, we investigate the effect
of weights on such problems, in the sense that the cost of traveling increases
with respect to the weights of nodes already visited during a tour. This provides
abstractions of important TSP variants such as the Traveling Thief Problem and
time dependent TSP variants, and allows to study precisely the increase in difficulty
caused by weight dependence. We provide a 3.59-approximation for this weight dependent
version of TSP with metric distances and bounded positive weights. Furthermore,
we conduct experimental investigations for simple randomized local search with
classical mutation operators and two variants of the state-of-the-art evolutionary
algorithm EAX adapted to the weighted TSP. Our results show the impact of the
node weights on the position of the nodes in the resulting tour.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Katrin
full_name: Casel, Katrin
last_name: Casel
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
citation:
ama: 'Bossek J, Casel K, Kerschke P, Neumann F. The Node Weight Dependent Traveling
Salesperson Problem: Approximation Algorithms and Randomized Search Heuristics.
In: Proceedings of the Genetic and Evolutionary Computation Conference.
GECCO ’20. Association for Computing Machinery; 2020:1286–1294. doi:10.1145/3377930.3390243'
apa: 'Bossek, J., Casel, K., Kerschke, P., & Neumann, F. (2020). The Node Weight
Dependent Traveling Salesperson Problem: Approximation Algorithms and Randomized
Search Heuristics. Proceedings of the Genetic and Evolutionary Computation
Conference, 1286–1294. https://doi.org/10.1145/3377930.3390243'
bibtex: '@inproceedings{Bossek_Casel_Kerschke_Neumann_2020, place={New York, NY,
USA}, series={GECCO ’20}, title={The Node Weight Dependent Traveling Salesperson
Problem: Approximation Algorithms and Randomized Search Heuristics}, DOI={10.1145/3377930.3390243},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
publisher={Association for Computing Machinery}, author={Bossek, Jakob and Casel,
Katrin and Kerschke, Pascal and Neumann, Frank}, year={2020}, pages={1286–1294},
collection={GECCO ’20} }'
chicago: 'Bossek, Jakob, Katrin Casel, Pascal Kerschke, and Frank Neumann. “The
Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms
and Randomized Search Heuristics.” In Proceedings of the Genetic and Evolutionary
Computation Conference, 1286–1294. GECCO ’20. New York, NY, USA: Association
for Computing Machinery, 2020. https://doi.org/10.1145/3377930.3390243.'
ieee: 'J. Bossek, K. Casel, P. Kerschke, and F. Neumann, “The Node Weight Dependent
Traveling Salesperson Problem: Approximation Algorithms and Randomized Search
Heuristics,” in Proceedings of the Genetic and Evolutionary Computation Conference,
2020, pp. 1286–1294, doi: 10.1145/3377930.3390243.'
mla: 'Bossek, Jakob, et al. “The Node Weight Dependent Traveling Salesperson Problem:
Approximation Algorithms and Randomized Search Heuristics.” Proceedings of
the Genetic and Evolutionary Computation Conference, Association for Computing
Machinery, 2020, pp. 1286–1294, doi:10.1145/3377930.3390243.'
short: 'J. Bossek, K. Casel, P. Kerschke, F. Neumann, in: Proceedings of the Genetic
and Evolutionary Computation Conference, Association for Computing Machinery,
New York, NY, USA, 2020, pp. 1286–1294.'
date_created: 2023-11-14T15:58:53Z
date_updated: 2023-12-13T10:43:33Z
department:
- _id: '819'
doi: 10.1145/3377930.3390243
extern: '1'
keyword:
- dynamic optimization
- evolutionary algorithms
- running time analysis
- theory
language:
- iso: eng
page: 1286–1294
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- 978-1-4503-7128-5
publication_status: published
publisher: Association for Computing Machinery
series_title: GECCO ’20
status: public
title: 'The Node Weight Dependent Traveling Salesperson Problem: Approximation Algorithms
and Randomized Search Heuristics'
type: conference
user_id: '102979'
year: '2020'
...
---
_id: '48845'
abstract:
- lang: eng
text: In practice, e.g. in delivery and service scenarios, Vehicle-Routing-Problems
(VRPs) often imply repeated decision making on dynamic customer requests. As in
classical VRPs, tours have to be planned short while the number of serviced customers
has to be maximized at the same time resulting in a multi-objective problem. Beyond
that, however, dynamic requests lead to the need for re-planning of not yet realized
tour parts, while already realized tour parts are irreversible. In this paper
we study this type of bi-objective dynamic VRP including sequential decision making
and concurrent realization of decisions. We adopt a recently proposed Dynamic
Evolutionary Multi-Objective Algorithm (DEMOA) for a related VRP problem and extend
it to the more realistic (here considered) scenario of multiple vehicles. We empirically
show that our DEMOA is competitive with a multi-vehicle offline and clairvoyant
variant of the proposed DEMOA as well as with the dynamic single-vehicle approach
proposed earlier.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Christian
full_name: Grimme, Christian
last_name: Grimme
- first_name: Heike
full_name: Trautmann, Heike
last_name: Trautmann
citation:
ama: 'Bossek J, Grimme C, Trautmann H. Dynamic Bi-Objective Routing of Multiple
Vehicles. In: Proceedings of the Genetic and Evolutionary Computation Conference.
GECCO ’20. Association for Computing Machinery; 2020:166–174. doi:10.1145/3377930.3390146'
apa: Bossek, J., Grimme, C., & Trautmann, H. (2020). Dynamic Bi-Objective Routing
of Multiple Vehicles. Proceedings of the Genetic and Evolutionary Computation
Conference, 166–174. https://doi.org/10.1145/3377930.3390146
bibtex: '@inproceedings{Bossek_Grimme_Trautmann_2020, place={New York, NY, USA},
series={GECCO ’20}, title={Dynamic Bi-Objective Routing of Multiple Vehicles},
DOI={10.1145/3377930.3390146},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
publisher={Association for Computing Machinery}, author={Bossek, Jakob and Grimme,
Christian and Trautmann, Heike}, year={2020}, pages={166–174}, collection={GECCO
’20} }'
chicago: 'Bossek, Jakob, Christian Grimme, and Heike Trautmann. “Dynamic Bi-Objective
Routing of Multiple Vehicles.” In Proceedings of the Genetic and Evolutionary
Computation Conference, 166–174. GECCO ’20. New York, NY, USA: Association
for Computing Machinery, 2020. https://doi.org/10.1145/3377930.3390146.'
ieee: 'J. Bossek, C. Grimme, and H. Trautmann, “Dynamic Bi-Objective Routing of
Multiple Vehicles,” in Proceedings of the Genetic and Evolutionary Computation
Conference, 2020, pp. 166–174, doi: 10.1145/3377930.3390146.'
mla: Bossek, Jakob, et al. “Dynamic Bi-Objective Routing of Multiple Vehicles.”
Proceedings of the Genetic and Evolutionary Computation Conference, Association
for Computing Machinery, 2020, pp. 166–174, doi:10.1145/3377930.3390146.
short: 'J. Bossek, C. Grimme, H. Trautmann, in: Proceedings of the Genetic and Evolutionary
Computation Conference, Association for Computing Machinery, New York, NY, USA,
2020, pp. 166–174.'
date_created: 2023-11-14T15:58:52Z
date_updated: 2023-12-13T10:43:24Z
department:
- _id: '819'
doi: 10.1145/3377930.3390146
extern: '1'
keyword:
- decision making
- dynamic optimization
- evolutionary algorithms
- multi-objective optimization
- vehicle routing
language:
- iso: eng
page: 166–174
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- 978-1-4503-7128-5
publication_status: published
publisher: Association for Computing Machinery
series_title: GECCO ’20
status: public
title: Dynamic Bi-Objective Routing of Multiple Vehicles
type: conference
user_id: '102979'
year: '2020'
...
---
_id: '48850'
abstract:
- lang: eng
text: Sequential model-based optimization (SMBO) approaches are algorithms for solving
problems that require computationally or otherwise expensive function evaluations.
The key design principle of SMBO is a substitution of the true objective function
by a surrogate, which is used to propose the point(s) to be evaluated next. SMBO
algorithms are intrinsically modular, leaving the user with many important design
choices. Significant research efforts go into understanding which settings perform
best for which type of problems. Most works, however, focus on the choice of the
model, the acquisition function, and the strategy used to optimize the latter.
The choice of the initial sampling strategy, however, receives much less attention.
Not surprisingly, quite diverging recommendations can be found in the literature.
We analyze in this work how the size and the distribution of the initial sample
influences the overall quality of the efficient global optimization (EGO) algorithm,
a well-known SMBO approach. While, overall, small initial budgets using Halton
sampling seem preferable, we also observe that the performance landscape is rather
unstructured. We furthermore identify several situations in which EGO performs
unfavorably against random sampling. Both observations indicate that an adaptive
SMBO design could be beneficial, making SMBO an interesting test-bed for automated
algorithm design.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Carola
full_name: Doerr, Carola
last_name: Doerr
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
citation:
ama: 'Bossek J, Doerr C, Kerschke P. Initial Design Strategies and Their Effects
on Sequential Model-Based Optimization: An Exploratory Case Study Based on BBOB.
In: Proceedings of the Genetic and Evolutionary Computation Conference.
GECCO ’20. Association for Computing Machinery; 2020:778–786. doi:10.1145/3377930.3390155'
apa: 'Bossek, J., Doerr, C., & Kerschke, P. (2020). Initial Design Strategies
and Their Effects on Sequential Model-Based Optimization: An Exploratory Case
Study Based on BBOB. Proceedings of the Genetic and Evolutionary Computation
Conference, 778–786. https://doi.org/10.1145/3377930.3390155'
bibtex: '@inproceedings{Bossek_Doerr_Kerschke_2020, place={New York, NY, USA}, series={GECCO
’20}, title={Initial Design Strategies and Their Effects on Sequential Model-Based
Optimization: An Exploratory Case Study Based on BBOB}, DOI={10.1145/3377930.3390155},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
publisher={Association for Computing Machinery}, author={Bossek, Jakob and Doerr,
Carola and Kerschke, Pascal}, year={2020}, pages={778–786}, collection={GECCO
’20} }'
chicago: 'Bossek, Jakob, Carola Doerr, and Pascal Kerschke. “Initial Design Strategies
and Their Effects on Sequential Model-Based Optimization: An Exploratory Case
Study Based on BBOB.” In Proceedings of the Genetic and Evolutionary Computation
Conference, 778–786. GECCO ’20. New York, NY, USA: Association for Computing
Machinery, 2020. https://doi.org/10.1145/3377930.3390155.'
ieee: 'J. Bossek, C. Doerr, and P. Kerschke, “Initial Design Strategies and Their
Effects on Sequential Model-Based Optimization: An Exploratory Case Study Based
on BBOB,” in Proceedings of the Genetic and Evolutionary Computation Conference,
2020, pp. 778–786, doi: 10.1145/3377930.3390155.'
mla: 'Bossek, Jakob, et al. “Initial Design Strategies and Their Effects on Sequential
Model-Based Optimization: An Exploratory Case Study Based on BBOB.” Proceedings
of the Genetic and Evolutionary Computation Conference, Association for Computing
Machinery, 2020, pp. 778–786, doi:10.1145/3377930.3390155.'
short: 'J. Bossek, C. Doerr, P. Kerschke, in: Proceedings of the Genetic and Evolutionary
Computation Conference, Association for Computing Machinery, New York, NY, USA,
2020, pp. 778–786.'
date_created: 2023-11-14T15:58:53Z
date_updated: 2023-12-13T10:44:01Z
department:
- _id: '819'
doi: 10.1145/3377930.3390155
extern: '1'
keyword:
- continuous black-box optimization
- design of experiments
- initial design
- sequential model-based optimization
language:
- iso: eng
page: 778–786
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- 978-1-4503-7128-5
publication_status: published
publisher: Association for Computing Machinery
series_title: GECCO ’20
status: public
title: 'Initial Design Strategies and Their Effects on Sequential Model-Based Optimization:
An Exploratory Case Study Based on BBOB'
type: conference
user_id: '102979'
year: '2020'
...
---
_id: '48848'
abstract:
- lang: eng
text: We build upon a recently proposed multi-objective view onto performance measurement
of single-objective stochastic solvers. The trade-off between the fraction of
failed runs and the mean runtime of successful runs \textendash both to be minimized
\textendash is directly analyzed based on a study on algorithm selection of inexact
state-of-the-art solvers for the famous Traveling Salesperson Problem (TSP). Moreover,
we adopt the hypervolume indicator (HV) commonly used in multi-objective optimization
for simultaneously assessing both conflicting objectives and investigate relations
to commonly used performance indicators, both theoretically and empirically. Next
to Penalized Average Runtime (PAR) and Penalized Quantile Runtime (PQR), the HV
measure is used as a core concept within the construction of per-instance algorithm
selection models offering interesting insights into complementary behavior of
inexact TSP solvers. \textbullet The multi-objective perspective is naturally
generalizable to multiple objectives. \textbullet Proof of relationship between
HV and the PAR in the considered bi-objective space. \textbullet New insights
into complementary behavior of stochastic optimization algorithms.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
- first_name: Heike
full_name: Trautmann, Heike
last_name: Trautmann
citation:
ama: Bossek J, Kerschke P, Trautmann H. A Multi-Objective Perspective on Performance
Assessment and Automated Selection of Single-Objective Optimization Algorithms.
Applied Soft Computing. 2020;88(C). doi:10.1016/j.asoc.2019.105901
apa: Bossek, J., Kerschke, P., & Trautmann, H. (2020). A Multi-Objective Perspective
on Performance Assessment and Automated Selection of Single-Objective Optimization
Algorithms. Applied Soft Computing, 88(C). https://doi.org/10.1016/j.asoc.2019.105901
bibtex: '@article{Bossek_Kerschke_Trautmann_2020, title={A Multi-Objective Perspective
on Performance Assessment and Automated Selection of Single-Objective Optimization
Algorithms}, volume={88}, DOI={10.1016/j.asoc.2019.105901},
number={C}, journal={Applied Soft Computing}, author={Bossek, Jakob and Kerschke,
Pascal and Trautmann, Heike}, year={2020} }'
chicago: Bossek, Jakob, Pascal Kerschke, and Heike Trautmann. “A Multi-Objective
Perspective on Performance Assessment and Automated Selection of Single-Objective
Optimization Algorithms.” Applied Soft Computing 88, no. C (2020). https://doi.org/10.1016/j.asoc.2019.105901.
ieee: 'J. Bossek, P. Kerschke, and H. Trautmann, “A Multi-Objective Perspective
on Performance Assessment and Automated Selection of Single-Objective Optimization
Algorithms,” Applied Soft Computing, vol. 88, no. C, 2020, doi: 10.1016/j.asoc.2019.105901.'
mla: Bossek, Jakob, et al. “A Multi-Objective Perspective on Performance Assessment
and Automated Selection of Single-Objective Optimization Algorithms.” Applied
Soft Computing, vol. 88, no. C, 2020, doi:10.1016/j.asoc.2019.105901.
short: J. Bossek, P. Kerschke, H. Trautmann, Applied Soft Computing 88 (2020).
date_created: 2023-11-14T15:58:53Z
date_updated: 2023-12-13T10:52:17Z
department:
- _id: '819'
doi: 10.1016/j.asoc.2019.105901
intvolume: ' 88'
issue: C
keyword:
- Algorithm selection
- Combinatorial optimization
- Multi-objective optimization
- Performance measurement
- Traveling Salesperson Problem
language:
- iso: eng
publication: Applied Soft Computing
publication_identifier:
issn:
- 1568-4946
status: public
title: A Multi-Objective Perspective on Performance Assessment and Automated Selection
of Single-Objective Optimization Algorithms
type: journal_article
user_id: '102979'
volume: 88
year: '2020'
...
---
_id: '46334'
abstract:
- lang: eng
text: We build upon a recently proposed multi-objective view onto performance measurement
of single-objective stochastic solvers. The trade-off between the fraction of
failed runs and the mean runtime of successful runs – both to be minimized – is
directly analyzed based on a study on algorithm selection of inexact state-of-the-art
solvers for the famous Traveling Salesperson Problem (TSP). Moreover, we adopt
the hypervolume indicator (HV) commonly used in multi-objective optimization for
simultaneously assessing both conflicting objectives and investigate relations
to commonly used performance indicators, both theoretically and empirically. Next
to Penalized Average Runtime (PAR) and Penalized Quantile Runtime (PQR), the HV
measure is used as a core concept within the construction of per-instance algorithm
selection models offering interesting insights into complementary behavior of
inexact TSP solvers.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
citation:
ama: Bossek J, Kerschke P, Trautmann H. A multi-objective perspective on performance
assessment and automated selection of single-objective optimization algorithms.
Applied Soft Computing. 2020;88:105901. doi:https://doi.org/10.1016/j.asoc.2019.105901
apa: Bossek, J., Kerschke, P., & Trautmann, H. (2020). A multi-objective perspective
on performance assessment and automated selection of single-objective optimization
algorithms. Applied Soft Computing, 88, 105901. https://doi.org/10.1016/j.asoc.2019.105901
bibtex: '@article{Bossek_Kerschke_Trautmann_2020, title={A multi-objective perspective
on performance assessment and automated selection of single-objective optimization
algorithms}, volume={88}, DOI={https://doi.org/10.1016/j.asoc.2019.105901},
journal={Applied Soft Computing}, author={Bossek, Jakob and Kerschke, Pascal and
Trautmann, Heike}, year={2020}, pages={105901} }'
chicago: 'Bossek, Jakob, Pascal Kerschke, and Heike Trautmann. “A Multi-Objective
Perspective on Performance Assessment and Automated Selection of Single-Objective
Optimization Algorithms.” Applied Soft Computing 88 (2020): 105901. https://doi.org/10.1016/j.asoc.2019.105901.'
ieee: 'J. Bossek, P. Kerschke, and H. Trautmann, “A multi-objective perspective
on performance assessment and automated selection of single-objective optimization
algorithms,” Applied Soft Computing, vol. 88, p. 105901, 2020, doi: https://doi.org/10.1016/j.asoc.2019.105901.'
mla: Bossek, Jakob, et al. “A Multi-Objective Perspective on Performance Assessment
and Automated Selection of Single-Objective Optimization Algorithms.” Applied
Soft Computing, vol. 88, 2020, p. 105901, doi:https://doi.org/10.1016/j.asoc.2019.105901.
short: J. Bossek, P. Kerschke, H. Trautmann, Applied Soft Computing 88 (2020) 105901.
date_created: 2023-08-04T07:42:26Z
date_updated: 2024-06-10T12:00:46Z
department:
- _id: '34'
- _id: '819'
doi: https://doi.org/10.1016/j.asoc.2019.105901
intvolume: ' 88'
keyword:
- Algorithm selection
- Multi-objective optimization
- Performance measurement
- Combinatorial optimization
- Traveling Salesperson Problem
language:
- iso: eng
page: '105901'
publication: Applied Soft Computing
publication_identifier:
issn:
- 1568-4946
status: public
title: A multi-objective perspective on performance assessment and automated selection
of single-objective optimization algorithms
type: journal_article
user_id: '15504'
volume: 88
year: '2020'
...
---
_id: '33866'
abstract:
- lang: eng
text: Helhmoltz–Kirchhoff equations of motions of vortices of an incompressible
fluid in the plane define a dynamics with singularities and this leads to a Zermelo
navigation problem describing the ship travel in such a field where the control
is the heading angle. Considering one vortex, we define a time minimization problem
which can be analyzed with the technics of geometric optimal control combined
with numerical simulations, the geometric frame being the extension of Randers
metrics in the punctured plane, with rotational symmetry. Candidates as minimizers
are parameterized thanks to the Pontryagin Maximum Principle as extremal solutions
of a Hamiltonian vector field. We analyze the time minimal solution to transfer
the ship between two points where during the transfer the ship can be either in
a strong current region in the vicinity of the vortex or in a weak current region.
The analysis is based on a micro-local classification of the extremals using mainly
the integrability properties of the dynamics due to the rotational symmetry. The
discussion is complex and related to the existence of an isolated extremal (Reeb)
circle due to the vortex singularity. The explicit computation of cut points where
the extremal curves cease to be optimal is given and the spheres are described
in the case where at the initial point the current is weak.
article_number: S10
author:
- first_name: Bernard
full_name: Bonnard, Bernard
last_name: Bonnard
- first_name: Olivier
full_name: Cots, Olivier
last_name: Cots
- first_name: Boris Edgar
full_name: Wembe Moafo, Boris Edgar
id: '95394'
last_name: Wembe Moafo
citation:
ama: 'Bonnard B, Cots O, Wembe Moafo BE. A Zermelo navigation problem with a vortex
singularity. ESAIM: Control, Optimisation and Calculus of Variations. 2020;27.
doi:10.1051/cocv/2020058'
apa: 'Bonnard, B., Cots, O., & Wembe Moafo, B. E. (2020). A Zermelo navigation
problem with a vortex singularity. ESAIM: Control, Optimisation and Calculus
of Variations, 27, Article S10. https://doi.org/10.1051/cocv/2020058'
bibtex: '@article{Bonnard_Cots_Wembe Moafo_2020, title={A Zermelo navigation problem
with a vortex singularity}, volume={27}, DOI={10.1051/cocv/2020058},
number={S10}, journal={ESAIM: Control, Optimisation and Calculus of Variations},
publisher={EDP Sciences}, author={Bonnard, Bernard and Cots, Olivier and Wembe
Moafo, Boris Edgar}, year={2020} }'
chicago: 'Bonnard, Bernard, Olivier Cots, and Boris Edgar Wembe Moafo. “A Zermelo
Navigation Problem with a Vortex Singularity.” ESAIM: Control, Optimisation
and Calculus of Variations 27 (2020). https://doi.org/10.1051/cocv/2020058.'
ieee: 'B. Bonnard, O. Cots, and B. E. Wembe Moafo, “A Zermelo navigation problem
with a vortex singularity,” ESAIM: Control, Optimisation and Calculus of Variations,
vol. 27, Art. no. S10, 2020, doi: 10.1051/cocv/2020058.'
mla: 'Bonnard, Bernard, et al. “A Zermelo Navigation Problem with a Vortex Singularity.”
ESAIM: Control, Optimisation and Calculus of Variations, vol. 27, S10,
EDP Sciences, 2020, doi:10.1051/cocv/2020058.'
short: 'B. Bonnard, O. Cots, B.E. Wembe Moafo, ESAIM: Control, Optimisation and
Calculus of Variations 27 (2020).'
date_created: 2022-10-24T12:51:05Z
date_updated: 2023-01-16T12:09:22Z
doi: 10.1051/cocv/2020058
intvolume: ' 27'
keyword:
- Computational Mathematics
- Control and Optimization
- Control and Systems Engineering
language:
- iso: eng
publication: 'ESAIM: Control, Optimisation and Calculus of Variations'
publication_identifier:
issn:
- 1292-8119
- 1262-3377
publication_status: published
publisher: EDP Sciences
status: public
title: A Zermelo navigation problem with a vortex singularity
type: journal_article
user_id: '95394'
volume: 27
year: '2020'
...
---
_id: '19976'
abstract:
- lang: eng
text: The aim to reduce pollutant emission has led to a trend towards lightweight
construction in car body development during the last years. As a consequence of
the resulting need for multi-material design, mechanical joining technologies
become increasingly important. Mechanical joining allows for the combination of
dissimilar materials, while thermic joining techniques reach their limits. Self-piercing
riveting enables the joining of dissimilar materials by using semi-tubular rivets
as mechanical fasteners. The rivet production, however, is costly and time-consuming,
as the rivets generally have to be hardened, tempered and coated after forming,
in order to achieve an adequate strength and corrosion resistance. A promising
approach to improve the efficiency of the rivet manufacturing is the use of high-strength
high nitrogen steel as rivet material because these additional process steps would
not be necessary anymore. As a result of the comparatively high nitrogen content,
such steels have various beneficial properties like higher strength, good ductility
and improved corrosion resistance. By cold bulk forming of high nitrogen steels
high-strength parts can be manufactured due to the strengthening which is caused
by the high strain hardening. However, high tool loads thereby have to be expected
and are a major challenge during the production process. Consequently, there is
a need for appropriate forming strategies. This paper presents key aspects concerning
the process design for the manufacturing of semi-tubular self-piercing rivets
made of high-strength steel. The aim is to produce the rivets in several forming
stages without intermediate heat treatment between the single stages. Due to the
high strain hardening of the material, a two stage forming concept will be investigated.
Cup-backward extrusion is chosen as the first process step in order to form the
rivet shank without forming the rivet foot. Thus, the strain hardening effects
in the area of the rivet foot are minimized and the tool loads during the following
process step can be reduced. During the second and final forming stage the detailed
geometry of the rivet foot and the rivet head is formed. In this context, the
effect of different variations, for example concerning the final geometry of the
rivet foot, on the tool load is investigated using multistage numerical analysis.
Furthermore, the influence of the process temperature on occurring stresses is
analysed. Based on the results of the investigations, an adequate forming strategy
and a tool concept for the manufacturing of semi-tubular self-piercing rivets
made of high-strength steel are presented.
citation:
ama: Kuball C-M, Uhe B, Meschut G, Merklein M, eds. Process Design for the Forming
of Semi-Tubular Self-Piercing Rivets Made of High Nitrogen Steel. Vol 50.;
2020:280-285. doi:10.1016/j.promfg.2020.08.052
apa: Kuball, C.-M., Uhe, B., Meschut, G., & Merklein, M. (Eds.). (2020). Process
design for the forming of semi-tubular self-piercing rivets made of high nitrogen
steel (Vol. 50, pp. 280–285). https://doi.org/10.1016/j.promfg.2020.08.052
bibtex: '@book{Kuball_Uhe_Meschut_Merklein_2020, series={Procedia Manufacturing},
title={Process design for the forming of semi-tubular self-piercing rivets made
of high nitrogen steel}, volume={50}, DOI={10.1016/j.promfg.2020.08.052},
year={2020}, pages={280–285}, collection={Procedia Manufacturing} }'
chicago: Kuball, Clara-Maria, Benedikt Uhe, Gerson Meschut, and Marion Merklein,
eds. Process Design for the Forming of Semi-Tubular Self-Piercing Rivets Made
of High Nitrogen Steel. Vol. 50. Procedia Manufacturing, 2020. https://doi.org/10.1016/j.promfg.2020.08.052.
ieee: C.-M. Kuball, B. Uhe, G. Meschut, and M. Merklein, Eds., Process design
for the forming of semi-tubular self-piercing rivets made of high nitrogen steel,
vol. 50. 2020, pp. 280–285.
mla: Kuball, Clara-Maria, et al., editors. Process Design for the Forming of
Semi-Tubular Self-Piercing Rivets Made of High Nitrogen Steel. 2020, pp. 280–85,
doi:10.1016/j.promfg.2020.08.052.
short: C.-M. Kuball, B. Uhe, G. Meschut, M. Merklein, eds., Process Design for the
Forming of Semi-Tubular Self-Piercing Rivets Made of High Nitrogen Steel, 2020.
date_created: 2020-10-12T08:30:08Z
date_updated: 2026-02-27T10:43:48Z
department:
- _id: '157'
doi: 10.1016/j.promfg.2020.08.052
editor:
- first_name: Clara-Maria
full_name: Kuball, Clara-Maria
last_name: Kuball
- first_name: Benedikt
full_name: Uhe, Benedikt
id: '38131'
last_name: Uhe
- first_name: Gerson
full_name: Meschut, Gerson
id: '32056'
last_name: Meschut
orcid: 0000-0002-2763-1246
- first_name: Marion
full_name: Merklein, Marion
last_name: Merklein
intvolume: ' 50'
keyword:
- high nitrogen steel
- self-piercing riveting
- joining by forming
- bulk forming
- tool design
language:
- iso: eng
page: 280-285
publication_status: published
quality_controlled: '1'
series_title: Procedia Manufacturing
status: public
title: Process design for the forming of semi-tubular self-piercing rivets made of
high nitrogen steel
type: conference_editor
user_id: '53912'
volume: 50
year: '2020'
...
---
_id: '19973'
abstract:
- lang: eng
text: As a result of lightweight design, increased use is being made of high-strength
steel and aluminium in car bodies. Self-piercing riveting is an established technique
for joining these materials. The dissimilar properties of the two materials have
led to a number of different rivet geometries in the past. Each rivet geometry
fulfils the requirements of the materials within a limited range. In the present
investigation, an improved rivet geometry is developed, which permits the reliable
joining of two material combinations that could only be joined by two different
rivet geometries up until now. Material combination 1 consists of high-strength
steel on both sides, while material combination 2 comprises aluminium on the punch
side and high-strength steel on the die side. The material flow and the stress
and strain conditions prevailing during the joining process are analysed by means
of numerical simulation. The rivet geometry is then improved step-by-step on the
basis of this analysis. Finally, the improved rivet geometry is manufactured and
the findings of the investigation are verified in experimental joining tests.
article_type: original
author:
- first_name: Benedikt
full_name: Uhe, Benedikt
id: '38131'
last_name: Uhe
- first_name: Clara-Maria
full_name: Kuball, Clara-Maria
last_name: Kuball
- first_name: Marion
full_name: Merklein, Marion
last_name: Merklein
- first_name: Gerson
full_name: Meschut, Gerson
id: '32056'
last_name: Meschut
orcid: 0000-0002-2763-1246
citation:
ama: Uhe B, Kuball C-M, Merklein M, Meschut G. Improvement of a rivet geometry for
the self-piercing riveting of high-strength steel and multi-material joints. Production
Engineering. 2020;14:417-423. doi:10.1007/s11740-020-00973-w
apa: Uhe, B., Kuball, C.-M., Merklein, M., & Meschut, G. (2020). Improvement
of a rivet geometry for the self-piercing riveting of high-strength steel and
multi-material joints. Production Engineering, 14, 417–423. https://doi.org/10.1007/s11740-020-00973-w
bibtex: '@article{Uhe_Kuball_Merklein_Meschut_2020, title={Improvement of a rivet
geometry for the self-piercing riveting of high-strength steel and multi-material
joints}, volume={14}, DOI={10.1007/s11740-020-00973-w},
journal={Production Engineering}, author={Uhe, Benedikt and Kuball, Clara-Maria
and Merklein, Marion and Meschut, Gerson}, year={2020}, pages={417–423} }'
chicago: 'Uhe, Benedikt, Clara-Maria Kuball, Marion Merklein, and Gerson Meschut.
“Improvement of a Rivet Geometry for the Self-Piercing Riveting of High-Strength
Steel and Multi-Material Joints.” Production Engineering 14 (2020): 417–23.
https://doi.org/10.1007/s11740-020-00973-w.'
ieee: 'B. Uhe, C.-M. Kuball, M. Merklein, and G. Meschut, “Improvement of a rivet
geometry for the self-piercing riveting of high-strength steel and multi-material
joints,” Production Engineering, vol. 14, pp. 417–423, 2020, doi: 10.1007/s11740-020-00973-w.'
mla: Uhe, Benedikt, et al. “Improvement of a Rivet Geometry for the Self-Piercing
Riveting of High-Strength Steel and Multi-Material Joints.” Production Engineering,
vol. 14, 2020, pp. 417–23, doi:10.1007/s11740-020-00973-w.
short: B. Uhe, C.-M. Kuball, M. Merklein, G. Meschut, Production Engineering 14
(2020) 417–423.
date_created: 2020-10-12T08:14:13Z
date_updated: 2026-02-27T10:41:55Z
department:
- _id: '157'
doi: 10.1007/s11740-020-00973-w
intvolume: ' 14'
keyword:
- Self-piercing riveting
- Joining technology
- Rivet geometry
- Multi-material design
- High-strength steel
- Aluminium
language:
- iso: eng
page: 417-423
publication: Production Engineering
publication_status: published
quality_controlled: '1'
status: public
title: Improvement of a rivet geometry for the self-piercing riveting of high-strength
steel and multi-material joints
type: journal_article
user_id: '53912'
volume: 14
year: '2020'
...
---
_id: '19974'
abstract:
- lang: eng
text: Due to the trend towards lightweight design in car body development mechanical
joining technologies become increasingly important. These techniques allow for
the joining of dissimilar materials and thus enable multi-material design, while
thermic joining methods reach their limits. Semi-tubular self-piercing riveting
is an important mechanical joining technology. The rivet production, however,
is costly and time-consuming, as the process consists of several process steps
including the heat treatment and coating of the rivets in order to achieve an
adequate strength and corrosion resistance. The use of high nitrogen steel as
rivet material leads to the possibility of reducing process steps and hence increasing
the efficiency of the process. However, the high tool loads being expected due
to the high strain hardening of the material are a major challenge during the
rivet production. Thus, there is a need for appropriate forming strategies, such
as the manufacturing of the rivets at elevated temperatures. Prior investigations
led to the conclusion that forming already at 200 °C results in a distinct reduction
of the yield strength. To create a deeper understanding of the forming behaviour
of high nitrogen steel at elevated temperatures, compression tests were conducted
in a temperature range between room temperature and 200 °C. The determined true
stress – true strain curves are the basis for the further process and tool design
of the rivet production. Another key factor for the rivet manufacturing at elevated
temperatures is the influence of the process temperature on the tribological conditions.
For this reason, ring compression tests at room temperature and 200 °C are carried
out. The friction factors are determined on the basis of calibration curves resulting
from the numerical analysis of the ring compression process. The investigations
indicate that the friction factor at 200 °C is significantly higher compared to
room temperature. This essential fact has to be taken into account for the process
and tool design for the rivet production using high nitrogen steel.
article_number: '100023'
citation:
ama: Kuball C-M, Jung R, Uhe B, Meschut G, Merklein M, eds. Influence of the
Process Temperature on the Forming Behaviour and the Friction during Bulk Forming
of High Nitrogen Steel. Vol 1.; 2020. doi:10.1016/j.jajp.2020.100023
apa: Kuball, C.-M., Jung, R., Uhe, B., Meschut, G., & Merklein, M. (Eds.). (2020).
Influence of the process temperature on the forming behaviour and the friction
during bulk forming of high nitrogen steel (No. 100023; Vol. 1). https://doi.org/10.1016/j.jajp.2020.100023
bibtex: '@book{Kuball_Jung_Uhe_Meschut_Merklein_2020, series={Journal of Advanced
Joining Processes}, title={Influence of the process temperature on the forming
behaviour and the friction during bulk forming of high nitrogen steel}, volume={1},
DOI={10.1016/j.jajp.2020.100023},
number={100023}, year={2020}, collection={Journal of Advanced Joining Processes}
}'
chicago: Kuball, Clara-Maria, R Jung, Benedikt Uhe, Gerson Meschut, and Marion Merklein,
eds. Influence of the Process Temperature on the Forming Behaviour and the
Friction during Bulk Forming of High Nitrogen Steel. Vol. 1. Journal of Advanced
Joining Processes, 2020. https://doi.org/10.1016/j.jajp.2020.100023.
ieee: C.-M. Kuball, R. Jung, B. Uhe, G. Meschut, and M. Merklein, Eds., Influence
of the process temperature on the forming behaviour and the friction during bulk
forming of high nitrogen steel, vol. 1. 2020.
mla: Kuball, Clara-Maria, et al., editors. Influence of the Process Temperature
on the Forming Behaviour and the Friction during Bulk Forming of High Nitrogen
Steel. 100023, 2020, doi:10.1016/j.jajp.2020.100023.
short: C.-M. Kuball, R. Jung, B. Uhe, G. Meschut, M. Merklein, eds., Influence of
the Process Temperature on the Forming Behaviour and the Friction during Bulk
Forming of High Nitrogen Steel, 2020.
date_created: 2020-10-12T08:23:27Z
date_updated: 2026-02-27T10:45:08Z
department:
- _id: '157'
doi: 10.1016/j.jajp.2020.100023
editor:
- first_name: Clara-Maria
full_name: Kuball, Clara-Maria
last_name: Kuball
- first_name: R
full_name: Jung, R
last_name: Jung
- first_name: Benedikt
full_name: Uhe, Benedikt
id: '38131'
last_name: Uhe
- first_name: Gerson
full_name: Meschut, Gerson
id: '32056'
last_name: Meschut
orcid: 0000-0002-2763-1246
- first_name: Marion
full_name: Merklein, Marion
last_name: Merklein
intvolume: ' 1'
keyword:
- High nitrogen steel
- Self-piercing riveting
- Joining by forming
- Bulk forming
- Strain hardening
language:
- iso: eng
publication_status: published
quality_controlled: '1'
series_title: Journal of Advanced Joining Processes
status: public
title: Influence of the process temperature on the forming behaviour and the friction
during bulk forming of high nitrogen steel
type: conference_editor
user_id: '53912'
volume: 1
year: '2020'
...
---
_id: '4562'
abstract:
- lang: eng
text: Employing main and sector-specific investment-grade CDS indices from the North
American and European CDS market and performing mean-variance out-of-sample analyses
for conservative and aggressive investors over the period from 2006 to 2014, this
paper analyzes portfolio benefits of adding corporate CDS indices to a traditional
financial portfolio consisting of stock and sovereign bond indices. As a baseline
result, we initially find an increase in portfolio (downside) risk-diversification
when adding CDS indices, which is observed irrespective of both CDS markets, investor-types
and different sub-periods, including the global financial crisis and European
sovereign debt crisis. In addition, the analysis reveals higher portfolio excess
returns and performance in CDS index portfolios, however, these effects clearly
differ between markets, investor-types and sub-periods. Overall, portfolio benefits
of adding CDS indices mainly result from the fact that institutional investors
replace sovereign bond indices rather than stock indices by CDS indices due to
better risk-return characteristics. Our baseline findings remain robust under
a variety of robustness checks. Results from sensitivity analyses provide further
important implications for institutional investors with a strategic focus on a
long-term conservative portfolio management.
article_type: original
author:
- first_name: Benjamin
full_name: Hippert, Benjamin
id: '48476'
last_name: Hippert
- first_name: André
full_name: Uhde, André
id: '36049'
last_name: Uhde
orcid: https://orcid.org/0000-0002-8058-8857
- first_name: Sascha Tobias
full_name: Wengerek, Sascha Tobias
id: '48837'
last_name: Wengerek
orcid: 0000-0002-7820-3903
citation:
ama: 'Hippert B, Uhde A, Wengerek ST. Portfolio Benefits of Adding Corporate Credit
Default Swap Indices: Evidence from North America and Europe. Review of Derivatives
Research . 2019;22(2):203-259. doi:https://doi.org/10.1007/s11147-018-9148-8'
apa: 'Hippert, B., Uhde, A., & Wengerek, S. T. (2019). Portfolio Benefits of
Adding Corporate Credit Default Swap Indices: Evidence from North America and
Europe. Review of Derivatives Research , 22(2), 203–259. https://doi.org/10.1007/s11147-018-9148-8'
bibtex: '@article{Hippert_Uhde_Wengerek_2019, title={Portfolio Benefits of Adding
Corporate Credit Default Swap Indices: Evidence from North America and Europe},
volume={22}, DOI={https://doi.org/10.1007/s11147-018-9148-8},
number={2}, journal={Review of Derivatives Research }, author={Hippert, Benjamin
and Uhde, André and Wengerek, Sascha Tobias}, year={2019}, pages={203–259} }'
chicago: 'Hippert, Benjamin, André Uhde, and Sascha Tobias Wengerek. “Portfolio
Benefits of Adding Corporate Credit Default Swap Indices: Evidence from North
America and Europe.” Review of Derivatives Research 22, no. 2 (2019):
203–59. https://doi.org/10.1007/s11147-018-9148-8.'
ieee: 'B. Hippert, A. Uhde, and S. T. Wengerek, “Portfolio Benefits of Adding Corporate
Credit Default Swap Indices: Evidence from North America and Europe,” Review
of Derivatives Research , vol. 22, no. 2, pp. 203–259, 2019, doi: https://doi.org/10.1007/s11147-018-9148-8.'
mla: 'Hippert, Benjamin, et al. “Portfolio Benefits of Adding Corporate Credit Default
Swap Indices: Evidence from North America and Europe.” Review of Derivatives
Research , vol. 22, no. 2, 2019, pp. 203–59, doi:https://doi.org/10.1007/s11147-018-9148-8.'
short: B. Hippert, A. Uhde, S.T. Wengerek, Review of Derivatives Research 22 (2019)
203–259.
date_created: 2018-10-01T12:17:35Z
date_updated: 2022-05-04T06:15:02Z
department:
- _id: '188'
- _id: '186'
doi: https://doi.org/10.1007/s11147-018-9148-8
intvolume: ' 22'
issue: '2'
jel:
- C61
- G01
- G11
- G15
- G23
keyword:
- Corporate credit default swap indices
- Mean-variance asset allocation
- Out-of-sample portfolio optimization
- Portfolio risk-diversification
- Portfolio performance evaluation
language:
- iso: eng
page: 203-259
publication: 'Review of Derivatives Research '
publication_status: published
status: public
title: 'Portfolio Benefits of Adding Corporate Credit Default Swap Indices: Evidence
from North America and Europe'
type: journal_article
user_id: '36049'
volume: 22
year: '2019'
...
---
_id: '48841'
abstract:
- lang: eng
text: We tackle a bi-objective dynamic orienteering problem where customer requests
arise as time passes by. The goal is to minimize the tour length traveled by a
single delivery vehicle while simultaneously keeping the number of dismissed dynamic
customers to a minimum. We propose a dynamic Evolutionary Multi-Objective Algorithm
which is grounded on insights gained from a previous series of work on an a-posteriori
version of the problem, where all request times are known in advance. In our experiments,
we simulate different decision maker strategies and evaluate the development of
the Pareto-front approximations on exemplary problem instances. It turns out,
that despite severely reduced computational budget and no oracle-knowledge of
request times the dynamic EMOA is capable of producing approximations which partially
dominate the results of the a-posteriori EMOA and dynamic integer linear programming
strategies.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Christian
full_name: Grimme, Christian
last_name: Grimme
- first_name: Stephan
full_name: Meisel, Stephan
last_name: Meisel
- first_name: Günter
full_name: Rudolph, Günter
last_name: Rudolph
- first_name: Heike
full_name: Trautmann, Heike
last_name: Trautmann
citation:
ama: 'Bossek J, Grimme C, Meisel S, Rudolph G, Trautmann H. Bi-Objective Orienteering:
Towards a Dynamic Multi-objective Evolutionary Algorithm. In: Deb K, Goodman E,
Coello Coello CA, et al., eds. Evolutionary Multi-Criterion Optimization (EMO).
Lecture Notes in Computer Science. Springer International Publishing; 2019:516–528.
doi:10.1007/978-3-030-12598-1_41'
apa: 'Bossek, J., Grimme, C., Meisel, S., Rudolph, G., & Trautmann, H. (2019).
Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm.
In K. Deb, E. Goodman, C. A. Coello Coello, K. Klamroth, K. Miettinen, S. Mostaghim,
& P. Reed (Eds.), Evolutionary Multi-Criterion Optimization (EMO) (pp.
516–528). Springer International Publishing. https://doi.org/10.1007/978-3-030-12598-1_41'
bibtex: '@inproceedings{Bossek_Grimme_Meisel_Rudolph_Trautmann_2019, place={Cham},
series={Lecture Notes in Computer Science}, title={Bi-Objective Orienteering:
Towards a Dynamic Multi-objective Evolutionary Algorithm}, DOI={10.1007/978-3-030-12598-1_41},
booktitle={Evolutionary Multi-Criterion Optimization (EMO)}, publisher={Springer
International Publishing}, author={Bossek, Jakob and Grimme, Christian and Meisel,
Stephan and Rudolph, Günter and Trautmann, Heike}, editor={Deb, Kalyanmoy and
Goodman, Erik and Coello Coello, Carlos A. and Klamroth, Kathrin and Miettinen,
Kaisa and Mostaghim, Sanaz and Reed, Patrick}, year={2019}, pages={516–528}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Bossek, Jakob, Christian Grimme, Stephan Meisel, Günter Rudolph, and Heike
Trautmann. “Bi-Objective Orienteering: Towards a Dynamic Multi-Objective Evolutionary
Algorithm.” In Evolutionary Multi-Criterion Optimization (EMO), edited
by Kalyanmoy Deb, Erik Goodman, Carlos A. Coello Coello, Kathrin Klamroth, Kaisa
Miettinen, Sanaz Mostaghim, and Patrick Reed, 516–528. Lecture Notes in Computer
Science. Cham: Springer International Publishing, 2019. https://doi.org/10.1007/978-3-030-12598-1_41.'
ieee: 'J. Bossek, C. Grimme, S. Meisel, G. Rudolph, and H. Trautmann, “Bi-Objective
Orienteering: Towards a Dynamic Multi-objective Evolutionary Algorithm,” in Evolutionary
Multi-Criterion Optimization (EMO), 2019, pp. 516–528, doi: 10.1007/978-3-030-12598-1_41.'
mla: 'Bossek, Jakob, et al. “Bi-Objective Orienteering: Towards a Dynamic Multi-Objective
Evolutionary Algorithm.” Evolutionary Multi-Criterion Optimization (EMO),
edited by Kalyanmoy Deb et al., Springer International Publishing, 2019, pp. 516–528,
doi:10.1007/978-3-030-12598-1_41.'
short: 'J. Bossek, C. Grimme, S. Meisel, G. Rudolph, H. Trautmann, in: K. Deb, E.
Goodman, C.A. Coello Coello, K. Klamroth, K. Miettinen, S. Mostaghim, P. Reed
(Eds.), Evolutionary Multi-Criterion Optimization (EMO), Springer International
Publishing, Cham, 2019, pp. 516–528.'
date_created: 2023-11-14T15:58:52Z
date_updated: 2023-12-13T10:43:07Z
department:
- _id: '819'
doi: 10.1007/978-3-030-12598-1_41
editor:
- first_name: Kalyanmoy
full_name: Deb, Kalyanmoy
last_name: Deb
- first_name: Erik
full_name: Goodman, Erik
last_name: Goodman
- first_name: Carlos A.
full_name: Coello Coello, Carlos A.
last_name: Coello Coello
- first_name: Kathrin
full_name: Klamroth, Kathrin
last_name: Klamroth
- first_name: Kaisa
full_name: Miettinen, Kaisa
last_name: Miettinen
- first_name: Sanaz
full_name: Mostaghim, Sanaz
last_name: Mostaghim
- first_name: Patrick
full_name: Reed, Patrick
last_name: Reed
extern: '1'
keyword:
- Combinatorial optimization
- Dynamic optimization
- Metaheuristics
- Multi-objective optimization
- Vehicle routing
language:
- iso: eng
page: 516–528
place: Cham
publication: Evolutionary Multi-Criterion Optimization (EMO)
publication_identifier:
isbn:
- 978-3-030-12598-1
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: 'Bi-Objective Orienteering: Towards a Dynamic Multi-objective Evolutionary
Algorithm'
type: conference
user_id: '102979'
year: '2019'
...
---
_id: '48842'
abstract:
- lang: eng
text: 'Evolutionary algorithms have successfully been applied to evolve problem
instances that exhibit a significant difference in performance for a given algorithm
or a pair of algorithms inter alia for the Traveling Salesperson Problem (TSP).
Creating a large variety of instances is crucial for successful applications in
the blooming field of algorithm selection. In this paper, we introduce new and
creative mutation operators for evolving instances of the TSP. We show that adopting
those operators in an evolutionary algorithm allows for the generation of benchmark
sets with highly desirable properties: (1) novelty by clear visual distinction
to established benchmark sets in the field, (2) visual and quantitative diversity
in the space of TSP problem characteristics, and (3) significant performance differences
with respect to the restart versions of heuristic state-of-the-art TSP solvers
EAX and LKH. The important aspect of diversity is addressed and achieved solely
by the proposed mutation operators and not enforced by explicit diversity preservation.'
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
- first_name: Aneta
full_name: Neumann, Aneta
last_name: Neumann
- first_name: Markus
full_name: Wagner, Markus
last_name: Wagner
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
- first_name: Heike
full_name: Trautmann, Heike
last_name: Trautmann
citation:
ama: 'Bossek J, Kerschke P, Neumann A, Wagner M, Neumann F, Trautmann H. Evolving
Diverse TSP Instances by Means of Novel and Creative Mutation Operators. In: Proceedings
of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms. FOGA
’19. Association for Computing Machinery; 2019:58–71. doi:10.1145/3299904.3340307'
apa: Bossek, J., Kerschke, P., Neumann, A., Wagner, M., Neumann, F., & Trautmann,
H. (2019). Evolving Diverse TSP Instances by Means of Novel and Creative Mutation
Operators. Proceedings of the 15th ACM/SIGEVO Conference on Foundations of
Genetic Algorithms, 58–71. https://doi.org/10.1145/3299904.3340307
bibtex: '@inproceedings{Bossek_Kerschke_Neumann_Wagner_Neumann_Trautmann_2019, place={New
York, NY, USA}, series={FOGA ’19}, title={Evolving Diverse TSP Instances by Means
of Novel and Creative Mutation Operators}, DOI={10.1145/3299904.3340307},
booktitle={Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic
Algorithms}, publisher={Association for Computing Machinery}, author={Bossek,
Jakob and Kerschke, Pascal and Neumann, Aneta and Wagner, Markus and Neumann,
Frank and Trautmann, Heike}, year={2019}, pages={58–71}, collection={FOGA ’19}
}'
chicago: 'Bossek, Jakob, Pascal Kerschke, Aneta Neumann, Markus Wagner, Frank Neumann,
and Heike Trautmann. “Evolving Diverse TSP Instances by Means of Novel and Creative
Mutation Operators.” In Proceedings of the 15th ACM/SIGEVO Conference on Foundations
of Genetic Algorithms, 58–71. FOGA ’19. New York, NY, USA: Association for
Computing Machinery, 2019. https://doi.org/10.1145/3299904.3340307.'
ieee: 'J. Bossek, P. Kerschke, A. Neumann, M. Wagner, F. Neumann, and H. Trautmann,
“Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators,”
in Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic
Algorithms, 2019, pp. 58–71, doi: 10.1145/3299904.3340307.'
mla: Bossek, Jakob, et al. “Evolving Diverse TSP Instances by Means of Novel and
Creative Mutation Operators.” Proceedings of the 15th ACM/SIGEVO Conference
on Foundations of Genetic Algorithms, Association for Computing Machinery,
2019, pp. 58–71, doi:10.1145/3299904.3340307.
short: 'J. Bossek, P. Kerschke, A. Neumann, M. Wagner, F. Neumann, H. Trautmann,
in: Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic Algorithms,
Association for Computing Machinery, New York, NY, USA, 2019, pp. 58–71.'
date_created: 2023-11-14T15:58:52Z
date_updated: 2023-12-13T10:42:57Z
department:
- _id: '819'
doi: 10.1145/3299904.3340307
extern: '1'
keyword:
- benchmarking
- instance features
- optimization
- problem generation
- traveling salesperson problem
language:
- iso: eng
page: 58–71
place: New York, NY, USA
publication: Proceedings of the 15th ACM/SIGEVO Conference on Foundations of Genetic
Algorithms
publication_identifier:
isbn:
- 978-1-4503-6254-2
publication_status: published
publisher: Association for Computing Machinery
series_title: FOGA ’19
status: public
title: Evolving Diverse TSP Instances by Means of Novel and Creative Mutation Operators
type: conference
user_id: '102979'
year: '2019'
...
---
_id: '48843'
abstract:
- lang: eng
text: We contribute to the theoretical understanding of randomized search heuristics
for dynamic problems. We consider the classical graph coloring problem and investigate
the dynamic setting where edges are added to the current graph. We then analyze
the expected time for randomized search heuristics to recompute high quality solutions.
This includes the (1+1) EA and RLS in a setting where the number of colors is
bounded and we are minimizing the number of conflicts as well as iterated local
search algorithms that use an unbounded color palette and aim to use the smallest
colors and - as a consequence - the smallest number of colors. We identify classes
of bipartite graphs where reoptimization is as hard as or even harder than optimization
from scratch, i. e. starting with a random initialization. Even adding a single
edge can lead to hard symmetry problems. However, graph classes that are hard
for one algorithm turn out to be easy for others. In most cases our bounds show
that reoptimization is faster than optimizing from scratch. Furthermore, we show
how to speed up computations by using problem specific operators concentrating
on parts of the graph where changes have occurred.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
- first_name: Pan
full_name: Peng, Pan
last_name: Peng
- first_name: Dirk
full_name: Sudholt, Dirk
last_name: Sudholt
citation:
ama: 'Bossek J, Neumann F, Peng P, Sudholt D. Runtime Analysis of Randomized Search
Heuristics for Dynamic Graph Coloring. In: Proceedings of the Genetic and Evolutionary
Computation Conference. GECCO ’19. Association for Computing Machinery; 2019:1443–1451.
doi:10.1145/3321707.3321792'
apa: Bossek, J., Neumann, F., Peng, P., & Sudholt, D. (2019). Runtime Analysis
of Randomized Search Heuristics for Dynamic Graph Coloring. Proceedings of
the Genetic and Evolutionary Computation Conference, 1443–1451. https://doi.org/10.1145/3321707.3321792
bibtex: '@inproceedings{Bossek_Neumann_Peng_Sudholt_2019, place={New York, NY, USA},
series={GECCO ’19}, title={Runtime Analysis of Randomized Search Heuristics for
Dynamic Graph Coloring}, DOI={10.1145/3321707.3321792},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
publisher={Association for Computing Machinery}, author={Bossek, Jakob and Neumann,
Frank and Peng, Pan and Sudholt, Dirk}, year={2019}, pages={1443–1451}, collection={GECCO
’19} }'
chicago: 'Bossek, Jakob, Frank Neumann, Pan Peng, and Dirk Sudholt. “Runtime Analysis
of Randomized Search Heuristics for Dynamic Graph Coloring.” In Proceedings
of the Genetic and Evolutionary Computation Conference, 1443–1451. GECCO ’19.
New York, NY, USA: Association for Computing Machinery, 2019. https://doi.org/10.1145/3321707.3321792.'
ieee: 'J. Bossek, F. Neumann, P. Peng, and D. Sudholt, “Runtime Analysis of Randomized
Search Heuristics for Dynamic Graph Coloring,” in Proceedings of the Genetic
and Evolutionary Computation Conference, 2019, pp. 1443–1451, doi: 10.1145/3321707.3321792.'
mla: Bossek, Jakob, et al. “Runtime Analysis of Randomized Search Heuristics for
Dynamic Graph Coloring.” Proceedings of the Genetic and Evolutionary Computation
Conference, Association for Computing Machinery, 2019, pp. 1443–1451, doi:10.1145/3321707.3321792.
short: 'J. Bossek, F. Neumann, P. Peng, D. Sudholt, in: Proceedings of the Genetic
and Evolutionary Computation Conference, Association for Computing Machinery,
New York, NY, USA, 2019, pp. 1443–1451.'
date_created: 2023-11-14T15:58:52Z
date_updated: 2023-12-13T10:42:37Z
department:
- _id: '819'
doi: 10.1145/3321707.3321792
extern: '1'
keyword:
- dynamic optimization
- evolutionary algorithms
- running time analysis
- theory
language:
- iso: eng
page: 1443–1451
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- 978-1-4503-6111-8
publication_status: published
publisher: Association for Computing Machinery
series_title: GECCO ’19
status: public
title: Runtime Analysis of Randomized Search Heuristics for Dynamic Graph Coloring
type: conference
user_id: '102979'
year: '2019'
...