ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (20)
  • Other Sources
  • genetic algorithms  (13)
  • Optimal control
  • Springer  (20)
  • 1995-1999  (20)
  • 1985-1989
  • 1970-1974
  • 1998  (20)
  • Mathematics  (15)
  • Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics  (5)
  • Natural Sciences in General
  • Technology
Collection
  • Articles  (20)
  • Other Sources
Publisher
Years
  • 1995-1999  (20)
  • 1985-1989
  • 1970-1974
Year
Topic
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    OR spectrum 20 (1998), S. 39-45 
    ISSN: 1436-6304
    Keywords: Supersequences ; heuristics ; genetic algorithms ; Supersequenzen ; Heuristiken ; Genetische Algorithmen
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Description / Table of Contents: Summary In diesem Artikel werden verschiedene Heuristiken und ein Genetischer Algorithmus (GA) für das Shortest Common Supersequence (SCS) Problem vorgestellt — ein NP-vollständiges Problem mit Anwendungen in den Bereichen Produktionsplanung, Maschinenbau und Datenkompression. Die von uns vorgestellten Heuristiken verhalten sich im schlechtesten Fall ähnlich wie die klassische Majority Merge (MM) Heuristik, übertreffen MM jedoch in beinahe allen Testfällen. Desweiteren beschreiben wir einen Genetischen Algorithmus, dem eine leicht veränderte Version einer der vorgestellten neuen Heuristiken zugrundeliegt. Das so entstandene GA/Heuristik Hybridverfahren liefert abermals signifikant bessere Ergebnisse als die anderen Heuristiken, benötigt dafür jedoch erheblich mehr Zeit.
    Notes: Abstract In this paper several heuristics and a genetic algorithm (GA) are described for the Shortest Common Supersequence (SCS) problem, an NP-complete problem with applications in production planning, mechanical engineering and data compression. While our heuristics show the same worst case behaviour as the classical Majority Merge heuristic (MM) they outperform MM on nearly all our test instances. We furthermore present a genetic algorithm based on a slightly modified version of one of the new heuristics. The resulting GA/heuristic hybrid yields significantly better results than any of the heuristics alone, though the running time is much higher.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent manufacturing 9 (1998), S. 323-329 
    ISSN: 1572-8145
    Keywords: Intelligent manufacturing ; machine learning ; neuro–fuzzy systems ; genetic algorithms
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract Intelligence is strongly connected with learning adapting abilities, therefore such capabilities are considered as indispensable features of intelligent manufacturing systems (IMSs). A number of approaches have been described to apply different machine learning (ML) techniques for manufacturing problems, starting with rule induction in symbolic domains and pattern recognition techniques in numerical, subsymbolic domains. In recent years, artificial neural network (ANN) based learning is the dominant ML technique in manufacturing. However, mainly because of the ‘black box’ nature of ANNs, these solutions have limited industrial acceptance. In the paper, the integration of neural and fuzzy techniques is treated and former solutions are analysed. A genetic algorithm (GA) based approach is introduced to overcome problems that are experienced during manufacturing applications with other algorithms.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Journal of heuristics 4 (1998), S. 323-357 
    ISSN: 1572-9397
    Keywords: combinatorial optimisation ; crew scheduling ; genetic algorithms ; set partitioning
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper we present a genetic algorithm-based heuristic for solving the set partitioning problem (SPP). The SPP is an important combinatorial optimisation problem used by many airlines as a mathematical model for flight crew scheduling. A key feature of the SPP is that it is a highly constrained problem, all constraints being equalities. New genetic algorithm (GA) components: separate fitness and unfitness scores, adaptive mutation, matching selection and ranking replacement, are introduced to enable a GA to effectively handle such constraints. These components are generalisable to any GA for constrained problems. We present a steady-state GA in conjunction with a specialised heuristic improvement operator for solving the SPP. The performance of our algorithm is evaluated on a large set of real-world problems. Computational results show that the genetic algorithm-based heuristic is capable of producing high-quality solutions.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Journal of heuristics 4 (1998), S. 221-244 
    ISSN: 1572-9397
    Keywords: optimization with multiple criteria ; genetic algorithms ; adaptive selection procedure ; Pareto-optimal solutions ; cost-benefit analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We present a new heuristic method to approximate the set of Pareto-optimal solutions in multicriteria optimization problems. We use genetic algorithms with an adaptive selection mechanism. The direction of the selection pressure is adapted to the actual state of the population and forces it to explore a broad range of so far undominated solutions. The adaptation is done by a fuzzy rule-based control of the selection procedure and the fitness function. As an application we present a timetable optimization problem where we used this method to derive cost-benefit curves for the investment into railway nets. These results show that our fuzzy adaptive approach avoids most of the empirical shortcomings of other multiobjective genetic algorithms.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 5
    Electronic Resource
    Electronic Resource
    Springer
    Journal of heuristics 4 (1998), S. 179-192 
    ISSN: 1572-9397
    Keywords: genetic algorithms ; simulated annealing ; software package
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Sugal is a major new public-domain software package designed to support experimentation with, and implementation of, Genetic Algorithms. Sugal includes a generalised Genetic Algorithm, which supports the major popular versions of the GA as special cases. Sugal also has integrated support for various datatypes, including real numbers, and features to make hybridisation simple. This paper discusses the Sugal GA, showing how recombining the features of the popular algorithms results in the creation of a number of useful hybrid algorithms.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 6
    Electronic Resource
    Electronic Resource
    Springer
    Journal of heuristics 4 (1998), S. 25-46 
    ISSN: 1572-9397
    Keywords: evolutionary algorithms ; genetic algorithms ; constraint satisfaction ; graph coloring ; grouping problem ; penalty functions ; adaptive parameters
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper presents the results of an experimental investigation on solving graph coloring problems with Evolutionary Algorithms (EAs). After testing different algorithm variants we conclude that the best option is an asexual EA using order-based representation and an adaptation mechanism that periodically changes the fitness function during the evolution. This adaptive EA is general, using no domain specific knowledge, except, of course, from the decoder (fitness function). We compare this adaptive EA to a powerful traditional graph coloring technique DSatur and the Grouping Genetic Algorithm (GGA) on a wide range of problem instances with different size, topology and edge density. The results show that the adaptive EA is superior to the Grouping (GA) and outperforms DSatur on the hardest problem instances. Furthermore, it scales up better with the problem size than the other two algorithms and indicates a linear computational complexity.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 7
    Electronic Resource
    Electronic Resource
    Springer
    Journal of heuristics 4 (1998), S. 63-86 
    ISSN: 1572-9397
    Keywords: genetic algorithms ; multidimensional knapsack ; multiconstraint knapsack ; combinatorial optimisation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper we present a heuristic based upon genetic algorithms for the multidimensional knapsack problem. A heuristic operator which utilises problem-specific knowledge is incorporated into the standard genetic algorithm approach. Computational results show that the genetic algorithm heuristic is capable of obtaining high-quality solutions for problems of various characteristics, whilst requiring only a modest amount of computational effort. Computational results also show that the genetic algorithm heuristic gives superior quality solutions to a number of other heuristics.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 8
    Electronic Resource
    Electronic Resource
    Springer
    Journal of heuristics 4 (1998), S. 107-122 
    ISSN: 1572-9397
    Keywords: maximum clique ; genetic algorithms ; optimized crossover
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In Balas and Niehaus (1996), we have developed a heuristic for generating large cliques in an arbitrary graph, by repeatedly taking two cliques and finding a maximum clique in the subgraph induced by the union of their vertex sets, an operation executable in polynomial time through bipartite matching in the complement of the subgraph. Aggarwal, Orlin and Tai (1997) recognized that the latter operation can be embedded into the framework of a genetic algorithm as an optimized crossover operation. Inspired by their approach, we examine variations of each element of the genetic algorithm—selection, population replacement and mutation—and develop a steady-state genetic algorithm that performs better than its competitors on most problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 9
    Electronic Resource
    Electronic Resource
    Springer
    Journal of heuristics 4 (1998), S. 245-261 
    ISSN: 1572-9397
    Keywords: scheduling problems ; constructive methods ; genetic algorithms ; uniform crossover
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We consider a robotized analytical system in which a chemical treatment has to be performed on a given set of identical samples. The objective is to carry out the chemical treatment on the whole set of samples in the shortest possible time. All constraints have to be satisfied since a modification of the chemical process could create unexpected reactions. We have developed a new robust method governed by a genetic algorithm to solve this scheduling problem. The crossover mechanism of this evolutionary method is based on an extension of the uniform crossover introduced by Syswerda (1989). The proposed approach can be adapted to other combinatorial problems where decisions, based on rules, have to be taken at each step of a constructive method.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 10
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent and robotic systems 23 (1998), S. 379-405 
    ISSN: 1573-0409
    Keywords: flexible drive system ; fuzzy-enhanced adaptive control ; genetic algorithms ; friction control
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract When a mechatronic system is in slow speed motion, serious effect of nonlinear friction plays a key role in its control design. In this paper, a stable adaptive control for drive systems including transmission flexibility and friction, based on the Lyapunov stability theory, is first proposed. For ease of design, the friction is fictitiously assumed as an unknown disturbance in the derivation of the adaptive control law. Genetic algorithms are then suggested for learning the structure and parameters of the fuzzy-enhancing strategy for the adaptive control to improve system's transient performance and robustness with respect to uncertainty. The integrated fuzzy-enhanced adaptive control is well tested via computer simulations using the new complete dynamic friction model recently suggested by Canudas de Wit et al. for modeling the real friction phenomena. Much lower critical velocity of a flexible drive system that determines system's low-speed performance bound can be obtained using the proposed hybrid control strategy.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 11
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent and robotic systems 23 (1998), S. 331-349 
    ISSN: 1573-0409
    Keywords: constrained robots ; genetic algorithms ; learning ; friction compensation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract In this paper, the issues of contact friction compensation for constrained robots are presented. The proposed design consists of two loops. The inner loop is for the inverse dynamics control which linearizes the system by canceling nonlinear dynamics, while the outer loop is for friction compensation. Although various models of friction have been proposed in many engineering applications, frictional force can be modeled by the Coulomb friction plus the viscous force. Based on such a model, an on-line genetic algorithm is proposed to learn the friction coefficients for friction model. The friction compensation control input is also implemented in terms of the friction coefficients to cancel the effect of unknown friction. By the guidance of the fitness function, the genetic learning algorithm searches for the best-fit value in a way like the natural surviving laws. Simulation results demonstrate that the proposed on-line genetic algorithm can achieve good friction compensation even under the conditions of measurement noise and system uncertainty. Moreover, the proposed control scheme is also found to be feasible for friction compensation of friction model with Stribeck effect and position-dependent friction model.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 12
    Electronic Resource
    Electronic Resource
    Springer
    Journal of intelligent and robotic systems 23 (1998), S. 351-377 
    ISSN: 1573-0409
    Keywords: robots ; trajectory generation ; raster scanning ; genetic algorithms ; redundancy ; obstacle avoidance
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract An algorithm for Cartesian trajectory generation by redundant robots in environments with obstacles is presented. The algorithm combines a raster scanning technique, genetic algorithms and functions for interpolation in the joint coordinates space in order to approximate a desired Cartesian curve by the robot's hand tip under maximum allowed position deviation. A raster scanning technique determines a minimal set of knot points on the desired curve in order to generate a Cartesian trajectory with bounded position approximation error. Genetic algorithms are used to determine an acceptable robot configuration under obstacle avoidance constraints corresponding to a knot point. Robot motion between two successive knot points is finally achieved using well known interpolation techniques in the joint coordinates space. The proposed algorithm is analyzed and its performance is demonstrated through simulated experiments carried out on planar redundant robots.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 13
    Electronic Resource
    Electronic Resource
    Springer
    Neural computing & applications 7 (1998), S. 295-308 
    ISSN: 1433-3058
    Keywords: Adaptive ; Backpropagation ; Multivariable ; Neural networks ; Optimal control ; Submarine
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mathematics
    Notes: Abstract Recently, there have been many attempts to use neural networks as a feedback controller. However, most of the reported cases seek to control Single-Input Single-Output (SISO) systems using some sort of adaptive strategy. In this paper, we demonstrate that neural networks can be used for the control of complex multivariable, rather than simply SISO, systems. A modified direct control scheme using a neural network architecture is used with backpropagation as the adaptive algorithm. The proposed algorithm is designed for Multi-Input Multi-Output (MIMO) systems, and is similar to that proposed by Saerens and Soquet [1] and Goldenthal and Farrell [2] for (SISO) systems, and differs only in the form of the gradient approximation. As an example of the application of this approach, we investigate the control of the dynamics of a submarine vehicle with four inputs and four outputs, in which the differential stern, bow and rudder control surfaces are dynamically coordinated to cause the submarine to follow commanded changes in roll, yaw rate, depth rate and pitch attitude. Results obtained using this scheme are compared with those obtained using optimal linear quadratic control.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 14
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 97 (1998), S. 623-644 
    ISSN: 1573-2878
    Keywords: Optimal control ; bang-bang control ; free boundary problems ; parabolic equations ; homogenizations ; optimality conditions
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract We study a simple model of chemical vapor deposition on a silicon wafer. The control is the flux of chemical species, and the objective is to grow the semiconductor film so that its surface attains a prescribed profile as nearly as possible. The surface is spatially fast oscillating due to the small feature scale, and therefore the problem is formulated in terms of its homogenized approximation. We prove that the optimal control is bang-bang, and we use this information to develop a numerical scheme for computing the optimal control.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 15
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 13 (1998), S. 43-59 
    ISSN: 1573-2916
    Keywords: Resource constrained scheduling ; renewable and nonrenewable resources ; Optimal control
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The paper addresses problems of allocating continuously divisible resources among multiple production activities. The resources are allowed to be doubly constrained, so that both usage at every point of time and cumulative consumption over a planning horizon are limited as it is often the case in project and production scheduling. The objective is to track changing in time demands for the activities as closely as possible. We propose a general continuous-time model that states the problem in a form of the optimal control problem with non-linear speed-resource usage functions. With the aid of the maximum principle, properties of the solutions are derived to characterize optimal resource usage policies. On the basis of this analytical investigation, numerical scheduling methods are suggested and computationally studied.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 16
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 98 (1998), S. 65-82 
    ISSN: 1573-2878
    Keywords: Optimal control ; switching times ; state jumps ; transformations ; optimal parameter selection problem ; automatic differentiation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract In this paper, we consider a class of optimal control problems in which the dynamical system involves a finite number of switching times together with a state jump at each of these switching times. The locations of these switching times and a parameter vector representing the state jumps are taken as decision variables. We show that this class of optimal control problems is equivalent to a special class of optimal parameter selection problems. Gradient formulas for the cost functional and the constraint functional are derived. On this basis, a computational algorithm is proposed. For illustration, a numerical example is included.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 17
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 12 (1998), S. 215-223 
    ISSN: 1573-2916
    Keywords: Optimal control ; Exact penalization ; Directional differentiability ; Subdifferentiability ; Necessary optimality conditions ; Nonsmooth analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The nonsmoothness is viewed by many people as at least an undesirable (if not unavoidable) property. Our aim here is to show that recent developments in Nonsmooth Analysis (especially in Exact Penalization Theory) allow one to treat successfully even some quite ‘smooth’ problems by tools of Nonsmooth Analysis and Nondifferentiable Optimization. Our approach is illustrated by one Classical Control Problem of finding optimal parameters in a system described by ordinary differential equations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 18
    Electronic Resource
    Electronic Resource
    Springer
    Journal of global optimization 13 (1998), S. 109-122 
    ISSN: 1573-2916
    Keywords: Optimal control ; Pontryagin maximum principle ; Global optimality
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract Let a trajectory and control pair $$(\bar x{\text{, }}\bar u{\text{)}}$$ maximize globally the functional g(x(T)) in the basic optimal control problem. Then (evidently) any pair (x,u) from the level set of the functional g corresponding to the value g( $$\bar x$$ (T)) is also globally optimal and satisfies the Pontryagin maximum principle. It is shown that this necessary condition for global optimality of $$(\bar x{\text{, }}\bar u{\text{)}}$$ turns out to be a sufficient one under the additional assumption of nondegeneracy of the maximum principle for every pair (x,u) from the above-mentioned level set. In particular, if the pair $$(\bar x{\text{, }}\bar u{\text{)}}$$ satisfies the Pontryagin maximum principle which is nondegenerate in the sense that for the Hamiltonian H, we have along the pair $$(\bar x{\text{, }}\bar u{\text{)}}$$ $$\mathop {{\text{max}}}\limits_u {\text{ }}H$$ ≢ $$\mathop {{\text{min}}}\limits_u {\text{ }}H$$ on [0,T], and if there is no another pair (x,u) such that g(x(T))=g( $$\bar x$$ (T)), then $$(\bar x{\text{, }}\bar u{\text{)}}$$ is a global maximizer.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 19
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 99 (1998), S. 1-22 
    ISSN: 1573-2878
    Keywords: Optimal control ; dynamical systems ; decomposition ; aggregation
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract This paper is concerned with the reduction of a class of optimal control problems to simpler problems by using decomposition and aggregation. Decomposition is shown to provide a good approximation when the system dynamics involve nearly decomposable matrices or variables with strong and weak interactions. Aggregation provides a good approximation if each of the decomposed matrices has one or more dominant eigenvalues. It is shown how one can construct nearly-optimal controls for the given system from the optimal solutions of the simpler reduced problems.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 20
    Electronic Resource
    Electronic Resource
    Springer
    Autonomous robots 5 (1998), S. 199-213 
    ISSN: 1573-7527
    Keywords: adaptive behaviors ; evolutionary robots ; fractal fitness landscape ; robot navigation ; genetic algorithms ; over-adaptation ; developed neural network
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science , Mechanical Engineering, Materials Science, Production Engineering, Mining and Metallurgy, Traffic Engineering, Precision Mechanics
    Notes: Abstract An autonomous robot “Khepera” was simulated with a sensory-motor model, which evolves in the genetic algorithm (GA) framework, with the fitness evaluation in terms of the navigation performance in a maze course. The sensory-motor model is a developed neural network decoded from a graph-represented chromosome, which is evolved in the GA process with several genetic operators. It was found that the fitness landscape is very rugged when it is observed at the starting point of the course. A hypothesis for this ruggedness is proposed, and is supported by the measurement of fractal dimension. It is also observed that the performance is sometimes plagued by “Loss of Robustness,” after the robot makes major evolutionary jumps. Here, the robustness is quantitatively defined as a ratio of the averaged fitness of the evolved robot navigating in perturbed environments over the fitness of the evolved robot in the referenced environment. Possible explanation of robustness loss is the over-adaptation occurred in the environment where the evolution was taken place. Testing some other possibilities for this loss of robustness, many simulation experiments were conducted which smooth out the discrete factors in the model and environment. It was found that smoothing the discrete factors does not solve the loss of robustness. An effective method for maintaining the robustness is the use of averaged fitness over different navigation conditions. The evolved models in the simulated environment were tested by down-loading the models into the real Khepera robot. It is demonstrated that the tendency of fitness values observed in the simulation were adequately regenerated.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...