439 research outputs found
A simheuristic approach for evolving agent behaviour in the exploration for novel combat tactics
The automatic generation of behavioural models for intelligent agents in military simulation and experimentation remains a challenge. Genetic Algorithms are a global optimization approach which is suitable for addressing complex problems where locating the global optimum is a difficult task. Unlike traditional optimisation techniques such as hill-climbing or derivatives-based methods, Genetic Algorithms are robust for addressing highly multi-modal and discontinuous search landscapes. In this paper, we outline a simheuristic GA-based approach for automatic generation of finite state machine based behavioural models of intelligent agents, where the aim is the identification of novel combat tactics. Rather than evolving states, the proposed approach evolves a sequence of transitions. We also discuss workable starting points for the use of Genetic Algorithms for such scenarios, shedding some light on the associated design and implementation difficulties
A survey on metaheuristics for stochastic combinatorial optimization
Metaheuristics are general algorithmic frameworks, often nature-inspired, designed to solve complex optimization problems, and they are a growing research area since a few decades. In recent years, metaheuristics are emerging as successful alternatives to more classical approaches also for solving optimization problems that include in their mathematical formulation uncertain, stochastic, and dynamic information. In this paper metaheuristics such as Ant Colony Optimization, Evolutionary Computation, Simulated Annealing, Tabu Search and others are introduced, and their applications to the class of Stochastic Combinatorial Optimization Problems (SCOPs) is thoroughly reviewed. Issues common to all metaheuristics, open problems, and possible directions of research are proposed and discussed. In this survey, the reader familiar to metaheuristics finds also pointers to classical algorithmic approaches to optimization under uncertainty, and useful informations to start working on this problem domain, while the reader new to metaheuristics should find a good tutorial in those metaheuristics that are currently being applied to optimization under uncertainty, and motivations for interest in this fiel
Recommended from our members
A generic approach to behaviour-driven biochemical model construction
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University.Modelling of biochemical systems has received considerable attention over the last decade from bioengineering, biochemistry, computer science, and mathematics. This thesis investigates the applications of computational techniques to computational systems biology, for the construction of biochemical models in terms of topology and kinetic rates. Due to the complexity of biochemical systems, it is natural to construct models representing the biochemical systems incrementally in a piecewise manner. Syntax and semantics of two patterns are defined for the instantiation of components which are extendable, reusable and fundamental building blocks for models composition. We propose and implement a set of genetic operators and composition rules to tackle issues of piecewise composing models from scratch. Quantitative Petri nets are evolved by the genetic operators, and evolutionary process of modelling are guided by the composition rules. Metaheuristic algorithms are widely applied in BioModel Engineering to support intelligent and heuristic analysis of biochemical systems in terms of structure and kinetic rates. We illustrate parameters of biochemical models based on Biochemical Systems Theory, and then the topology and kinetic rates of the models are manipulated by employing evolution strategy and simulated annealing respectively. A new hybrid modelling framework is proposed and implemented for the models construction. Two heuristic algorithms are performed on two embedded layers in the hybrid framework: an outer layer for topology mutation and an inner layer for rates optimization. Moreover, variants of the hybrid piecewise modelling framework are investigated. Regarding flexibility of these variants, various combinations of evolutionary operators, evaluation criteria and design principles can be taken into account. We examine performance of five sets of the variants on specific aspects of modelling. The comparison of variants is not to explicitly show that one variant clearly outperforms the others, but it provides an indication of considering important features for various aspects of the modelling. Because of the very heavy computational demands, the process of modelling is paralleled by employing a grid environment, GridGain. Application of the GridGain and heuristic algorithms to analyze biological processes can support modelling of biochemical systems in a computational manner, which can also benefit mathematical modelling in computer science and bioengineering. We apply our proposed modelling framework to model biochemical systems in a hybrid piecewise manner. Modelling variants of the framework are comparatively studied on specific aims of modelling. Simulation results show that our modelling framework can compose synthetic models exhibiting similar species behaviour, generate models with alternative topologies and obtain general knowledge about key modelling features
Unknown area exploration for robots with energy constraints using a modified Butterfly Optimization Algorithm
Butterfly Optimization Algorithm (BOA) is a recent metaheuristic that has
been used in several optimization problems. In this paper, we propose a new
version of the algorithm (xBOA) based on the crossover operator and compare its
results to the original BOA and 3 other variants recently introduced in the
literature. We also proposed a framework for solving the unknown area
exploration problem with energy constraints using metaheuristics in both
single- and multi-robot scenarios. This framework allowed us to benchmark the
performances of different metaheuristics for the robotics exploration problem.
We conducted several experiments to validate this framework and used it to
compare the effectiveness of xBOA with wellknown metaheuristics used in the
literature through 5 evaluation criteria. Although BOA and xBOA are not optimal
in all these criteria, we found that BOA can be a good alternative to many
metaheuristics in terms of the exploration time, while xBOA is more robust to
local optima; has better fitness convergence; and achieves better exploration
rates than the original BOA and its other variants
A new Taxonomy of Continuous Global Optimization Algorithms
Surrogate-based optimization, nature-inspired metaheuristics, and hybrid
combinations have become state of the art in algorithm design for solving
real-world optimization problems. Still, it is difficult for practitioners to
get an overview that explains their advantages in comparison to a large number
of available methods in the scope of optimization. Available taxonomies lack
the embedding of current approaches in the larger context of this broad field.
This article presents a taxonomy of the field, which explores and matches
algorithm strategies by extracting similarities and differences in their search
strategies. A particular focus lies on algorithms using surrogates,
nature-inspired designs, and those created by design optimization. The
extracted features of components or operators allow us to create a set of
classification indicators to distinguish between a small number of classes. The
features allow a deeper understanding of components of the search strategies
and further indicate the close connections between the different algorithm
designs. We present intuitive analogies to explain the basic principles of the
search algorithms, particularly useful for novices in this research field.
Furthermore, this taxonomy allows recommendations for the applicability of the
corresponding algorithms.Comment: 35 pages total, 28 written pages, 4 figures, 2019 Reworked Versio
Recommended from our members
Evolutionary algorithms and other metaheuristics in water resources: Current status, research challenges and future directions
Copyright Š 2014 Elsevier. NOTICE: this is the authorâs version of a work that was accepted for publication in Environmental Modelling and Software. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Environmental Modelling and Software Vol. 62 (2014), DOI: 10.1016/j.envsoft.2014.09.013The development and application of evolutionary algorithms (EAs) and other metaheuristics for the optimisation of water resources systems has been an active research field for over two decades. Research to date has emphasized algorithmic improvements and individual applications in specific areas (e.g. model calibration, water distribution systems, groundwater management, river-basin planning and management, etc.). However, there has been limited synthesis between shared problem traits, common EA challenges, and needed advances across major applications. This paper clarifies the current status and future research directions for better solving key water resources problems using EAs. Advances in understanding fitness landscape properties and their effects on algorithm performance are critical. Future EA-based applications to real-world problems require a fundamental shift of focus towards improving problem formulations, understanding general theoretic frameworks for problem decompositions, major advances in EA computational efficiency, and most importantly aiding real decision-making in complex, uncertain application contexts
- âŚ