---
_id: '30605'
author:
- first_name: Sven
full_name: Bolte, Sven
last_name: Bolte
- first_name: Norbert
full_name: Fröhleke, Norbert
last_name: Fröhleke
- first_name: Joachim
full_name: Böcker, Joachim
id: '66'
last_name: Böcker
orcid: 0000-0002-8480-7295
citation:
ama: 'Bolte S, Fröhleke N, Böcker J. Efficiency optimization for a power factor
correction (PFC) rectifier with gallium nitride transistor. In: 2015 IEEE 3rd
Workshop on Wide Bandgap Power Devices and Applications (WiPDA). IEEE; 2016.
doi:10.1109/wipda.2015.7369288'
apa: Bolte, S., Fröhleke, N., & Böcker, J. (2016). Efficiency optimization for
a power factor correction (PFC) rectifier with gallium nitride transistor. 2015
IEEE 3rd Workshop on Wide Bandgap Power Devices and Applications (WiPDA).
https://doi.org/10.1109/wipda.2015.7369288
bibtex: '@inproceedings{Bolte_Fröhleke_Böcker_2016, title={Efficiency optimization
for a power factor correction (PFC) rectifier with gallium nitride transistor},
DOI={10.1109/wipda.2015.7369288},
booktitle={2015 IEEE 3rd Workshop on Wide Bandgap Power Devices and Applications
(WiPDA)}, publisher={IEEE}, author={Bolte, Sven and Fröhleke, Norbert and Böcker,
Joachim}, year={2016} }'
chicago: Bolte, Sven, Norbert Fröhleke, and Joachim Böcker. “Efficiency Optimization
for a Power Factor Correction (PFC) Rectifier with Gallium Nitride Transistor.”
In 2015 IEEE 3rd Workshop on Wide Bandgap Power Devices and Applications (WiPDA).
IEEE, 2016. https://doi.org/10.1109/wipda.2015.7369288.
ieee: 'S. Bolte, N. Fröhleke, and J. Böcker, “Efficiency optimization for a power
factor correction (PFC) rectifier with gallium nitride transistor,” 2016, doi:
10.1109/wipda.2015.7369288.'
mla: Bolte, Sven, et al. “Efficiency Optimization for a Power Factor Correction
(PFC) Rectifier with Gallium Nitride Transistor.” 2015 IEEE 3rd Workshop on
Wide Bandgap Power Devices and Applications (WiPDA), IEEE, 2016, doi:10.1109/wipda.2015.7369288.
short: 'S. Bolte, N. Fröhleke, J. Böcker, in: 2015 IEEE 3rd Workshop on Wide Bandgap
Power Devices and Applications (WiPDA), IEEE, 2016.'
date_created: 2022-03-28T07:42:01Z
date_updated: 2022-03-28T08:55:29Z
department:
- _id: '52'
doi: 10.1109/wipda.2015.7369288
language:
- iso: eng
publication: 2015 IEEE 3rd Workshop on Wide Bandgap Power Devices and Applications
(WiPDA)
publication_status: published
publisher: IEEE
status: public
title: Efficiency optimization for a power factor correction (PFC) rectifier with
gallium nitride transistor
type: conference
user_id: '66'
year: '2016'
...
---
_id: '28483'
author:
- first_name: Andrés
full_name: Marín López, Andrés
last_name: Marín López
- first_name: Florina
full_name: Almenárez-Mendoza, Florina
last_name: Almenárez-Mendoza
- first_name: Patricia
full_name: Arias Cabarcos, Patricia
id: '92804'
last_name: Arias Cabarcos
- first_name: Daniel
full_name: Díaz Sánchez, Daniel
last_name: Díaz Sánchez
citation:
ama: 'Marín López A, Almenárez-Mendoza F, Arias Cabarcos P, Díaz Sánchez D. Wi-Fi
Direct: Lessons learned. In: 2016 Mediterranean Ad Hoc Networking Workshop,
Med-Hoc-Net 2016, Vilanova i La Geltru, Spain, June 20-22, 2016. {IEEE}; 2016:1-8.
doi:10.1109/MedHocNet.2016.7528493'
apa: 'Marín López, A., Almenárez-Mendoza, F., Arias Cabarcos, P., & Díaz Sánchez,
D. (2016). Wi-Fi Direct: Lessons learned. 2016 Mediterranean Ad Hoc Networking
Workshop, Med-Hoc-Net 2016, Vilanova i La Geltru, Spain, June 20-22, 2016,
1–8. https://doi.org/10.1109/MedHocNet.2016.7528493'
bibtex: '@inproceedings{Marín López_Almenárez-Mendoza_Arias Cabarcos_Díaz Sánchez_2016,
title={Wi-Fi Direct: Lessons learned}, DOI={10.1109/MedHocNet.2016.7528493},
booktitle={2016 Mediterranean Ad Hoc Networking Workshop, Med-Hoc-Net 2016, Vilanova
i la Geltru, Spain, June 20-22, 2016}, publisher={{IEEE}}, author={Marín López,
Andrés and Almenárez-Mendoza, Florina and Arias Cabarcos, Patricia and Díaz Sánchez,
Daniel}, year={2016}, pages={1–8} }'
chicago: 'Marín López, Andrés, Florina Almenárez-Mendoza, Patricia Arias Cabarcos,
and Daniel Díaz Sánchez. “Wi-Fi Direct: Lessons Learned.” In 2016 Mediterranean
Ad Hoc Networking Workshop, Med-Hoc-Net 2016, Vilanova i La Geltru, Spain, June
20-22, 2016, 1–8. {IEEE}, 2016. https://doi.org/10.1109/MedHocNet.2016.7528493.'
ieee: 'A. Marín López, F. Almenárez-Mendoza, P. Arias Cabarcos, and D. Díaz Sánchez,
“Wi-Fi Direct: Lessons learned,” in 2016 Mediterranean Ad Hoc Networking Workshop,
Med-Hoc-Net 2016, Vilanova i la Geltru, Spain, June 20-22, 2016, 2016, pp.
1–8, doi: 10.1109/MedHocNet.2016.7528493.'
mla: 'Marín López, Andrés, et al. “Wi-Fi Direct: Lessons Learned.” 2016 Mediterranean
Ad Hoc Networking Workshop, Med-Hoc-Net 2016, Vilanova i La Geltru, Spain, June
20-22, 2016, {IEEE}, 2016, pp. 1–8, doi:10.1109/MedHocNet.2016.7528493.'
short: 'A. Marín López, F. Almenárez-Mendoza, P. Arias Cabarcos, D. Díaz Sánchez,
in: 2016 Mediterranean Ad Hoc Networking Workshop, Med-Hoc-Net 2016, Vilanova
i La Geltru, Spain, June 20-22, 2016, {IEEE}, 2016, pp. 1–8.'
date_created: 2021-12-08T19:13:50Z
date_updated: 2022-01-27T17:00:16Z
doi: 10.1109/MedHocNet.2016.7528493
extern: '1'
language:
- iso: eng
page: 1-8
publication: 2016 Mediterranean Ad Hoc Networking Workshop, Med-Hoc-Net 2016, Vilanova
i la Geltru, Spain, June 20-22, 2016
publisher: '{IEEE}'
status: public
title: 'Wi-Fi Direct: Lessons learned'
type: conference
user_id: '92804'
year: '2016'
...
---
_id: '35989'
author:
- first_name: Kirsten
full_name: Schlegel-Matthies, Kirsten
id: '459'
last_name: Schlegel-Matthies
- first_name: Gerd
full_name: Gigerenzer, Gerd
last_name: Gigerenzer
- first_name: Gert G.
full_name: Wagner, Gert G.
last_name: Wagner
citation:
ama: Schlegel-Matthies K, Gigerenzer G, Wagner GG. Digitale Welt und Gesundheit.
eHealth und mHealth – Chancen und Risiken der Digitalisierung im Gesundheitsbereich.;
2016.
apa: Schlegel-Matthies, K., Gigerenzer, G., & Wagner, G. G. (2016). Digitale
Welt und Gesundheit. eHealth und mHealth – Chancen und Risiken der Digitalisierung
im Gesundheitsbereich.
bibtex: '@book{Schlegel-Matthies_Gigerenzer_Wagner_2016, place={Berlin}, title={Digitale
Welt und Gesundheit. eHealth und mHealth – Chancen und Risiken der Digitalisierung
im Gesundheitsbereich}, author={Schlegel-Matthies, Kirsten and Gigerenzer, Gerd
and Wagner, Gert G.}, year={2016} }'
chicago: Schlegel-Matthies, Kirsten, Gerd Gigerenzer, and Gert G. Wagner. Digitale
Welt und Gesundheit. eHealth und mHealth – Chancen und Risiken der Digitalisierung
im Gesundheitsbereich. Berlin, 2016.
ieee: K. Schlegel-Matthies, G. Gigerenzer, and G. G. Wagner, Digitale Welt und
Gesundheit. eHealth und mHealth – Chancen und Risiken der Digitalisierung im Gesundheitsbereich.
Berlin, 2016.
mla: Schlegel-Matthies, Kirsten, et al. Digitale Welt und Gesundheit. eHealth
und mHealth – Chancen und Risiken der Digitalisierung im Gesundheitsbereich.
2016.
short: K. Schlegel-Matthies, G. Gigerenzer, G.G. Wagner, Digitale Welt und Gesundheit.
eHealth und mHealth – Chancen und Risiken der Digitalisierung im Gesundheitsbereich,
Berlin, 2016.
date_created: 2023-01-11T10:46:12Z
date_updated: 2023-01-11T10:46:50Z
department:
- _id: '35'
- _id: '17'
- _id: '22'
- _id: '396'
language:
- iso: ger
main_file_link:
- open_access: '1'
url: https://www.svr-verbraucherfragen.de/wp-content/uploads/Digitale-Welt-und-Gesundheit.pdf
oa: '1'
page: '51'
place: Berlin
publication_identifier:
issn:
- 2365-919X
publication_status: published
status: public
title: Digitale Welt und Gesundheit. eHealth und mHealth – Chancen und Risiken der
Digitalisierung im Gesundheitsbereich
type: working_paper
user_id: '459'
year: '2016'
...
---
_id: '4239'
abstract:
- lang: eng
text: "Confocal Raman spectroscopy is applied to identify ferroelectric domain structure
sensitive\r\nphonon modes in potassium titanyl phosphate. Therefore, polarization-dependent
measurements in\r\nvarious scattering configurations have been performed to characterize
the fundamental Raman\r\nspectra of the material. The obtained spectra are discussed
qualitatively based on an internal mode\r\nassignment. In the main part of this
work, we have characterized z-cut periodically poled potassium\r\ntitanyl phosphate
in terms of polarity- and structure-sensitive phonon modes. Here, we find vibrations\r\nwhose
intensities are linked to the ferroelectric domain walls. We interpret this in
terms of\r\nchanges in the polarizability originating from strain induced by domain
boundaries and the inner\r\nfield distribution. Hence, a direct and 3D visualization
of ferroelectric domain structures becomes\r\npossible in potassium titanyl phosphate."
article_number: '044103'
article_type: original
author:
- first_name: Michael
full_name: Rüsing, Michael
id: '22501'
last_name: Rüsing
orcid: 0000-0003-4682-4577
- first_name: Christof
full_name: Eigner, Christof
id: '13244'
last_name: Eigner
orcid: https://orcid.org/0000-0002-5693-3083
- first_name: P.
full_name: Mackwitz, P.
last_name: Mackwitz
- first_name: Gerhard
full_name: Berth, Gerhard
id: '53'
last_name: Berth
- first_name: Christine
full_name: Silberhorn, Christine
id: '26263'
last_name: Silberhorn
- first_name: Artur
full_name: Zrenner, Artur
id: '606'
last_name: Zrenner
orcid: 0000-0002-5190-0944
citation:
ama: 'Rüsing M, Eigner C, Mackwitz P, Berth G, Silberhorn C, Zrenner A. Identification
of ferroelectric domain structure sensitive phonon modes in potassium titanyl
phosphate: A fundamental study. Journal of Applied Physics. 2016;119(4).
doi:10.1063/1.4940964'
apa: 'Rüsing, M., Eigner, C., Mackwitz, P., Berth, G., Silberhorn, C., & Zrenner,
A. (2016). Identification of ferroelectric domain structure sensitive phonon modes
in potassium titanyl phosphate: A fundamental study. Journal of Applied Physics,
119(4), Article 044103. https://doi.org/10.1063/1.4940964'
bibtex: '@article{Rüsing_Eigner_Mackwitz_Berth_Silberhorn_Zrenner_2016, title={Identification
of ferroelectric domain structure sensitive phonon modes in potassium titanyl
phosphate: A fundamental study}, volume={119}, DOI={10.1063/1.4940964},
number={4044103}, journal={Journal of Applied Physics}, publisher={AIP Publishing},
author={Rüsing, Michael and Eigner, Christof and Mackwitz, P. and Berth, Gerhard
and Silberhorn, Christine and Zrenner, Artur}, year={2016} }'
chicago: 'Rüsing, Michael, Christof Eigner, P. Mackwitz, Gerhard Berth, Christine
Silberhorn, and Artur Zrenner. “Identification of Ferroelectric Domain Structure
Sensitive Phonon Modes in Potassium Titanyl Phosphate: A Fundamental Study.” Journal
of Applied Physics 119, no. 4 (2016). https://doi.org/10.1063/1.4940964.'
ieee: 'M. Rüsing, C. Eigner, P. Mackwitz, G. Berth, C. Silberhorn, and A. Zrenner,
“Identification of ferroelectric domain structure sensitive phonon modes in potassium
titanyl phosphate: A fundamental study,” Journal of Applied Physics, vol.
119, no. 4, Art. no. 044103, 2016, doi: 10.1063/1.4940964.'
mla: 'Rüsing, Michael, et al. “Identification of Ferroelectric Domain Structure
Sensitive Phonon Modes in Potassium Titanyl Phosphate: A Fundamental Study.” Journal
of Applied Physics, vol. 119, no. 4, 044103, AIP Publishing, 2016, doi:10.1063/1.4940964.'
short: M. Rüsing, C. Eigner, P. Mackwitz, G. Berth, C. Silberhorn, A. Zrenner, Journal
of Applied Physics 119 (2016).
date_created: 2018-08-29T08:21:00Z
date_updated: 2023-10-09T08:32:15Z
department:
- _id: '15'
- _id: '230'
- _id: '35'
- _id: '288'
doi: 10.1063/1.4940964
intvolume: ' 119'
issue: '4'
language:
- iso: eng
project:
- _id: '53'
grant_number: '231447078'
name: TRR 142
- _id: '55'
name: TRR 142 - Project Area B
- _id: '68'
grant_number: '231447078'
name: TRR 142 - Subproject B3
publication: Journal of Applied Physics
publication_identifier:
issn:
- 0021-8979
- 1089-7550
publication_status: published
publisher: AIP Publishing
status: public
title: 'Identification of ferroelectric domain structure sensitive phonon modes in
potassium titanyl phosphate: A fundamental study'
type: journal_article
user_id: '14931'
volume: 119
year: '2016'
...
---
_id: '46364'
abstract:
- lang: eng
text: Automated algorithm configuration procedures play an increasingly important
role in the development and application of algorithms for a wide range of computationally
challenging problems. Until very recently, these configuration procedures were
limited to optimising a single performance objective, such as the running time
or solution quality achieved by the algorithm being configured. However, in many
applications there is more than one performance objective of interest. This gives
rise to the multi-objective automatic algorithm configuration problem, which involves
finding a Pareto set of configurations of a given target algorithm that characterises
trade-offs between multiple performance objectives. In this work, we introduce
MO-ParamILS, a multi-objective extension of the state-of-the-art single-objective
algorithm configuration framework ParamILS, and demonstrate that it produces good
results on several challenging bi-objective algorithm configuration scenarios
compared to a base-line obtained from using a state-of-the-art single-objective
algorithm configurator.
author:
- first_name: A
full_name: Blot, A
last_name: Blot
- first_name: H
full_name: Hoos, H
last_name: Hoos
- first_name: L
full_name: Jourdan, L
last_name: Jourdan
- first_name: M
full_name: Marmion, M
last_name: Marmion
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
citation:
ama: 'Blot A, Hoos H, Jourdan L, Marmion M, Trautmann H. MO-ParamILS: A Multi-objective
Automatic Algorithm Configuration Framework. In: et al. Joaquin V, ed. LION
2016: Learning and Intelligent Optimization. Vol 10079. LNTCS. Springer International
Publishing; 2016:32–47. doi:10.1007/978-3-319-50349-3_3'
apa: 'Blot, A., Hoos, H., Jourdan, L., Marmion, M., & Trautmann, H. (2016).
MO-ParamILS: A Multi-objective Automatic Algorithm Configuration Framework. In
V. et al. Joaquin (Ed.), LION 2016: Learning and Intelligent Optimization
(Vol. 10079, pp. 32–47). Springer International Publishing. https://doi.org/10.1007/978-3-319-50349-3_3'
bibtex: '@inproceedings{Blot_Hoos_Jourdan_Marmion_Trautmann_2016, place={Cham},
series={LNTCS}, title={MO-ParamILS: A Multi-objective Automatic Algorithm Configuration
Framework}, volume={10079}, DOI={10.1007/978-3-319-50349-3_3},
booktitle={LION 2016: Learning and Intelligent Optimization}, publisher={Springer
International Publishing}, author={Blot, A and Hoos, H and Jourdan, L and Marmion,
M and Trautmann, Heike}, editor={et al. Joaquin, Vanschooren}, year={2016}, pages={32–47},
collection={LNTCS} }'
chicago: 'Blot, A, H Hoos, L Jourdan, M Marmion, and Heike Trautmann. “MO-ParamILS:
A Multi-Objective Automatic Algorithm Configuration Framework.” In LION 2016:
Learning and Intelligent Optimization, edited by Vanschooren et al. Joaquin,
10079:32–47. LNTCS. Cham: Springer International Publishing, 2016. https://doi.org/10.1007/978-3-319-50349-3_3.'
ieee: 'A. Blot, H. Hoos, L. Jourdan, M. Marmion, and H. Trautmann, “MO-ParamILS:
A Multi-objective Automatic Algorithm Configuration Framework,” in LION 2016:
Learning and Intelligent Optimization, 2016, vol. 10079, pp. 32–47, doi: 10.1007/978-3-319-50349-3_3.'
mla: 'Blot, A., et al. “MO-ParamILS: A Multi-Objective Automatic Algorithm Configuration
Framework.” LION 2016: Learning and Intelligent Optimization, edited by
Vanschooren et al. Joaquin, vol. 10079, Springer International Publishing, 2016,
pp. 32–47, doi:10.1007/978-3-319-50349-3_3.'
short: 'A. Blot, H. Hoos, L. Jourdan, M. Marmion, H. Trautmann, in: V. et al. Joaquin
(Ed.), LION 2016: Learning and Intelligent Optimization, Springer International
Publishing, Cham, 2016, pp. 32–47.'
date_created: 2023-08-04T15:10:09Z
date_updated: 2023-10-16T13:37:50Z
department:
- _id: '34'
- _id: '819'
doi: 10.1007/978-3-319-50349-3_3
editor:
- first_name: Vanschooren
full_name: et al. Joaquin, Vanschooren
last_name: et al. Joaquin
intvolume: ' 10079'
language:
- iso: eng
page: 32–47
place: Cham
publication: 'LION 2016: Learning and Intelligent Optimization'
publisher: Springer International Publishing
series_title: LNTCS
status: public
title: 'MO-ParamILS: A Multi-objective Automatic Algorithm Configuration Framework'
type: conference
user_id: '15504'
volume: 10079
year: '2016'
...
---
_id: '46363'
abstract:
- lang: eng
text: "The averaged Hausdorff distance has been proposed as an indicator for assessing
the quality of finitely sized approximations of the Pareto front of a multiobjective
problem. Since many set-based, iterative optimization algorithms store their currently
best approximation in an internal archive these approximations are also termed
archives. In case of two objectives and continuous variables it is known that
the best approximations in terms of averaged Hausdorff distance are subsets of
the Pareto front if it is concave. If it is linear or circularly concave the points
of the best approximation are equally spaced.\r\n\r\nHere, it is proven that the
optimal averaged Hausdorff approximation and the Pareto front have an empty intersection
if the Pareto front is circularly convex. But the points of the best approximation
are equally spaced and they rapidly approach the Pareto front for increasing size
of the approximation."
author:
- first_name: G
full_name: Rudolph, G
last_name: Rudolph
- first_name: O
full_name: Schütze, O
last_name: Schütze
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
citation:
ama: 'Rudolph G, Schütze O, Trautmann H. On the Closest Averaged Hausdorff Archive
for a Circularly Convex Pareto Front. In: Squillero G, Burelli P, eds. Applications
of Evolutionary Computation: 19$^th$ European Conference, EvoApplications 2016,
Porto, Portugal, March 30 — April 1, 2016, Proceedings, Part II. Springer
International Publishing; 2016:42–55. doi:10.1007/978-3-319-31153-1_4'
apa: 'Rudolph, G., Schütze, O., & Trautmann, H. (2016). On the Closest Averaged
Hausdorff Archive for a Circularly Convex Pareto Front. In G. Squillero &
P. Burelli (Eds.), Applications of Evolutionary Computation: 19$^th$ European
Conference, EvoApplications 2016, Porto, Portugal, March 30 — April 1, 2016, Proceedings,
Part II (pp. 42–55). Springer International Publishing. https://doi.org/10.1007/978-3-319-31153-1_4'
bibtex: '@inbook{Rudolph_Schütze_Trautmann_2016, place={Cham}, title={On the Closest
Averaged Hausdorff Archive for a Circularly Convex Pareto Front}, DOI={10.1007/978-3-319-31153-1_4},
booktitle={Applications of Evolutionary Computation: 19$^th$ European Conference,
EvoApplications 2016, Porto, Portugal, March 30 — April 1, 2016, Proceedings,
Part II}, publisher={Springer International Publishing}, author={Rudolph, G and
Schütze, O and Trautmann, Heike}, editor={Squillero, G and Burelli, P}, year={2016},
pages={42–55} }'
chicago: 'Rudolph, G, O Schütze, and Heike Trautmann. “On the Closest Averaged Hausdorff
Archive for a Circularly Convex Pareto Front.” In Applications of Evolutionary
Computation: 19$^th$ European Conference, EvoApplications 2016, Porto, Portugal,
March 30 — April 1, 2016, Proceedings, Part II, edited by G Squillero and
P Burelli, 42–55. Cham: Springer International Publishing, 2016. https://doi.org/10.1007/978-3-319-31153-1_4.'
ieee: 'G. Rudolph, O. Schütze, and H. Trautmann, “On the Closest Averaged Hausdorff
Archive for a Circularly Convex Pareto Front,” in Applications of Evolutionary
Computation: 19$^th$ European Conference, EvoApplications 2016, Porto, Portugal,
March 30 — April 1, 2016, Proceedings, Part II, G. Squillero and P. Burelli,
Eds. Cham: Springer International Publishing, 2016, pp. 42–55.'
mla: 'Rudolph, G., et al. “On the Closest Averaged Hausdorff Archive for a Circularly
Convex Pareto Front.” Applications of Evolutionary Computation: 19$^th$ European
Conference, EvoApplications 2016, Porto, Portugal, March 30 — April 1, 2016, Proceedings,
Part II, edited by G Squillero and P Burelli, Springer International Publishing,
2016, pp. 42–55, doi:10.1007/978-3-319-31153-1_4.'
short: 'G. Rudolph, O. Schütze, H. Trautmann, in: G. Squillero, P. Burelli (Eds.),
Applications of Evolutionary Computation: 19$^th$ European Conference, EvoApplications
2016, Porto, Portugal, March 30 — April 1, 2016, Proceedings, Part II, Springer
International Publishing, Cham, 2016, pp. 42–55.'
date_created: 2023-08-04T15:09:14Z
date_updated: 2023-10-16T13:37:33Z
department:
- _id: '34'
- _id: '819'
doi: 10.1007/978-3-319-31153-1_4
editor:
- first_name: G
full_name: Squillero, G
last_name: Squillero
- first_name: P
full_name: Burelli, P
last_name: Burelli
language:
- iso: eng
page: 42–55
place: Cham
publication: 'Applications of Evolutionary Computation: 19$^th$ European Conference,
EvoApplications 2016, Porto, Portugal, March 30 — April 1, 2016, Proceedings, Part
II'
publication_identifier:
isbn:
- 978-3-319-31153-1
publisher: Springer International Publishing
status: public
title: On the Closest Averaged Hausdorff Archive for a Circularly Convex Pareto Front
type: book_chapter
user_id: '15504'
year: '2016'
...
---
_id: '46369'
abstract:
- lang: eng
text: This paper formally defines multimodality in multiobjective optimization (MO).
We introduce a test-bed in which multimodal MO problems with known properties
can be constructed as well as numerical characteristics of the resulting landscape.
Gradient- and local search based strategies are compared on exemplary problems
together with specific performance indicators in the multimodal MO setting. By
this means the foundation for Exploratory Landscape Analysis in MO is provided.
author:
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
- first_name: Hao
full_name: Wang, Hao
last_name: Wang
- first_name: Mike
full_name: Preuss, Mike
last_name: Preuss
- first_name: Christian
full_name: Grimme, Christian
last_name: Grimme
- first_name: André
full_name: Deutz, André
last_name: Deutz
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
- first_name: Michael
full_name: Emmerich, Michael
last_name: Emmerich
citation:
ama: 'Kerschke P, Wang H, Preuss M, et al. Towards Analyzing Multimodality of Multiobjective
Landscapes. In: Proceedings of the 14$^th$ International Conference on Parallel
Problem Solving from Nature (PPSN XIV). Lecture Notes in Computer Science.
Springer; 2016:962–972. doi:10.1007/978-3-319-45823-6_90'
apa: Kerschke, P., Wang, H., Preuss, M., Grimme, C., Deutz, A., Trautmann, H., &
Emmerich, M. (2016). Towards Analyzing Multimodality of Multiobjective Landscapes.
Proceedings of the 14$^th$ International Conference on Parallel Problem Solving
from Nature (PPSN XIV), 962–972. https://doi.org/10.1007/978-3-319-45823-6_90
bibtex: '@inproceedings{Kerschke_Wang_Preuss_Grimme_Deutz_Trautmann_Emmerich_2016,
place={Edinburgh, Scotland}, series={Lecture Notes in Computer Science}, title={Towards
Analyzing Multimodality of Multiobjective Landscapes}, DOI={10.1007/978-3-319-45823-6_90},
booktitle={Proceedings of the 14$^th$ International Conference on Parallel Problem
Solving from Nature (PPSN XIV)}, publisher={Springer}, author={Kerschke, Pascal
and Wang, Hao and Preuss, Mike and Grimme, Christian and Deutz, André and Trautmann,
Heike and Emmerich, Michael}, year={2016}, pages={962–972}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Kerschke, Pascal, Hao Wang, Mike Preuss, Christian Grimme, André Deutz,
Heike Trautmann, and Michael Emmerich. “Towards Analyzing Multimodality of Multiobjective
Landscapes.” In Proceedings of the 14$^th$ International Conference on Parallel
Problem Solving from Nature (PPSN XIV), 962–972. Lecture Notes in Computer
Science. Edinburgh, Scotland: Springer, 2016. https://doi.org/10.1007/978-3-319-45823-6_90.'
ieee: 'P. Kerschke et al., “Towards Analyzing Multimodality of Multiobjective
Landscapes,” in Proceedings of the 14$^th$ International Conference on Parallel
Problem Solving from Nature (PPSN XIV), 2016, pp. 962–972, doi: 10.1007/978-3-319-45823-6_90.'
mla: Kerschke, Pascal, et al. “Towards Analyzing Multimodality of Multiobjective
Landscapes.” Proceedings of the 14$^th$ International Conference on Parallel
Problem Solving from Nature (PPSN XIV), Springer, 2016, pp. 962–972, doi:10.1007/978-3-319-45823-6_90.
short: 'P. Kerschke, H. Wang, M. Preuss, C. Grimme, A. Deutz, H. Trautmann, M. Emmerich,
in: Proceedings of the 14$^th$ International Conference on Parallel Problem Solving
from Nature (PPSN XIV), Springer, Edinburgh, Scotland, 2016, pp. 962–972.'
date_created: 2023-08-04T15:16:02Z
date_updated: 2023-10-16T13:39:42Z
department:
- _id: '34'
- _id: '819'
doi: 10.1007/978-3-319-45823-6_90
language:
- iso: eng
page: 962–972
place: Edinburgh, Scotland
publication: Proceedings of the 14$^th$ International Conference on Parallel Problem
Solving from Nature (PPSN XIV)
publisher: Springer
series_title: Lecture Notes in Computer Science
status: public
title: Towards Analyzing Multimodality of Multiobjective Landscapes
type: conference
user_id: '15504'
year: '2016'
...
---
_id: '46367'
abstract:
- lang: eng
text: When selecting the best suited algorithm for an unknown optimization problem,
it is useful to possess some a priori knowledge of the problem at hand. In the
context of single-objective, continuous optimization problems such knowledge can
be retrieved by means of Exploratory Landscape Analysis (ELA), which automatically
identifies properties of a landscape, e.g., the so-called funnel structures, based
on an initial sample. In this paper, we extract the relevant features (for detecting
funnels) out of a large set of landscape features when only given a small initial
sample consisting of 50 x D observations, where D is the number of decision space
dimensions. This is already in the range of the start population sizes of many
evolutionary algorithms. The new Multiple Peaks Model Generator (MPM2) is used
for training the classifier, and the approach is then very successfully validated
on the Black-Box Optimization Benchmark (BBOB) and a subset of the CEC 2013 niching
competition problems.
author:
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
- first_name: Mike
full_name: Preuss, Mike
last_name: Preuss
- first_name: Simon
full_name: Wessing, Simon
last_name: Wessing
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
citation:
ama: 'Kerschke P, Preuss M, Wessing S, Trautmann H. Low-Budget Exploratory Landscape
Analysis on Multiple Peaks Models. In: Proceedings of the 18$^th$ Annual Conference
on Genetic and Evolutionary Computation. ; 2016:229–236. doi:10.1145/2908812.2908845'
apa: Kerschke, P., Preuss, M., Wessing, S., & Trautmann, H. (2016). Low-Budget
Exploratory Landscape Analysis on Multiple Peaks Models. Proceedings of the
18$^th$ Annual Conference on Genetic and Evolutionary Computation, 229–236.
https://doi.org/10.1145/2908812.2908845
bibtex: '@inproceedings{Kerschke_Preuss_Wessing_Trautmann_2016, place={Denver, CO,
USA}, title={Low-Budget Exploratory Landscape Analysis on Multiple Peaks Models},
DOI={10.1145/2908812.2908845},
booktitle={Proceedings of the 18$^th$ Annual Conference on Genetic and Evolutionary
Computation}, author={Kerschke, Pascal and Preuss, Mike and Wessing, Simon and
Trautmann, Heike}, year={2016}, pages={229–236} }'
chicago: Kerschke, Pascal, Mike Preuss, Simon Wessing, and Heike Trautmann. “Low-Budget
Exploratory Landscape Analysis on Multiple Peaks Models.” In Proceedings of
the 18$^th$ Annual Conference on Genetic and Evolutionary Computation, 229–236.
Denver, CO, USA, 2016. https://doi.org/10.1145/2908812.2908845.
ieee: 'P. Kerschke, M. Preuss, S. Wessing, and H. Trautmann, “Low-Budget Exploratory
Landscape Analysis on Multiple Peaks Models,” in Proceedings of the 18$^th$
Annual Conference on Genetic and Evolutionary Computation, 2016, pp. 229–236,
doi: 10.1145/2908812.2908845.'
mla: Kerschke, Pascal, et al. “Low-Budget Exploratory Landscape Analysis on Multiple
Peaks Models.” Proceedings of the 18$^th$ Annual Conference on Genetic and
Evolutionary Computation, 2016, pp. 229–236, doi:10.1145/2908812.2908845.
short: 'P. Kerschke, M. Preuss, S. Wessing, H. Trautmann, in: Proceedings of the
18$^th$ Annual Conference on Genetic and Evolutionary Computation, Denver, CO,
USA, 2016, pp. 229–236.'
date_created: 2023-08-04T15:14:06Z
date_updated: 2023-10-16T13:38:47Z
department:
- _id: '34'
- _id: '819'
doi: 10.1145/2908812.2908845
language:
- iso: eng
page: 229–236
place: Denver, CO, USA
publication: Proceedings of the 18$^th$ Annual Conference on Genetic and Evolutionary
Computation
publication_identifier:
isbn:
- 978-1-4503-4206-3
status: public
title: Low-Budget Exploratory Landscape Analysis on Multiple Peaks Models
type: conference
user_id: '15504'
year: '2016'
...
---
_id: '46371'
abstract:
- lang: eng
text: "One main task in evolutionary multiobjective optimization (EMO) is to obtain
a suitable finite size approximation of the Pareto front which is the image of
the solution set, termed the Pareto set, of a given multiobjective optimization
problem. In the technical literature, the characteristic of the desired approximation
is commonly expressed by closeness to the Pareto front and a sufficient spread
of the solutions obtained. In this paper, we first make an effort to show by theoretical
and empirical findings that the recently proposed Averaged Hausdorff (or Δ\U0001D45D-)
indicator indeed aims at fulfilling both performance criteria for bi-objective
optimization problems. In the second part of this paper, standard EMO algorithms
combined with a specialized archiver and a postprocessing step based on the Δ\U0001D45D
indicator are introduced which sufficiently approximate the Δ\U0001D45D-optimal
archives and generate solutions evenly spread along the Pareto front."
author:
- first_name: G
full_name: Rudolph, G
last_name: Rudolph
- first_name: O
full_name: Schütze, O
last_name: Schütze
- first_name: C
full_name: Grimme, C
last_name: Grimme
- first_name: C
full_name: Domínguez-Medina, C
last_name: Domínguez-Medina
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
citation:
ama: 'Rudolph G, Schütze O, Grimme C, Domínguez-Medina C, Trautmann H. Optimal averaged
Hausdorff archives for bi-objective problems: theoretical and numerical results.
Computational Optimization and Applications (Comput Optim Appl). 2016;64(2):589–618.
doi:10.1007/s10589-015-9815-8'
apa: 'Rudolph, G., Schütze, O., Grimme, C., Domínguez-Medina, C., & Trautmann,
H. (2016). Optimal averaged Hausdorff archives for bi-objective problems: theoretical
and numerical results. Computational Optimization and Applications (Comput.
Optim. Appl.), 64(2), 589–618. https://doi.org/10.1007/s10589-015-9815-8'
bibtex: '@article{Rudolph_Schütze_Grimme_Domínguez-Medina_Trautmann_2016, title={Optimal
averaged Hausdorff archives for bi-objective problems: theoretical and numerical
results}, volume={64}, DOI={10.1007/s10589-015-9815-8},
number={2}, journal={Computational Optimization and Applications (Comput. Optim.
Appl.)}, author={Rudolph, G and Schütze, O and Grimme, C and Domínguez-Medina,
C and Trautmann, Heike}, year={2016}, pages={589–618} }'
chicago: 'Rudolph, G, O Schütze, C Grimme, C Domínguez-Medina, and Heike Trautmann.
“Optimal Averaged Hausdorff Archives for Bi-Objective Problems: Theoretical and
Numerical Results.” Computational Optimization and Applications (Comput. Optim.
Appl.) 64, no. 2 (2016): 589–618. https://doi.org/10.1007/s10589-015-9815-8.'
ieee: 'G. Rudolph, O. Schütze, C. Grimme, C. Domínguez-Medina, and H. Trautmann,
“Optimal averaged Hausdorff archives for bi-objective problems: theoretical and
numerical results,” Computational Optimization and Applications (Comput. Optim.
Appl.), vol. 64, no. 2, pp. 589–618, 2016, doi: 10.1007/s10589-015-9815-8.'
mla: 'Rudolph, G., et al. “Optimal Averaged Hausdorff Archives for Bi-Objective
Problems: Theoretical and Numerical Results.” Computational Optimization and
Applications (Comput. Optim. Appl.), vol. 64, no. 2, 2016, pp. 589–618, doi:10.1007/s10589-015-9815-8.'
short: G. Rudolph, O. Schütze, C. Grimme, C. Domínguez-Medina, H. Trautmann, Computational
Optimization and Applications (Comput. Optim. Appl.) 64 (2016) 589–618.
date_created: 2023-08-04T15:17:48Z
date_updated: 2023-10-16T13:40:21Z
department:
- _id: '34'
- _id: '819'
doi: 10.1007/s10589-015-9815-8
intvolume: ' 64'
issue: '2'
language:
- iso: eng
page: 589–618
publication: Computational Optimization and Applications (Comput. Optim. Appl.)
status: public
title: 'Optimal averaged Hausdorff archives for bi-objective problems: theoretical
and numerical results'
type: journal_article
user_id: '15504'
volume: 64
year: '2016'
...
---
_id: '46372'
abstract:
- lang: eng
text: We present a new hybrid evolutionary algorithm for the effective hypervolume
approximation of the Pareto front of a given differentiable multi-objective optimization
problem. Starting point for the local search (LS) mechanism is a new division
of the decision space as we will argue that in each of these regions a different
LS strategy seems to be most promising. For the LS in two out of the three regions
we will utilize and adapt the Directed Search method which is capable of steering
the search into any direction given in objective space and which is thus well
suited for the problem at hand. We further on integrate the resulting LS mechanism
into SMS-EMOA, a state-of-the-art evolutionary algorithm for hypervolume approximations.
Finally, we will present some numerical results on several benchmark problems
with two and three objectives indicating the strength and competitiveness of the
novel hybrid.
author:
- first_name: O
full_name: Schütze, O
last_name: Schütze
- first_name: Hernandez VA
full_name: Sosa, Hernandez VA
last_name: Sosa
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
- first_name: G
full_name: Rudolph, G
last_name: Rudolph
citation:
ama: Schütze O, Sosa HV, Trautmann H, Rudolph G. The Hypervolume based Directed
Search Method for Multi-Objective Optimization Problems. Journal of Heuristics.
2016;22(3):273–300. doi:10.1007/s10732-016-9310-0
apa: Schütze, O., Sosa, H. V., Trautmann, H., & Rudolph, G. (2016). The Hypervolume
based Directed Search Method for Multi-Objective Optimization Problems. Journal
of Heuristics, 22(3), 273–300. https://doi.org/10.1007/s10732-016-9310-0
bibtex: '@article{Schütze_Sosa_Trautmann_Rudolph_2016, title={The Hypervolume based
Directed Search Method for Multi-Objective Optimization Problems}, volume={22},
DOI={10.1007/s10732-016-9310-0},
number={3}, journal={Journal of Heuristics}, author={Schütze, O and Sosa, Hernandez
VA and Trautmann, Heike and Rudolph, G}, year={2016}, pages={273–300} }'
chicago: 'Schütze, O, Hernandez VA Sosa, Heike Trautmann, and G Rudolph. “The Hypervolume
Based Directed Search Method for Multi-Objective Optimization Problems.” Journal
of Heuristics 22, no. 3 (2016): 273–300. https://doi.org/10.1007/s10732-016-9310-0.'
ieee: 'O. Schütze, H. V. Sosa, H. Trautmann, and G. Rudolph, “The Hypervolume based
Directed Search Method for Multi-Objective Optimization Problems,” Journal
of Heuristics, vol. 22, no. 3, pp. 273–300, 2016, doi: 10.1007/s10732-016-9310-0.'
mla: Schütze, O., et al. “The Hypervolume Based Directed Search Method for Multi-Objective
Optimization Problems.” Journal of Heuristics, vol. 22, no. 3, 2016, pp.
273–300, doi:10.1007/s10732-016-9310-0.
short: O. Schütze, H.V. Sosa, H. Trautmann, G. Rudolph, Journal of Heuristics 22
(2016) 273–300.
date_created: 2023-08-04T15:19:11Z
date_updated: 2023-10-16T13:40:43Z
department:
- _id: '34'
- _id: '819'
doi: 10.1007/s10732-016-9310-0
intvolume: ' 22'
issue: '3'
language:
- iso: eng
page: 273–300
publication: Journal of Heuristics
status: public
title: The Hypervolume based Directed Search Method for Multi-Objective Optimization
Problems
type: journal_article
user_id: '15504'
volume: 22
year: '2016'
...
---
_id: '46368'
abstract:
- lang: eng
text: Exploratory Landscape Analysis (ELA) aims at understanding characteristics
of single-objective continuous (black-box) optimization problems in an automated
way. Moreover, the approach provides the basis for constructing algorithm selection
models for unseen problem instances. Recently, it has gained increasing attention
and numerical features have been designed by various research groups. This paper
introduces the R-Package FLACCO which makes all relevant features available in
a unified framework together with efficient helper functions. Moreover, a case
study which gives perspectives to ELA for multi-objective optimization problems
is presented.
author:
- first_name: Pascal
full_name: Kerschke, Pascal
last_name: Kerschke
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
citation:
ama: 'Kerschke P, Trautmann H. The R-Package FLACCO for Exploratory Landscape Analysis
with Applications to Multi-Objective Optimization Problems. In: Proceedings
of the IEEE Congress on Evolutionary Computation (CEC). ; 2016. doi:10.1109/CEC.2016.7748359'
apa: Kerschke, P., & Trautmann, H. (2016). The R-Package FLACCO for Exploratory
Landscape Analysis with Applications to Multi-Objective Optimization Problems.
Proceedings of the IEEE Congress on Evolutionary Computation (CEC). https://doi.org/10.1109/CEC.2016.7748359
bibtex: '@inproceedings{Kerschke_Trautmann_2016, place={Vancouver, BC, Kanada},
title={The R-Package FLACCO for Exploratory Landscape Analysis with Applications
to Multi-Objective Optimization Problems}, DOI={10.1109/CEC.2016.7748359},
booktitle={Proceedings of the IEEE Congress on Evolutionary Computation (CEC)},
author={Kerschke, Pascal and Trautmann, Heike}, year={2016} }'
chicago: Kerschke, Pascal, and Heike Trautmann. “The R-Package FLACCO for Exploratory
Landscape Analysis with Applications to Multi-Objective Optimization Problems.”
In Proceedings of the IEEE Congress on Evolutionary Computation (CEC).
Vancouver, BC, Kanada, 2016. https://doi.org/10.1109/CEC.2016.7748359.
ieee: 'P. Kerschke and H. Trautmann, “The R-Package FLACCO for Exploratory Landscape
Analysis with Applications to Multi-Objective Optimization Problems,” 2016, doi:
10.1109/CEC.2016.7748359.'
mla: Kerschke, Pascal, and Heike Trautmann. “The R-Package FLACCO for Exploratory
Landscape Analysis with Applications to Multi-Objective Optimization Problems.”
Proceedings of the IEEE Congress on Evolutionary Computation (CEC), 2016,
doi:10.1109/CEC.2016.7748359.
short: 'P. Kerschke, H. Trautmann, in: Proceedings of the IEEE Congress on Evolutionary
Computation (CEC), Vancouver, BC, Kanada, 2016.'
date_created: 2023-08-04T15:14:52Z
date_updated: 2023-10-16T13:39:06Z
department:
- _id: '34'
- _id: '819'
doi: 10.1109/CEC.2016.7748359
language:
- iso: eng
place: Vancouver, BC, Kanada
publication: Proceedings of the IEEE Congress on Evolutionary Computation (CEC)
status: public
title: The R-Package FLACCO for Exploratory Landscape Analysis with Applications to
Multi-Objective Optimization Problems
type: conference
user_id: '15504'
year: '2016'
...
---
_id: '11890'
abstract:
- lang: eng
text: In this paper we study the influence of directional radio patterns of Bluetooth
low energy (BLE) beacons on smartphone localization accuracy and beacon network
planning. A two-dimensional model of the power emission characteristic is derived
from measurements of the radiation pattern of BLE beacons carried out in an RF
chamber. The Cramer-Rao lower bound (CRLB) for position estimation is then derived
for this directional power emission model. With this lower bound on the RMS positioning
error the coverage of different beacon network configurations can be evaluated.
For near-optimal network planing an evolutionary optimization algorithm for finding
the best beacon placement is presented.
author:
- first_name: Joerg
full_name: Schmalenstroeer, Joerg
id: '460'
last_name: Schmalenstroeer
- first_name: Reinhold
full_name: Haeb-Umbach, Reinhold
id: '242'
last_name: Haeb-Umbach
citation:
ama: 'Schmalenstroeer J, Haeb-Umbach R. Investigations into Bluetooth Low Energy
Localization Precision Limits. In: 24th European Signal Processing Conference
(EUSIPCO 2016). ; 2016.'
apa: Schmalenstroeer, J., & Haeb-Umbach, R. (2016). Investigations into Bluetooth
Low Energy Localization Precision Limits. 24th European Signal Processing Conference
(EUSIPCO 2016).
bibtex: '@inproceedings{Schmalenstroeer_Haeb-Umbach_2016, title={Investigations
into Bluetooth Low Energy Localization Precision Limits}, booktitle={24th European
Signal Processing Conference (EUSIPCO 2016)}, author={Schmalenstroeer, Joerg and
Haeb-Umbach, Reinhold}, year={2016} }'
chicago: Schmalenstroeer, Joerg, and Reinhold Haeb-Umbach. “Investigations into
Bluetooth Low Energy Localization Precision Limits.” In 24th European Signal
Processing Conference (EUSIPCO 2016), 2016.
ieee: J. Schmalenstroeer and R. Haeb-Umbach, “Investigations into Bluetooth Low
Energy Localization Precision Limits,” 2016.
mla: Schmalenstroeer, Joerg, and Reinhold Haeb-Umbach. “Investigations into Bluetooth
Low Energy Localization Precision Limits.” 24th European Signal Processing
Conference (EUSIPCO 2016), 2016.
short: 'J. Schmalenstroeer, R. Haeb-Umbach, in: 24th European Signal Processing
Conference (EUSIPCO 2016), 2016.'
date_created: 2019-07-12T05:30:14Z
date_updated: 2023-10-26T08:11:52Z
department:
- _id: '54'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://groups.uni-paderborn.de/nt/pubs/2016/SchHaeb16.pdf
oa: '1'
publication: 24th European Signal Processing Conference (EUSIPCO 2016)
quality_controlled: '1'
related_material:
link:
- description: Poster
relation: supplementary_material
url: https://groups.uni-paderborn.de/nt/pubs/2016/SchHaeb16_Poster.pdf
status: public
title: Investigations into Bluetooth Low Energy Localization Precision Limits
type: conference
user_id: '460'
year: '2016'
...
---
_id: '48873'
abstract:
- lang: eng
text: Despite the intrinsic hardness of the Traveling Salesperson Problem (TSP)
heuristic solvers, e.g., LKH+restart and EAX+restart, are remarkably successful
in generating satisfactory or even optimal solutions. However, the reasons for
their success are not yet fully understood. Recent approaches take an analytical
viewpoint and try to identify instance features, which make an instance hard or
easy to solve. We contribute to this area by generating instance sets for couples
of TSP algorithms A and B by maximizing/minimizing their performance difference
in order to generate instances which are easier to solve for one solver and much
harder to solve for the other. This instance set offers the potential to identify
key features which allow to distinguish between the problem hardness classes of
both algorithms.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Heike
full_name: Trautmann, Heike
last_name: Trautmann
citation:
ama: 'Bossek J, Trautmann H. Evolving Instances for Maximizing Performance Differences
of State-of-the-Art Inexact TSP Solvers. In: Festa P, Sellmann M, Vanschoren J,
eds. Learning and Intelligent Optimization. Lecture Notes in Computer Science.
Springer International Publishing; 2016:48–59. doi:10.1007/978-3-319-50349-3_4'
apa: Bossek, J., & Trautmann, H. (2016). Evolving Instances for Maximizing Performance
Differences of State-of-the-Art Inexact TSP Solvers. In P. Festa, M. Sellmann,
& J. Vanschoren (Eds.), Learning and Intelligent Optimization (pp.
48–59). Springer International Publishing. https://doi.org/10.1007/978-3-319-50349-3_4
bibtex: '@inproceedings{Bossek_Trautmann_2016, place={Cham}, series={Lecture Notes
in Computer Science}, title={Evolving Instances for Maximizing Performance Differences
of State-of-the-Art Inexact TSP Solvers}, DOI={10.1007/978-3-319-50349-3_4},
booktitle={Learning and Intelligent Optimization}, publisher={Springer International
Publishing}, author={Bossek, Jakob and Trautmann, Heike}, editor={Festa, Paola
and Sellmann, Meinolf and Vanschoren, Joaquin}, year={2016}, pages={48–59}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Bossek, Jakob, and Heike Trautmann. “Evolving Instances for Maximizing
Performance Differences of State-of-the-Art Inexact TSP Solvers.” In Learning
and Intelligent Optimization, edited by Paola Festa, Meinolf Sellmann, and
Joaquin Vanschoren, 48–59. Lecture Notes in Computer Science. Cham: Springer International
Publishing, 2016. https://doi.org/10.1007/978-3-319-50349-3_4.'
ieee: 'J. Bossek and H. Trautmann, “Evolving Instances for Maximizing Performance
Differences of State-of-the-Art Inexact TSP Solvers,” in Learning and Intelligent
Optimization, 2016, pp. 48–59, doi: 10.1007/978-3-319-50349-3_4.'
mla: Bossek, Jakob, and Heike Trautmann. “Evolving Instances for Maximizing Performance
Differences of State-of-the-Art Inexact TSP Solvers.” Learning and Intelligent
Optimization, edited by Paola Festa et al., Springer International Publishing,
2016, pp. 48–59, doi:10.1007/978-3-319-50349-3_4.
short: 'J. Bossek, H. Trautmann, in: P. Festa, M. Sellmann, J. Vanschoren (Eds.),
Learning and Intelligent Optimization, Springer International Publishing, Cham,
2016, pp. 48–59.'
date_created: 2023-11-14T15:58:57Z
date_updated: 2023-12-13T10:47:05Z
department:
- _id: '819'
doi: 10.1007/978-3-319-50349-3_4
editor:
- first_name: Paola
full_name: Festa, Paola
last_name: Festa
- first_name: Meinolf
full_name: Sellmann, Meinolf
last_name: Sellmann
- first_name: Joaquin
full_name: Vanschoren, Joaquin
last_name: Vanschoren
extern: '1'
keyword:
- Algorithm selection
- Feature selection
- Instance hardness
- TSP
language:
- iso: eng
page: 48–59
place: Cham
publication: Learning and Intelligent Optimization
publication_identifier:
isbn:
- 978-3-319-50349-3
publication_status: published
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: Evolving Instances for Maximizing Performance Differences of State-of-the-Art
Inexact TSP Solvers
type: conference
user_id: '102979'
year: '2016'
...
---
_id: '48874'
abstract:
- lang: eng
text: State of the Art inexact solvers of the NP-hard Traveling Salesperson Problem
TSP are known to mostly yield high-quality solutions in reasonable computation
times. With the purpose of understanding different levels of instance difficulties,
instances for the current State of the Art heuristic TSP solvers LKH+restart and
EAX+restart are presented which are evolved using a sophisticated evolutionary
algorithm. More specifically, the performance differences of the respective solvers
are maximized resulting in instances which are easier to solve for one solver
and much more difficult for the other. Focusing on both optimization directions,
instance features are identified which characterize both types of instances and
increase the understanding of solver performance differences.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Heike
full_name: Trautmann, Heike
last_name: Trautmann
citation:
ama: 'Bossek J, Trautmann H. Understanding Characteristics of Evolved Instances
for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference.
In: Proceedings of the XV International Conference of the Italian Association
for Artificial Intelligence on Advances in Artificial Intelligence - Volume 10037.
AI*IA 2016. Springer-Verlag; 2016:3–12. doi:10.1007/978-3-319-49130-1_1'
apa: Bossek, J., & Trautmann, H. (2016). Understanding Characteristics of Evolved
Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference.
Proceedings of the XV International Conference of the Italian Association for
Artificial Intelligence on Advances in Artificial Intelligence - Volume 10037,
3–12. https://doi.org/10.1007/978-3-319-49130-1_1
bibtex: '@inproceedings{Bossek_Trautmann_2016, place={Berlin, Heidelberg}, series={AI*IA
2016}, title={Understanding Characteristics of Evolved Instances for State-of-the-Art
Inexact TSP Solvers with Maximum Performance Difference}, DOI={10.1007/978-3-319-49130-1_1},
booktitle={Proceedings of the XV International Conference of the Italian Association
for Artificial Intelligence on Advances in Artificial Intelligence - Volume 10037},
publisher={Springer-Verlag}, author={Bossek, Jakob and Trautmann, Heike}, year={2016},
pages={3–12}, collection={AI*IA 2016} }'
chicago: 'Bossek, Jakob, and Heike Trautmann. “Understanding Characteristics of
Evolved Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance
Difference.” In Proceedings of the XV International Conference of the Italian
Association for Artificial Intelligence on Advances in Artificial Intelligence
- Volume 10037, 3–12. AI*IA 2016. Berlin, Heidelberg: Springer-Verlag, 2016.
https://doi.org/10.1007/978-3-319-49130-1_1.'
ieee: 'J. Bossek and H. Trautmann, “Understanding Characteristics of Evolved Instances
for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference,”
in Proceedings of the XV International Conference of the Italian Association
for Artificial Intelligence on Advances in Artificial Intelligence - Volume 10037,
2016, pp. 3–12, doi: 10.1007/978-3-319-49130-1_1.'
mla: Bossek, Jakob, and Heike Trautmann. “Understanding Characteristics of Evolved
Instances for State-of-the-Art Inexact TSP Solvers with Maximum Performance Difference.”
Proceedings of the XV International Conference of the Italian Association for
Artificial Intelligence on Advances in Artificial Intelligence - Volume 10037,
Springer-Verlag, 2016, pp. 3–12, doi:10.1007/978-3-319-49130-1_1.
short: 'J. Bossek, H. Trautmann, in: Proceedings of the XV International Conference
of the Italian Association for Artificial Intelligence on Advances in Artificial
Intelligence - Volume 10037, Springer-Verlag, Berlin, Heidelberg, 2016, pp. 3–12.'
date_created: 2023-11-14T15:58:57Z
date_updated: 2023-12-13T10:47:11Z
doi: 10.1007/978-3-319-49130-1_1
extern: '1'
keyword:
- Combinatorial optimization
- Instance hardness
- Metaheuristics
- Transportation
- TSP
language:
- iso: eng
page: 3–12
place: Berlin, Heidelberg
publication: Proceedings of the XV International Conference of the Italian Association
for Artificial Intelligence on Advances in Artificial Intelligence - Volume 10037
publication_identifier:
isbn:
- 978-3-319-49129-5
publication_status: published
publisher: Springer-Verlag
series_title: AI*IA 2016
status: public
title: Understanding Characteristics of Evolved Instances for State-of-the-Art Inexact
TSP Solvers with Maximum Performance Difference
type: conference
user_id: '102979'
year: '2016'
...
---
_id: '29027'
abstract:
- lang: eng
text: Over the last years, the Linked Open Data (LOD) has evolved from a mere 12
to more than 10, 000 knowledge bases. These knowledge bases come from diverse
domains including (but not limited to) publications, life sciences, social networking,
government, media, linguistics. Moreover, the LOD cloud also contains a large
number of crossdomain knowledge bases such as DBpedia and Yago2. These knowledge
bases are commonly managed in a decentralized fashion and contain partly overlapping
information. This architectural choice has led to knowledge pertaining to the
same domain being published by independent entities in the LOD cloud. For example,
information on drugs can be found in Diseasome as well as DBpedia and Drugbank.
Furthermore, certain knowledge bases such as DBLP have been published by several
bodies, which in turn has lead to duplicated content in the LOD. In addition,
large amounts of geo-spatial information have been made available with the growth
of heterogeneous Web of Data. The concurrent publication of knowledge bases containing
related information promises to become a phenomenon of increasing importance with
the growth of the number of independent data providers. Enabling the joint use
of the knowledge bases published by these providers for tasks such as federated
queries, cross-ontology question answering and data integration is most commonly
tackled by creating links between the resources described within these knowledge
bases. Within this thesis, we spur the transition from isolated knowledge bases
to enriched Linked Data sets where information can be easily integrated and processed.
To achieve this goal, we provide concepts, approaches and use cases that facilitate
the integration and enrichment of information with other data types that are already
present on the Linked Data Web with a focus on geo-spatial data. The first challenge
that motivates our work is the lack of measures that use the geographic data for
linking geo-spatial knowledge bases. This is partly due to the geo-spatial resources
being described by the means of vector geometry. In particular, discrepancies
in granularity and error measurements across knowledge bases render the selection
of appropriate distance measures for geo-spatial resources difficult. We address
this challenge by evaluating existing literature for pointset measures that can
be used to measure the similarity of vector geometries. Then, we present and evaluate
the ten measures that we derived from the literature on samples of three real
knowledge bases. The second challenge we address in this thesis is the lack of
automatic Link Discovery (LD) approaches capable of dealing with geospatial knowledge
bases with missing and erroneous data. To this end,we present Colibri, an unsupervised
approach that allows discovering links between knowledge bases while improving
the quality of the instance data in these knowledge bases. A Colibri iteration
begins by generating links between knowledge bases. Then, the approach makes use
of these links to detect resources with probably erroneous or missing information.
This erroneous or missing infor- mation detected by the approach is finally corrected
or added. The third challenge we address is the lack of scalable LD approaches
for tackling big geo-spatial knowledge bases. Thus, we present Deterministic Particle-Swarm
Optimization (DPSO), a novel load balancing technique for LD on parallel hardware
based on particle-swarm optimization. We combine this approach with the Orchid
algorithm for geo-spatial linking and evaluate it on real and artificial data
sets. The lack of approaches for automatic updating of links of an evolving knowledge
base is our fourth challenge. This challenge is addressed in this thesis by the
Wombat algorithm. Wombat is a novel approach for the discovery of links between
knowledge bases that relies exclusively on positive examples. Wombat is based
on generalisation via an upward refinement operator to traverse the space of Link
Specifications (LS). We study the theoretical characteristics of Wombat and evaluate
it on different benchmark data sets. The last challenge addressed herein is the
lack of automatic approaches for geo-spatial knowledge base enrichment. Thus,
we propose Deer, a supervised learning approach based on a refinement operator
for enriching Resource Description Framework (RDF) data sets. We show how we can
use exemplary descriptions of enriched resources to generate accurate enrichment
pipelines. We evaluate our approach against manually defined enrichment pipelines
and show that our approach can learn accurate pipelines even when provided with
a small number of training examples. Each of the proposed approaches is implemented
and evaluated against state-of-the-art approaches on real and/or artificial data
sets. Moreover, all approaches are peer-reviewed and published in a con- ference
or a journal paper. Throughout this thesis, we detail the ideas, implementation
and the evaluation of each of the approaches. Moreover, we discuss each approach
and present lessons learned. Finally, we conclude this thesis by presenting a
set of possible future extensions and use cases for each of the proposed approaches.
author:
- first_name: Mohamed
full_name: Sherif, Mohamed
id: '67234'
last_name: Sherif
orcid: https://orcid.org/0000-0002-9927-2203
citation:
ama: Sherif M. Automating Geospatial RDF Dataset Integration and Enrichment.
University of Leipzig; 2016.
apa: Sherif, M. (2016). Automating Geospatial RDF Dataset Integration and Enrichment.
University of Leipzig.
bibtex: '@book{Sherif_2016, place={Leipzig, Germany}, title={Automating Geospatial
RDF Dataset Integration and Enrichment}, publisher={University of Leipzig}, author={Sherif,
Mohamed}, year={2016} }'
chicago: 'Sherif, Mohamed. Automating Geospatial RDF Dataset Integration and
Enrichment. Leipzig, Germany: University of Leipzig, 2016.'
ieee: 'M. Sherif, Automating Geospatial RDF Dataset Integration and Enrichment.
Leipzig, Germany: University of Leipzig, 2016.'
mla: Sherif, Mohamed. Automating Geospatial RDF Dataset Integration and Enrichment.
University of Leipzig, 2016.
short: M. Sherif, Automating Geospatial RDF Dataset Integration and Enrichment,
University of Leipzig, Leipzig, Germany, 2016.
date_created: 2021-12-17T09:59:57Z
date_updated: 2024-05-08T10:40:28Z
keyword:
- 2016 group\_aksw sys:relevantFor:geoknow sys:relevantFor:infai sys:relevantFor:bis
ngonga simba dice sherif group\_aksw geoknow deer lehmann MOLE
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://www.qucosa.de/landing-page/?tx_dlf%5Bid%5D=https%3A%2F%2Fwww.qucosa.de%2Fapi%2Fqucosa%253A15175%2Fmets%2F&cHash=22c1b49c76de010dc4fb42260d8a1cf6
oa: '1'
place: Leipzig, Germany
publisher: University of Leipzig
status: public
supervisor:
- first_name: 'Klaus-Peter '
full_name: 'Fähnrich, Klaus-Peter '
last_name: Fähnrich
- first_name: 'Jens '
full_name: 'Lehmann, Jens '
last_name: Lehmann
title: Automating Geospatial RDF Dataset Integration and Enrichment
type: dissertation
user_id: '67234'
year: '2016'
...
---
_id: '54172'
author:
- first_name: Seyed Mohsen
full_name: Mousavi, Seyed Mohsen
last_name: Mousavi
- first_name: Javad
full_name: Sadeghi, Javad
last_name: Sadeghi
- first_name: Seyed Taghi Akhavan
full_name: Niaki, Seyed Taghi Akhavan
last_name: Niaki
- first_name: Madjid
full_name: Tavana, Madjid
id: '31858'
last_name: Tavana
citation:
ama: 'Mousavi SM, Sadeghi J, Niaki STA, Tavana M. A bi-objective inventory optimization
model under inflation and discount using tuned Pareto-based algorithms: NSGA-II,
NRGA, and MOPSO. Applied Soft Computing. 2016;43:57-72. doi:10.1016/j.asoc.2016.02.014'
apa: 'Mousavi, S. M., Sadeghi, J., Niaki, S. T. A., & Tavana, M. (2016). A bi-objective
inventory optimization model under inflation and discount using tuned Pareto-based
algorithms: NSGA-II, NRGA, and MOPSO. Applied Soft Computing, 43,
57–72. https://doi.org/10.1016/j.asoc.2016.02.014'
bibtex: '@article{Mousavi_Sadeghi_Niaki_Tavana_2016, title={A bi-objective inventory
optimization model under inflation and discount using tuned Pareto-based algorithms:
NSGA-II, NRGA, and MOPSO}, volume={43}, DOI={10.1016/j.asoc.2016.02.014},
journal={Applied Soft Computing}, publisher={Elsevier BV}, author={Mousavi, Seyed
Mohsen and Sadeghi, Javad and Niaki, Seyed Taghi Akhavan and Tavana, Madjid},
year={2016}, pages={57–72} }'
chicago: 'Mousavi, Seyed Mohsen, Javad Sadeghi, Seyed Taghi Akhavan Niaki, and Madjid
Tavana. “A Bi-Objective Inventory Optimization Model under Inflation and Discount
Using Tuned Pareto-Based Algorithms: NSGA-II, NRGA, and MOPSO.” Applied Soft
Computing 43 (2016): 57–72. https://doi.org/10.1016/j.asoc.2016.02.014.'
ieee: 'S. M. Mousavi, J. Sadeghi, S. T. A. Niaki, and M. Tavana, “A bi-objective
inventory optimization model under inflation and discount using tuned Pareto-based
algorithms: NSGA-II, NRGA, and MOPSO,” Applied Soft Computing, vol. 43,
pp. 57–72, 2016, doi: 10.1016/j.asoc.2016.02.014.'
mla: 'Mousavi, Seyed Mohsen, et al. “A Bi-Objective Inventory Optimization Model
under Inflation and Discount Using Tuned Pareto-Based Algorithms: NSGA-II, NRGA,
and MOPSO.” Applied Soft Computing, vol. 43, Elsevier BV, 2016, pp. 57–72,
doi:10.1016/j.asoc.2016.02.014.'
short: S.M. Mousavi, J. Sadeghi, S.T.A. Niaki, M. Tavana, Applied Soft Computing
43 (2016) 57–72.
date_created: 2024-05-11T11:39:47Z
date_updated: 2024-05-11T11:52:02Z
department:
- _id: '277'
doi: 10.1016/j.asoc.2016.02.014
intvolume: ' 43'
language:
- iso: eng
page: 57-72
publication: Applied Soft Computing
publication_identifier:
issn:
- 1568-4946
publication_status: published
publisher: Elsevier BV
status: public
title: 'A bi-objective inventory optimization model under inflation and discount using
tuned Pareto-based algorithms: NSGA-II, NRGA, and MOPSO'
type: journal_article
user_id: '51811'
volume: 43
year: '2016'
...
---
_id: '54166'
author:
- first_name: Rashed
full_name: Khanjani Shiraz, Rashed
last_name: Khanjani Shiraz
- first_name: Madjid
full_name: Tavana, Madjid
id: '31858'
last_name: Tavana
- first_name: Debora
full_name: Di Caprio, Debora
last_name: Di Caprio
- first_name: Hirofumi
full_name: Fukuyama, Hirofumi
last_name: Fukuyama
citation:
ama: Khanjani Shiraz R, Tavana M, Di Caprio D, Fukuyama H. Solving Geometric Programming
Problems with Normal, Linear and Zigzag Uncertainty Distributions. Journal
of Optimization Theory and Applications. 2016;170(1):243-265. doi:10.1007/s10957-015-0857-y
apa: Khanjani Shiraz, R., Tavana, M., Di Caprio, D., & Fukuyama, H. (2016).
Solving Geometric Programming Problems with Normal, Linear and Zigzag Uncertainty
Distributions. Journal of Optimization Theory and Applications, 170(1),
243–265. https://doi.org/10.1007/s10957-015-0857-y
bibtex: '@article{Khanjani Shiraz_Tavana_Di Caprio_Fukuyama_2016, title={Solving
Geometric Programming Problems with Normal, Linear and Zigzag Uncertainty Distributions},
volume={170}, DOI={10.1007/s10957-015-0857-y},
number={1}, journal={Journal of Optimization Theory and Applications}, publisher={Springer
Science and Business Media LLC}, author={Khanjani Shiraz, Rashed and Tavana, Madjid
and Di Caprio, Debora and Fukuyama, Hirofumi}, year={2016}, pages={243–265} }'
chicago: 'Khanjani Shiraz, Rashed, Madjid Tavana, Debora Di Caprio, and Hirofumi
Fukuyama. “Solving Geometric Programming Problems with Normal, Linear and Zigzag
Uncertainty Distributions.” Journal of Optimization Theory and Applications
170, no. 1 (2016): 243–65. https://doi.org/10.1007/s10957-015-0857-y.'
ieee: 'R. Khanjani Shiraz, M. Tavana, D. Di Caprio, and H. Fukuyama, “Solving Geometric
Programming Problems with Normal, Linear and Zigzag Uncertainty Distributions,”
Journal of Optimization Theory and Applications, vol. 170, no. 1, pp. 243–265,
2016, doi: 10.1007/s10957-015-0857-y.'
mla: Khanjani Shiraz, Rashed, et al. “Solving Geometric Programming Problems with
Normal, Linear and Zigzag Uncertainty Distributions.” Journal of Optimization
Theory and Applications, vol. 170, no. 1, Springer Science and Business Media
LLC, 2016, pp. 243–65, doi:10.1007/s10957-015-0857-y.
short: R. Khanjani Shiraz, M. Tavana, D. Di Caprio, H. Fukuyama, Journal of Optimization
Theory and Applications 170 (2016) 243–265.
date_created: 2024-05-11T11:25:18Z
date_updated: 2024-05-11T11:52:17Z
department:
- _id: '277'
doi: 10.1007/s10957-015-0857-y
intvolume: ' 170'
issue: '1'
language:
- iso: eng
page: 243-265
publication: Journal of Optimization Theory and Applications
publication_identifier:
issn:
- 0022-3239
- 1573-2878
publication_status: published
publisher: Springer Science and Business Media LLC
status: public
title: Solving Geometric Programming Problems with Normal, Linear and Zigzag Uncertainty
Distributions
type: journal_article
user_id: '51811'
volume: 170
year: '2016'
...
---
_id: '54167'
author:
- first_name: Vahid
full_name: Hajipour, Vahid
last_name: Hajipour
- first_name: Parviz
full_name: Fattahi, Parviz
last_name: Fattahi
- first_name: Madjid
full_name: Tavana, Madjid
id: '31858'
last_name: Tavana
- first_name: Debora
full_name: Di Caprio, Debora
last_name: Di Caprio
citation:
ama: Hajipour V, Fattahi P, Tavana M, Di Caprio D. Multi-objective multi-layer congested
facility location-allocation problem optimization with Pareto-based meta-heuristics.
Applied Mathematical Modelling. 2016;40(7-8):4948-4969. doi:10.1016/j.apm.2015.12.013
apa: Hajipour, V., Fattahi, P., Tavana, M., & Di Caprio, D. (2016). Multi-objective
multi-layer congested facility location-allocation problem optimization with Pareto-based
meta-heuristics. Applied Mathematical Modelling, 40(7–8), 4948–4969.
https://doi.org/10.1016/j.apm.2015.12.013
bibtex: '@article{Hajipour_Fattahi_Tavana_Di Caprio_2016, title={Multi-objective
multi-layer congested facility location-allocation problem optimization with Pareto-based
meta-heuristics}, volume={40}, DOI={10.1016/j.apm.2015.12.013},
number={7–8}, journal={Applied Mathematical Modelling}, publisher={Elsevier BV},
author={Hajipour, Vahid and Fattahi, Parviz and Tavana, Madjid and Di Caprio,
Debora}, year={2016}, pages={4948–4969} }'
chicago: 'Hajipour, Vahid, Parviz Fattahi, Madjid Tavana, and Debora Di Caprio.
“Multi-Objective Multi-Layer Congested Facility Location-Allocation Problem Optimization
with Pareto-Based Meta-Heuristics.” Applied Mathematical Modelling 40,
no. 7–8 (2016): 4948–69. https://doi.org/10.1016/j.apm.2015.12.013.'
ieee: 'V. Hajipour, P. Fattahi, M. Tavana, and D. Di Caprio, “Multi-objective multi-layer
congested facility location-allocation problem optimization with Pareto-based
meta-heuristics,” Applied Mathematical Modelling, vol. 40, no. 7–8, pp.
4948–4969, 2016, doi: 10.1016/j.apm.2015.12.013.'
mla: Hajipour, Vahid, et al. “Multi-Objective Multi-Layer Congested Facility Location-Allocation
Problem Optimization with Pareto-Based Meta-Heuristics.” Applied Mathematical
Modelling, vol. 40, no. 7–8, Elsevier BV, 2016, pp. 4948–69, doi:10.1016/j.apm.2015.12.013.
short: V. Hajipour, P. Fattahi, M. Tavana, D. Di Caprio, Applied Mathematical Modelling
40 (2016) 4948–4969.
date_created: 2024-05-11T11:26:04Z
date_updated: 2024-05-11T11:52:14Z
department:
- _id: '277'
doi: 10.1016/j.apm.2015.12.013
intvolume: ' 40'
issue: 7-8
language:
- iso: eng
page: 4948-4969
publication: Applied Mathematical Modelling
publication_identifier:
issn:
- 0307-904X
publication_status: published
publisher: Elsevier BV
status: public
title: Multi-objective multi-layer congested facility location-allocation problem
optimization with Pareto-based meta-heuristics
type: journal_article
user_id: '51811'
volume: 40
year: '2016'
...
---
_id: '54155'
author:
- first_name: Madjid
full_name: Tavana, Madjid
id: '31858'
last_name: Tavana
- first_name: Zhaojun
full_name: Li, Zhaojun
last_name: Li
- first_name: Mohammadsadegh
full_name: Mobin, Mohammadsadegh
last_name: Mobin
- first_name: Mohammad
full_name: Komaki, Mohammad
last_name: Komaki
- first_name: Ehsan
full_name: Teymourian, Ehsan
last_name: Teymourian
citation:
ama: Tavana M, Li Z, Mobin M, Komaki M, Teymourian E. Multi-objective control chart
design optimization using NSGA-III and MOPSO enhanced with DEA and TOPSIS. Expert
Systems with Applications. 2016;50:17-39. doi:10.1016/j.eswa.2015.11.007
apa: Tavana, M., Li, Z., Mobin, M., Komaki, M., & Teymourian, E. (2016). Multi-objective
control chart design optimization using NSGA-III and MOPSO enhanced with DEA and
TOPSIS. Expert Systems with Applications, 50, 17–39. https://doi.org/10.1016/j.eswa.2015.11.007
bibtex: '@article{Tavana_Li_Mobin_Komaki_Teymourian_2016, title={Multi-objective
control chart design optimization using NSGA-III and MOPSO enhanced with DEA and
TOPSIS}, volume={50}, DOI={10.1016/j.eswa.2015.11.007},
journal={Expert Systems with Applications}, publisher={Elsevier BV}, author={Tavana,
Madjid and Li, Zhaojun and Mobin, Mohammadsadegh and Komaki, Mohammad and Teymourian,
Ehsan}, year={2016}, pages={17–39} }'
chicago: 'Tavana, Madjid, Zhaojun Li, Mohammadsadegh Mobin, Mohammad Komaki, and
Ehsan Teymourian. “Multi-Objective Control Chart Design Optimization Using NSGA-III
and MOPSO Enhanced with DEA and TOPSIS.” Expert Systems with Applications
50 (2016): 17–39. https://doi.org/10.1016/j.eswa.2015.11.007.'
ieee: 'M. Tavana, Z. Li, M. Mobin, M. Komaki, and E. Teymourian, “Multi-objective
control chart design optimization using NSGA-III and MOPSO enhanced with DEA and
TOPSIS,” Expert Systems with Applications, vol. 50, pp. 17–39, 2016, doi:
10.1016/j.eswa.2015.11.007.'
mla: Tavana, Madjid, et al. “Multi-Objective Control Chart Design Optimization Using
NSGA-III and MOPSO Enhanced with DEA and TOPSIS.” Expert Systems with Applications,
vol. 50, Elsevier BV, 2016, pp. 17–39, doi:10.1016/j.eswa.2015.11.007.
short: M. Tavana, Z. Li, M. Mobin, M. Komaki, E. Teymourian, Expert Systems with
Applications 50 (2016) 17–39.
date_created: 2024-05-11T11:15:34Z
date_updated: 2024-05-11T11:52:44Z
department:
- _id: '277'
doi: 10.1016/j.eswa.2015.11.007
intvolume: ' 50'
language:
- iso: eng
page: 17-39
publication: Expert Systems with Applications
publication_identifier:
issn:
- 0957-4174
publication_status: published
publisher: Elsevier BV
status: public
title: Multi-objective control chart design optimization using NSGA-III and MOPSO
enhanced with DEA and TOPSIS
type: journal_article
user_id: '51811'
volume: 50
year: '2016'
...
---
_id: '46365'
abstract:
- lang: eng
text: Despite the intrinsic hardness of the Traveling Salesperson Problem (TSP)
heuristic solvers, e.g., LKH+restart and EAX+restart, are remarkably successful
in generating satisfactory or even optimal solutions. However, the reasons for
their success are not yet fully understood. Recent approaches take an analytical
viewpoint and try to identify instance features, which make an instance hard or
easy to solve. We contribute to this area by generating instance sets for couples
of TSP algorithms A and B by maximizing/minimizing their performance difference
in order to generate instances which are easier to solve for one solver and much
harder to solve for the other. This instance set offers the potential to identify
key features which allow to distinguish between the problem hardness classes of
both algorithms.
author:
- first_name: Jakob
full_name: Bossek, Jakob
id: '102979'
last_name: Bossek
orcid: 0000-0002-4121-4668
- first_name: Heike
full_name: Trautmann, Heike
id: '100740'
last_name: Trautmann
orcid: 0000-0002-9788-8282
citation:
ama: 'Bossek J, Trautmann H. Evolving Instances for Maximizing Performance Differences
of State-of-The-Art Inexact TSP Solvers. In: Festa P, Sellmann M, Vanschoren J,
eds. Learning and Intelligent Optimization. Vol 10079. Lecture Notes in
Computer Science. Springer International Publishing; 2016:48–59. doi:10.1007/978-3-319-50349-3_4'
apa: Bossek, J., & Trautmann, H. (2016). Evolving Instances for Maximizing Performance
Differences of State-of-The-Art Inexact TSP Solvers. In P. Festa, M. Sellmann,
& J. Vanschoren (Eds.), Learning and Intelligent Optimization (Vol.
10079, pp. 48–59). Springer International Publishing. https://doi.org/10.1007/978-3-319-50349-3_4
bibtex: '@inproceedings{Bossek_Trautmann_2016, place={Ischia, Italy}, series={Lecture
Notes in Computer Science}, title={Evolving Instances for Maximizing Performance
Differences of State-of-The-Art Inexact TSP Solvers}, volume={10079}, DOI={10.1007/978-3-319-50349-3_4},
booktitle={Learning and Intelligent Optimization}, publisher={Springer International
Publishing}, author={Bossek, Jakob and Trautmann, Heike}, editor={Festa, P and
Sellmann, M and Vanschoren, J}, year={2016}, pages={48–59}, collection={Lecture
Notes in Computer Science} }'
chicago: 'Bossek, Jakob, and Heike Trautmann. “Evolving Instances for Maximizing
Performance Differences of State-of-The-Art Inexact TSP Solvers.” In Learning
and Intelligent Optimization, edited by P Festa, M Sellmann, and J Vanschoren,
10079:48–59. Lecture Notes in Computer Science. Ischia, Italy: Springer International
Publishing, 2016. https://doi.org/10.1007/978-3-319-50349-3_4.'
ieee: 'J. Bossek and H. Trautmann, “Evolving Instances for Maximizing Performance
Differences of State-of-The-Art Inexact TSP Solvers,” in Learning and Intelligent
Optimization, 2016, vol. 10079, pp. 48–59, doi: 10.1007/978-3-319-50349-3_4.'
mla: Bossek, Jakob, and Heike Trautmann. “Evolving Instances for Maximizing Performance
Differences of State-of-The-Art Inexact TSP Solvers.” Learning and Intelligent
Optimization, edited by P Festa et al., vol. 10079, Springer International
Publishing, 2016, pp. 48–59, doi:10.1007/978-3-319-50349-3_4.
short: 'J. Bossek, H. Trautmann, in: P. Festa, M. Sellmann, J. Vanschoren (Eds.),
Learning and Intelligent Optimization, Springer International Publishing, Ischia,
Italy, 2016, pp. 48–59.'
date_created: 2023-08-04T15:10:58Z
date_updated: 2024-06-10T11:58:25Z
department:
- _id: '34'
- _id: '819'
doi: 10.1007/978-3-319-50349-3_4
editor:
- first_name: P
full_name: Festa, P
last_name: Festa
- first_name: M
full_name: Sellmann, M
last_name: Sellmann
- first_name: J
full_name: Vanschoren, J
last_name: Vanschoren
intvolume: ' 10079'
language:
- iso: eng
page: 48–59
place: Ischia, Italy
publication: Learning and Intelligent Optimization
publication_identifier:
isbn:
- 978-3-319-50348-6
publisher: Springer International Publishing
series_title: Lecture Notes in Computer Science
status: public
title: Evolving Instances for Maximizing Performance Differences of State-of-The-Art
Inexact TSP Solvers
type: conference
user_id: '15504'
volume: 10079
year: '2016'
...