This paper describes the development of a method to locate high performance solutions for the deployment of Fire Brigade resources, such as fire stations and appliances, using evolutionary algorithms in conjunction wi...
详细信息
ISBN:
(纸本)9781905088416
This paper describes the development of a method to locate high performance solutions for the deployment of Fire Brigade resources, such as fire stations and appliances, using evolutionary algorithms in conjunction with fire service cover models. The problem itself is highly complex and multi-facetted, with many interrelated variables relating to the performance of a particular configuration of resources. This paper considers the difficulties inherent in attempting to apply evolutionary algorithms to search for high performance solutions. The application of these algorithms to fire service cover is both novel and highly challenging. Such algorithms allow the relatively rapid identification of areas of good potential solutions by sampling only a small percentage of the total search space. In order to achieve this, the cover models are being re-written in a more computationally efficient manner. This will then be coupled with an evolutionary algorithm in order to identify suitable solutions to the problem.
This work deals with an evolutionary data processing, concretely optimization of control of chaos based on using EA. The main aim of this work is to show that evolutionary algorithms are capable of optimization of cha...
详细信息
ISBN:
(纸本)9780769529325
This work deals with an evolutionary data processing, concretely optimization of control of chaos based on using EA. The main aim of this work is to show that evolutionary algorithms are capable of optimization of chaos control. As models of deterministic chaotic system one dimensional Logistic equation and two dimensional Henon map were used. The evolutionary algorithm Self-Organizing Migrating Algorithm (SOAM) was used in four versions. For each version, simulations were repeated several times to show and check robustness of used method.
The performance of base-line evolutionary algorithms (EAs) on combinatorial problems has been studied rigorously. From the theoretical viewpoint, the literature extensively investigates the linear problems, while the ...
详细信息
ISBN:
(纸本)9781450362542
The performance of base-line evolutionary algorithms (EAs) on combinatorial problems has been studied rigorously. From the theoretical viewpoint, the literature extensively investigates the linear problems, while the theoretical analysis of the non-linear problems is still far behind. In this paper, variations of the Packing While Travelling (PWT) - also known as the non-linear knapsack problem - are studied as an attempt to analyse the behaviour of EAs on non-linear problems from theoretical perspective. We investigate PWT for two cities and n items with correlated weights and profits, using single-objective and multi-objective algorithms. Our results show that RLS swap, which differs from the classical RLS by having the ability to swap two bits in one iteration, finds the optimal solution in O(n(3)) expected time. We also study an enhanced version of GSEMO, which a specific selection operator to deal with exponential population size, and prove that it finds the Pareto front in the same asymptotic expected time. In the case of uniform weights, (1+1) EA is able to find the optimal solution in expected time O(n(2) log (max{n,p(max)})), where p(max) is the largest profit of the given items. We also perform an experimental analysis to complement our theoretical investigations and provide additional insights into the runtime behavior.
Metaheuristics have received considerable interest these recent years in the field of combinatorial optimization. However, the choice of a particular algorithm to optimize a certain problem is still mainly driven by s...
详细信息
This paper proposes an evolutionary approach for the composition of solutions in an incremental way. The approach is based on the metaphor of transitions in complexity discussed in the context of evolutionary biology....
详细信息
ISBN:
(纸本)0780393635
This paper proposes an evolutionary approach for the composition of solutions in an incremental way. The approach is based on the metaphor of transitions in complexity discussed in the context of evolutionary biology. Partially defined solutions interact and evolve into aggregations until a full solution for the problem at hand is found. The impact of the initial population on the outcome and the dynamics of the process is evaluated using the domain of binary constraint satisfaction problems.
For general video game playing agents, the biggest challenge is adapting to the wide variety of situations they encounter and responding appropriately. Some success was recently achieved by modifying search-control pa...
详细信息
ISBN:
(纸本)9781728145334
For general video game playing agents, the biggest challenge is adapting to the wide variety of situations they encounter and responding appropriately. Some success was recently achieved by modifying search-control parameters in agents on-line, during one play-through of a game. We propose adapting such methods for Rolling Horizon evolutionary algorithms, which have shown high performance in many different environments, and test the effect of on-line adaptation on the agent's win rate. On-line tuned agents are able to achieve results comparable to the state of the art, including first win rates in hard problems, while employing a more general and highly adaptive approach. We additionally include further insight into the algorithm itself, given by statistics gathered during the tuning process and highlight key parameter choices.
One of the mostly used method for acquisition of structures of interpersonal relationships in the area of psychodynamic psychotherapy research is the method of the 'Core Conflictual Relationship Theme' which a...
详细信息
ISBN:
(纸本)3540628681
One of the mostly used method for acquisition of structures of interpersonal relationships in the area of psychodynamic psychotherapy research is the method of the 'Core Conflictual Relationship Theme' which allows a standardization of phrases in so-called standard categories. We reclustered these categories on the basis of a set of red clinical data by application of evolutionary algorithms which leads to an improvement of the clustering in comparison to earlier resulted cluster distribution. For the evolutionary algorithms we used a special (mu * lambda)-spring-off strategy balancing between the well known (mu, lambda)- and (mu + lambda)-strategy. Furthermore, we developed a special migration scheme for handling the dynamic of subpopulations.
This article gives a brief overview of theoretical and application-related advances and of future perspectives in parallel evolutionary algorithms, particularly parallel genetic algorithms. The developments presented ...
详细信息
ISBN:
(纸本)1889335231
This article gives a brief overview of theoretical and application-related advances and of future perspectives in parallel evolutionary algorithms, particularly parallel genetic algorithms. The developments presented may be classified into two periods - those prior and subsequent to the year 2001. The latter period is of greater interest and importance, including as it does recent work and providing indications on possible future trends, and is accordingly afforded more space. Since there appears to be no such overview of developments in parallel genetic algorithms pertaining to the period, we feel that the present investigation may be particularly useful.
Modern computer processing units tend towards simpler cores in greater numbers, favouring the development of data-parallel applications. evolutionary algorithms are ideal for taking full advantage of SIMD (Single Inst...
详细信息
ISBN:
(纸本)9781467315098
Modern computer processing units tend towards simpler cores in greater numbers, favouring the development of data-parallel applications. evolutionary algorithms are ideal for taking full advantage of SIMD (Single Instruction, Multiple Data) processing, which is available on both CPUs and GPUs. Creating software that runs on a GPU requires the use of specialised programming languages or styles, forcing practitioners to acquire new skills and limiting the portability of their developments. In this paper, we present an automatic translation from ESDL, a domain-specific language for composing evolutionary algorithms from arbitrary operators, to C++ AMP, a C++ extension for targeting heterogeneous hardware. Generating executable code from a simple platform-independent description allows practitioners with varying levels of programming expertise to take advantage of data-parallel execution, and enables those with strong expertise to further optimise their implementations. The automatic transformation is shown to produce code less optimal than a manual implementation but with significantly less developer effort. A secondary result is that GPU implementations require a large population, large individuals or an expensive evaluation function to achieve performance benefits over the CPU. All code developed for this paper is freely available online from http://***/esdl/amp.
Recently, evolutionary algorithms (EAs) with associative memory schemes have been developed to solve Dynamic Optimization Problems (DOPs). Current associative memory schemes always retrieve both the best memory indivi...
详细信息
ISBN:
(纸本)9783642048425
Recently, evolutionary algorithms (EAs) with associative memory schemes have been developed to solve Dynamic Optimization Problems (DOPs). Current associative memory schemes always retrieve both the best memory individual and the corresponding environmental information. However, the memory individual with the best fitness could not be the most appropriate one for new environments. In this paper, two novel associative memory retrieving strategies are proposed to obtain the most appropriate memory environmental information. In these strategies, two best individuals are first selected from the two best memory individuals and the Current best individual. Then, their corresponding environmental information is evaluated according to either the survivability or the diversity, one of which is retrieved. In experiments, the proposed two strategies were embedded into the state-of-the-art algorithm, i.e. the MPBIL and tested on three dynamic functions in cyclic environments. Experiment results demonstrate that the proposed retrieving strategies enhance the search ability in cyclic environments.
暂无评论