---
_id: '30683'
abstract:
- lang: eng
text: 'When joining lightweight parts of various materials, clinching is a cost
efficient solution. In a production line, the quality of a clinch point is primarily
controlled by measurement of dimensions, which are accessible from outside. However,
methods such as visual testing and measuring the bottom thickness as well as the
outer diameter are not able to deliver any information about the most significant
geometrical characteristic of the clinch point, neck thickness and undercut. Furthermore,
ex-situ destructive methods such as microsectioning cannot detect elastic deformations
and cracks that close after unloading. In order to exceed the current limits,
a new non-destructive in-situ testing method for the clinching process is necessary.
This work proposes a concept to characterize clinch points in-situ by combining
two complementary non-destructive methods, namely, computed tomography (CT) and
ultrasonic testing. Firstly, clinch points with different geometrical characteristics
are analysed experimentally using ex-situ CT to get a highly spatially resolved
3D-image of the object. In this context, highly X-ray attenuating materials enhancing
the visibility of the sheet-sheet interface are investigated. Secondly, the test
specimens are modelled using finite element method (FEM) and a transient dynamic
analysis (TDA) is conducted to study the effect of the geometrical differences
on the deformation energy and to qualify the TDA as a fast in-situ non-destructive
method for characterizing clinch points at high temporal resolution. '
author:
- first_name: D.
full_name: Köhler, D.
last_name: Köhler
- first_name: B.
full_name: Sadeghian, B.
last_name: Sadeghian
- first_name: R.
full_name: Kupfer, R.
last_name: Kupfer
- first_name: J.
full_name: Troschitz, J.
last_name: Troschitz
- first_name: M.
full_name: Gude, M.
last_name: Gude
- first_name: A.
full_name: Brosius, A.
last_name: Brosius
citation:
ama: Köhler D, Sadeghian B, Kupfer R, Troschitz J, Gude M, Brosius A. A Method for
Characterization of Geometric Deviations in Clinch Points with Computed Tomography
and Transient Dynamic Analysis. Key Engineering Materials. 2021;883:89-96.
doi:10.4028/www.scientific.net/kem.883.89
apa: Köhler, D., Sadeghian, B., Kupfer, R., Troschitz, J., Gude, M., & Brosius,
A. (2021). A Method for Characterization of Geometric Deviations in Clinch Points
with Computed Tomography and Transient Dynamic Analysis. Key Engineering Materials,
883, 89–96. https://doi.org/10.4028/www.scientific.net/kem.883.89
bibtex: '@article{Köhler_Sadeghian_Kupfer_Troschitz_Gude_Brosius_2021, title={A
Method for Characterization of Geometric Deviations in Clinch Points with Computed
Tomography and Transient Dynamic Analysis}, volume={883}, DOI={10.4028/www.scientific.net/kem.883.89},
journal={Key Engineering Materials}, author={Köhler, D. and Sadeghian, B. and
Kupfer, R. and Troschitz, J. and Gude, M. and Brosius, A.}, year={2021}, pages={89–96}
}'
chicago: 'Köhler, D., B. Sadeghian, R. Kupfer, J. Troschitz, M. Gude, and A. Brosius.
“A Method for Characterization of Geometric Deviations in Clinch Points with Computed
Tomography and Transient Dynamic Analysis.” Key Engineering Materials 883
(2021): 89–96. https://doi.org/10.4028/www.scientific.net/kem.883.89.'
ieee: 'D. Köhler, B. Sadeghian, R. Kupfer, J. Troschitz, M. Gude, and A. Brosius,
“A Method for Characterization of Geometric Deviations in Clinch Points with Computed
Tomography and Transient Dynamic Analysis,” Key Engineering Materials,
vol. 883, pp. 89–96, 2021, doi: 10.4028/www.scientific.net/kem.883.89.'
mla: Köhler, D., et al. “A Method for Characterization of Geometric Deviations in
Clinch Points with Computed Tomography and Transient Dynamic Analysis.” Key
Engineering Materials, vol. 883, 2021, pp. 89–96, doi:10.4028/www.scientific.net/kem.883.89.
short: D. Köhler, B. Sadeghian, R. Kupfer, J. Troschitz, M. Gude, A. Brosius, Key
Engineering Materials 883 (2021) 89–96.
date_created: 2022-03-29T08:46:40Z
date_updated: 2023-01-02T11:48:16Z
department:
- _id: '630'
doi: 10.4028/www.scientific.net/kem.883.89
intvolume: ' 883'
language:
- iso: eng
page: 89-96
project:
- _id: '130'
grant_number: '418701707'
name: 'TRR 285: TRR 285'
- _id: '133'
name: 'TRR 285 - C: TRR 285 - Project Area C'
- _id: '148'
name: 'TRR 285 – C04: TRR 285 - Subproject C04'
publication: Key Engineering Materials
status: public
title: A Method for Characterization of Geometric Deviations in Clinch Points with
Computed Tomography and Transient Dynamic Analysis
type: journal_article
user_id: '14931'
volume: 883
year: '2021'
...
---
_id: '35303'
abstract:
- lang: eng
text: "Abstract\r\n Purpose\r\n
\ Studies about effects of lunch dietary Glycemic Index
(GI) on cognition of schoolchildren are scarce. Our previous CogniDo GI study
found no changes of cognition in the early postprandial phase after consumption
of two rice types with medium vs. high dietary GI for lunch (i.e., 45 min after
starting lunch). This study investigated whether the dietary GI of lunch has an
impact on cognition of schoolchildren in the late postprandial phase, 90 min after
lunch.\r\n \r\n Methods\r\n
\ A randomized, 2 × 2 crossover intervention study was conducted
at a comprehensive school with 5th and 6th grade students. Participants (n = 212)
were randomly assigned to either sequence 1 or 2. In the first period, participants
of sequence 1 received a dish with high GI rice (GI: 79), those of sequence 2
with medium GI rice (GI: 64)—in the second period, 1 week later, vice versa. Computer-based
cognitive testing was performed 90 min after lunch examining tonic alertness,
visual search and task switching, and working memory. Treatment effects and treatment
effects adjusted for estimated lunch glycemic load (GL) were analyzed using a
linear mixed model.\r\n \r\n Results\r\n
\ The selected cognitive parameters were not affected by
the GI of lunch 90 min after lunch, neither after intention-to-treat nor in the
per-protocol analysis. Adjustment for GL also did not change results.\r\n
\ \r\n Conclusion\r\n
\ The present study revealed no notable differences after
the consumption of two rice types with medium vs. high dietary GI for lunch in
children’s cognitive function in the late postprandial phase, 90 min after lunch.\r\n
\ \r\n Clinical trial
registration\r\n German Clinical Trials Register
(DRKS00013597); date of registration: 16/04/2018, retrospectively registered.\r\n
\ "
author:
- first_name: Alina
full_name: Drozdowska, Alina
last_name: Drozdowska
- first_name: Kathrin
full_name: Sinningen, Kathrin
last_name: Sinningen
- first_name: Michael
full_name: Falkenstein, Michael
last_name: Falkenstein
- first_name: Henrik
full_name: Rudolf, Henrik
last_name: Rudolf
- first_name: Lars
full_name: Libuda, Lars
id: '88682'
last_name: Libuda
orcid: 0000-0003-1603-3133
- first_name: Anette
full_name: Buyken, Anette
id: '65985'
last_name: Buyken
- first_name: Thomas
full_name: Lücke, Thomas
last_name: Lücke
- first_name: Mathilde
full_name: Kersting, Mathilde
last_name: Kersting
citation:
ama: 'Drozdowska A, Sinningen K, Falkenstein M, et al. Impact of lunch with carbohydrates
differing in glycemic index on children’s cognitive functioning in the late postprandial
phase: a randomized crossover study. European Journal of Nutrition. 2021;61(3):1637-1647.
doi:10.1007/s00394-021-02766-y'
apa: 'Drozdowska, A., Sinningen, K., Falkenstein, M., Rudolf, H., Libuda, L., Buyken,
A., Lücke, T., & Kersting, M. (2021). Impact of lunch with carbohydrates differing
in glycemic index on children’s cognitive functioning in the late postprandial
phase: a randomized crossover study. European Journal of Nutrition, 61(3),
1637–1647. https://doi.org/10.1007/s00394-021-02766-y'
bibtex: '@article{Drozdowska_Sinningen_Falkenstein_Rudolf_Libuda_Buyken_Lücke_Kersting_2021,
title={Impact of lunch with carbohydrates differing in glycemic index on children’s
cognitive functioning in the late postprandial phase: a randomized crossover study},
volume={61}, DOI={10.1007/s00394-021-02766-y},
number={3}, journal={European Journal of Nutrition}, publisher={Springer Science
and Business Media LLC}, author={Drozdowska, Alina and Sinningen, Kathrin and
Falkenstein, Michael and Rudolf, Henrik and Libuda, Lars and Buyken, Anette and
Lücke, Thomas and Kersting, Mathilde}, year={2021}, pages={1637–1647} }'
chicago: 'Drozdowska, Alina, Kathrin Sinningen, Michael Falkenstein, Henrik Rudolf,
Lars Libuda, Anette Buyken, Thomas Lücke, and Mathilde Kersting. “Impact of Lunch
with Carbohydrates Differing in Glycemic Index on Children’s Cognitive Functioning
in the Late Postprandial Phase: A Randomized Crossover Study.” European Journal
of Nutrition 61, no. 3 (2021): 1637–47. https://doi.org/10.1007/s00394-021-02766-y.'
ieee: 'A. Drozdowska et al., “Impact of lunch with carbohydrates differing
in glycemic index on children’s cognitive functioning in the late postprandial
phase: a randomized crossover study,” European Journal of Nutrition, vol.
61, no. 3, pp. 1637–1647, 2021, doi: 10.1007/s00394-021-02766-y.'
mla: 'Drozdowska, Alina, et al. “Impact of Lunch with Carbohydrates Differing in
Glycemic Index on Children’s Cognitive Functioning in the Late Postprandial Phase:
A Randomized Crossover Study.” European Journal of Nutrition, vol. 61,
no. 3, Springer Science and Business Media LLC, 2021, pp. 1637–47, doi:10.1007/s00394-021-02766-y.'
short: A. Drozdowska, K. Sinningen, M. Falkenstein, H. Rudolf, L. Libuda, A. Buyken,
T. Lücke, M. Kersting, European Journal of Nutrition 61 (2021) 1637–1647.
date_created: 2023-01-05T14:49:10Z
date_updated: 2023-01-05T16:47:16Z
department:
- _id: '35'
- _id: '17'
- _id: '22'
- _id: '571'
- _id: '395'
doi: 10.1007/s00394-021-02766-y
intvolume: ' 61'
issue: '3'
keyword:
- Nutrition and Dietetics
- Medicine (miscellaneous)
language:
- iso: eng
page: 1637-1647
publication: European Journal of Nutrition
publication_identifier:
issn:
- 1436-6207
- 1436-6215
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: 'Impact of lunch with carbohydrates differing in glycemic index on children''s
cognitive functioning in the late postprandial phase: a randomized crossover study'
type: journal_article
user_id: '61597'
volume: 61
year: '2021'
...
---
_id: '35774'
author:
- first_name: Timm
full_name: Albers, Timm
id: '48393'
last_name: Albers
- first_name: Agnes
full_name: Filipiak, Agnes
last_name: Filipiak
- first_name: Katja
full_name: Franzen, Katja
id: '75124'
last_name: Franzen
- first_name: Frank
full_name: Hellmich, Frank
id: '26282'
last_name: Hellmich
citation:
ama: 'Albers T, Filipiak A, Franzen K, Hellmich F. Kompetenzentwicklung im inklusiven
Unterricht (KinU) – eine internationale Perspektive. In: Schimek B, Kremsner G,
Proyer M, Grubich R, Paudel F, Grubich-Müller R, eds. Grenzen. Gänge. Zwischen.
Welten. Kontroversen – Entwicklungen – Perspektiven Der Inklusionsforschung.
Verlag Julius Klinkhardt; 2021:207–214. doi:10.35468/5924-22'
apa: Albers, T., Filipiak, A., Franzen, K., & Hellmich, F. (2021). Kompetenzentwicklung
im inklusiven Unterricht (KinU) – eine internationale Perspektive. In B. Schimek,
G. Kremsner, M. Proyer, R. Grubich, F. Paudel, & R. Grubich-Müller (Eds.),
Grenzen. Gänge. Zwischen. Welten. Kontroversen – Entwicklungen – Perspektiven
der Inklusionsforschung (pp. 207–214). Verlag Julius Klinkhardt. https://doi.org/10.35468/5924-22
bibtex: '@inbook{Albers_Filipiak_Franzen_Hellmich_2021, place={Bad Heilbrunn}, title={Kompetenzentwicklung
im inklusiven Unterricht (KinU) – eine internationale Perspektive}, DOI={10.35468/5924-22},
booktitle={Grenzen. Gänge. Zwischen. Welten. Kontroversen – Entwicklungen – Perspektiven
der Inklusionsforschung}, publisher={Verlag Julius Klinkhardt}, author={Albers,
Timm and Filipiak, Agnes and Franzen, Katja and Hellmich, Frank}, editor={Schimek,
Bernhard and Kremsner, Gertraud and Proyer, Michelle and Grubich, Rainer and Paudel,
Florentine and Grubich-Müller, Regina}, year={2021}, pages={207–214} }'
chicago: 'Albers, Timm, Agnes Filipiak, Katja Franzen, and Frank Hellmich. “Kompetenzentwicklung
Im Inklusiven Unterricht (KinU) – Eine Internationale Perspektive.” In Grenzen.
Gänge. Zwischen. Welten. Kontroversen – Entwicklungen – Perspektiven Der Inklusionsforschung,
edited by Bernhard Schimek, Gertraud Kremsner, Michelle Proyer, Rainer Grubich,
Florentine Paudel, and Regina Grubich-Müller, 207–214. Bad Heilbrunn: Verlag Julius
Klinkhardt, 2021. https://doi.org/10.35468/5924-22.'
ieee: 'T. Albers, A. Filipiak, K. Franzen, and F. Hellmich, “Kompetenzentwicklung
im inklusiven Unterricht (KinU) – eine internationale Perspektive,” in Grenzen.
Gänge. Zwischen. Welten. Kontroversen – Entwicklungen – Perspektiven der Inklusionsforschung,
B. Schimek, G. Kremsner, M. Proyer, R. Grubich, F. Paudel, and R. Grubich-Müller,
Eds. Bad Heilbrunn: Verlag Julius Klinkhardt, 2021, pp. 207–214.'
mla: Albers, Timm, et al. “Kompetenzentwicklung Im Inklusiven Unterricht (KinU)
– Eine Internationale Perspektive.” Grenzen. Gänge. Zwischen. Welten. Kontroversen
– Entwicklungen – Perspektiven Der Inklusionsforschung, edited by Bernhard
Schimek et al., Verlag Julius Klinkhardt, 2021, pp. 207–214, doi:10.35468/5924-22.
short: 'T. Albers, A. Filipiak, K. Franzen, F. Hellmich, in: B. Schimek, G. Kremsner,
M. Proyer, R. Grubich, F. Paudel, R. Grubich-Müller (Eds.), Grenzen. Gänge. Zwischen.
Welten. Kontroversen – Entwicklungen – Perspektiven Der Inklusionsforschung, Verlag
Julius Klinkhardt, Bad Heilbrunn, 2021, pp. 207–214.'
date_created: 2023-01-10T10:39:00Z
date_updated: 2023-01-10T15:01:37Z
department:
- _id: '460'
doi: 10.35468/5924-22
editor:
- first_name: Bernhard
full_name: Schimek, Bernhard
last_name: Schimek
- first_name: Gertraud
full_name: Kremsner, Gertraud
last_name: Kremsner
- first_name: Michelle
full_name: Proyer, Michelle
last_name: Proyer
- first_name: Rainer
full_name: Grubich, Rainer
last_name: Grubich
- first_name: Florentine
full_name: Paudel, Florentine
last_name: Paudel
- first_name: Regina
full_name: Grubich-Müller, Regina
last_name: Grubich-Müller
language:
- iso: eng
page: 207–214
place: Bad Heilbrunn
publication: Grenzen. Gänge. Zwischen. Welten. Kontroversen – Entwicklungen – Perspektiven
der Inklusionsforschung
publication_status: published
publisher: Verlag Julius Klinkhardt
status: public
title: Kompetenzentwicklung im inklusiven Unterricht (KinU) – eine internationale
Perspektive
type: book_chapter
user_id: '57672'
year: '2021'
...
---
_id: '36042'
author:
- first_name: Thomas
full_name: Berger, Thomas
id: '77457'
last_name: Berger
citation:
ama: Berger T. Funnel control of the Fokker-Blanck equation for a multidimensional
Ornstein-Uhlenbeck process. SIAM Journal on control and Optimization .
2021;59(5):3203-3230.
apa: Berger, T. (2021). Funnel control of the Fokker-Blanck equation for a multidimensional
Ornstein-Uhlenbeck process. SIAM Journal on Control and Optimization ,
59(5), 3203–3230.
bibtex: '@article{Berger_2021, title={Funnel control of the Fokker-Blanck equation
for a multidimensional Ornstein-Uhlenbeck process}, volume={59}, number={5}, journal={SIAM
Journal on control and Optimization }, author={Berger, Thomas}, year={2021}, pages={3203–3230}
}'
chicago: 'Berger, Thomas. “Funnel Control of the Fokker-Blanck Equation for a Multidimensional
Ornstein-Uhlenbeck Process.” SIAM Journal on Control and Optimization
59, no. 5 (2021): 3203–30.'
ieee: T. Berger, “Funnel control of the Fokker-Blanck equation for a multidimensional
Ornstein-Uhlenbeck process,” SIAM Journal on control and Optimization ,
vol. 59, no. 5, pp. 3203–3230, 2021.
mla: Berger, Thomas. “Funnel Control of the Fokker-Blanck Equation for a Multidimensional
Ornstein-Uhlenbeck Process.” SIAM Journal on Control and Optimization ,
vol. 59, no. 5, 2021, pp. 3203–30.
short: T. Berger, SIAM Journal on Control and Optimization 59 (2021) 3203–3230.
date_created: 2023-01-11T11:14:47Z
date_updated: 2023-01-12T12:28:16Z
intvolume: ' 59'
issue: '5'
language:
- iso: eng
page: 3203-3230
publication: 'SIAM Journal on control and Optimization '
status: public
title: Funnel control of the Fokker-Blanck equation for a multidimensional Ornstein-Uhlenbeck
process
type: journal_article
user_id: '77457'
volume: 59
year: '2021'
...
---
_id: '46318'
abstract:
- lang: eng
text: 'Multi-objective (MO) optimization, i.e., the simultaneous optimization of
multiple conflicting objectives, is gaining more and more attention in various
research areas, such as evolutionary computation, machine learning (e.g., (hyper-)parameter
optimization), or logistics (e.g., vehicle routing). Many works in this domain
mention the structural problem property of multimodality as a challenge from two
classical perspectives: (1) finding all globally optimal solution sets, and (2)
avoiding to get trapped in local optima. Interestingly, these streams seem to
transfer many traditional concepts of single-objective (SO) optimization into
claims, assumptions, or even terminology regarding the MO domain, but mostly neglect
the understanding of the structural properties as well as the algorithmic search
behavior on a problem’s landscape. However, some recent works counteract this
trend, by investigating the fundamentals and characteristics of MO problems using
new visualization techniques and gaining surprising insights. Using these visual
insights, this work proposes a step towards a unified terminology to capture multimodality
and locality in a broader way than it is usually done. This enables us to investigate
current research activities in multimodal continuous MO optimization and to highlight
new implications and promising research directions for the design of benchmark
suites, the discovery of MO landscape features, the development of new MO (or
even SO) optimization algorithms, and performance indicators. For all these topics,
we provide a review of ideas and methods but also an outlook on future challenges,
research potential and perspectives that result from recent developments.'
author:
- first_name: Christian
full_name: Grimme, Christian
last_name: Grimme
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
- first_name: Pelin
full_name: Aspar, Pelin
last_name: Aspar
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
- first_name: Mike
full_name: Preuss, Mike
last_name: Preuss
- first_name: André H.
full_name: Deutz, André H.
last_name: Deutz
- first_name: Hao
full_name: Wang, Hao
last_name: Wang
- first_name: Michael
full_name: Emmerich, Michael
last_name: Emmerich
citation:
ama: 'Grimme C, Kerschke P, Aspar P, et al. Peeking beyond peaks: Challenges and
research potentials of continuous multimodal multi-objective optimization. Computers
& Operations Research. 2021;136:105489. doi:https://doi.org/10.1016/j.cor.2021.105489'
apa: 'Grimme, C., Kerschke, P., Aspar, P., Trautmann, H., Preuss, M., Deutz, A.
H., Wang, H., & Emmerich, M. (2021). Peeking beyond peaks: Challenges and
research potentials of continuous multimodal multi-objective optimization. Computers
& Operations Research, 136, 105489. https://doi.org/10.1016/j.cor.2021.105489'
bibtex: '@article{Grimme_Kerschke_Aspar_Trautmann_Preuss_Deutz_Wang_Emmerich_2021,
title={Peeking beyond peaks: Challenges and research potentials of continuous
multimodal multi-objective optimization}, volume={136}, DOI={https://doi.org/10.1016/j.cor.2021.105489},
journal={Computers & Operations Research}, author={Grimme, Christian and Kerschke,
Pascal and Aspar, Pelin and Trautmann, Heike and Preuss, Mike and Deutz, André
H. and Wang, Hao and Emmerich, Michael}, year={2021}, pages={105489} }'
chicago: 'Grimme, Christian, Pascal Kerschke, Pelin Aspar, Heike Trautmann, Mike
Preuss, André H. Deutz, Hao Wang, and Michael Emmerich. “Peeking beyond Peaks:
Challenges and Research Potentials of Continuous Multimodal Multi-Objective Optimization.”
Computers & Operations Research 136 (2021): 105489. https://doi.org/10.1016/j.cor.2021.105489.'
ieee: 'C. Grimme et al., “Peeking beyond peaks: Challenges and research potentials
of continuous multimodal multi-objective optimization,” Computers & Operations
Research, vol. 136, p. 105489, 2021, doi: https://doi.org/10.1016/j.cor.2021.105489.'
mla: 'Grimme, Christian, et al. “Peeking beyond Peaks: Challenges and Research Potentials
of Continuous Multimodal Multi-Objective Optimization.” Computers & Operations
Research, vol. 136, 2021, p. 105489, doi:https://doi.org/10.1016/j.cor.2021.105489.'
short: C. Grimme, P. Kerschke, P. Aspar, H. Trautmann, M. Preuss, A.H. Deutz, H.
Wang, M. Emmerich, Computers & Operations Research 136 (2021) 105489.
date_created: 2023-08-04T07:28:34Z
date_updated: 2023-10-16T12:58:42Z
department:
- _id: '34'
- _id: '819'
doi: https://doi.org/10.1016/j.cor.2021.105489
intvolume: ' 136'
keyword:
- Multimodal optimization
- Multi-objective continuous optimization
- Landscape analysis
- Visualization
- Benchmarking
- Theory
- Algorithms
language:
- iso: eng
page: '105489'
publication: Computers & Operations Research
publication_identifier:
issn:
- 0305-0548
status: public
title: 'Peeking beyond peaks: Challenges and research potentials of continuous multimodal
multi-objective optimization'
type: journal_article
user_id: '15504'
volume: 136
year: '2021'
...
---
_id: '46311'
abstract:
- lang: eng
text: "In this work we examine the inner mechanisms of the recently developed sophisticated
local search procedure SOMOGSA. This method solves multimodal single-objective
continuous optimization problems by first expanding the problem with an additional
objective (e.g., a sphere function) to the bi-objective space, and subsequently
exploiting local structures and ridges of the resulting landscapes. Our study
particularly focusses on the sensitivity of this multiobjectivization approach
w.r.t. (i) the parametrization of the artificial second objective, as well as
(ii) the position of the initial starting points in the search space.\r\n\r\nAs
SOMOGSA is a modular framework for encapsulating local search, we integrate Gradient
and Nelder-Mead local search (as optimizers in the respective module) and compare
the performance of the resulting hybrid local search to their original single-objective
counterparts. We show that the SOMOGSA framework can significantly boost local
search by multiobjectivization. Combined with more sophisticated local search
and metaheuristics this may help in solving highly multimodal optimization problems
in future."
author:
- first_name: Pelin
full_name: Aspar, Pelin
last_name: Aspar
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
- first_name: Vera
full_name: Steinhoff, Vera
last_name: Steinhoff
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
- first_name: Christian
full_name: Grimme, Christian
last_name: Grimme
citation:
ama: 'Aspar P, Kerschke P, Steinhoff V, Trautmann H, Grimme C. Multi^3: Optimizing
Multimodal Single-Objective Continuous Problems in the Multi-Objective Space by
Means of Multiobjectivization. In: et al. Ishibuchi H, ed. Evolutionary Multi-Criterion
Optimization: 11$^th$ International Conference, EMO 2021, Shenzhen, China, March
28–31, 2021, Proceedings. Springer; 2021:311–322. doi:10.1007/978-3-030-72062-9_25'
apa: 'Aspar, P., Kerschke, P., Steinhoff, V., Trautmann, H., & Grimme, C. (2021).
Multi^3: Optimizing Multimodal Single-Objective Continuous Problems in the Multi-Objective
Space by Means of Multiobjectivization. In H. et al. Ishibuchi (Ed.), Evolutionary
Multi-Criterion Optimization: 11$^th$ International Conference, EMO 2021, Shenzhen,
China, March 28–31, 2021, Proceedings (pp. 311–322). Springer. https://doi.org/10.1007/978-3-030-72062-9_25'
bibtex: '@inproceedings{Aspar_Kerschke_Steinhoff_Trautmann_Grimme_2021, place={Heidelberg,
Berlin}, title={Multi^3: Optimizing Multimodal Single-Objective Continuous Problems
in the Multi-Objective Space by Means of Multiobjectivization}, DOI={10.1007/978-3-030-72062-9_25},
booktitle={Evolutionary Multi-Criterion Optimization: 11$^th$ International Conference,
EMO 2021, Shenzhen, China, March 28–31, 2021, Proceedings}, publisher={Springer},
author={Aspar, Pelin and Kerschke, Pascal and Steinhoff, Vera and Trautmann, Heike
and Grimme, Christian}, editor={et al. Ishibuchi, H.}, year={2021}, pages={311–322}
}'
chicago: 'Aspar, Pelin, Pascal Kerschke, Vera Steinhoff, Heike Trautmann, and Christian
Grimme. “Multi^3: Optimizing Multimodal Single-Objective Continuous Problems in
the Multi-Objective Space by Means of Multiobjectivization.” In Evolutionary
Multi-Criterion Optimization: 11$^th$ International Conference, EMO 2021, Shenzhen,
China, March 28–31, 2021, Proceedings, edited by H. et al. Ishibuchi, 311–322.
Heidelberg, Berlin: Springer, 2021. https://doi.org/10.1007/978-3-030-72062-9_25.'
ieee: 'P. Aspar, P. Kerschke, V. Steinhoff, H. Trautmann, and C. Grimme, “Multi^3:
Optimizing Multimodal Single-Objective Continuous Problems in the Multi-Objective
Space by Means of Multiobjectivization,” in Evolutionary Multi-Criterion Optimization:
11$^th$ International Conference, EMO 2021, Shenzhen, China, March 28–31, 2021,
Proceedings, 2021, pp. 311–322, doi: 10.1007/978-3-030-72062-9_25.'
mla: 'Aspar, Pelin, et al. “Multi^3: Optimizing Multimodal Single-Objective Continuous
Problems in the Multi-Objective Space by Means of Multiobjectivization.” Evolutionary
Multi-Criterion Optimization: 11$^th$ International Conference, EMO 2021, Shenzhen,
China, March 28–31, 2021, Proceedings, edited by H. et al. Ishibuchi, Springer,
2021, pp. 311–322, doi:10.1007/978-3-030-72062-9_25.'
short: 'P. Aspar, P. Kerschke, V. Steinhoff, H. Trautmann, C. Grimme, in: H. et
al. Ishibuchi (Ed.), Evolutionary Multi-Criterion Optimization: 11$^th$ International
Conference, EMO 2021, Shenzhen, China, March 28–31, 2021, Proceedings, Springer,
Heidelberg, Berlin, 2021, pp. 311–322.'
date_created: 2023-08-04T07:21:17Z
date_updated: 2023-10-16T12:54:29Z
department:
- _id: '34'
- _id: '819'
doi: 10.1007/978-3-030-72062-9_25
editor:
- first_name: H.
full_name: et al. Ishibuchi, H.
last_name: et al. Ishibuchi
language:
- iso: eng
page: 311–322
place: Heidelberg, Berlin
publication: 'Evolutionary Multi-Criterion Optimization: 11$^th$ International Conference,
EMO 2021, Shenzhen, China, March 28–31, 2021, Proceedings'
publisher: Springer
status: public
title: 'Multi^3: Optimizing Multimodal Single-Objective Continuous Problems in the
Multi-Objective Space by Means of Multiobjectivization'
type: conference
user_id: '15504'
year: '2021'
...
---
_id: '21592'
abstract:
- lang: eng
text: We propose a reachability approach for infinite and finite horizon multi-objective
optimization problems for low-thrust spacecraft trajectory design. The main advantage
of the proposed method is that the Pareto front can be efficiently constructed
from the zero level set of the solution to a Hamilton-Jacobi-Bellman equation.
We demonstrate the proposed method by applying it to a low-thrust spacecraft trajectory
design problem. By deriving the analytic expression for the Hamiltonian and the
optimal control policy, we are able to efficiently compute the backward reachable
set and reconstruct the optimal trajectories. Furthermore, we show that any reconstructed
trajectory will be guaranteed to be weakly Pareto optimal. The proposed method
can be used as a benchmark for future research of applying reachability analysis
to low-thrust spacecraft trajectory design.
author:
- first_name: Nikolaus
full_name: Vertovec, Nikolaus
id: '87056'
last_name: Vertovec
- first_name: Sina
full_name: Ober-Blöbaum, Sina
id: '16494'
last_name: Ober-Blöbaum
- first_name: Kostas
full_name: Margellos, Kostas
last_name: Margellos
citation:
ama: 'Vertovec N, Ober-Blöbaum S, Margellos K. Multi-objective minimum time optimal
control for low-thrust trajectory design. In: ; :1975-1980.'
apa: Vertovec, N., Ober-Blöbaum, S., & Margellos, K. (n.d.). Multi-objective
minimum time optimal control for low-thrust trajectory design. 1975–1980.
bibtex: '@inproceedings{Vertovec_Ober-Blöbaum_Margellos, title={Multi-objective
minimum time optimal control for low-thrust trajectory design}, author={Vertovec,
Nikolaus and Ober-Blöbaum, Sina and Margellos, Kostas}, pages={1975–1980} }'
chicago: Vertovec, Nikolaus, Sina Ober-Blöbaum, and Kostas Margellos. “Multi-Objective
Minimum Time Optimal Control for Low-Thrust Trajectory Design,” 1975–80, n.d.
ieee: N. Vertovec, S. Ober-Blöbaum, and K. Margellos, “Multi-objective minimum time
optimal control for low-thrust trajectory design,” Rotterdam, the Netherlands,
pp. 1975–1980.
mla: Vertovec, Nikolaus, et al. Multi-Objective Minimum Time Optimal Control
for Low-Thrust Trajectory Design. pp. 1975–80.
short: 'N. Vertovec, S. Ober-Blöbaum, K. Margellos, in: n.d., pp. 1975–1980.'
conference:
end_date: 2021-07-02
location: Rotterdam, the Netherlands
name: 2021 European Control Conference (ECC)
start_date: 2021-06-29
date_created: 2021-04-03T03:00:35Z
date_updated: 2023-11-29T10:26:49Z
department:
- _id: '636'
external_id:
arxiv:
- '2103.08813'
language:
- iso: eng
page: 1975-1980
publication_status: accepted
status: public
title: Multi-objective minimum time optimal control for low-thrust trajectory design
type: conference
user_id: '15694'
year: '2021'
...
---
_id: '47977'
abstract:
- lang: eng
text: Orange-colored crystals of the oxoferrate tellurate K12+6xFe6Te4−xO27 [x=0.222(4)]
were synthesized in a potassium hydroxide hydroflux with a molar water–base ratio
n(H2O)/n(KOH) of 1.5 starting from Fe(NO3)3 ⋅ 9H2O, TeO2 and H2O2 at about 200 °C.
By using (NH4)2TeO4 instead of TeO2, a fine powder consisting of microcrystalline
spheres of K12+6xFe6Te4−xO27 was obtained. K12+6xFe6Te4−xO27 crystallizes in the
acentric cubic space group Iurn:x-wiley:09476539:media:chem202102464:chem202102464-math-0001
3d. [FeIIIO5] pyramids share their apical atoms in [Fe2O9] groups and two of their
edges with [TeVIO6] octahedra to form an open framework that consists of two loosely
connected, but not interpenetrating, chiral networks. The flexibility of the hinged
oxometalate network manifests in a piezoelectric response similar to that of LiNbO3.The
potassium cations are mobile in channels that run along the <111> directions and
cross in cavities acting as nodes. The ion conductivity of cold-pressed pellets
of ball-milled K12+6xFe6Te4−xO27 is 2.3×10^(−4) S ⋅ cm^(−1) at room temperature.
Magnetization measurements and neutron diffraction indicate antiferromagnetic
coupling in the [Fe2O9] groups.
author:
- first_name: Ralf
full_name: Albrecht, Ralf
last_name: Albrecht
- first_name: Markus
full_name: Hoelzel, Markus
last_name: Hoelzel
- first_name: Henrik
full_name: Beccard, Henrik
last_name: Beccard
- first_name: Michael
full_name: Rüsing, Michael
id: '22501'
last_name: Rüsing
orcid: 0000-0003-4682-4577
- first_name: Lukas
full_name: Eng, Lukas
last_name: Eng
- first_name: Thomas
full_name: Doert, Thomas
last_name: Doert
- first_name: Michael
full_name: Ruck, Michael
last_name: Ruck
citation:
ama: Albrecht R, Hoelzel M, Beccard H, et al. Potassium Ion Conductivity in the
Cubic Labyrinth of a Piezoelectric, Antiferromagnetic Oxoferrate(III) Tellurate(VI).
Chemistry – A European Journal. 2021;27(57):14299-14306. doi:10.1002/chem.202102464
apa: Albrecht, R., Hoelzel, M., Beccard, H., Rüsing, M., Eng, L., Doert, T., &
Ruck, M. (2021). Potassium Ion Conductivity in the Cubic Labyrinth of a Piezoelectric,
Antiferromagnetic Oxoferrate(III) Tellurate(VI). Chemistry – A European Journal,
27(57), 14299–14306. https://doi.org/10.1002/chem.202102464
bibtex: '@article{Albrecht_Hoelzel_Beccard_Rüsing_Eng_Doert_Ruck_2021, title={Potassium
Ion Conductivity in the Cubic Labyrinth of a Piezoelectric, Antiferromagnetic
Oxoferrate(III) Tellurate(VI)}, volume={27}, DOI={10.1002/chem.202102464},
number={57}, journal={Chemistry – A European Journal}, publisher={Wiley}, author={Albrecht,
Ralf and Hoelzel, Markus and Beccard, Henrik and Rüsing, Michael and Eng, Lukas
and Doert, Thomas and Ruck, Michael}, year={2021}, pages={14299–14306} }'
chicago: 'Albrecht, Ralf, Markus Hoelzel, Henrik Beccard, Michael Rüsing, Lukas
Eng, Thomas Doert, and Michael Ruck. “Potassium Ion Conductivity in the Cubic
Labyrinth of a Piezoelectric, Antiferromagnetic Oxoferrate(III) Tellurate(VI).”
Chemistry – A European Journal 27, no. 57 (2021): 14299–306. https://doi.org/10.1002/chem.202102464.'
ieee: 'R. Albrecht et al., “Potassium Ion Conductivity in the Cubic Labyrinth
of a Piezoelectric, Antiferromagnetic Oxoferrate(III) Tellurate(VI),” Chemistry
– A European Journal, vol. 27, no. 57, pp. 14299–14306, 2021, doi: 10.1002/chem.202102464.'
mla: Albrecht, Ralf, et al. “Potassium Ion Conductivity in the Cubic Labyrinth of
a Piezoelectric, Antiferromagnetic Oxoferrate(III) Tellurate(VI).” Chemistry
– A European Journal, vol. 27, no. 57, Wiley, 2021, pp. 14299–306, doi:10.1002/chem.202102464.
short: R. Albrecht, M. Hoelzel, H. Beccard, M. Rüsing, L. Eng, T. Doert, M. Ruck,
Chemistry – A European Journal 27 (2021) 14299–14306.
date_created: 2023-10-11T08:39:51Z
date_updated: 2023-10-11T08:41:35Z
doi: 10.1002/chem.202102464
extern: '1'
intvolume: ' 27'
issue: '57'
keyword:
- General Chemistry
- Catalysis
- Organic Chemistry
language:
- iso: eng
page: 14299-14306
publication: Chemistry – A European Journal
publication_identifier:
issn:
- 0947-6539
- 1521-3765
publication_status: published
publisher: Wiley
quality_controlled: '1'
status: public
title: Potassium Ion Conductivity in the Cubic Labyrinth of a Piezoelectric, Antiferromagnetic
Oxoferrate(III) Tellurate(VI)
type: journal_article
user_id: '22501'
volume: 27
year: '2021'
...
---
_id: '48853'
abstract:
- lang: eng
text: In practise, it is often desirable to provide the decision-maker with a rich
set of diverse solutions of decent quality instead of just a single solution.
In this paper we study evolutionary diversity optimization for the knapsack problem
(KP). Our goal is to evolve a population of solutions that all have a profit of
at least (1 - {$ϵ$}) {$\cdot$} OPT, where OPT is the value of an optimal solution.
Furthermore, they should differ in structure with respect to an entropy-based
diversity measure. To this end we propose a simple ({$\mu$} + 1)-EA with initial
approximate solutions calculated by a well-known FPTAS for the KP. We investigate
the effect of different standard mutation operators and introduce biased mutation
and crossover which puts strong probability on flipping bits of low and/or high
frequency within the population. An experimental study on different instances
and settings shows that the proposed mutation operators in most cases perform
slightly inferior in the long term, but show strong benefits if the number of
function evaluations is severely limited.
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. Breeding Diverse Packings for the Knapsack
Problem by Means of Diversity-Tailored Evolutionary Algorithms. In: Proceedings
of the Genetic and Evolutionary Computation Conference. GECCO ’21. Association
for Computing Machinery; 2021:556–564. doi:10.1145/3449639.3459364'
apa: Bossek, J., Neumann, A., & Neumann, F. (2021). Breeding Diverse Packings
for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms.
Proceedings of the Genetic and Evolutionary Computation Conference, 556–564.
https://doi.org/10.1145/3449639.3459364
bibtex: '@inproceedings{Bossek_Neumann_Neumann_2021, place={New York, NY, USA},
series={GECCO ’21}, title={Breeding Diverse Packings for the Knapsack Problem
by Means of Diversity-Tailored Evolutionary Algorithms}, DOI={10.1145/3449639.3459364},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
publisher={Association for Computing Machinery}, author={Bossek, Jakob and Neumann,
Aneta and Neumann, Frank}, year={2021}, pages={556–564}, collection={GECCO ’21}
}'
chicago: 'Bossek, Jakob, Aneta Neumann, and Frank Neumann. “Breeding Diverse Packings
for the Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms.”
In Proceedings of the Genetic and Evolutionary Computation Conference,
556–564. GECCO ’21. New York, NY, USA: Association for Computing Machinery, 2021.
https://doi.org/10.1145/3449639.3459364.'
ieee: 'J. Bossek, A. Neumann, and F. Neumann, “Breeding Diverse Packings for the
Knapsack Problem by Means of Diversity-Tailored Evolutionary Algorithms,” in Proceedings
of the Genetic and Evolutionary Computation Conference, 2021, pp. 556–564,
doi: 10.1145/3449639.3459364.'
mla: Bossek, Jakob, et al. “Breeding Diverse Packings for the Knapsack Problem by
Means of Diversity-Tailored Evolutionary Algorithms.” Proceedings of the Genetic
and Evolutionary Computation Conference, Association for Computing Machinery,
2021, pp. 556–564, doi:10.1145/3449639.3459364.
short: 'J. Bossek, A. Neumann, F. Neumann, in: Proceedings of the Genetic and Evolutionary
Computation Conference, Association for Computing Machinery, New York, NY, USA,
2021, pp. 556–564.'
date_created: 2023-11-14T15:58:54Z
date_updated: 2023-12-13T10:45:22Z
department:
- _id: '819'
doi: 10.1145/3449639.3459364
extern: '1'
keyword:
- evolutionary algorithms
- evolutionary diversity optimization
- knapsack problem
- tailored operators
language:
- iso: eng
page: 556–564
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- 978-1-4503-8350-9
publication_status: published
publisher: Association for Computing Machinery
series_title: GECCO ’21
status: public
title: Breeding Diverse Packings for the Knapsack Problem by Means of Diversity-Tailored
Evolutionary Algorithms
type: conference
user_id: '102979'
year: '2021'
...
---
_id: '48855'
abstract:
- lang: eng
text: Computing sets of high quality solutions has gained increasing interest in
recent years. In this paper, we investigate how to obtain sets of optimal solutions
for the classical knapsack problem. We present an algorithm to count exactly the
number of optima to a zero-one knapsack problem instance. In addition, we show
how to efficiently sample uniformly at random from the set of all global optima.
In our experimental study, we investigate how the number of optima develops for
classical random benchmark instances dependent on their generator parameters.
We find that the number of global optima can increase exponentially for practically
relevant classes of instances with correlated weights and profits which poses
a justification for the considered exact counting problem.
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. Exact Counting and~Sampling of Optima for
the Knapsack Problem. In: Learning and Intelligent Optimization. Springer-Verlag;
2021:40–54. doi:10.1007/978-3-030-92121-7_4'
apa: Bossek, J., Neumann, A., & Neumann, F. (2021). Exact Counting and~Sampling
of Optima for the Knapsack Problem. Learning and Intelligent Optimization,
40–54. https://doi.org/10.1007/978-3-030-92121-7_4
bibtex: '@inproceedings{Bossek_Neumann_Neumann_2021, place={Berlin, Heidelberg},
title={Exact Counting and~Sampling of Optima for the Knapsack Problem}, DOI={10.1007/978-3-030-92121-7_4},
booktitle={Learning and Intelligent Optimization}, publisher={Springer-Verlag},
author={Bossek, Jakob and Neumann, Aneta and Neumann, Frank}, year={2021}, pages={40–54}
}'
chicago: 'Bossek, Jakob, Aneta Neumann, and Frank Neumann. “Exact Counting And~Sampling
of Optima for the Knapsack Problem.” In Learning and Intelligent Optimization,
40–54. Berlin, Heidelberg: Springer-Verlag, 2021. https://doi.org/10.1007/978-3-030-92121-7_4.'
ieee: 'J. Bossek, A. Neumann, and F. Neumann, “Exact Counting and~Sampling of Optima
for the Knapsack Problem,” in Learning and Intelligent Optimization, 2021,
pp. 40–54, doi: 10.1007/978-3-030-92121-7_4.'
mla: Bossek, Jakob, et al. “Exact Counting And~Sampling of Optima for the Knapsack
Problem.” Learning and Intelligent Optimization, Springer-Verlag, 2021,
pp. 40–54, doi:10.1007/978-3-030-92121-7_4.
short: 'J. Bossek, A. Neumann, F. Neumann, in: Learning and Intelligent Optimization,
Springer-Verlag, Berlin, Heidelberg, 2021, pp. 40–54.'
date_created: 2023-11-14T15:58:54Z
date_updated: 2023-12-13T10:45:14Z
department:
- _id: '819'
doi: 10.1007/978-3-030-92121-7_4
extern: '1'
keyword:
- Dynamic programming
- Exact counting
- Sampling
- Zero-one knapsack problem
language:
- iso: eng
page: 40–54
place: Berlin, Heidelberg
publication: Learning and Intelligent Optimization
publication_identifier:
isbn:
- 978-3-030-92120-0
publication_status: published
publisher: Springer-Verlag
status: public
title: Exact Counting and~Sampling of Optima for the Knapsack Problem
type: conference
user_id: '102979'
year: '2021'
...
---
_id: '48860'
abstract:
- lang: eng
text: In the area of evolutionary computation the calculation of diverse sets of
high-quality solutions to a given optimization problem has gained momentum in
recent years under the term evolutionary diversity optimization. Theoretical insights
into the working principles of baseline evolutionary algorithms for diversity
optimization are still rare. In this paper we study the well-known Minimum Spanning
Tree problem (MST) in the context of diversity optimization where population diversity
is measured by the sum of pairwise edge overlaps. Theoretical results provide
insights into the fitness landscape of the MST diversity optimization problem
pointing out that even for a population of {$\mu$} = 2 fitness plateaus (of constant
length) can be reached, but nevertheless diverse sets can be calculated in polynomial
time. We supplement our theoretical results with a series of experiments for the
unconstrained and constraint case where all solutions need to fulfill a minimal
quality threshold. Our results show that a simple ({$\mu$} + 1)-EA can effectively
compute a diversified population of spanning trees of high quality.
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
citation:
ama: 'Bossek J, Neumann F. Evolutionary Diversity Optimization and the Minimum Spanning
Tree Problem. In: Proceedings of the Genetic and Evolutionary Computation Conference.
GECCO ’21. Association for Computing Machinery; 2021:198–206. doi:10.1145/3449639.3459363'
apa: Bossek, J., & Neumann, F. (2021). Evolutionary Diversity Optimization and
the Minimum Spanning Tree Problem. Proceedings of the Genetic and Evolutionary
Computation Conference, 198–206. https://doi.org/10.1145/3449639.3459363
bibtex: '@inproceedings{Bossek_Neumann_2021, place={New York, NY, USA}, series={GECCO
’21}, title={Evolutionary Diversity Optimization and the Minimum Spanning Tree
Problem}, DOI={10.1145/3449639.3459363},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference},
publisher={Association for Computing Machinery}, author={Bossek, Jakob and Neumann,
Frank}, year={2021}, pages={198–206}, collection={GECCO ’21} }'
chicago: 'Bossek, Jakob, and Frank Neumann. “Evolutionary Diversity Optimization
and the Minimum Spanning Tree Problem.” In Proceedings of the Genetic and Evolutionary
Computation Conference, 198–206. GECCO ’21. New York, NY, USA: Association
for Computing Machinery, 2021. https://doi.org/10.1145/3449639.3459363.'
ieee: 'J. Bossek and F. Neumann, “Evolutionary Diversity Optimization and the Minimum
Spanning Tree Problem,” in Proceedings of the Genetic and Evolutionary Computation
Conference, 2021, pp. 198–206, doi: 10.1145/3449639.3459363.'
mla: Bossek, Jakob, and Frank Neumann. “Evolutionary Diversity Optimization and
the Minimum Spanning Tree Problem.” Proceedings of the Genetic and Evolutionary
Computation Conference, Association for Computing Machinery, 2021, pp. 198–206,
doi:10.1145/3449639.3459363.
short: 'J. Bossek, F. Neumann, in: Proceedings of the Genetic and Evolutionary Computation
Conference, Association for Computing Machinery, New York, NY, USA, 2021, pp.
198–206.'
date_created: 2023-11-14T15:58:55Z
date_updated: 2023-12-13T10:45:37Z
department:
- _id: '819'
doi: 10.1145/3449639.3459363
extern: '1'
keyword:
- evolutionary algorithms
- evolutionary diversity optimization
- minimum spanning tree
- runtime analysis
language:
- iso: eng
page: 198–206
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference
publication_identifier:
isbn:
- 978-1-4503-8350-9
publication_status: published
publisher: Association for Computing Machinery
series_title: GECCO ’21
status: public
title: Evolutionary Diversity Optimization and the Minimum Spanning Tree Problem
type: conference
user_id: '102979'
year: '2021'
...
---
_id: '48881'
abstract:
- lang: eng
text: 'Classic automated algorithm selection (AS) for (combinatorial) optimization
problems heavily relies on so-called instance features, i.e., numerical characteristics
of the problem at hand ideally extracted with computationally low-demanding routines.
For the traveling salesperson problem (TSP) a plethora of features have been suggested.
Most of these features are, if at all, only normalized imprecisely raising the
issue of feature values being strongly affected by the instance size. Such artifacts
may have detrimental effects on algorithm selection models. We propose a normalization
for two feature groups which stood out in multiple AS studies on the TSP: (a)
features based on a minimum spanning tree (MST) and (b) a k-nearest neighbor graph
(NNG) transformation of the input instance. To this end we theoretically derive
minimum and maximum values for properties of MSTs and k-NNGs of Euclidean graphs.
We analyze the differences in feature space between normalized versions of these
features and their unnormalized counterparts. Our empirical investigations on
various TSP benchmark sets point out that the feature scaling succeeds in eliminating
the effect of the instance size. Eventually, a proof-of-concept AS-study shows
promising results: models trained with normalized features tend to outperform
those trained with the respective vanilla features.'
author:
- first_name: Jonathan
full_name: Heins, Jonathan
last_name: Heins
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Janina
full_name: Pohl, Janina
last_name: Pohl
- first_name: Moritz
full_name: Seiler, Moritz
last_name: Seiler
- first_name: Heike
full_name: Trautmann, Heike
last_name: Trautmann
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
citation:
ama: 'Heins J, Bossek J, Pohl J, Seiler M, Trautmann H, Kerschke P. On the Potential
of Normalized TSP Features for Automated Algorithm Selection. In: Proceedings
of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms. Association
for Computing Machinery; 2021:1–15.'
apa: Heins, J., Bossek, J., Pohl, J., Seiler, M., Trautmann, H., & Kerschke,
P. (2021). On the Potential of Normalized TSP Features for Automated Algorithm
Selection. In Proceedings of the 16th ACM/SIGEVO Conference on Foundations
of Genetic Algorithms (pp. 1–15). Association for Computing Machinery.
bibtex: '@inbook{Heins_Bossek_Pohl_Seiler_Trautmann_Kerschke_2021, place={New York,
NY, USA}, title={On the Potential of Normalized TSP Features for Automated Algorithm
Selection}, booktitle={Proceedings of the 16th ACM/SIGEVO Conference on Foundations
of Genetic Algorithms}, publisher={Association for Computing Machinery}, author={Heins,
Jonathan and Bossek, Jakob and Pohl, Janina and Seiler, Moritz and Trautmann,
Heike and Kerschke, Pascal}, year={2021}, pages={1–15} }'
chicago: 'Heins, Jonathan, Jakob Bossek, Janina Pohl, Moritz Seiler, Heike Trautmann,
and Pascal Kerschke. “On the Potential of Normalized TSP Features for Automated
Algorithm Selection.” In Proceedings of the 16th ACM/SIGEVO Conference on Foundations
of Genetic Algorithms, 1–15. New York, NY, USA: Association for Computing
Machinery, 2021.'
ieee: 'J. Heins, J. Bossek, J. Pohl, M. Seiler, H. Trautmann, and P. Kerschke, “On
the Potential of Normalized TSP Features for Automated Algorithm Selection,” in
Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms,
New York, NY, USA: Association for Computing Machinery, 2021, pp. 1–15.'
mla: Heins, Jonathan, et al. “On the Potential of Normalized TSP Features for Automated
Algorithm Selection.” Proceedings of the 16th ACM/SIGEVO Conference on Foundations
of Genetic Algorithms, Association for Computing Machinery, 2021, pp. 1–15.
short: 'J. Heins, J. Bossek, J. Pohl, M. Seiler, H. Trautmann, P. Kerschke, in:
Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic Algorithms,
Association for Computing Machinery, New York, NY, USA, 2021, pp. 1–15.'
date_created: 2023-11-14T15:58:58Z
date_updated: 2023-12-13T10:47:23Z
department:
- _id: '819'
extern: '1'
keyword:
- automated algorithm selection
- graph theory
- instance features
- normalization
- traveling salesperson problem (TSP)
language:
- iso: eng
page: 1–15
place: New York, NY, USA
publication: Proceedings of the 16th ACM/SIGEVO Conference on Foundations of Genetic
Algorithms
publication_identifier:
isbn:
- 978-1-4503-8352-3
publisher: Association for Computing Machinery
status: public
title: On the Potential of Normalized TSP Features for Automated Algorithm Selection
type: book_chapter
user_id: '102979'
year: '2021'
...
---
_id: '48876'
abstract:
- lang: eng
text: In recent years, Evolutionary Algorithms (EAs) have frequently been adopted
to evolve instances for optimization problems that pose difficulties for one algorithm
while being rather easy for a competitor and vice versa. Typically, this is achieved
by either minimizing or maximizing the performance difference or ratio which serves
as the fitness function. Repeating this process is useful to gain insights into
strengths/weaknesses of certain algorithms or to build a set of instances with
strong performance differences as a foundation for automatic per-instance algorithm
selection or configuration. We contribute to this branch of research by proposing
fitness-functions to evolve instances that show large performance differences
for more than just two algorithms simultaneously. As a proof-of-principle, we
evolve instances of the multi-component Traveling Thief Problem (TTP) for three
incomplete TTP-solvers. Our results point out that our strategies are promising,
but unsurprisingly their success strongly relies on the algorithms’ performance
complementarity.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Markus
full_name: Wagner, Markus
last_name: Wagner
citation:
ama: 'Bossek J, Wagner M. Generating Instances with Performance Differences for
More than Just Two Algorithms. In: Proceedings of the Genetic and Evolutionary
Computation Conference Companion. GECCO’21. Association for Computing Machinery;
2021:1423–1432. doi:10.1145/3449726.3463165'
apa: Bossek, J., & Wagner, M. (2021). Generating Instances with Performance
Differences for More than Just Two Algorithms. Proceedings of the Genetic and
Evolutionary Computation Conference Companion, 1423–1432. https://doi.org/10.1145/3449726.3463165
bibtex: '@inproceedings{Bossek_Wagner_2021, place={New York, NY, USA}, series={GECCO’21},
title={Generating Instances with Performance Differences for More than Just Two
Algorithms}, DOI={10.1145/3449726.3463165},
booktitle={Proceedings of the Genetic and Evolutionary Computation Conference
Companion}, publisher={Association for Computing Machinery}, author={Bossek, Jakob
and Wagner, Markus}, year={2021}, pages={1423–1432}, collection={GECCO’21} }'
chicago: 'Bossek, Jakob, and Markus Wagner. “Generating Instances with Performance
Differences for More than Just Two Algorithms.” In Proceedings of the Genetic
and Evolutionary Computation Conference Companion, 1423–1432. GECCO’21. New
York, NY, USA: Association for Computing Machinery, 2021. https://doi.org/10.1145/3449726.3463165.'
ieee: 'J. Bossek and M. Wagner, “Generating Instances with Performance Differences
for More than Just Two Algorithms,” in Proceedings of the Genetic and Evolutionary
Computation Conference Companion, 2021, pp. 1423–1432, doi: 10.1145/3449726.3463165.'
mla: Bossek, Jakob, and Markus Wagner. “Generating Instances with Performance Differences
for More than Just Two Algorithms.” Proceedings of the Genetic and Evolutionary
Computation Conference Companion, Association for Computing Machinery, 2021,
pp. 1423–1432, doi:10.1145/3449726.3463165.
short: 'J. Bossek, M. Wagner, in: Proceedings of the Genetic and Evolutionary Computation
Conference Companion, Association for Computing Machinery, New York, NY, USA,
2021, pp. 1423–1432.'
date_created: 2023-11-14T15:58:57Z
date_updated: 2023-12-13T10:47:41Z
department:
- _id: '819'
doi: 10.1145/3449726.3463165
extern: '1'
keyword:
- evolutionary algorithms
- evolving instances
- fitness function
- instance hardness
- traveling thief problem (TTP)
language:
- iso: eng
page: 1423–1432
place: New York, NY, USA
publication: Proceedings of the Genetic and Evolutionary Computation Conference Companion
publication_identifier:
isbn:
- 978-1-4503-8351-6
publisher: Association for Computing Machinery
series_title: GECCO’21
status: public
title: Generating Instances with Performance Differences for More than Just Two Algorithms
type: conference
user_id: '102979'
year: '2021'
...
---
_id: '48854'
abstract:
- lang: eng
text: We contribute to the theoretical understanding of randomized search heuristics
for dynamic problems. We consider the classical vertex coloring problem on graphs
and investigate the dynamic setting where edges are added to the current graph.
We then analyze the expected time for randomized search heuristics to recompute
high quality solutions. The (1+1) Evolutionary Algorithm and RLS operate in a
setting where the number of colors is bounded and we are minimizing the number
of conflicts. Iterated local search algorithms use an unbounded color palette
and aim to use the smallest colors and, consequently, the smallest number of colors.
We identify classes of bipartite graphs where reoptimization is as hard as or
even harder than optimization from scratch, i.e., starting with a random initialization.
Even adding a single edge can lead to hard symmetry problems. However, graph classes
that are hard for one algorithm turn out to be easy for others. In most cases
our bounds show that reoptimization is faster than optimizing from scratch. We
further show that tailoring mutation operators to parts of the graph where changes
have occurred can significantly reduce the expected reoptimization time. In most
settings the expected reoptimization time for such tailored algorithms is linear
in the number of added edges. However, tailored algorithms cannot prevent exponential
times in settings where the original algorithm is inefficient.
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. Time Complexity Analysis of Randomized
Search Heuristics for the Dynamic Graph Coloring Problem. Algorithmica.
2021;83(10):3148–3179. doi:10.1007/s00453-021-00838-3
apa: Bossek, J., Neumann, F., Peng, P., & Sudholt, D. (2021). Time Complexity
Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem.
Algorithmica, 83(10), 3148–3179. https://doi.org/10.1007/s00453-021-00838-3
bibtex: '@article{Bossek_Neumann_Peng_Sudholt_2021, title={Time Complexity Analysis
of Randomized Search Heuristics for the Dynamic Graph Coloring Problem}, volume={83},
DOI={10.1007/s00453-021-00838-3},
number={10}, journal={Algorithmica}, author={Bossek, Jakob and Neumann, Frank
and Peng, Pan and Sudholt, Dirk}, year={2021}, pages={3148–3179} }'
chicago: 'Bossek, Jakob, Frank Neumann, Pan Peng, and Dirk Sudholt. “Time Complexity
Analysis of Randomized Search Heuristics for the Dynamic Graph Coloring Problem.”
Algorithmica 83, no. 10 (2021): 3148–3179. https://doi.org/10.1007/s00453-021-00838-3.'
ieee: 'J. Bossek, F. Neumann, P. Peng, and D. Sudholt, “Time Complexity Analysis
of Randomized Search Heuristics for the Dynamic Graph Coloring Problem,” Algorithmica,
vol. 83, no. 10, pp. 3148–3179, 2021, doi: 10.1007/s00453-021-00838-3.'
mla: Bossek, Jakob, et al. “Time Complexity Analysis of Randomized Search Heuristics
for the Dynamic Graph Coloring Problem.” Algorithmica, vol. 83, no. 10,
2021, pp. 3148–3179, doi:10.1007/s00453-021-00838-3.
short: J. Bossek, F. Neumann, P. Peng, D. Sudholt, Algorithmica 83 (2021) 3148–3179.
date_created: 2023-11-14T15:58:54Z
date_updated: 2023-12-13T10:51:34Z
department:
- _id: '819'
doi: 10.1007/s00453-021-00838-3
intvolume: ' 83'
issue: '10'
keyword:
- Dynamic optimization
- Evolutionary algorithms
- Running time analysis
language:
- iso: eng
page: 3148–3179
publication: Algorithmica
publication_identifier:
issn:
- 0178-4617
status: public
title: Time Complexity Analysis of Randomized Search Heuristics for the Dynamic Graph
Coloring Problem
type: journal_article
user_id: '102979'
volume: 83
year: '2021'
...
---
_id: '24101'
abstract:
- lang: eng
text: Arburg Plastic Freeforming (APF) is an additive manufacturing process with
which three-dimensional, thermoplastic components can be produced layer by layer.
Visual and geometrical properties are a major criterion for characterizing the
resulting component quality. The aim of this study was to investigate the influences
on visual and geometrical properties of APF components depending on process parameters.
Initially the focus was on the analysis of the shrinkage behavior of ABS-M30 (Stratasys).
On the basis of the results and an existing procedure by the machine manufacturer,
an optimized procedure for determining the scaling factors was developed to counteract
the shrinkage. With this procedure a higher dimensional accuracy of the components
can be achieved. In addition, it was investigated whether an adaption of the form
factor based on a mathematical model depending on the component geometry makes
sense. The results were transferred into manufacturing guidelines, which allow
the user of the APF-technology to optimize process parameters more efficiently.
author:
- first_name: Elmar
full_name: Moritzer, Elmar
id: '20531'
last_name: Moritzer
- first_name: Felix
full_name: Hecker, Felix
id: '45537'
last_name: Hecker
- first_name: Christian Lennart
full_name: Elsner, Christian Lennart
id: '70729'
last_name: Elsner
- first_name: André
full_name: Hirsch, André
id: '27599'
last_name: Hirsch
citation:
ama: 'Moritzer E, Hecker F, Elsner CL, Hirsch A. Investigations for the Optimization
of Visual and Geometrical Properties of Arburg Plastic Freeforming Components.
In: Bourell D, ed. Proceedings: 2021 Annual International Solid Freeform Fabrication
Symposium (SFF Symp 2021). ; 2021:467-474. doi:10.26153/tsw/17567'
apa: 'Moritzer, E., Hecker, F., Elsner, C. L., & Hirsch, A. (2021). Investigations
for the Optimization of Visual and Geometrical Properties of Arburg Plastic Freeforming
Components. In D. Bourell (Ed.), Proceedings: 2021 Annual International Solid
Freeform Fabrication Symposium (SFF Symp 2021) (pp. 467–474). https://doi.org/10.26153/tsw/17567'
bibtex: '@inproceedings{Moritzer_Hecker_Elsner_Hirsch_2021, title={Investigations
for the Optimization of Visual and Geometrical Properties of Arburg Plastic Freeforming
Components}, DOI={10.26153/tsw/17567},
booktitle={Proceedings: 2021 Annual International Solid Freeform Fabrication Symposium
(SFF Symp 2021)}, author={Moritzer, Elmar and Hecker, Felix and Elsner, Christian
Lennart and Hirsch, André}, editor={Bourell, David}, year={2021}, pages={467–474}
}'
chicago: 'Moritzer, Elmar, Felix Hecker, Christian Lennart Elsner, and André Hirsch.
“Investigations for the Optimization of Visual and Geometrical Properties of Arburg
Plastic Freeforming Components.” In Proceedings: 2021 Annual International
Solid Freeform Fabrication Symposium (SFF Symp 2021), edited by David Bourell,
467–74, 2021. https://doi.org/10.26153/tsw/17567.'
ieee: 'E. Moritzer, F. Hecker, C. L. Elsner, and A. Hirsch, “Investigations for
the Optimization of Visual and Geometrical Properties of Arburg Plastic Freeforming
Components,” in Proceedings: 2021 Annual International Solid Freeform Fabrication
Symposium (SFF Symp 2021), Austin, Texas, USA, 2021, pp. 467–474, doi: 10.26153/tsw/17567.'
mla: 'Moritzer, Elmar, et al. “Investigations for the Optimization of Visual and
Geometrical Properties of Arburg Plastic Freeforming Components.” Proceedings:
2021 Annual International Solid Freeform Fabrication Symposium (SFF Symp 2021),
edited by David Bourell, 2021, pp. 467–74, doi:10.26153/tsw/17567.'
short: 'E. Moritzer, F. Hecker, C.L. Elsner, A. Hirsch, in: D. Bourell (Ed.), Proceedings:
2021 Annual International Solid Freeform Fabrication Symposium (SFF Symp 2021),
2021, pp. 467–474.'
conference:
end_date: 2021-08-04
location: Austin, Texas, USA
name: 2021 Annual International Solid Freeform Fabrication Symposium (SFF Symp 2021)
start_date: 2021-08-02
date_created: 2021-09-10T06:54:35Z
date_updated: 2024-01-08T11:32:53Z
department:
- _id: '9'
- _id: '367'
- _id: '321'
- _id: '219'
- _id: '624'
doi: 10.26153/tsw/17567
editor:
- first_name: David
full_name: Bourell, David
last_name: Bourell
language:
- iso: eng
main_file_link:
- open_access: '1'
url: http://utw10945.utweb.utexas.edu/2021-table-contents
oa: '1'
page: 467-474
publication: 'Proceedings: 2021 Annual International Solid Freeform Fabrication Symposium
(SFF Symp 2021)'
publication_status: published
status: public
title: Investigations for the Optimization of Visual and Geometrical Properties of
Arburg Plastic Freeforming Components
type: conference
user_id: '45537'
year: '2021'
...
---
_id: '47564'
author:
- first_name: Arnulf
full_name: Reitze, Arnulf
last_name: Reitze
- first_name: Marcus
full_name: Grünewald, Marcus
last_name: Grünewald
- first_name: Julia
full_name: Riese, Julia
id: '101499'
last_name: Riese
orcid: 0000-0002-3053-0534
citation:
ama: Reitze A, Grünewald M, Riese J. Characterization of Liquid-Phase Distribution
in 3D Printed Structured Packings with an Enclosed Column Wall. Industrial
& Engineering Chemistry Research. 2021;61(1):740-746. doi:10.1021/acs.iecr.1c03931
apa: Reitze, A., Grünewald, M., & Riese, J. (2021). Characterization of Liquid-Phase
Distribution in 3D Printed Structured Packings with an Enclosed Column Wall. Industrial
& Engineering Chemistry Research, 61(1), 740–746. https://doi.org/10.1021/acs.iecr.1c03931
bibtex: '@article{Reitze_Grünewald_Riese_2021, title={Characterization of Liquid-Phase
Distribution in 3D Printed Structured Packings with an Enclosed Column Wall},
volume={61}, DOI={10.1021/acs.iecr.1c03931},
number={1}, journal={Industrial & Engineering Chemistry Research}, publisher={American
Chemical Society (ACS)}, author={Reitze, Arnulf and Grünewald, Marcus and Riese,
Julia}, year={2021}, pages={740–746} }'
chicago: 'Reitze, Arnulf, Marcus Grünewald, and Julia Riese. “Characterization of
Liquid-Phase Distribution in 3D Printed Structured Packings with an Enclosed Column
Wall.” Industrial & Engineering Chemistry Research 61, no. 1 (2021):
740–46. https://doi.org/10.1021/acs.iecr.1c03931.'
ieee: 'A. Reitze, M. Grünewald, and J. Riese, “Characterization of Liquid-Phase
Distribution in 3D Printed Structured Packings with an Enclosed Column Wall,”
Industrial & Engineering Chemistry Research, vol. 61, no. 1, pp.
740–746, 2021, doi: 10.1021/acs.iecr.1c03931.'
mla: Reitze, Arnulf, et al. “Characterization of Liquid-Phase Distribution in 3D
Printed Structured Packings with an Enclosed Column Wall.” Industrial &
Engineering Chemistry Research, vol. 61, no. 1, American Chemical Society
(ACS), 2021, pp. 740–46, doi:10.1021/acs.iecr.1c03931.
short: A. Reitze, M. Grünewald, J. Riese, Industrial & Engineering Chemistry
Research 61 (2021) 740–746.
date_created: 2023-10-04T14:16:01Z
date_updated: 2024-03-08T11:38:39Z
doi: 10.1021/acs.iecr.1c03931
extern: '1'
intvolume: ' 61'
issue: '1'
keyword:
- Industrial and Manufacturing Engineering
- General Chemical Engineering
- General Chemistry
language:
- iso: eng
page: 740-746
publication: Industrial & Engineering Chemistry Research
publication_identifier:
issn:
- 0888-5885
- 1520-5045
publication_status: published
publisher: American Chemical Society (ACS)
quality_controlled: '1'
status: public
title: Characterization of Liquid-Phase Distribution in 3D Printed Structured Packings
with an Enclosed Column Wall
type: journal_article
user_id: '101499'
volume: 61
year: '2021'
...
---
_id: '47568'
author:
- first_name: Bastian
full_name: Bruns, Bastian
last_name: Bruns
- first_name: Felix
full_name: Herrmann, Felix
last_name: Herrmann
- first_name: Marcus
full_name: Grünewald, Marcus
last_name: Grünewald
- first_name: Julia
full_name: Riese, Julia
id: '101499'
last_name: Riese
orcid: 0000-0002-3053-0534
citation:
ama: Bruns B, Herrmann F, Grünewald M, Riese J. Dynamic Design Optimization for
Flexible Process Equipment. Industrial & Engineering Chemistry Research.
2021;60(20):7678-7688. doi:10.1021/acs.iecr.1c00306
apa: Bruns, B., Herrmann, F., Grünewald, M., & Riese, J. (2021). Dynamic Design
Optimization for Flexible Process Equipment. Industrial & Engineering
Chemistry Research, 60(20), 7678–7688. https://doi.org/10.1021/acs.iecr.1c00306
bibtex: '@article{Bruns_Herrmann_Grünewald_Riese_2021, title={Dynamic Design Optimization
for Flexible Process Equipment}, volume={60}, DOI={10.1021/acs.iecr.1c00306},
number={20}, journal={Industrial & Engineering Chemistry Research}, publisher={American
Chemical Society (ACS)}, author={Bruns, Bastian and Herrmann, Felix and Grünewald,
Marcus and Riese, Julia}, year={2021}, pages={7678–7688} }'
chicago: 'Bruns, Bastian, Felix Herrmann, Marcus Grünewald, and Julia Riese. “Dynamic
Design Optimization for Flexible Process Equipment.” Industrial & Engineering
Chemistry Research 60, no. 20 (2021): 7678–88. https://doi.org/10.1021/acs.iecr.1c00306.'
ieee: 'B. Bruns, F. Herrmann, M. Grünewald, and J. Riese, “Dynamic Design Optimization
for Flexible Process Equipment,” Industrial & Engineering Chemistry
Research, vol. 60, no. 20, pp. 7678–7688, 2021, doi: 10.1021/acs.iecr.1c00306.'
mla: Bruns, Bastian, et al. “Dynamic Design Optimization for Flexible Process Equipment.”
Industrial & Engineering Chemistry Research, vol. 60, no. 20, American
Chemical Society (ACS), 2021, pp. 7678–88, doi:10.1021/acs.iecr.1c00306.
short: B. Bruns, F. Herrmann, M. Grünewald, J. Riese, Industrial & Engineering
Chemistry Research 60 (2021) 7678–7688.
date_created: 2023-10-04T14:16:46Z
date_updated: 2024-03-08T11:37:55Z
doi: 10.1021/acs.iecr.1c00306
extern: '1'
intvolume: ' 60'
issue: '20'
keyword:
- Industrial and Manufacturing Engineering
- General Chemical Engineering
- General Chemistry
language:
- iso: eng
page: 7678-7688
publication: Industrial & Engineering Chemistry Research
publication_identifier:
issn:
- 0888-5885
- 1520-5045
publication_status: published
publisher: American Chemical Society (ACS)
quality_controlled: '1'
status: public
title: Dynamic Design Optimization for Flexible Process Equipment
type: journal_article
user_id: '101499'
volume: 60
year: '2021'
...
---
_id: '47570'
abstract:
- lang: eng
text: AbstractShortened product life cycles and
increased demand for specialized products lead to more challenges in efficiently
satisfying customer needs. Customer demands are increasingly uncertain in terms
of type, location, and volume. As a result, more flexible chemical production
plants are required. Modular small‐scale plants can be installed in transportation
containers and, therefore, offer the flexibility of easy relocation, enabling
production close to the customer or supplier. In a mathematical optimization model,
the economic benefit of small‐scale plants in the specialty chemicals market of
polymer production is analyzed. Different scenarios created from the real data
of a chemical company show that the use of small‐scale plants may lead to a significant
reduction in total costs that is mainly due to the transportation costs of raw
materials and products.
author:
- first_name: Bastian
full_name: Bruns, Bastian
last_name: Bruns
- first_name: Tristan
full_name: Becker, Tristan
last_name: Becker
- first_name: Julia
full_name: Riese, Julia
id: '101499'
last_name: Riese
orcid: 0000-0002-3053-0534
- first_name: Stefan
full_name: Lier, Stefan
last_name: Lier
- first_name: Brigitte
full_name: Werners, Brigitte
last_name: Werners
citation:
ama: Bruns B, Becker T, Riese J, Lier S, Werners B. Efficient Production of Specialized
Polymers with Highly Flexible Small‐Scale Plants. Chemical Engineering &
Technology. 2021;44(6):1148-1152. doi:10.1002/ceat.202000591
apa: Bruns, B., Becker, T., Riese, J., Lier, S., & Werners, B. (2021). Efficient
Production of Specialized Polymers with Highly Flexible Small‐Scale Plants. Chemical
Engineering & Technology, 44(6), 1148–1152. https://doi.org/10.1002/ceat.202000591
bibtex: '@article{Bruns_Becker_Riese_Lier_Werners_2021, title={Efficient Production
of Specialized Polymers with Highly Flexible Small‐Scale Plants}, volume={44},
DOI={10.1002/ceat.202000591},
number={6}, journal={Chemical Engineering & Technology}, publisher={Wiley},
author={Bruns, Bastian and Becker, Tristan and Riese, Julia and Lier, Stefan and
Werners, Brigitte}, year={2021}, pages={1148–1152} }'
chicago: 'Bruns, Bastian, Tristan Becker, Julia Riese, Stefan Lier, and Brigitte
Werners. “Efficient Production of Specialized Polymers with Highly Flexible Small‐Scale
Plants.” Chemical Engineering & Technology 44, no. 6 (2021): 1148–52.
https://doi.org/10.1002/ceat.202000591.'
ieee: 'B. Bruns, T. Becker, J. Riese, S. Lier, and B. Werners, “Efficient Production
of Specialized Polymers with Highly Flexible Small‐Scale Plants,” Chemical
Engineering & Technology, vol. 44, no. 6, pp. 1148–1152, 2021, doi:
10.1002/ceat.202000591.'
mla: Bruns, Bastian, et al. “Efficient Production of Specialized Polymers with Highly
Flexible Small‐Scale Plants.” Chemical Engineering & Technology,
vol. 44, no. 6, Wiley, 2021, pp. 1148–52, doi:10.1002/ceat.202000591.
short: B. Bruns, T. Becker, J. Riese, S. Lier, B. Werners, Chemical Engineering
& Technology 44 (2021) 1148–1152.
date_created: 2023-10-04T14:17:08Z
date_updated: 2024-03-08T11:37:29Z
doi: 10.1002/ceat.202000591
extern: '1'
intvolume: ' 44'
issue: '6'
keyword:
- Industrial and Manufacturing Engineering
- General Chemical Engineering
- General Chemistry
language:
- iso: eng
page: 1148-1152
publication: Chemical Engineering & Technology
publication_identifier:
issn:
- 0930-7516
- 1521-4125
publication_status: published
publisher: Wiley
quality_controlled: '1'
status: public
title: Efficient Production of Specialized Polymers with Highly Flexible Small‐Scale
Plants
type: journal_article
user_id: '101499'
volume: 44
year: '2021'
...
---
_id: '30693'
author:
- first_name: Matti
full_name: Grabo, Matti
id: '66520'
last_name: Grabo
- first_name: Lennart
full_name: Kuckuck, Lennart
last_name: Kuckuck
- first_name: Eugeny
full_name: Kenig, Eugeny
id: '665'
last_name: Kenig
citation:
ama: 'Grabo M, Kuckuck L, Kenig E. Optimization of packed bed latent heat storages
filled with PCM-capsules based on super-ellipsoids. In: ; 2021.'
apa: Grabo, M., Kuckuck, L., & Kenig, E. (2021). Optimization of packed bed
latent heat storages filled with PCM-capsules based on super-ellipsoids. 16th
Conference on Sustainable Development of Energy, Water and Environment Systems,
Dubrovnik.
bibtex: '@inproceedings{Grabo_Kuckuck_Kenig_2021, title={Optimization of packed
bed latent heat storages filled with PCM-capsules based on super-ellipsoids},
author={Grabo, Matti and Kuckuck, Lennart and Kenig, Eugeny}, year={2021} }'
chicago: Grabo, Matti, Lennart Kuckuck, and Eugeny Kenig. “Optimization of Packed
Bed Latent Heat Storages Filled with PCM-Capsules Based on Super-Ellipsoids,”
2021.
ieee: M. Grabo, L. Kuckuck, and E. Kenig, “Optimization of packed bed latent heat
storages filled with PCM-capsules based on super-ellipsoids,” presented at the
16th Conference on Sustainable Development of Energy, Water and Environment Systems,
Dubrovnik, 2021.
mla: Grabo, Matti, et al. Optimization of Packed Bed Latent Heat Storages Filled
with PCM-Capsules Based on Super-Ellipsoids. 2021.
short: 'M. Grabo, L. Kuckuck, E. Kenig, in: 2021.'
conference:
end_date: 2021-10-15
location: Dubrovnik
name: 16th Conference on Sustainable Development of Energy, Water and Environment
Systems
start_date: 2021-10-10
date_created: 2022-03-29T09:12:48Z
date_updated: 2024-03-18T13:25:03Z
department:
- _id: '9'
- _id: '145'
language:
- iso: eng
quality_controlled: '1'
status: public
title: Optimization of packed bed latent heat storages filled with PCM-capsules based
on super-ellipsoids
type: conference
user_id: '66520'
year: '2021'
...
---
_id: '52665'
author:
- first_name: Michael
full_name: Hillebrand, Michael
id: '83856'
last_name: Hillebrand
citation:
ama: Hillebrand M. Entwicklungssystematik Zur Integration von Eigenschaften Der
Selbstheilung in Intelligente Technische Systeme . Vol Band 403.; 2021.
apa: 'Hillebrand, M. (2021). Entwicklungssystematik zur Integration von Eigenschaften
der Selbstheilung in Intelligente Technische Systeme : Vol. Band 403.'
bibtex: '@book{Hillebrand_2021, series={HNI-Verlagsschriftreihe}, title={Entwicklungssystematik
zur Integration von Eigenschaften der Selbstheilung in Intelligente Technische
Systeme }, volume={Band 403}, author={Hillebrand, Michael}, year={2021}, collection={HNI-Verlagsschriftreihe}
}'
chicago: Hillebrand, Michael. Entwicklungssystematik Zur Integration von Eigenschaften
Der Selbstheilung in Intelligente Technische Systeme . Vol. Band 403. HNI-Verlagsschriftreihe,
2021.
ieee: M. Hillebrand, Entwicklungssystematik zur Integration von Eigenschaften
der Selbstheilung in Intelligente Technische Systeme , vol. Band 403. 2021.
mla: Hillebrand, Michael. Entwicklungssystematik Zur Integration von Eigenschaften
Der Selbstheilung in Intelligente Technische Systeme . 2021.
short: M. Hillebrand, Entwicklungssystematik Zur Integration von Eigenschaften Der
Selbstheilung in Intelligente Technische Systeme , 2021.
date_created: 2024-03-20T10:07:10Z
date_updated: 2024-04-02T09:47:42Z
department:
- _id: '26'
language:
- iso: eng
publication_identifier:
isbn:
- 978-3-947647-22-4
series_title: HNI-Verlagsschriftreihe
status: public
title: 'Entwicklungssystematik zur Integration von Eigenschaften der Selbstheilung
in Intelligente Technische Systeme '
type: dissertation
user_id: '5786'
volume: Band 403
year: '2021'
...