---
_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: '48844'
abstract:
- lang: eng
text: The Traveling-Salesperson-Problem (TSP) is arguably one of the best-known
NP-hard combinatorial optimization problems. The two sophisticated heuristic solvers
LKH and EAX and respective (restart) variants manage to calculate close-to optimal
or even optimal solutions, also for large instances with several thousand nodes
in reasonable time. In this work we extend existing benchmarking studies by addressing
anytime behaviour of inexact TSP solvers based on empirical runtime distributions
leading to an increased understanding of solver behaviour and the respective relation
to problem hardness. It turns out that performance ranking of solvers is highly
dependent on the focused approximation quality. Insights on intersection points
of performances offer huge potential for the construction of hybridized solvers
depending on instance features. Moreover, instance features tailored to anytime
performance and corresponding performance indicators will highly improve automated
algorithm selection models by including comprehensive information on solver quality.
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. Anytime Behavior of Inexact TSP Solvers
and Perspectives for Automated Algorithm Selection. In: 2020 IEEE Congress
on Evolutionary Computation (CEC). IEEE Press; 2020:1–8. doi:10.1109/CEC48606.2020.9185613'
apa: Bossek, J., Kerschke, P., & Trautmann, H. (2020). Anytime Behavior of Inexact
TSP Solvers and Perspectives for Automated Algorithm Selection. 2020 IEEE Congress
on Evolutionary Computation (CEC), 1–8. https://doi.org/10.1109/CEC48606.2020.9185613
bibtex: '@inproceedings{Bossek_Kerschke_Trautmann_2020, place={Glasgow, United Kingdom},
title={Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated
Algorithm Selection}, DOI={10.1109/CEC48606.2020.9185613},
booktitle={2020 IEEE Congress on Evolutionary Computation (CEC)}, publisher={IEEE
Press}, author={Bossek, Jakob and Kerschke, Pascal and Trautmann, Heike}, year={2020},
pages={1–8} }'
chicago: 'Bossek, Jakob, Pascal Kerschke, and Heike Trautmann. “Anytime Behavior
of Inexact TSP Solvers and Perspectives for Automated Algorithm Selection.” In
2020 IEEE Congress on Evolutionary Computation (CEC), 1–8. Glasgow, United
Kingdom: IEEE Press, 2020. https://doi.org/10.1109/CEC48606.2020.9185613.'
ieee: 'J. Bossek, P. Kerschke, and H. Trautmann, “Anytime Behavior of Inexact TSP
Solvers and Perspectives for Automated Algorithm Selection,” in 2020 IEEE Congress
on Evolutionary Computation (CEC), 2020, pp. 1–8, doi: 10.1109/CEC48606.2020.9185613.'
mla: Bossek, Jakob, et al. “Anytime Behavior of Inexact TSP Solvers and Perspectives
for Automated Algorithm Selection.” 2020 IEEE Congress on Evolutionary Computation
(CEC), IEEE Press, 2020, pp. 1–8, doi:10.1109/CEC48606.2020.9185613.
short: 'J. Bossek, P. Kerschke, H. Trautmann, in: 2020 IEEE Congress on Evolutionary
Computation (CEC), IEEE Press, Glasgow, United Kingdom, 2020, pp. 1–8.'
date_created: 2023-11-14T15:58:52Z
date_updated: 2023-12-13T10:43:16Z
department:
- _id: '819'
doi: 10.1109/CEC48606.2020.9185613
extern: '1'
language:
- iso: eng
page: 1–8
place: Glasgow, United Kingdom
publication: 2020 IEEE Congress on Evolutionary Computation (CEC)
publication_status: published
publisher: IEEE Press
status: public
title: Anytime Behavior of Inexact TSP Solvers and Perspectives for Automated Algorithm
Selection
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: '48852'
abstract:
- lang: eng
text: The Traveling Salesperson Problem (TSP) is one of the best-known combinatorial
optimisation problems. However, many real-world problems are composed of several
interacting components. The Traveling Thief Problem (TTP) addresses such interactions
by combining two combinatorial optimisation problems, namely the TSP and the Knapsack
Problem (KP). Recently, a new problem called the node weight dependent Traveling
Salesperson Problem (W-TSP) has been introduced where nodes have weights that
influence the cost of the tour. In this paper, we compare W-TSP and TTP. We investigate
the structure of the optimised tours for W-TSP and TTP and the impact of using
each others fitness function. Our experimental results suggest (1) that the W-TSP
often can be solved better using the TTP fitness function and (2) final W-TSP
and TTP solutions show different distributions when compared with optimal TSP
or weighted greedy solutions.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Aneta
full_name: Neumann, Aneta
last_name: Neumann
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
citation:
ama: 'Bossek J, Neumann A, Neumann F. Optimising Tours for the Weighted Traveling
Salesperson Problem and the Traveling Thief Problem: A Structural Comparison of
Solutions. In: Parallel Problem Solving from Nature (PPSN XVI). Springer-Verlag;
2020:346–359. doi:10.1007/978-3-030-58112-1_24'
apa: 'Bossek, J., Neumann, A., & Neumann, F. (2020). Optimising Tours for the
Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A Structural
Comparison of Solutions. Parallel Problem Solving from Nature (PPSN XVI),
346–359. https://doi.org/10.1007/978-3-030-58112-1_24'
bibtex: '@inproceedings{Bossek_Neumann_Neumann_2020, place={Berlin, Heidelberg},
title={Optimising Tours for the Weighted Traveling Salesperson Problem and the
Traveling Thief Problem: A Structural Comparison of Solutions}, DOI={10.1007/978-3-030-58112-1_24},
booktitle={Parallel Problem Solving from Nature (PPSN XVI)}, publisher={Springer-Verlag},
author={Bossek, Jakob and Neumann, Aneta and Neumann, Frank}, year={2020}, pages={346–359}
}'
chicago: 'Bossek, Jakob, Aneta Neumann, and Frank Neumann. “Optimising Tours for
the Weighted Traveling Salesperson Problem and the Traveling Thief Problem: A
Structural Comparison of Solutions.” In Parallel Problem Solving from Nature
(PPSN XVI), 346–359. Berlin, Heidelberg: Springer-Verlag, 2020. https://doi.org/10.1007/978-3-030-58112-1_24.'
ieee: 'J. Bossek, A. Neumann, and F. Neumann, “Optimising Tours for the Weighted
Traveling Salesperson Problem and the Traveling Thief Problem: A Structural Comparison
of Solutions,” in Parallel Problem Solving from Nature (PPSN XVI), 2020,
pp. 346–359, doi: 10.1007/978-3-030-58112-1_24.'
mla: 'Bossek, Jakob, et al. “Optimising Tours for the Weighted Traveling Salesperson
Problem and the Traveling Thief Problem: A Structural Comparison of Solutions.”
Parallel Problem Solving from Nature (PPSN XVI), Springer-Verlag, 2020,
pp. 346–359, doi:10.1007/978-3-030-58112-1_24.'
short: 'J. Bossek, A. Neumann, F. Neumann, in: Parallel Problem Solving from Nature
(PPSN XVI), Springer-Verlag, Berlin, Heidelberg, 2020, pp. 346–359.'
date_created: 2023-11-14T15:58:54Z
date_updated: 2023-12-13T10:44:54Z
department:
- _id: '819'
doi: 10.1007/978-3-030-58112-1_24
extern: '1'
keyword:
- Evolutionary algorithms
- Node weight dependent TSP
- Traveling Thief Problem
language:
- iso: eng
page: 346–359
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: 'Optimising Tours for the Weighted Traveling Salesperson Problem and the Traveling
Thief Problem: A Structural Comparison of Solutions'
type: conference
user_id: '102979'
year: '2020'
...
---
_id: '48846'
abstract:
- lang: eng
text: We consider a dynamic bi-objective vehicle routing problem, where a subset
of customers ask for service over time. Therein, the distance traveled by a single
vehicle and the number of unserved dynamic requests is minimized by a dynamic
evolutionary multi-objective algorithm (DEMOA), which operates on discrete time
windows (eras). A decision is made at each era by a decision-maker, thus any decision
depends on irreversible decisions made in foregoing eras. To understand effects
of sequences of decision-making and interactions/dependencies between decisions
made, we conduct a series of experiments. More precisely, we fix a set of decision-maker
preferences D and the number of eras n{$<$}inf{$>$}t{$<$}/inf{$>$} and analyze
all $|D|\^{n_t}$ combinations of decision-maker options. We find that for random
uniform instances (a) the final selected solutions mainly depend on the final
decision and not on the decision history, (b) solutions are quite robust with
respect to the number of unvisited dynamic customers, and (c) solutions of the
dynamic approach can even dominate solutions obtained by a clairvoyant EMOA. In
contrast, for instances with clustered customers, we observe a strong dependency
on decision-making history as well as more variance in solution diversity.
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: 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, Rudolph G, Trautmann H. Towards Decision Support in Dynamic
Bi-Objective Vehicle Routing. In: 2020 IEEE Congress on Evolutionary Computation
(CEC). IEEE Press; 2020:1–8. doi:10.1109/CEC48606.2020.9185778'
apa: Bossek, J., Grimme, C., Rudolph, G., & Trautmann, H. (2020). Towards Decision
Support in Dynamic Bi-Objective Vehicle Routing. 2020 IEEE Congress on Evolutionary
Computation (CEC), 1–8. https://doi.org/10.1109/CEC48606.2020.9185778
bibtex: '@inproceedings{Bossek_Grimme_Rudolph_Trautmann_2020, place={Glasgow, United
Kingdom}, title={Towards Decision Support in Dynamic Bi-Objective Vehicle Routing},
DOI={10.1109/CEC48606.2020.9185778},
booktitle={2020 IEEE Congress on Evolutionary Computation (CEC)}, publisher={IEEE
Press}, author={Bossek, Jakob and Grimme, Christian and Rudolph, Günter and Trautmann,
Heike}, year={2020}, pages={1–8} }'
chicago: 'Bossek, Jakob, Christian Grimme, Günter Rudolph, and Heike Trautmann.
“Towards Decision Support in Dynamic Bi-Objective Vehicle Routing.” In 2020
IEEE Congress on Evolutionary Computation (CEC), 1–8. Glasgow, United Kingdom:
IEEE Press, 2020. https://doi.org/10.1109/CEC48606.2020.9185778.'
ieee: 'J. Bossek, C. Grimme, G. Rudolph, and H. Trautmann, “Towards Decision Support
in Dynamic Bi-Objective Vehicle Routing,” in 2020 IEEE Congress on Evolutionary
Computation (CEC), 2020, pp. 1–8, doi: 10.1109/CEC48606.2020.9185778.'
mla: Bossek, Jakob, et al. “Towards Decision Support in Dynamic Bi-Objective Vehicle
Routing.” 2020 IEEE Congress on Evolutionary Computation (CEC), IEEE Press,
2020, pp. 1–8, doi:10.1109/CEC48606.2020.9185778.
short: 'J. Bossek, C. Grimme, G. Rudolph, H. Trautmann, in: 2020 IEEE Congress on
Evolutionary Computation (CEC), IEEE Press, Glasgow, United Kingdom, 2020, pp.
1–8.'
date_created: 2023-11-14T15:58:53Z
date_updated: 2023-12-13T10:44:17Z
department:
- _id: '819'
doi: 10.1109/CEC48606.2020.9185778
extern: '1'
language:
- iso: eng
page: 1–8
place: Glasgow, United Kingdom
publication: 2020 IEEE Congress on Evolutionary Computation (CEC)
publication_status: published
publisher: IEEE Press
status: public
title: Towards Decision Support in Dynamic Bi-Objective Vehicle Routing
type: conference
user_id: '102979'
year: '2020'
...
---
_id: '48879'
abstract:
- lang: eng
text: Evolving diverse sets of high quality solutions has gained increasing interest
in the evolutionary computation literature in recent years. With this paper, we
contribute to this area of research by examining evolutionary diversity optimisation
approaches for the classical Traveling Salesperson Problem (TSP). We study the
impact of using different diversity measures for a given set of tours and the
ability of evolutionary algorithms to obtain a diverse set of high quality solutions
when adopting these measures. Our studies show that a large variety of diverse
high quality tours can be achieved by using our approaches. Furthermore, we compare
our approaches in terms of theoretical properties and the final set of tours obtained
by the evolutionary diversity optimisation algorithm.
author:
- first_name: Anh Viet
full_name: Do, Anh Viet
last_name: Do
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Aneta
full_name: Neumann, Aneta
last_name: Neumann
- first_name: Frank
full_name: Neumann, Frank
last_name: Neumann
citation:
ama: 'Do AV, Bossek J, Neumann A, Neumann F. Evolving Diverse Sets of Tours for
the Travelling Salesperson Problem. In: Proceedings of the Genetic and Evolutionary
Computation Conference. GECCO’20. Association for Computing Machinery; 2020:681–689.
doi:10.1145/3377930.3389844'
apa: Do, A. V., Bossek, J., Neumann, A., & Neumann, F. (2020). Evolving Diverse
Sets of Tours for the Travelling Salesperson Problem. Proceedings of the Genetic
and Evolutionary Computation Conference, 681–689. https://doi.org/10.1145/3377930.3389844
bibtex: '@inproceedings{Do_Bossek_Neumann_Neumann_2020, place={New York, NY, USA},
series={GECCO’20}, title={Evolving Diverse Sets of Tours for the Travelling Salesperson
Problem}, DOI={10.1145/3377930.3389844},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
publisher={Association for Computing Machinery}, author={Do, Anh Viet and Bossek,
Jakob and Neumann, Aneta and Neumann, Frank}, year={2020}, pages={681–689}, collection={GECCO’20}
}'
chicago: 'Do, Anh Viet, Jakob Bossek, Aneta Neumann, and Frank Neumann. “Evolving
Diverse Sets of Tours for the Travelling Salesperson Problem.” In Proceedings
of the Genetic and Evolutionary Computation Conference, 681–689. GECCO’20.
New York, NY, USA: Association for Computing Machinery, 2020. https://doi.org/10.1145/3377930.3389844.'
ieee: 'A. V. Do, J. Bossek, A. Neumann, and F. Neumann, “Evolving Diverse Sets of
Tours for the Travelling Salesperson Problem,” in Proceedings of the Genetic
and Evolutionary Computation Conference, 2020, pp. 681–689, doi: 10.1145/3377930.3389844.'
mla: Do, Anh Viet, et al. “Evolving Diverse Sets of Tours for the Travelling Salesperson
Problem.” Proceedings of the Genetic and Evolutionary Computation Conference,
Association for Computing Machinery, 2020, pp. 681–689, doi:10.1145/3377930.3389844.
short: 'A.V. Do, J. Bossek, A. Neumann, F. Neumann, in: Proceedings of the Genetic
and Evolutionary Computation Conference, Association for Computing Machinery,
New York, NY, USA, 2020, pp. 681–689.'
date_created: 2023-11-14T15:58:58Z
date_updated: 2023-12-13T10:48:50Z
department:
- _id: '819'
doi: 10.1145/3377930.3389844
extern: '1'
keyword:
- diversity maximisation
- evolutionary algorithms
- travelling salesperson problem
language:
- iso: eng
page: 681–689
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- 978-1-4503-7128-5
publisher: Association for Computing Machinery
series_title: GECCO’20
status: public
title: Evolving Diverse Sets of Tours for the Travelling Salesperson Problem
type: conference
user_id: '102979'
year: '2020'
...
---
_id: '48895'
abstract:
- lang: eng
text: Evolutionary algorithms (EAs) are general-purpose problem solvers that usually
perform an unbiased search. This is reasonable and desirable in a black-box scenario.
For combinatorial optimization problems, often more knowledge about the structure
of optimal solutions is given, which can be leveraged by means of biased search
operators. We consider the Minimum Spanning Tree (MST) problem in a single- and
multi-objective version, and introduce a biased mutation, which puts more emphasis
on the selection of edges of low rank in terms of low domination number. We present
example graphs where the biased mutation can significantly speed up the expected
runtime until (Pareto-)optimal solutions are found. On the other hand, we demonstrate
that bias can lead to exponential runtime if "heavy" edges are necessarily part
of an optimal solution. However, on general graphs in the single-objective setting,
we show that a combined mutation operator which decides for unbiased or biased
edge selection in each step with equal probability exhibits a polynomial upper
bound - as unbiased mutation - in the worst case and benefits from bias if the
circumstances are favorable.
author:
- first_name: Vahid
full_name: Roostapour, Vahid
last_name: Roostapour
- 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
citation:
ama: 'Roostapour V, Bossek J, Neumann F. Runtime Analysis of Evolutionary Algorithms
with Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem. In:
Proceedings of the 2020 Genetic and Evolutionary Computation Conference.
{GECCO} ’20. Association for Computing Machinery; 2020:551–559. doi:10.1145/3377930.3390168'
apa: Roostapour, V., Bossek, J., & Neumann, F. (2020). Runtime Analysis of Evolutionary
Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree
Problem. Proceedings of the 2020 Genetic and Evolutionary Computation Conference,
551–559. https://doi.org/10.1145/3377930.3390168
bibtex: '@inproceedings{Roostapour_Bossek_Neumann_2020, place={New York, NY, USA},
series={{GECCO} ’20}, title={Runtime Analysis of Evolutionary Algorithms with
Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem}, DOI={10.1145/3377930.3390168}, booktitle={Proceedings
of the 2020 Genetic and Evolutionary Computation Conference}, publisher={Association
for Computing Machinery}, author={Roostapour, Vahid and Bossek, Jakob and Neumann,
Frank}, year={2020}, pages={551–559}, collection={{GECCO} ’20} }'
chicago: 'Roostapour, Vahid, Jakob Bossek, and Frank Neumann. “Runtime Analysis
of Evolutionary Algorithms with Biased Mutation for the Multi-Objective Minimum
Spanning Tree Problem.” In Proceedings of the 2020 Genetic and Evolutionary
Computation Conference, 551–559. {GECCO} ’20. New York, NY, USA: Association
for Computing Machinery, 2020. https://doi.org/10.1145/3377930.3390168.'
ieee: 'V. Roostapour, J. Bossek, and F. Neumann, “Runtime Analysis of Evolutionary
Algorithms with Biased Mutation for the Multi-Objective Minimum Spanning Tree
Problem,” in Proceedings of the 2020 Genetic and Evolutionary Computation Conference,
2020, pp. 551–559, doi: 10.1145/3377930.3390168.'
mla: Roostapour, Vahid, et al. “Runtime Analysis of Evolutionary Algorithms with
Biased Mutation for the Multi-Objective Minimum Spanning Tree Problem.” Proceedings
of the 2020 Genetic and Evolutionary Computation Conference, Association for
Computing Machinery, 2020, pp. 551–559, doi:10.1145/3377930.3390168.
short: 'V. Roostapour, J. Bossek, F. Neumann, in: Proceedings of the 2020 Genetic
and Evolutionary Computation Conference, Association for Computing Machinery,
New York, NY, USA, 2020, pp. 551–559.'
date_created: 2023-11-14T15:59:00Z
date_updated: 2023-12-13T10:49:38Z
department:
- _id: '819'
doi: 10.1145/3377930.3390168
extern: '1'
keyword:
- biased mutation
- evolutionary algorithms
- minimum spanning tree problem
- runtime analysis
language:
- iso: eng
page: 551–559
place: New York, NY, USA
publication: Proceedings of the 2020 Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- 978-1-4503-7128-5
publisher: Association for Computing Machinery
series_title: '{GECCO} ’20'
status: public
title: Runtime Analysis of Evolutionary Algorithms with Biased Mutation for the Multi-Objective
Minimum Spanning Tree Problem
type: conference
user_id: '102979'
year: '2020'
...
---
_id: '48897'
abstract:
- lang: eng
text: 'In this work we focus on the well-known Euclidean Traveling Salesperson Problem
(TSP) and two highly competitive inexact heuristic TSP solvers, EAX and LKH, in
the context of per-instance algorithm selection (AS). We evolve instances with
nodes where the solvers show strongly different performance profiles. These instances
serve as a basis for an exploratory study on the identification of well-discriminating
problem characteristics (features). Our results in a nutshell: we show that even
though (1) promising features exist, (2) these are in line with previous results
from the literature, and (3) models trained with these features are more accurate
than models adopting sophisticated feature selection methods, the advantage is
not close to the virtual best solver in terms of penalized average runtime and
so is the performance gain over the single best solver. However, we show that
a feature-free deep neural network based approach solely based on visual representation
of the instances already matches classical AS model results and thus shows huge
potential for future studies.'
author:
- first_name: Moritz
full_name: Seiler, Moritz
last_name: Seiler
- first_name: Janina
full_name: Pohl, Janina
last_name: Pohl
- 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: 'Seiler M, Pohl J, Bossek J, Kerschke P, Trautmann H. Deep Learning as a Competitive
Feature-Free Approach for Automated Algorithm Selection on the Traveling Salesperson
Problem. In: Parallel Problem Solving from {Nature} (PPSN XVI). Springer-Verlag;
2020:48–64. doi:10.1007/978-3-030-58112-1_4'
apa: Seiler, M., Pohl, J., Bossek, J., Kerschke, P., & Trautmann, H. (2020).
Deep Learning as a Competitive Feature-Free Approach for Automated Algorithm Selection
on the Traveling Salesperson Problem. Parallel Problem Solving from {Nature}
(PPSN XVI), 48–64. https://doi.org/10.1007/978-3-030-58112-1_4
bibtex: '@inproceedings{Seiler_Pohl_Bossek_Kerschke_Trautmann_2020, place={Berlin,
Heidelberg}, title={Deep Learning as a Competitive Feature-Free Approach for Automated
Algorithm Selection on the Traveling Salesperson Problem}, DOI={10.1007/978-3-030-58112-1_4},
booktitle={Parallel Problem Solving from {Nature} (PPSN XVI)}, publisher={Springer-Verlag},
author={Seiler, Moritz and Pohl, Janina and Bossek, Jakob and Kerschke, Pascal
and Trautmann, Heike}, year={2020}, pages={48–64} }'
chicago: 'Seiler, Moritz, Janina Pohl, Jakob Bossek, Pascal Kerschke, and Heike
Trautmann. “Deep Learning as a Competitive Feature-Free Approach for Automated
Algorithm Selection on the Traveling Salesperson Problem.” In Parallel Problem
Solving from {Nature} (PPSN XVI), 48–64. Berlin, Heidelberg: Springer-Verlag,
2020. https://doi.org/10.1007/978-3-030-58112-1_4.'
ieee: 'M. Seiler, J. Pohl, J. Bossek, P. Kerschke, and H. Trautmann, “Deep Learning
as a Competitive Feature-Free Approach for Automated Algorithm Selection on the
Traveling Salesperson Problem,” in Parallel Problem Solving from {Nature} (PPSN
XVI), 2020, pp. 48–64, doi: 10.1007/978-3-030-58112-1_4.'
mla: Seiler, Moritz, et al. “Deep Learning as a Competitive Feature-Free Approach
for Automated Algorithm Selection on the Traveling Salesperson Problem.” Parallel
Problem Solving from {Nature} (PPSN XVI), Springer-Verlag, 2020, pp. 48–64,
doi:10.1007/978-3-030-58112-1_4.
short: 'M. Seiler, J. Pohl, J. Bossek, P. Kerschke, H. Trautmann, in: Parallel Problem
Solving from {Nature} (PPSN XVI), Springer-Verlag, Berlin, Heidelberg, 2020, pp.
48–64.'
date_created: 2023-11-14T15:59:00Z
date_updated: 2023-12-13T10:49:45Z
department:
- _id: '819'
doi: 10.1007/978-3-030-58112-1_4
extern: '1'
keyword:
- Automated algorithm selection
- Deep learning
- Feature-based approaches
- Traveling Salesperson Problem
language:
- iso: eng
page: 48–64
place: Berlin, Heidelberg
publication: Parallel Problem Solving from {Nature} (PPSN XVI)
publication_identifier:
isbn:
- 978-3-030-58111-4
publisher: Springer-Verlag
status: public
title: Deep Learning as a Competitive Feature-Free Approach for Automated Algorithm
Selection on the Traveling Salesperson Problem
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: '48836'
author:
- first_name: Thomas
full_name: Bartz-Beielstein, Thomas
last_name: Bartz-Beielstein
- first_name: Carola
full_name: Doerr, Carola
last_name: Doerr
- first_name: Daan
full_name: van den Berg, Daan
last_name: van den Berg
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Sowmya
full_name: Chandrasekaran, Sowmya
last_name: Chandrasekaran
- first_name: Tome
full_name: Eftimov, Tome
last_name: Eftimov
- first_name: Andreas
full_name: Fischbach, Andreas
last_name: Fischbach
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
- first_name: William La
full_name: Cava, William La
last_name: Cava
- first_name: Manuel
full_name: Lopez-Ibanez, Manuel
last_name: Lopez-Ibanez
- first_name: Katherine M.
full_name: Malan, Katherine M.
last_name: Malan
- first_name: Jason H.
full_name: Moore, Jason H.
last_name: Moore
- first_name: Boris
full_name: Naujoks, Boris
last_name: Naujoks
- first_name: Patryk
full_name: Orzechowski, Patryk
last_name: Orzechowski
- first_name: Vanessa
full_name: Volz, Vanessa
last_name: Volz
- first_name: Markus
full_name: Wagner, Markus
last_name: Wagner
- first_name: Thomas
full_name: Weise, Thomas
last_name: Weise
citation:
ama: 'Bartz-Beielstein T, Doerr C, van den Berg D, et al. Benchmarking in Optimization:
Best Practice and Open Issues. Corr. Published online 2020.'
apa: 'Bartz-Beielstein, T., Doerr, C., van den Berg, D., Bossek, J., Chandrasekaran,
S., Eftimov, T., Fischbach, A., Kerschke, P., Cava, W. L., Lopez-Ibanez, M., Malan,
K. M., Moore, J. H., Naujoks, B., Orzechowski, P., Volz, V., Wagner, M., &
Weise, T. (2020). Benchmarking in Optimization: Best Practice and Open Issues.
Corr.'
bibtex: '@article{Bartz-Beielstein_Doerr_van den Berg_Bossek_Chandrasekaran_Eftimov_Fischbach_Kerschke_Cava_Lopez-Ibanez_et
al._2020, title={Benchmarking in Optimization: Best Practice and Open Issues},
journal={Corr}, author={Bartz-Beielstein, Thomas and Doerr, Carola and van den
Berg, Daan and Bossek, Jakob and Chandrasekaran, Sowmya and Eftimov, Tome and
Fischbach, Andreas and Kerschke, Pascal and Cava, William La and Lopez-Ibanez,
Manuel and et al.}, year={2020} }'
chicago: 'Bartz-Beielstein, Thomas, Carola Doerr, Daan van den Berg, Jakob Bossek,
Sowmya Chandrasekaran, Tome Eftimov, Andreas Fischbach, et al. “Benchmarking in
Optimization: Best Practice and Open Issues.” Corr, 2020.'
ieee: 'T. Bartz-Beielstein et al., “Benchmarking in Optimization: Best Practice
and Open Issues,” Corr, 2020.'
mla: 'Bartz-Beielstein, Thomas, et al. “Benchmarking in Optimization: Best Practice
and Open Issues.” Corr, 2020.'
short: T. Bartz-Beielstein, C. Doerr, D. van den Berg, J. Bossek, S. Chandrasekaran,
T. Eftimov, A. Fischbach, P. Kerschke, W.L. Cava, M. Lopez-Ibanez, K.M. Malan,
J.H. Moore, B. Naujoks, P. Orzechowski, V. Volz, M. Wagner, T. Weise, Corr (2020).
date_created: 2023-11-14T15:58:51Z
date_updated: 2023-12-13T10:52:24Z
department:
- _id: '819'
language:
- iso: eng
publication: Corr
status: public
title: 'Benchmarking in Optimization: Best Practice and Open Issues'
type: journal_article
user_id: '102979'
year: '2020'
...
---
_id: '49599'
author:
- first_name: Daniel
full_name: Fastlabend-Vargas, Daniel
id: '23102'
last_name: Fastlabend-Vargas
citation:
ama: Fastlabend-Vargas D. Geschichte(n) der deutschen Migrationsgesellschaft.
Jugendliche erzählen begründete historische Geschichten Eine Unterrichtsreihe
für das Portal Zwischentöne.info . Zwischentöne.info ; 2020.
apa: Fastlabend-Vargas, D. (2020). Geschichte(n) der deutschen Migrationsgesellschaft.
Jugendliche erzählen begründete historische Geschichten Eine Unterrichtsreihe
für das Portal Zwischentöne.info . Zwischentöne.info .
bibtex: '@book{Fastlabend-Vargas_2020, place={Zwischentöne.info }, title={Geschichte(n)
der deutschen Migrationsgesellschaft. Jugendliche erzählen begründete historische
Geschichten Eine Unterrichtsreihe für das Portal Zwischentöne.info }, publisher={Zwischentöne.info
}, author={Fastlabend-Vargas, Daniel}, year={2020} }'
chicago: 'Fastlabend-Vargas, Daniel. Geschichte(n) der deutschen Migrationsgesellschaft.
Jugendliche erzählen begründete historische Geschichten Eine Unterrichtsreihe
für das Portal Zwischentöne.info . Zwischentöne.info : Zwischentöne.info ,
2020.'
ieee: 'D. Fastlabend-Vargas, Geschichte(n) der deutschen Migrationsgesellschaft.
Jugendliche erzählen begründete historische Geschichten Eine Unterrichtsreihe
für das Portal Zwischentöne.info . Zwischentöne.info : Zwischentöne.info ,
2020.'
mla: Fastlabend-Vargas, Daniel. Geschichte(n) der deutschen Migrationsgesellschaft.
Jugendliche erzählen begründete historische Geschichten Eine Unterrichtsreihe
für das Portal Zwischentöne.info . Zwischentöne.info , 2020.
short: D. Fastlabend-Vargas, Geschichte(n) der deutschen Migrationsgesellschaft.
Jugendliche erzählen begründete historische Geschichten Eine Unterrichtsreihe
für das Portal Zwischentöne.info , Zwischentöne.info , Zwischentöne.info , 2020.
date_created: 2023-12-13T13:19:41Z
date_updated: 2023-12-13T20:31:09Z
department:
- _id: '6'
- _id: '444'
language:
- iso: ger
main_file_link:
- open_access: '1'
url: https://www.zwischentoene.info/unterrichtseinheit/praesentation?tx_uemat_uemat%5Bunterrichtseinheit%5D=65&cHash=ea39aadf818de9c990c1f542ba84741b
oa: '1'
place: 'Zwischentöne.info '
publication_status: published
publisher: 'Zwischentöne.info '
status: public
title: 'Geschichte(n) der deutschen Migrationsgesellschaft. Jugendliche erzählen begründete
historische Geschichten Eine Unterrichtsreihe für das Portal Zwischentöne.info '
type: misc
user_id: '23102'
year: '2020'
...
---
_id: '30869'
author:
- first_name: Christina
full_name: Lammer, Christina
id: '84580'
last_name: Lammer
citation:
ama: 'Lammer C. Erinnerung Und Identität: Literarische Konstruktionen in Doeschka
Meijsings Prosa. transcript Verlag; 2020.'
apa: 'Lammer, C. (2020). Erinnerung und Identität: Literarische Konstruktionen
in Doeschka Meijsings Prosa. transcript Verlag.'
bibtex: '@book{Lammer_2020, title={Erinnerung und Identität: Literarische Konstruktionen
in Doeschka Meijsings Prosa}, publisher={transcript Verlag}, author={Lammer, Christina},
year={2020} }'
chicago: 'Lammer, Christina. Erinnerung Und Identität: Literarische Konstruktionen
in Doeschka Meijsings Prosa. transcript Verlag, 2020.'
ieee: 'C. Lammer, Erinnerung und Identität: Literarische Konstruktionen in Doeschka
Meijsings Prosa. transcript Verlag, 2020.'
mla: 'Lammer, Christina. Erinnerung Und Identität: Literarische Konstruktionen
in Doeschka Meijsings Prosa. transcript Verlag, 2020.'
short: 'C. Lammer, Erinnerung Und Identität: Literarische Konstruktionen in Doeschka
Meijsings Prosa, transcript Verlag, 2020.'
date_created: 2022-04-12T14:18:30Z
date_updated: 2023-12-14T18:32:38Z
language:
- iso: eng
publisher: transcript Verlag
status: public
title: 'Erinnerung und Identität: Literarische Konstruktionen in Doeschka Meijsings
Prosa'
type: book
user_id: '84580'
year: '2020'
...
---
_id: '49767'
author:
- first_name: Yves
full_name: Huybrechts, Yves
id: '78579'
last_name: Huybrechts
orcid: 0009-0009-2166-9794
citation:
ama: Huybrechts Y. “Die Bombardierung von Brüssel - teil 1” (PODCAST). BelgienNet;
2020.
apa: Huybrechts, Y. (2020). “Die Bombardierung von Brüssel - teil 1” (PODCAST).
BelgienNet.
bibtex: '@book{Huybrechts_2020, title={“Die Bombardierung von Brüssel - teil 1”
(PODCAST)}, publisher={BelgienNet}, author={Huybrechts, Yves}, year={2020} }'
chicago: Huybrechts, Yves. “Die Bombardierung von Brüssel - teil 1” (PODCAST).
BelgienNet, 2020.
ieee: Y. Huybrechts, “Die Bombardierung von Brüssel - teil 1” (PODCAST).
BelgienNet, 2020.
mla: Huybrechts, Yves. “Die Bombardierung von Brüssel - teil 1” (PODCAST).
BelgienNet, 2020.
short: Y. Huybrechts, “Die Bombardierung von Brüssel - teil 1” (PODCAST), BelgienNet,
2020.
date_created: 2023-12-18T10:02:47Z
date_updated: 2023-12-18T10:08:13Z
department:
- _id: '448'
language:
- iso: ger
- iso: fre
main_file_link:
- open_access: '1'
url: https://belgien.net/die-bombardierung-von-bruessel-teil-1/
oa: '1'
publication_status: published
publisher: BelgienNet
status: public
title: '"Die Bombardierung von Brüssel - teil 1" (PODCAST)'
type: misc
user_id: '78579'
year: '2020'
...
---
_id: '49736'
author:
- first_name: Yves
full_name: Huybrechts, Yves
id: '78579'
last_name: Huybrechts
orcid: 0009-0009-2166-9794
citation:
ama: Huybrechts Y. Den Kaiser erpressen. Der Fall Jever zwischen Burgundischem Reichskreis
und Reichskammergericht, 1737-1739. Historisches Jahrbuch. 2020;140:420-445.
apa: Huybrechts, Y. (2020). Den Kaiser erpressen. Der Fall Jever zwischen Burgundischem
Reichskreis und Reichskammergericht, 1737-1739. Historisches Jahrbuch,
140, 420–445.
bibtex: '@article{Huybrechts_2020, title={Den Kaiser erpressen. Der Fall Jever zwischen
Burgundischem Reichskreis und Reichskammergericht, 1737-1739}, volume={140}, journal={Historisches
Jahrbuch}, author={Huybrechts, Yves}, year={2020}, pages={420–445} }'
chicago: 'Huybrechts, Yves. “Den Kaiser erpressen. Der Fall Jever zwischen Burgundischem
Reichskreis und Reichskammergericht, 1737-1739.” Historisches Jahrbuch
140 (2020): 420–45.'
ieee: Y. Huybrechts, “Den Kaiser erpressen. Der Fall Jever zwischen Burgundischem
Reichskreis und Reichskammergericht, 1737-1739,” Historisches Jahrbuch,
vol. 140, pp. 420–445, 2020.
mla: Huybrechts, Yves. “Den Kaiser erpressen. Der Fall Jever zwischen Burgundischem
Reichskreis und Reichskammergericht, 1737-1739.” Historisches Jahrbuch,
vol. 140, 2020, pp. 420–45.
short: Y. Huybrechts, Historisches Jahrbuch 140 (2020) 420–445.
date_created: 2023-12-18T09:15:32Z
date_updated: 2023-12-18T10:09:05Z
department:
- _id: '446'
intvolume: ' 140'
language:
- iso: ger
page: 420-445
publication: Historisches Jahrbuch
publication_identifier:
isbn:
- '9783451032967'
issn:
- '00182621'
publication_status: published
status: public
title: Den Kaiser erpressen. Der Fall Jever zwischen Burgundischem Reichskreis und
Reichskammergericht, 1737-1739
type: journal_article
user_id: '78579'
volume: 140
year: '2020'
...
---
_id: '49756'
author:
- first_name: Yves
full_name: Huybrechts, Yves
id: '78579'
last_name: Huybrechts
orcid: 0009-0009-2166-9794
citation:
ama: Huybrechts Y. “Ein Gespräch mit Guy Vanhengel - Ein Gespräch mit dem Vizepräsidenten
des Brüsseler Parlaments, in zwei Teilen.” (VIDEO). BelgienNet; 2020.
apa: Huybrechts, Y. (2020). “Ein Gespräch mit Guy Vanhengel - Ein Gespräch mit
dem Vizepräsidenten des Brüsseler Parlaments, in zwei Teilen.” (VIDEO). BelgienNet.
bibtex: '@book{Huybrechts_2020, title={“Ein Gespräch mit Guy Vanhengel - Ein Gespräch
mit dem Vizepräsidenten des Brüsseler Parlaments, in zwei Teilen.” (VIDEO)}, publisher={BelgienNet},
author={Huybrechts, Yves}, year={2020} }'
chicago: Huybrechts, Yves. “Ein Gespräch mit Guy Vanhengel - Ein Gespräch mit
dem Vizepräsidenten des Brüsseler Parlaments, in zwei Teilen.” (VIDEO). BelgienNet,
2020.
ieee: Y. Huybrechts, “Ein Gespräch mit Guy Vanhengel - Ein Gespräch mit dem Vizepräsidenten
des Brüsseler Parlaments, in zwei Teilen.” (VIDEO). BelgienNet, 2020.
mla: Huybrechts, Yves. “Ein Gespräch mit Guy Vanhengel - Ein Gespräch mit dem
Vizepräsidenten des Brüsseler Parlaments, in zwei Teilen.” (VIDEO). BelgienNet,
2020.
short: Y. Huybrechts, “Ein Gespräch mit Guy Vanhengel - Ein Gespräch mit dem Vizepräsidenten
des Brüsseler Parlaments, in zwei Teilen.” (VIDEO), BelgienNet, 2020.
date_created: 2023-12-18T09:48:13Z
date_updated: 2023-12-18T10:08:33Z
department:
- _id: '448'
language:
- iso: dut
main_file_link:
- open_access: '1'
url: https://belgien.net/ein-gespraech-mit-guy-vanhengel/
oa: '1'
publication_status: published
publisher: BelgienNet
status: public
title: '"Ein Gespräch mit Guy Vanhengel - Ein Gespräch mit dem Vizepräsidenten des
Brüsseler Parlaments, in zwei Teilen." (VIDEO)'
type: misc
user_id: '78579'
year: '2020'
...
---
_id: '49750'
author:
- first_name: Yves
full_name: Huybrechts, Yves
id: '78579'
last_name: Huybrechts
orcid: 0009-0009-2166-9794
citation:
ama: Huybrechts Y. Interview zur Ausstellung “Rubens und der Barock im Norden”
- 2 Teile (VIDEO). BelgienNet; 2020.
apa: Huybrechts, Y. (2020). Interview zur Ausstellung “Rubens und der Barock
im Norden” - 2 Teile (VIDEO). BelgienNet.
bibtex: '@book{Huybrechts_2020, title={Interview zur Ausstellung “Rubens und der
Barock im Norden” - 2 Teile (VIDEO)}, publisher={BelgienNet}, author={Huybrechts,
Yves}, year={2020} }'
chicago: Huybrechts, Yves. Interview zur Ausstellung “Rubens und der Barock im
Norden” - 2 Teile (VIDEO). BelgienNet, 2020.
ieee: Y. Huybrechts, Interview zur Ausstellung “Rubens und der Barock im Norden”
- 2 Teile (VIDEO). BelgienNet, 2020.
mla: Huybrechts, Yves. Interview zur Ausstellung “Rubens und der Barock im Norden”
- 2 Teile (VIDEO). BelgienNet, 2020.
short: Y. Huybrechts, Interview zur Ausstellung “Rubens und der Barock im Norden”
- 2 Teile (VIDEO), BelgienNet, 2020.
date_created: 2023-12-18T09:41:06Z
date_updated: 2023-12-18T10:08:45Z
department:
- _id: '448'
language:
- iso: ger
main_file_link:
- open_access: '1'
url: https://belgien.net/interview-rubens-und-barock-im-norden/
oa: '1'
publication_status: published
publisher: BelgienNet
status: public
title: Interview zur Ausstellung "Rubens und der Barock im Norden" - 2 Teile (VIDEO)
type: misc
user_id: '78579'
year: '2020'
...
---
_id: '49831'
author:
- first_name: Alena
full_name: Diedrich, Alena
id: '49513'
last_name: Diedrich
citation:
ama: 'Diedrich A. Ironie als forcierte Form. Hans Magnus Enzensbergers Versepos
Der Untergang der Titanic. In: Bremer K, Elit S, Kroucheva K, eds. Forcierte
Form: Deutschsprachige Versepik Des 20. Und 21. Jahrhunderts Im Europäischen Kontext.
Metzler; 2020.'
apa: 'Diedrich, A. (2020). Ironie als forcierte Form. Hans Magnus Enzensbergers
Versepos Der Untergang der Titanic. In K. Bremer, S. Elit, & K. Kroucheva
(Eds.), Forcierte Form: Deutschsprachige Versepik des 20. und 21. Jahrhunderts
im europäischen Kontext. Metzler.'
bibtex: '@inbook{Diedrich_2020, title={Ironie als forcierte Form. Hans Magnus Enzensbergers
Versepos Der Untergang der Titanic}, booktitle={Forcierte Form: Deutschsprachige
Versepik des 20. und 21. Jahrhunderts im europäischen Kontext}, publisher={Metzler},
author={Diedrich, Alena}, editor={Bremer, Kai and Elit, Stefan and Kroucheva,
Katerina}, year={2020} }'
chicago: 'Diedrich, Alena. “Ironie Als Forcierte Form. Hans Magnus Enzensbergers
Versepos Der Untergang Der Titanic.” In Forcierte Form: Deutschsprachige Versepik
Des 20. Und 21. Jahrhunderts Im Europäischen Kontext, edited by Kai Bremer,
Stefan Elit, and Katerina Kroucheva. Metzler, 2020.'
ieee: 'A. Diedrich, “Ironie als forcierte Form. Hans Magnus Enzensbergers Versepos
Der Untergang der Titanic,” in Forcierte Form: Deutschsprachige Versepik des
20. und 21. Jahrhunderts im europäischen Kontext, K. Bremer, S. Elit, and
K. Kroucheva, Eds. Metzler, 2020.'
mla: 'Diedrich, Alena. “Ironie Als Forcierte Form. Hans Magnus Enzensbergers Versepos
Der Untergang Der Titanic.” Forcierte Form: Deutschsprachige Versepik Des 20.
Und 21. Jahrhunderts Im Europäischen Kontext, edited by Kai Bremer et al.,
Metzler, 2020.'
short: 'A. Diedrich, in: K. Bremer, S. Elit, K. Kroucheva (Eds.), Forcierte Form:
Deutschsprachige Versepik Des 20. Und 21. Jahrhunderts Im Europäischen Kontext,
Metzler, 2020.'
date_created: 2023-12-19T08:56:02Z
date_updated: 2023-12-19T09:05:26Z
editor:
- first_name: Kai
full_name: Bremer, Kai
last_name: Bremer
- first_name: Stefan
full_name: Elit, Stefan
last_name: Elit
- first_name: Katerina
full_name: Kroucheva, Katerina
last_name: Kroucheva
language:
- iso: eng
publication: 'Forcierte Form: Deutschsprachige Versepik des 20. und 21. Jahrhunderts
im europäischen Kontext'
publisher: Metzler
status: public
title: Ironie als forcierte Form. Hans Magnus Enzensbergers Versepos Der Untergang
der Titanic
type: book_chapter
user_id: '49513'
year: '2020'
...
---
_id: '49832'
author:
- first_name: Alena
full_name: Diedrich, Alena
id: '49513'
last_name: Diedrich
citation:
ama: 'Diedrich A. Lyrik im Vormärz. In: Eke NO, ed. Handbuch Vormärz. Aisthesis;
2020.'
apa: Diedrich, A. (2020). Lyrik im Vormärz. In N. O. Eke (Ed.), Handbuch Vormärz.
Aisthesis.
bibtex: '@inbook{Diedrich_2020, title={Lyrik im Vormärz}, booktitle={Handbuch Vormärz},
publisher={Aisthesis}, author={Diedrich, Alena}, editor={Eke, Norbert Otto },
year={2020} }'
chicago: Diedrich, Alena. “Lyrik Im Vormärz.” In Handbuch Vormärz, edited
by Norbert Otto Eke. Aisthesis, 2020.
ieee: A. Diedrich, “Lyrik im Vormärz,” in Handbuch Vormärz, N. O. Eke, Ed.
Aisthesis, 2020.
mla: Diedrich, Alena. “Lyrik Im Vormärz.” Handbuch Vormärz, edited by Norbert
Otto Eke, Aisthesis, 2020.
short: 'A. Diedrich, in: N.O. Eke (Ed.), Handbuch Vormärz, Aisthesis, 2020.'
date_created: 2023-12-19T08:57:06Z
date_updated: 2023-12-19T09:05:31Z
editor:
- first_name: 'Norbert Otto '
full_name: 'Eke, Norbert Otto '
last_name: Eke
language:
- iso: eng
publication: Handbuch Vormärz
publisher: Aisthesis
status: public
title: Lyrik im Vormärz
type: book_chapter
user_id: '49513'
year: '2020'
...
---
_id: '49833'
author:
- first_name: Alena
full_name: Diedrich, Alena
id: '49513'
last_name: Diedrich
citation:
ama: 'Diedrich A. Nikolaus Lenau. In: Eke NO, ed. Handbuch Vormärz. Aisthesis;
2020.'
apa: Diedrich, A. (2020). Nikolaus Lenau. In N. O. Eke (Ed.), Handbuch Vormärz.
Aisthesis.
bibtex: '@inbook{Diedrich_2020, title={Nikolaus Lenau}, booktitle={Handbuch Vormärz},
publisher={Aisthesis}, author={Diedrich, Alena}, editor={Eke, Norbert Otto },
year={2020} }'
chicago: Diedrich, Alena. “Nikolaus Lenau.” In Handbuch Vormärz, edited by
Norbert Otto Eke. Aisthesis, 2020.
ieee: A. Diedrich, “Nikolaus Lenau,” in Handbuch Vormärz, N. O. Eke, Ed.
Aisthesis, 2020.
mla: Diedrich, Alena. “Nikolaus Lenau.” Handbuch Vormärz, edited by Norbert
Otto Eke, Aisthesis, 2020.
short: 'A. Diedrich, in: N.O. Eke (Ed.), Handbuch Vormärz, Aisthesis, 2020.'
date_created: 2023-12-19T08:57:52Z
date_updated: 2023-12-19T09:05:36Z
editor:
- first_name: 'Norbert Otto '
full_name: 'Eke, Norbert Otto '
last_name: Eke
language:
- iso: eng
publication: Handbuch Vormärz
publisher: Aisthesis
status: public
title: Nikolaus Lenau
type: book_chapter
user_id: '49513'
year: '2020'
...
---
_id: '49869'
author:
- first_name: Iris
full_name: Neiske, Iris
id: '53827'
last_name: Neiske
- first_name: Diana
full_name: Bücker, Diana
last_name: Bücker
citation:
ama: 'Neiske I, Bücker D. Medienpädagogik und Hochschuldidaktik. In: Medienpädagogik
als Schlüsseldisziplin in einer mediatisierten Welt. Perspektiven aus Theorie,
Empirie und Praxis 37. ; 2020:299-312.'
apa: Neiske, I., & Bücker, D. (2020). Medienpädagogik und Hochschuldidaktik.
In Medienpädagogik als Schlüsseldisziplin in einer mediatisierten Welt. Perspektiven
aus Theorie, Empirie und Praxis 37 (pp. 299–312).
bibtex: '@inbook{Neiske_Bücker_2020, title={Medienpädagogik und Hochschuldidaktik},
booktitle={Medienpädagogik als Schlüsseldisziplin in einer mediatisierten Welt.
Perspektiven aus Theorie, Empirie und Praxis 37}, author={Neiske, Iris and Bücker,
Diana}, year={2020}, pages={299–312} }'
chicago: Neiske, Iris, and Diana Bücker. “Medienpädagogik und Hochschuldidaktik.”
In Medienpädagogik als Schlüsseldisziplin in einer mediatisierten Welt. Perspektiven
aus Theorie, Empirie und Praxis 37, 299–312, 2020.
ieee: I. Neiske and D. Bücker, “Medienpädagogik und Hochschuldidaktik,” in Medienpädagogik
als Schlüsseldisziplin in einer mediatisierten Welt. Perspektiven aus Theorie,
Empirie und Praxis 37, 2020, pp. 299–312.
mla: Neiske, Iris, and Diana Bücker. “Medienpädagogik und Hochschuldidaktik.” Medienpädagogik
als Schlüsseldisziplin in einer mediatisierten Welt. Perspektiven aus Theorie,
Empirie und Praxis 37, 2020, pp. 299–312.
short: 'I. Neiske, D. Bücker, in: Medienpädagogik als Schlüsseldisziplin in einer
mediatisierten Welt. Perspektiven aus Theorie, Empirie und Praxis 37, 2020, pp.
299–312.'
date_created: 2023-12-19T13:12:11Z
date_updated: 2023-12-19T13:12:21Z
department:
- _id: '544'
language:
- iso: ger
main_file_link:
- open_access: '1'
url: https://www.medienpaed.com/article/view/808/904
oa: '1'
page: 299-312
publication: Medienpädagogik als Schlüsseldisziplin in einer mediatisierten Welt.
Perspektiven aus Theorie, Empirie und Praxis 37
publication_identifier:
issn:
- 1424-3636
publication_status: published
status: public
title: Medienpädagogik und Hochschuldidaktik
type: book_chapter
user_id: '53827'
year: '2020'
...