Relevant bibliographies by topics / Evolutionary problems / Dissertations / Theses
To see the other types of publications on this topic, follow the link: Evolutionary problems.

Dissertations / Theses on the topic 'Evolutionary problems'

Author: Grafiati
Published: 10 March 2023

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Evolutionary problems.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Weicker, Karsten. "Evolutionary algorithms and dynamic optimization problems /." Osnabrück : Der Andere Verl, 2003. http://www.gbv.de/dms/ilmenau/toc/365163716weick.PDF.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Soylu, Banu. "An Evolutionary Algorithm For Multiple Criteria Problems." Phd thesis, METU, 2007. http://etd.lib.metu.edu.tr/upload/2/12608134/index.pdf.

Full text
Abstract:
In this thesis, we develop an evolutionary algorithm for approximating the Pareto frontier of multi-objective continuous and combinatorial optimization problems. The algorithm tries to evolve the population of solutions towards the Pareto frontier and distribute it over the frontier in order to maintain a well-spread representation. The fitness score of each solution is computed with a Tchebycheff distance function and non-dominating sorting approach. Each solution chooses its own favorable weights according to the Tchebycheff distance function. Some seed solutions at initial population and a
APA, Harvard, Vancouver, ISO, and other styles
3

Guenther, Chris. "Pseudospectral techniques for non-smooth evolutionary problems." Morgantown, W. Va. : [West Virginia University Libraries], 1998. http://etd.wvu.edu/templates/showETD.cfm?recnum=202.

Full text
Abstract:
Thesis (Ph. D.)--West Virginia University, 1998.<br>Title from document title page. Document formatted into pages; contains xi, 116 p. : ill. (some col.) Includes abstract. Includes bibliographical references (p. 94-98).
APA, Harvard, Vancouver, ISO, and other styles
4

Mason, Andrew J. "Genetic algorithms and scheduling problems." Thesis, University of Cambridge, 1992. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.335134.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Demir, Erdem. "Analysis Of Evolutionary Algorithms For Constrained Routing Problems." Master's thesis, METU, 2004. http://etd.lib.metu.edu.tr/upload/12605083/index.pdf.

Full text
Abstract:
This study focuses on two types of routing problems based on standard Traveling Salesman Problem, which are TSP with pickup and delivery (TSPPD) and TSP with backhauls (TSPB). In both of these problems, there are two types of customers, i.e. &ldquo<br>delivery customers&rdquo<br>demanding goods from depot and &ldquo<br>pickup customers&rdquo<br>sending goods to depot. The objective is to minimize the cost of the tour that visits every customer once without violating the side constraints. In TSPB, delivery customers should precede the pickup customers, whereas the vehicle capacity should not
APA, Harvard, Vancouver, ISO, and other styles
6

Barkat, Ullah Abu Saleh Shah Muhammad Engineering &amp Information Technology Australian Defence Force Academy UNSW. "An integrated evolutionary system for solving optimization problems." Awarded by:University of New South Wales - Australian Defence Force Academy. Engineering & Information Technology, 2009. http://handle.unsw.edu.au/1959.4/43764.

Full text
Abstract:
Many real-world decision processes require solving optimization problems which may involve different types of constraints such as inequality and equality constraints. The hurdles in solving these Constrained Optimization Problems (COPs) arise from the challenge of searching a huge variable space in order to locate feasible points with acceptable solution quality. Over the last decades Evolutionary Algorithms (EAs) have brought a tremendous advancement in the area of computer science and optimization with their ability to solve various problems. However, EAs have inherent difficulty in d
APA, Harvard, Vancouver, ISO, and other styles
7

Priestley, A. "Lagrange and characteristic Galerkin methods for evolutionary problems." Thesis, University of Oxford, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.376942.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Liu, Wudong. "Evolutionary multiobjective optimisation for expensive and complex problems." Thesis, University of Essex, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.537937.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Garcia, Najera Abel. "Multi-Objective evolutionary algorithms for vehicle routing problems." Thesis, University of Birmingham, 2010. http://etheses.bham.ac.uk//id/eprint/1069/.

Full text
Abstract:
The Vehicle Routing Problem, which main objective is to find the lowest-cost set of routes to deliver goods to customers, has many applications in transportation services. In the past, costs have been mainly associated to the number of routes and the travel distance, however, in real-world problems there exist additional objectives. Since there is no known exact method to efficiently solve the problem in polynomial time, many heuristic techniques have been considered, among which, evolutionary methods have proved to be suitable for solving the problem. Despite this method being able to provide
APA, Harvard, Vancouver, ISO, and other styles
10

Mohammed, Ali Hind. "Behavior study of an evolutionary design for permutation problems." Thesis, Bourgogne Franche-Comté, 2018. http://www.theses.fr/2018UBFCD033.

Full text
Abstract:
Cette thèse étudie une combinaison évolutionnaire représentation_croisement pour des problèmes de permutation. Ceux-ci sont très étudiés dans la littérature en raison de leur complexité et de la diversité de leurs applications. Des méthodes efficaces existent pour résoudre les problèmes de permutation. Mais les états de l’art récents montrent que les applications réelles font émerger de nouvelles instances qui sont fortement dynamiques et conjuguent de nombreux objectifs et contraintes, notamment de synchronisation. Cette contribution se concentre sur les approches évolutionnaires. Elle explor
APA, Harvard, Vancouver, ISO, and other styles
11

Andrade, Carlos Eduardo de 1981. "Evolutionary algorithms for some problems in telecommunications = Algoritmos evolutivos para alguns problemas em telecomunicações." [s.n.], 2015. http://repositorio.unicamp.br/jspui/handle/REPOSIP/275653.

Full text
Abstract:
Orientadores: Flavio Keidi Miyazawa, Mauricio Guilherme de Carvalho Resende<br>Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Computação<br>Made available in DSpace on 2018-08-27T21:53:09Z (GMT). No. of bitstreams: 1 Andrade_CarlosEduardode_D.pdf: 4654702 bytes, checksum: 566cb3ea8fc876147ffa6df2ec8482b3 (MD5) Previous issue date: 2015<br>Resumo: Nos últimos anos, as redes de telecomunicação tem experienciado um grande aumento no fluxo de dados. Desde a utilização massiva de vídeo sob demanda até o incontável número de dispositivos móveis trocando texto e vídeo, o tráfego
APA, Harvard, Vancouver, ISO, and other styles
12

Di, Pietro Anthony. "Optimising evolutionary strategies for problems with varying noise strength." University of Western Australia. School of Computer Science and Software Engineering, 2007. http://theses.library.uwa.edu.au/adt-WU2007.0210.

Full text
Abstract:
For many real-world applications of evolutionary computation, the fitness function is obscured by random noise. This interferes with the evaluation and selection processes and adversely affects the performance of the algorithm. Noise can be effectively eliminated by averaging a large number of fitness samples for each candidate, but the number of samples used per candidate (the resampling rate) required to achieve this is usually prohibitively large and time-consuming. Hence there is a practical need for algorithms that handle noise without eliminating it. Moreover, the amount of noise (noise
APA, Harvard, Vancouver, ISO, and other styles
13

Smirnov, Oleg. "Formal evolutionary modeling and the problems of political science /." view abstract or download file of text, 2005. http://wwwlib.umi.com/cr/uoregon/fullcit?p3190550.

Full text
Abstract:
Thesis (Ph. D.)--University of Oregon, 2005.<br>Typescript. Includes vita and abstract. Includes bibliographical references (leaves 113-131). Also available for download via the World Wide Web; free to University of Oregon users.
APA, Harvard, Vancouver, ISO, and other styles
14

Britt, Winard. "A meta-parallel evolutionary system for solving optimization problems." Auburn, Ala., 2007. http://repo.lib.auburn.edu/2007%20Spring%20Theses/BRITT_WINARD_18.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
15

Xing, Huanlai. "Evolutionary approaches for network coding based multicast routing problems." Thesis, University of Nottingham, 2013. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.596088.

Full text
Abstract:
Network coding is an emerging technique in communication networks, where the intennediate nodes are allowed to combine (code) the data received from different incoming links if necessary. The thesis investigates a nwnber of routing problems for network coding based multicast (NCM). which belong to combinatorial optimization problems (COPs). Evolutionary algorithms (EAs) are used to srudy the problems. The work of the thesis are described below. We propose three EAs for the network coding resource minimization (NCRM) problem where the objective is to minimize the number of coding operations whi
APA, Harvard, Vancouver, ISO, and other styles
16

Guo, Qiang. "Evolutionary algorithms and hyper-heuristics for orthogonal packing problems." Thesis, University of Nottingham, 2011. http://eprints.nottingham.ac.uk/29311/.

Full text
Abstract:
This thesis investigates two major classes of Evolutionary Algorithms, Genetic Algorithms (GAs) and Evolution Strategies (ESs), and their application to the Orthogonal Packing Problems (OPP). OPP are canonical models for NP-hard problems, the class of problems widely conceived to be unsolvable on a polynomial deterministic Turing machine, although they underlie many optimisation problems in the real world. With the increasing power of modern computers, GAs and ESs have been developed in the past decades to provide high quality solutions for a wide range of optimisation and learning problems. T
APA, Harvard, Vancouver, ISO, and other styles
17

Jin, Nanlin. "Constraint-based co-evolutionary genetic programming for bargaining problems." Thesis, University of Essex, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.438140.

Full text
APA, Harvard, Vancouver, ISO, and other styles
18

Trostorff, Sascha. "Exponential Stability and Initial Value Problems for Evolutionary Equations." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2018. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-236494.

Full text
Abstract:
The thesis deals with so-called evolutionary equations, a class of abstract linear operator equations, which cover a huge class of partial differential equation with and without memory. We provide a unified Hilbert space framework for the well-posedness of such equations. Moreover, we inspect the exponential stability of those problems and construct spaces of admissible inital values and pre-histories, on which a strongly continuous semigroup could be associated with the given problem. The theoretical results are illustrated by several examples.
APA, Harvard, Vancouver, ISO, and other styles
19

Thompson, Evan Benjamin. "The application of genetic and evolutionary algorithms to spanning tree problems." Thesis, University of Exeter, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.288698.

Full text
APA, Harvard, Vancouver, ISO, and other styles
20

Wong, King Hei. "Solving combinatorial based chemical engineering problems via parallel evolutionary approaches /." View abstract or full-text, 2009. http://library.ust.hk/cgi/db/thesis.pl?CBME%202010%20WONGK.

Full text
APA, Harvard, Vancouver, ISO, and other styles
21

Gigli, Elena. "Evolutionary genetics of homo neanderthalensis :adaptive traits and methodological problems." Doctoral thesis, Universitat Pompeu Fabra, 2011. http://hdl.handle.net/10803/77656.

Full text
Abstract:
The evolutionary history of H. neanderthalensis, interwoven with that of H. sapiens, has always fascinated the scientific world. Recent adavncess in paleogenetics shedds new light on the phylogenetic relationship between Neandertals and modern humans. The studies developed in this thesis intend principally to control the contaminants through the development of an anti-contamination protocol for decreasing the human contamination in pre-laboratory phases. We designed a PCR-based method specific for reducing human contamination during the laboratory analysis, and we analyzed the fragmentation pa
APA, Harvard, Vancouver, ISO, and other styles
22

Cryan, Mary Elizabeth. "Learning and approximation algorithms for problems motivated by evolutionary trees." Thesis, University of Warwick, 1999. http://wrap.warwick.ac.uk/61093/.

Full text
Abstract:
In this thesis we consider some computational problems motivated by the biological problem of reconstructing evolutionary trees. In this thesis, we are concerned with the design and analysis of efficient algorithms for clearly defined combinatorial problems motived by this application area. We present results for two different kinds of problem. Our first problem is motivated by models of evolution that describe the evolution of biological species in terms of a stochastic process that alters the DNA of species. The particular stochastic model that we considered is called the Two-State General M
APA, Harvard, Vancouver, ISO, and other styles
23

Elbergali, Abdalla Kh. "Factor analysis : theory and applications to evolutionary problems in chemometrics." Thesis, University of Bristol, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.282138.

Full text
APA, Harvard, Vancouver, ISO, and other styles
24

CRUZ, ANDRE VARGAS ABS DA. "QUANTUM-INSPIRED EVOLUTIONARY ALGORITHMS FOR PROBLEMS BASED ON NUMERICAL REPRESENTATION." PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2007. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=10640@1.

Full text
Abstract:
CONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO<br>Desde que foram propostos como método de otimização, os algoritmos evolutivos têm sido usados com sucesso para resolver problemas complexos nas mais diversas áreas como, por exemplo, o projeto automático de circuitos e equipamentos, planejamento de tarefas, engenharia de software e mineração de dados, entre tantos outros. Este sucesso se deve, entre outras coisas, ao fato desta classe de algoritmos não necessitar de formulações matemáticas rigorosas a respeito do problema que se deseja otimizar, além de oferecer um alto gr
APA, Harvard, Vancouver, ISO, and other styles
25

Hatzakis, Iason. "Multi-objective evolutionary methods for time-changing portfolio optimization problems." Thesis, Massachusetts Institute of Technology, 2007. http://hdl.handle.net/1721.1/42307.

Full text
Abstract:
Thesis (S.M. in Ocean Systems Management)--Massachusetts Institute of Technology, Dept. of Mechanical Engineering, 2007.<br>Includes bibliographical references (p. 77-79).<br>This thesis is focused on the discovery of efficient asset allocations with the use of evolutionary algorithms. The portfolio optimization problem is a multi-objective optimization problem for the conflicting criteria of risk and expected return. Furthermore the nonstationary nature of the market makes it a time-changing problem in which the optimal solution is likely to change as time advances. Hence the portfolio optimi
APA, Harvard, Vancouver, ISO, and other styles
26

Jayachandran, Jayakanth. "Improving resiliency using graph based evolutionary algorithms." Diss., Rolla, Mo. : Missouri University of Science and Technology, 2010. http://scholarsmine.mst.edu/thesis/pdf/Jayachandran_09007dcc807d6ba6.pdf.

Full text
Abstract:
Thesis (M.S.)--Missouri University of Science and Technology, 2010.<br>Vita. The entire thesis text is included in file. Title from title screen of thesis/dissertation PDF file (viewed July 19, 2010) Includes bibliographical references (p. 56-62).
APA, Harvard, Vancouver, ISO, and other styles
27

Fu, Ser-Geon. "Genetic and evolutionary protocols for solving distributed asymmetric constraint satisfaction problems." Auburn, Ala., 2007. http://repo.lib.auburn.edu/2007%20Spring%20Dissertations/FU_SER-GEON_10.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
28

Androulakakis, Pavlos. "Analysis of Evolutionary Algorithms in the Control of Path Planning Problems." Wright State University / OhioLINK, 2018. http://rave.ohiolink.edu/etdc/view?acc_num=wright1535549741081137.

Full text
APA, Harvard, Vancouver, ISO, and other styles
29

Mirjalili, Seyedali. "Confidence-based Robust Optimisation of Engineering Design Problems." Thesis, Griffith University, 2016. http://hdl.handle.net/10072/366690.

Full text
Abstract:
Robust optimisation refers to the process of combining good performance with low sensitivity to possible perturbations. Due to the presence of different un- certainties when optimising real problems, failure to employ robust optimisation techniques may result in finding unreliable solutions. Robust optimisation techniques play key roles in finding reliable solutions when considering possible uncertainties during optimisation. Evolutionary optimisation algorithms have become very popular for solving real problems in science and industry mainly due to simplicity, gradient-free mechanism, and fl
APA, Harvard, Vancouver, ISO, and other styles
30

Li, Miqing. "Evolutionary many-objective optimisation : pushing the boundaries." Thesis, Brunel University, 2015. http://bura.brunel.ac.uk/handle/2438/11778.

Full text
Abstract:
Many-objective optimisation poses great challenges to evolutionary algorithms. To start with, the ineffectiveness of the Pareto dominance relation, which is the most important criterion in multi-objective optimisation, results in the underperformance of traditional Pareto-based algorithms. Also, the aggravation of the conflict between proximity and diversity, along with increasing time or space requirement as well as parameter sensitivity, has become key barriers to the design of effective many-objective optimisation algorithms. Furthermore, the infeasibility of solutions' direct observation c
APA, Harvard, Vancouver, ISO, and other styles
31

Urquhart, Neil B. "Solving real-world routing problems using evolutionary algorithms and multi-agent-systems." Thesis, Edinburgh Napier University, 2003. http://researchrepository.napier.ac.uk/Output/2748.

Full text
Abstract:
This thesis investigates the solving of routing problems using Evolutionary Algorithms (EAs). Routing problems are known to be hard and may possess complex search spaces. Evolutionary algorithms are potentially powerful tools for finding solutions within complex search spaces. The problem investigated is the routing of deliveries to households within an urban environment; the most common instance of this problem is that of daily postal deliveries. A representation known as Street Based Routing (SBR) is presented. This is a problem representation that makes use of the real world groupings of st
APA, Harvard, Vancouver, ISO, and other styles
32

Raj, Ashish. "Evolutionary Optimization Algorithms for Nonlinear Systems." DigitalCommons@USU, 2013. http://digitalcommons.usu.edu/etd/1520.

Full text
Abstract:
Many real world problems in science and engineering can be treated as optimization problems with multiple objectives or criteria. The demand for fast and robust stochastic algorithms to cater to the optimization needs is very high. When the cost function for the problem is nonlinear and non-differentiable, direct search approaches are the methods of choice. Many such approaches use the greedy criterion, which is based on accepting the new parameter vector only if it reduces the value of the cost function. This could result in fast convergence, but also in misconvergence where it could lead the
APA, Harvard, Vancouver, ISO, and other styles
33

Muthuswamy, Shanthi. "Discrete particle swarm optimization algorithms for orienteering and team orienteering problems." Diss., Online access via UMI:, 2009.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
34

Asco, Amadeo. "Constructive and evolutionary algorithms for airport baggage sorting station and gate assignment problems." Thesis, University of Nottingham, 2013. http://eprints.nottingham.ac.uk/13784/.

Full text
Abstract:
Correct assignment of airport resources can greatly affect the quality of service which airlines and airports provide to their customers. Good assignments can help airlines and airports to keep to published schedules, by minimising changes in these schedules and reducing delays. Given the expected increases in civil air traffic, the complexities of resource scheduling and assignment continue to increase. For this reason, as well as the dynamic nature of the problems, scheduling and assignment are becoming increasingly more difficult. The assignment of baggage sorting stations to flights is one
APA, Harvard, Vancouver, ISO, and other styles
35

Syberfeldt, Anna. "A multi-objective evolutionary approach to simulation-based optimisation of real-world problems." Thesis, De Montfort University, 2009. http://hdl.handle.net/2086/2770.

Full text
Abstract:
This thesis presents a novel evolutionary optimisation algorithm that can improve the quality of solutions in simulation-based optimisation. Simulation-based optimisation is the process of finding optimal parameter settings without explicitly examining each possible configuration of settings. An optimisation algorithm generates potential configurations and sends these to the simulation, which acts as an evaluation function. The evaluation results are used to refine the optimisation such that it eventually returns a high-quality solution. The algorithm described in this thesis integrates multi-
APA, Harvard, Vancouver, ISO, and other styles
36

Fu, Ser-Geon. "Genetic and evolionary protocols for solving distributed asymmetric contraint satisfaction problems." Auburn, Ala., 2007. http://repo.lib.auburn.edu/07M%20Dissertations/FU_SER-GEON_10.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
37

Cameron, Mark A., and Mark Cameron@csiro au. "A Problem Model for Decision Support Systems." The Australian National University. Faculty of Engineering and Information Technology, 2000. http://thesis.anu.edu.au./public/adt-ANU20020717.144031.

Full text
Abstract:
This body of research focuses on supporting problem-stakeholders, decision-makers and problem-solvers faced with an ill-defined and complex real world problem. An ill-defined problem has a characteristic trait of continual refinement. That is, the definition of the problem changes throughout the problem investigation and resolution process. The central theme of this research is that a support system should provide problem stakeholders with a problem definition model for constructing and manipulating a representation of the definition of the problem as they understand it. The approach adopted h
APA, Harvard, Vancouver, ISO, and other styles
38

Aldogan, Deniz. "Memetic Algorithms For Timetabling Problems In Private Schools." Master's thesis, METU, 2005. http://etd.lib.metu.edu.tr/upload/3/12606218/index.pdf.

Full text
Abstract:
The aim of this study is to introduce a real-world timetabling problem that exists in some private schools in Turkey and to solve such problem instances utilizing memetic algorithms. Being a new type of problem and for privacy reasons, there is no real data available. Hence for benchmarking purposes, a random data generator has been implemented. Memetic algorithms (MAs) combining genetic algorithms and hill-climbing are applied to solve synthetic problem instances produced by this generator. Different types of recombination and mutation operators based on the hierarchical structure of the
APA, Harvard, Vancouver, ISO, and other styles
39

Tometzki, Thomas [Verfasser]. "Hybrid Evolutionary Algorithms for the Efficient Solution of Planning Problems under Uncertainty / Thomas Tometzki." Aachen : Shaker, 2011. http://d-nb.info/1070152730/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
40

Abo, Alsabeh Rewayda. "An evolutionary approach to solving the maximum size consecutive ones submatrix and related problems." Thesis, University of Essex, 2017. http://repository.essex.ac.uk/20792/.

Full text
Abstract:
The Consecutive Ones Submatrix (C1S) has a vital role in real world applications. Consequently, there are continuous concern and demand to solve this problem via efficient algorithms. These algorithms are judged on the basis of their robustness, ease of use, and their computational time. The main aim of this thesis is to convert a Pure Integer Linear Programming (ILP) with (0, 1)−matrix into Mixed Integer Linear Programming (MILP) by finding the C1S submatrix. Given a (0, 1)−matrix, we consider the C1S problem which aims to maximize the number of columns having only one block of consecutive 1’
APA, Harvard, Vancouver, ISO, and other styles
41

Hasan, S. M. Kamrul Engineering &amp Information Technology Australian Defence Force Academy UNSW. "Evolutionary algorithms for solving job-shop scheduling problems in the presence of process interruptions." Awarded by:University of New South Wales - Australian Defence Force Academy. Engineering & Information Technology, 2009. http://handle.unsw.edu.au/1959.4/43768.

Full text
Abstract:
In this thesis, the Job Shop Scheduling Problem (JSSP) is the problem of interest. The classical JSSP is well-known as an NP-hard problem. Although with current computational capabilities, the small problems are solvable using deterministic methods, it is out of reach when they are larger in size. The complexity of JSSP is further increased when process interruptions, such as machine breakdown and/or machine unavailability, are introduced. Over the last few decades, several stochastic algorithms have been proposed to solve JSSPs. However, none of them are suitable for all kinds of probl
APA, Harvard, Vancouver, ISO, and other styles
42

Butans, Jevgenijs. "Addressing real-time control problems in complex environments using dynamic multi-objective evolutionary approaches." Thesis, Cranfield University, 2011. http://dspace.lib.cranfield.ac.uk/handle/1826/7275.

Full text
Abstract:
The demand for increased automation of industrial processes generates control problems that are dynamic, multi-objective and noisy at the same time. The primary hypothesis underlying this research is that dynamic evolutionary methods could be used to address dynamic control problems where con icting control criteria are necessary. The aim of this research is to develop a framework for on-line optimisation of dynamic problems that is capable of a) representing problems in a quantitative way, b) identifying optimal solutions using multi-objective evolutionary algorithms, and c) automatically sel
APA, Harvard, Vancouver, ISO, and other styles
43

Trostorff, Sascha [Verfasser], and Ralph [Gutachter] Chill. "Exponential Stability and Initial Value Problems for Evolutionary Equations / Sascha Trostorff ; Gutachter: Ralph Chill." Dresden : Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2018. http://d-nb.info/1160875545/34.

Full text
APA, Harvard, Vancouver, ISO, and other styles
44

Pickardt, Christoph W. "Evolutionary methods for the design of dispatching rules for complex and dynamic scheduling problems." Thesis, University of Warwick, 2013. http://wrap.warwick.ac.uk/59757/.

Full text
Abstract:
Three methods, based on Evolutionary Algorithms (EAs), to support and automate the design of dispatching rules for complex and dynamic scheduling problems are proposed in this thesis. The first method employs an EA to search for problem instances on which a given dispatching rule performs badly. These instances can then be analysed to reveal weaknesses of the tested rule, thereby providing guidelines for the design of a better rule. The other two methods are hyper-heuristics, which employ an EA directly to generate effective dispatching rules. In particular, one hyper-heuristic is based on a s
APA, Harvard, Vancouver, ISO, and other styles
45

Filograsso, Gianni <1997&gt. "Adaptive evolutionary algorithms for portfolio selection problems: state of the art and experimental analysis." Master's Degree Thesis, Università Ca' Foscari Venezia, 2021. http://hdl.handle.net/10579/19820.

Full text
Abstract:
This thesis aims at solving complex portfolio selection problems by introducing an adaptive strategy for parameter control in EAs, with the aim of achieving accurate and robust solutions. In chapter 1 we review a broad set of parameter tuning and parameter control strategies, then we implement an adaptive policy, based on the parameter control technique proposed by Maturana (2010), on a variety of non-convex risk measures, that display many local optima, for which traditional minimization strategies like gradient descent methods are not suitable. The idea behind this method is to solve problem
APA, Harvard, Vancouver, ISO, and other styles
46

Fabritius, Björn. "Application of genetic algorithms to problems in computational fluid dynamics." Thesis, University of Exeter, 2014. http://hdl.handle.net/10871/15236.

Full text
Abstract:
In this thesis a methodology is presented to optimise non–linear mathematical models in numerical engineering applications. The method is based on biological evolution and uses known concepts of genetic algorithms and evolutionary compu- tation. The working principle is explained in detail, the implementation is outlined and alternative approaches are mentioned. The optimisation is then tested on a series of benchmark cases to prove its validity. It is then applied to two different types of problems in computational engineering. The first application is the mathematical modeling of turbulence.
APA, Harvard, Vancouver, ISO, and other styles
47

Roudenko, Olga. "Application des Algorithmes Evolutionnaires aux problèmes d'optimisation muti-objectif avec contraintes." Palaiseau, Ecole polytechnique, 2004. http://www.theses.fr/2004EPXX0005.

Full text
APA, Harvard, Vancouver, ISO, and other styles
48

Sävhammar, Simon. "Tillämpbarheten av Learning Backtracking Search Optimization Algoritmen vid Lösning av Sudoku-problemet." Thesis, Högskolan i Skövde, Institutionen för informationsteknologi, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-14087.

Full text
Abstract:
Den här rapporten undersöker egenskaper hos en algoritm som är baserad på Learning Backtracking Search Optimization Algorithm (LBSA) som introducerades av Chen et. al. (2017). Undersökningen genomfördes genom att tillämpa algoritmen på Sudokuproblemet och jämföra lösningsgraden och diversiteten i den sista populationen med en algoritm som är baserad på Hybrid Genetic Algorithm (HGA) som introducerades av Deng och Li (2011). Resultaten visar att implementationen av den LBSA-baserade algoritmen har en lägre lösningsgrad än den HGA-baserade algoritmen för alla genomförda experiment, men att algor
APA, Harvard, Vancouver, ISO, and other styles
49

Le, Khoi Nguyen. "A study of evolutionary multiobjective algorithms and their application to knapsack and nurse scheduling problems." Thesis, University of Nottingham, 2011. http://eprints.nottingham.ac.uk/13116/.

Full text
Abstract:
Evolutionary algorithms (EAs) based on the concept of Pareto dominance seem the most suitable technique for multiobjective optimisation. In multiobjective optimisation, several criteria (usually conflicting) need to be taken into consideration simultaneously to assess a quality of a solution. Instead of finding a single solution, a set of trade-off or compromise solutions that represents a good approximation to the Pareto optimal set is often required. This thesis presents an investigation on evolutionary algorithms within the framework of multiobjective optimisation. This addresses a number o
APA, Harvard, Vancouver, ISO, and other styles
50

Mikki, Said M. "Theoretical-physics approach to selected problems in engineering electromagnetics : evolutionary optimization and low-dimensional nanostructures /." Full text available from ProQuest UM Digital Dissertations, 2008. http://0-proquest.umi.com.umiss.lib.olemiss.edu/pqdweb?index=0&did=1814477871&SrchMode=1&sid=1&Fmt=2&VInst=PROD&VType=PQD&RQT=309&VName=PQD&TS=1257874503&clientId=22256.

Full text
Abstract:
Thesis (Ph.D.)--University of Mississippi, 2008.<br>Typescript. Vita. "October 2008." Dissertation advisor: Ahmed A. Kishk Includes bibliographical references (leaves 307-328). Also available online via ProQuest to authorized users.
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography