@article{LeschKoenigKounevetal.2022,
  author    = {Lesch, Veronika and K{\"o}nig, Maximilian and Kounev, Samuel and Stein, Anthony and Krupitzer, Christian},
  title     = {Tackling the rich vehicle routing problem with nature-inspired algorithms},
  series = {Applied Intelligence},
  volume    = {52},
  journal   = {Applied Intelligence},
  issn      = {1573-7497},
  doi       = {10.1007/s10489-021-03035-5},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-268942},
  pages     = {9476-9500},
  year      = {2022},
  abstract  = {In the last decades, the classical Vehicle Routing Problem (VRP), i.e., assigning a set of orders to vehicles and planning their routes has been intensively researched. As only the assignment of order to vehicles and their routes is already an NP-complete problem, the application of these algorithms in practice often fails to take into account the constraints and restrictions that apply in real-world applications, the so called rich VRP (rVRP) and are limited to single aspects. In this work, we incorporate the main relevant real-world constraints and requirements. We propose a two-stage strategy and a Timeline algorithm for time windows and pause times, and apply a Genetic Algorithm (GA) and Ant Colony Optimization (ACO) individually to the problem to find optimal solutions. Our evaluation of eight different problem instances against four state-of-the-art algorithms shows that our approach handles all given constraints in a reasonable time.},
  language  = {en}
}
@article{PrantlZeckBaueretal.2022,
  author    = {Prantl, Thomas and Zeck, Timo and Bauer, Andre and Ten, Peter and Prantl, Dominik and Yahya, Ala Eddine Ben and Ifflaender, Lukas and Dmitrienko, Alexandra and Krupitzer, Christian and Kounev, Samuel},
  title     = {A Survey on Secure Group Communication Schemes With Focus on IoT Communication},
  series = {IEEE Access},
  volume    = {10},
  journal   = {IEEE Access},
  doi       = {10.1109/ACCESS.2022.3206451},
  url       = {http://nbn-resolving.de/urn:nbn:de:bvb:20-opus-300257},
  pages     = {99944 -- 99962},
  year      = {2022},
  abstract  = {A key feature for Internet of Things (IoT) is to control what content is available to each user. To handle this access management, encryption schemes can be used. Due to the diverse usage of encryption schemes, there are various realizations of 1-to-1, 1-to-n, and n-to-n schemes in the literature. This multitude of encryption methods with a wide variety of properties presents developers with the challenge of selecting the optimal method for a particular use case, which is further complicated by the fact that there is no overview of existing encryption schemes. To fill this gap, we envision a cryptography encyclopedia providing such an overview of existing encryption schemes. In this survey paper, we take a first step towards such an encyclopedia by creating a sub-encyclopedia for secure group communication (SGC) schemes, which belong to the n-to-n category. We extensively surveyed the state-of-the-art and classified 47 different schemes. More precisely, we provide (i) a comprehensive overview of the relevant security features, (ii) a set of relevant performance metrics, (iii) a classification for secure group communication schemes, and (iv) workflow descriptions of the 47 schemes. Moreover, we perform a detailed performance and security evaluation of the 47 secure group communication schemes. Based on this evaluation, we create a guideline for the selection of secure group communication schemes.},
  language  = {en}
}