Log in

Relevant bibliographies by topics / Evolutionary problems

Contents

Dissertations / Theses

Academic literature 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 lists of relevant articles, books, theses, conference reports, and other scholarly sources 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.

Dissertations / Theses on the topic "Evolutionary problems"

1

Weicker, Karsten. "Evolutionary algorithms and dynamic optimization problems /." Osnabrü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

More sources

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!