Log in

Relevant bibliographies by topics / Backtracking search optimization algorithm / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Backtracking search optimization algorithm.

Dissertations / Theses on the topic 'Backtracking search optimization algorithm'

Author: Grafiati

Published: 4 June 2021

Last updated: 25 July 2025

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 'Backtracking search optimization algorithm.'

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

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

2

Tchvagha, Zeine Ahmed. "Contribution à l’optimisation multi-objectifs sous contraintes : applications à la mécanique des structures." Thesis, Normandie, 2018. http://www.theses.fr/2018NORMIR13/document.

Full text

Abstract:

L’objectif de cette thèse est le développement de méthodes d’optimisation multi-objectif pour la résolution de problèmes de conception des structures mécaniques. En effet, la plupart des problèmes réels dans le domaine de la mécanique des structures ont plusieurs objectifs qui sont souvent antagonistes. Il s’agit, par exemple, de concevoir des structures en optimisant leurs poids, leurs tailles, et leurs coûts de production. Le but des méthodes d’optimisation multi-objectif est la recherche des solutions de compromis entre les objectifs étant donné l’impossibilité de satisfaire tout simultaném

APA, Harvard, Vancouver, ISO, and other styles

3

Rossato, Luciara Vellar. "Otimização de amortecedores de massa sintonizados em estruturas submetidas a um processo estacionário." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2017. http://hdl.handle.net/10183/163246.

Full text

Abstract:

Atualmente as estruturas estão sendo avaliadas para um maior número de ações em relação há algumas décadas. Esta melhoria ao longo da fase de concepção é dada devido ao fato de que está se tornando mais competitivo o fornecimento de estruturas leves e esbeltas, sendo solicitados, cada vez mais, projetos com menor custo de implantação. Devido a isto, é necessário avaliar as estruturas não apenas sujeitas a cargas estáticas, mas também a carregamentos dinâmicos. As ações dinâmicas que atuam sobre uma estrutura podem ser muito mais prejudiciais do que as estáticas quando não são bem consideradas

APA, Harvard, Vancouver, ISO, and other styles

4

Sá, Alan Oliveira de. "Localização colaborativa em robótica de enxame." Universidade do Estado do Rio de Janeiro, 2015. http://www.bdtd.uerj.br/tde_busca/arquivo.php?codArquivo=8895.

Full text

Abstract:

Fundação de Amparo à Pesquisa do Estado do Rio de Janeiro<br>Diversas das possíveis aplicações da robótica de enxame demandam que cada robô seja capaz de estimar a sua posição. A informação de localização dos robôs é necessária, por exemplo, para que cada elemento do enxame possa se posicionar dentro de uma formatura de robôs pré-definida. Da mesma forma, quando os robôs atuam como sensores móveis, a informação de posição é necessária para que seja possível identificar o local dos eventos medidos. Em virtude do tamanho, custo e energia dos dispositivos, bem como limitações impostas pelo ambien

APA, Harvard, Vancouver, ISO, and other styles

5

Malleypally, Vinaya. "Parallelizing Tabu Search Based Optimization Algorithm on GPUs." Scholar Commons, 2018. https://scholarcommons.usf.edu/etd/7638.

Full text

Abstract:

There are many combinatorial optimization problems such as traveling salesman problem, quadratic-assignment problem, flow shop scheduling, that are computationally intractable. Tabu search based simulated annealing is a stochastic search algorithm that is widely used to solve combinatorial optimization problems. Due to excessive run time, there is a strong demand for a parallel version that can be applied to any problem with minimal modifications. Existing advanced and/or parallel versions of tabu search algorithms are specific to the problem at hand. This leads to a drawback of optimization o

APA, Harvard, Vancouver, ISO, and other styles

6

Bilal, Mohd. "A Heuristic Search Algorithm for Asteroid Tour Missions." Thesis, Luleå tekniska universitet, Rymdteknik, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:ltu:diva-71361.

Full text

Abstract:

Since the discovery of Ceres, asteroids have been of immense scientific interest and intrigue. They hold answers to many of the fundamental questionsabout the formation and evolution of the Solar System. Therefore, a missionsurveying the asteroid belt with close encounter of carefully chosen asteroidswould be of immense scientific benefit. The trajectory of such an asteroidtour mission needs to be designed such that asteroids of a wide range ofcompositions and sizes are encountered; all with an extremely limited ∆Vbudget.This thesis presents a novel heuristic algorithm to optimize trajectories

APA, Harvard, Vancouver, ISO, and other styles

7

Lianjie, Shen. "Optimization and Search in Model-Based Automotive SW/HW Development." Thesis, Linköpings universitet, Programvara och system, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-105394.

Full text

Abstract:

In this thesis two case studies are performed about solving two design problems we face during the design phase of new Volvo truck. One is to solve the frame packing problem on CAN bus. The other is to solve the LDC allocation problem. Both solutions are targeted to meet as many end-to-end latency requirements as possible. Now the solution is obtained through manually approach and based on the designer experience. But it is still not satisfactory enough. With the development of artificial intelligence method we propose two methods based on genetic algorithm to solve our design problem we face

APA, Harvard, Vancouver, ISO, and other styles

8

Akin, Alper. "Optimum Design Of Reinforced Concrete Plane Frames Using Harmony Search Algorithm." Phd thesis, METU, 2010. http://etd.lib.metu.edu.tr/upload/12612293/index.pdf.

Full text

Abstract:

In this thesis, the optimum design algorithm is presented for reinforced concrete special moment frames. The objective function is considered as the total cost of reinforced concrete frame which includes the cost of concrete, formwork and reinforcing steel bars. The cost of any component is inclusive of material, fabrication and labor. The design variables in beams are selected as the width and the depth of beams in each span, the diameter and the number of longitudinal reinforcement bars along the span and supports. In columns the width and the depth of the column section, the number and the

APA, Harvard, Vancouver, ISO, and other styles

9

Cruz, António Manuel Costa. "IMRT beam angle optimization using Tabu search." Master's thesis, Universidade de Aveiro, 2014. http://hdl.handle.net/10773/17714.

Full text

Abstract:

Mestrado em Matemática e Aplicações<br>O número de pacientes com cancro continua a crescer no mundo e a Organização Mundial da Saúde considerou mesmo esta como uma das principais ameaças para a saúde e o desenvolvimento humano. Dependendo da localização e das especi cidades do tumor, existem muitos tratamentos que podem ser usados, incluindo cirurgia, quimioterapia, imunoterapia e radioterapia. A Radioterapia de Intensidade Modulada (IMRT | Intensity Modulated Radiation Therapy) é uma das modalidades mais avançadas de radioterapia, onde a otimização pode ter um papel importante no que

APA, Harvard, Vancouver, ISO, and other styles

10

Kim, Jinhyo. "Iterated Grid Search Algorithm on Unimodal Criteria." Diss., Virginia Tech, 1997. http://hdl.handle.net/10919/30370.

Full text

Abstract:

The unimodality of a function seems a simple concept. But in the Euclidean space R^m, m=3,4,..., it is not easy to define. We have an easy tool to find the minimum point of a unimodal function. The goal of this project is to formalize and support distinctive strategies that typically guarantee convergence. Support is given both by analytic arguments and simulation study. Application is envisioned in low-dimensional but non-trivial problems. The convergence of the proposed iterated grid search algorithm is presented along with the results of particular application studies. It has been recogn

APA, Harvard, Vancouver, ISO, and other styles

11

Bengtlars, Ann, and Erik Väljamets. "Optimization of Pile Groups : A practical study using Genetic Algorithm and Direct Search with four different objective functions." Thesis, KTH, Bro- och stålbyggnad, 2014. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-146832.

Full text

Abstract:

Piling is expensive but often necessary when building large structures, for example bridges. Some pile types, such as steel core piles, are very costly and it is therefore of great interest to keep the number piles in a pile group to a minimum. This thesis deals with optimization of pile groups with respect to placement, batter and angle of rotation in order to minimize the number of piles. A program has been developed, where two optimization algorithms named Genetic Algorithm and Direct Search, and four objective functions have been used. These have been tested and compared to find the most s

APA, Harvard, Vancouver, ISO, and other styles

12

Erdal, Ferhat. "Optimum Design Of Grillage Systems Using Harmony Search Algorithm." Master's thesis, METU, 2007. http://etd.lib.metu.edu.tr/upload/12608231/index.pdf.

Full text

Abstract:

Harmony search method based optimum design algorithm is presented for the grillage systems. This numerical optimization technique imitates the musical performance process that takes place when a musician searches for a better state of harmony. For instance, jazz improvisation seeks to find musically pleasing harmony similar to the optimum design process which seeks to find the optimum solution. The design algorithm considers the displacement and strength constraints which are implemented from LRFD-AISC (Load and Resistance Factor Design-American Institute of Steel Construction). It selects th

APA, Harvard, Vancouver, ISO, and other styles

13

Burrell, Tinal R. "An alternating direction search algorithm for low dimensional optimization: an application to power flow." Thesis, Virginia Tech, 1993. http://hdl.handle.net/10919/46240.

Full text

Abstract:

Presented in this paper is a scheme for minimizing the cost function of a three-source technique to arrive at an approximation point (I,J) that is within one unit of the true minimum. The Line-Step algorithm is applied to several systems and is also compared to other minimization techniques, including the Equal Incremental Loss Algorithm. Variations are made on the Line-Step Algorithm for faster convergence and also to handle inequality constraints.<br>Master of Science

APA, Harvard, Vancouver, ISO, and other styles

14

Burrell, Tina R. "An alternating direction search algorithm for low dimensional optimization : an application to power flow /." This resource online, 1993. http://scholar.lib.vt.edu/theses/available/etd-12162009-020216/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Lidberg, Simon. "Evolving Cuckoo Search : From single-objective to multi-objective." Thesis, Högskolan i Skövde, Institutionen för teknik och samhälle, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-5309.

Full text

Abstract:

This thesis aims to produce a novel multi-objective algorithm that is based on Cuckoo Search by Dr. Xin-She Yang. Cuckoo Search is a promising nature-inspired meta-heuristic optimization algorithm, which currently is only able to solve single-objective optimization problems. After an introduction, a number of theoretical points are presented as a basis for the decision of which algorithms to hybridize Cuckoo Search with. These are then reviewed in detail and verified against current benchmark algorithms to evaluate their efficiency. To test the proposed algorithm in a new setting, a real-world

APA, Harvard, Vancouver, ISO, and other styles

16

Lythell, Markus, and Jonathan Stenberg. "Cost optimization of composite bridges." Thesis, KTH, Bro- och stålbyggnad, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-289211.

Full text

Abstract:

Today in most design offices the practice when designing infrastructure is to adopt a trial-and-error based approach. This means that one solution to the problem is evaluated and based on the results the design is altered. This process is then repeated until satisfactory results have been achieved. This is an iterative process and in this project, a software has been developed as a tool for the practicing engineer to use for preliminary design. The software carries out this iterative process and optimizes the solution using algorithms. The software is developed to evaluate road traffic composi

APA, Harvard, Vancouver, ISO, and other styles

17

El, Mourabit Samir. "Optimization of Concrete Beam Bridges : Development of Software for Design Automation and Cost Optimization." Thesis, KTH, Bro- och stålbyggnad, 2016. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-189273.

Full text

Abstract:

Recent advances in the field of computational intelligence have led to a numberof promising optimization algorithms. These algorithms have the potential to findoptimal or near-optimal solutions to complex problems within a reasonable timeframe. Structural optimization is a research field where such algorithms are appliedto optimally design structures. Although a significant amount of research has been published in the field ofstructural optimization since the 1960s, little of the research effort has been utilizedin structural design practice. One reason for this is that only a small portion of

APA, Harvard, Vancouver, ISO, and other styles

18

Frithiof, Fredrik. "A framework for designing a modular muffler system by global optimization." Thesis, KTH, Optimeringslära och systemteori, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-169650.

Full text

Abstract:

When creating a muffler to be installed on a noise generating machine, the design parameters as well as the placements of sound attenuating elements has to be optimized in order to minimize the sound coming out of the equipage. This is exemplified in a small project task for students of a basic course in optimization at KTH. The task is however flawed, since both the way in which the optimization problem is formed is overly simplistic and the algorithm used to solve the problem, fmincon, does not cope well with the mathematical complexity of the model, meaning it gets stuck in a local optimum

APA, Harvard, Vancouver, ISO, and other styles

19

Deng, Qichen. "Antenna Optimization in Long-Term Evolution Networks." Thesis, KTH, Optimeringslära och systemteori, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-119147.

Full text

Abstract:

The aim of this master thesis is to study algorithms for automatically tuning antenna parameters to improve the performance of the radio access part of a telecommunication network and user experience. There are four dierent optimization algorithms, Stepwise Minimization Algorithm, Random Search Algorithm, Modied Steepest Descent Algorithm and Multi-Objective Genetic Algorithm to be applied to a model of a radio access network. The performances of all algorithms will be evaluated in this thesis. Moreover, a graphical user interface which is developed to facilitate the antenna tuning simulations

APA, Harvard, Vancouver, ISO, and other styles

20

Husk, Evan. "Imitating individualized facial expressions in a human-like avatar through a hybrid particle swarm optimization - tabu search algorithm." Honors in the Major Thesis, University of Central Florida, 2012. http://digital.library.ucf.edu/cdm/ref/collection/ETH/id/567.

Full text

Abstract:

This thesis describes a machine learning method for automatically imitating a particular person's facial expressions in a human-like avatar through a hybrid Particle Swarm Optimization - Tabu Search algorithm. The muscular structures of the facial expressions are measured by Ekman and Friesen's Facial Action Coding System (FACS). Using a neutral face as a reference, the minute movements of the Action Units, used in FACS, are automatically tracked and mapped onto the avatar using a hybrid method. The hybrid algorithm is composed of Kennedy and Eberhart's Particle Swarm Optimization algorithm (P

APA, Harvard, Vancouver, ISO, and other styles

21

Lakshminarayanan, Srinivasan. "Nature Inspired Discrete Integer Cuckoo Search Algorithm for Optimal Planned Generator Maintenance Scheduling." University of Toledo / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1438101954.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

He, Jian. "Global Optimization of Transmitter Placement for Indoor Wireless Communication Systems." Thesis, Virginia Tech, 2002. http://hdl.handle.net/10919/34817.

Full text

Abstract:

The DIRECT (DIviding RECTangles) algorithm JONESJOTi, a variant of Lipschitzian methods for bound constrained global optimization, has been applied to the optimal transmitter placement for indoor wireless systems. Power coverage and BER (bit error rate) are considered as two criteria for optimizing locations of a specified number of transmitters across the feasible region of the design space. The performance of a DIRECT implementation in such applications depends on the characteristics of the objective function, the problem dimension, and the desired solution accuracy. Implementations with sta

APA, Harvard, Vancouver, ISO, and other styles

23

Borges, André de Ávila. "Otimização de forma e paramétrica de estruturas treliçadas através dos métodos meta-heurísticos Harmony Search e Firefly Algorithm." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2013. http://hdl.handle.net/10183/96635.

Full text

Abstract:

Otimização estrutural é uma área relativamente nova que vem sendo cada vez mais explorada. Existem muitos métodos clássicos, e outros mais recentes vem surgindo para disputar em eficiência, confiabilidade e rapidez na obtenção de um resultado ótimo. Os algoritmos são classificados em algoritmos determinísticos, que utilizam a informação do gradiente, ou seja, usam os valores das funções e suas derivadas, e os meta-heurísticos, algoritmos de otimização aleatórios que são métodos probabilísticos não baseados em gradiente, ou seja, usam somente a avaliação da função objetivo. São apresentados doi

APA, Harvard, Vancouver, ISO, and other styles

24

Kopřiva, Jan. "Srovnání algoritmů při řešení problému obchodního cestujícího." Master's thesis, Vysoké učení technické v Brně. Fakulta podnikatelská, 2009. http://www.nusl.cz/ntk/nusl-222126.

Full text

Abstract:

The Master Thesis deals with logistic module innovation of information system ERP. The principle of innovation is based on implementation of heuristic algorithms which solve Travel Salesman Problems (TSP). The software MATLAB is used for analysis and tests of these algorithms. The goal of Master Thesis is the comparison of selections algorithm, which are suitable for economic purposes (accuracy of solution, speed of calculation and memory demands).

APA, Harvard, Vancouver, ISO, and other styles

25

Erfani, Tohid. "An efficient analysis of pareto optimal solutions in multidisciplinary design." Thesis, University of Manchester, 2011. https://www.research.manchester.ac.uk/portal/en/theses/an-efficient-analysis-of-pareto-optimal-solutions-in-multidisciplinary-design(9bcf3c8f-4922-48a7-a829-1efce3d804ab).html.

Full text

Abstract:

Optimisation is one of the most important and challenging part of any engineering design. In real world design problems one faces multiobjective optimisation under constraints. The optimal solution in these cases is not unique because the objectives can contradict each other. In such cases, a set of optimal solutions which forms a Pareto frontier in the objective space is considered. There are many algorithms to generate the Pareto frontier. However, only a few of them are potentially capable of providing an evenly distributed set of the solutions. Such a property is especially important in re

APA, Harvard, Vancouver, ISO, and other styles

26

Zakaria, Rabih. "Optimization of the car relocation operations in one-way carsharing systems." Thesis, Belfort-Montbéliard, 2015. http://www.theses.fr/2015BELF0281/document.

Full text

Abstract:

L'autopartage est un service de mobilité qui offre les mêmes avantages que les voitures particulières mais sansnotion de propriété. Les clients du système peuvent accéder aux véhicules sans ou avec réservation préalable. Laflotte de voitures est distribuée entre les stations et les clients peuvent prendre une voiture d'une station et ladéposer dans n'importe quelle autre station (one-way), chaque station disposant d'un nombre maximum de placesde stationnement. La demande pour la prise ou le retour des voitures dans chaque station est souvent asymétriqueentre les stations et varie au cours de l

APA, Harvard, Vancouver, ISO, and other styles

27

Solat, Yavari Majid. "Slab Frame Bridges : Structural Optimization Considering Investment Cost and Environmental Impacts." Licentiate thesis, KTH, Bro- och stålbyggnad, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-202948.

Full text

Abstract:

This research encompasses the automated design and structural optimization of reinforced concrete slab frame bridges, considering investment costs and environmental impacts. The most important feature of this work is that it focusses on realistic and complete models of slab frame bridges rather than on optimization of only individual members or sections of a bridge. The thesis consists of an extended summary of publications and three appended papers. In the first paper, using simple assumptions, the possibility of applying cost-optimization to the structural design of slab frame bridges was in

APA, Harvard, Vancouver, ISO, and other styles

28

Bashir, Bushra. "Contribution to modeling and optimization of home healthcare." Thesis, Clermont-Ferrand 2, 2013. http://www.theses.fr/2013CLF22391/document.

Full text

Abstract:

Résumé indisponible<br>A healthcare network or health system consists of all organizations, actions and people who participate to promote, restore or maintain people’s health. The health care systems in many developed countries are facing increasing costs. The major reason is the changing age distribution of the population with more elderly people in need of support. Increasing healthcare costs has created new alternatives to traditional hospitalization in which one is Home Health Care (HHC). Home health care or domiciliary care is the provision of health care and assistance to people in their

APA, Harvard, Vancouver, ISO, and other styles

29

Pal, Anibrata. "Multi-objective optimization in learn to pre-compute evidence fusion to obtain high quality compressed web search indexes." Universidade Federal do Amazonas, 2016. http://tede.ufam.edu.br/handle/tede/5128.

Full text

Abstract:

Submitted by Sáboia Nágila (nagila.saboia01@gmail.com) on 2016-07-29T14:09:40Z No. of bitstreams: 1 Disertação-Anibrata Pal.pdf: 1139751 bytes, checksum: a29e1923e75e239365abac2dc74c7f40 (MD5)<br>Approved for entry into archive by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br) on 2016-08-15T17:54:46Z (GMT) No. of bitstreams: 1 Disertação-Anibrata Pal.pdf: 1139751 bytes, checksum: a29e1923e75e239365abac2dc74c7f40 (MD5)<br>Approved for entry into archive by Divisão de Documentação/BC Biblioteca Central (ddbc@ufam.edu.br) on 2016-08-15T17:57:29Z (GMT) No. of bitstreams: 1 Disert

APA, Harvard, Vancouver, ISO, and other styles

30

Cevik, Mert. "Desifn And Optimization Of A Mixed Flow Compressor Impeller Using Robust Design Methods." Master's thesis, METU, 2009. http://etd.lib.metu.edu.tr/upload/12611105/index.pdf.

Full text

Abstract:

This is a study that is focused on developing an individual design methodology for a centrifugal impeller and generating a mixed flow impeller for a small turbojet engine by using this methodology. The structure of the methodology is based on the design, modeling and the optimization processes, which are operated sequentially. The design process consists of engine design and compressor design codes operated together with a commercial design code. Design of Experiment methods and an in-house Neural Network code is used for the modeling phase. The optimization is based on an in-house code which

APA, Harvard, Vancouver, ISO, and other styles

31

KUMAR, NEERAJ. "DESIGNING OF MARKET MODEL, EFFECTIVE PRICE FORECASTING TOOL AND BIDDING STRATEGY FOR INDIAN ELECTRICITY MARKET." Thesis, DELHI TECHNOLOGICAL UNIVERSITY, 2021. http://dspace.dtu.ac.in:8080/jspui/handle/repository/18910.

Full text

Abstract:

The Development scenario for renewable energy across the globe is changing rapidly in terms of capacity addition and grid interconnection. Penetration of renewable energy resources into grid is necessary to meet the elevated demand of electricity. In view of this penetration of solar and wind power growing enormously across the globe. Solar energy is widely escalating in terms of generation and capacity addition due its better predictability over wind energy. Electricity pricing is one of the important aspects for power system planning and it felicitates information for the electricity b

APA, Harvard, Vancouver, ISO, and other styles

32

Clausner, André. "Anwendung von Line-Search-Strategien zur Formoptimierung und Parameteridentifikation." Master's thesis, Universitätsbibliothek Chemnitz, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-114858.

Full text

Abstract:

Die kontinuierliche Weiterentwicklung und Verbesserung technischer Prozesse erfolgt heute auf der Basis stochastischer und deterministischer Optimierungsstrategien in Kombination mit der numerischen Simulation dieser Abläufe. Da die FE-Simulation von Umformvorgängen in der Regel sehr zeitintensiv ist, bietet sich für die Optimierung solcher Prozesse der Einsatz deterministischer Methoden an, da hier weniger Optimierungsschritte und somit auch weniger FE-Simulationen notwendig sind. Eine wichtige Anforderung an solche Optimierungsverfahren ist globale Konvergenz zu lokalen Minima, da die optima

APA, Harvard, Vancouver, ISO, and other styles

33

Farooq, Farhan. "Optimal Path Searching through Specified Routes using different Algorithms." Thesis, Högskolan Dalarna, Datateknik, 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:du-4530.

Full text

Abstract:

To connect different electrical, network and data devices with the minimum cost and shortest path, is a complex job. In huge buildings, where the devices are placed at different locations on different floors and only some specific routes are available to pass the cables and buses, the shortest path search becomes more complex. The aim of this thesis project is, to develop an application which indentifies the best path to connect all objects or devices by following the specific routes.To address the above issue we adopted three algorithms Greedy Algorithm, Simulated Annealing and Exhaustive sea

APA, Harvard, Vancouver, ISO, and other styles

34

Ugarte, Ernesto de Las Casas de La Torre. "Otimização do projeto de embarcações pesqueiras." Universidade de São Paulo, 2007. http://www.teses.usp.br/teses/disponiveis/3/3135/tde-04072007-130257/.

Full text

Abstract:

O propósito deste trabalho foi o de elaborar uma metodologia de projeto de embarcações pesqueiras como alternativa ao processo clássico baseado na seqüência da \"Espiral de Projetos\". A metodologia proposta faz uso de um algoritmo de otimização que tem como finalidade automatizar cada uma das etapas e aperfeiçoar o resultado final mediante a busca, dentro do espaço de soluções viáveis (chamadas de soluções satisfatórias), da solução \"ótima\", ou seja, a melhor solução para uma determinada condição. Devido ao fato de cada zona de pesca ter suas características particulares no que diz respeito

APA, Harvard, Vancouver, ISO, and other styles

35

Park, Vincent Se-jin. "AN EMPIRICAL STUDY OF DIFFERENT BRANCHING STRATEGIES FOR CONSTRAINT SATISFACTION PROBLEMS." Thesis, University of Waterloo, 2004. http://hdl.handle.net/10012/1193.

Full text

Abstract:

Many real life problems can be formulated as constraint satisfaction problems <i>(CSPs)</i>. Backtracking search algorithms are usually employed to solve <i>CSPs</i> and in backtracking search the choice of branching strategies can be critical since they specify how a search algorithm can instantiate a variable and how a problem can be reduced into subproblems; that is, they define a search tree. In spite of the apparent importance of the branching strategy, there have been only a few empirical studies about different branching strategies and they all have been tested exclusively for nume

APA, Harvard, Vancouver, ISO, and other styles

36

Lu, Zhi. "Optimization approaches for minimum conductance graph partitioning." Thesis, Angers, 2020. http://www.theses.fr/2020ANGE0013.

Full text

Abstract:

Le problème de partitionnement de graphe de conductance minimale (MCGPP) est un problème d’optimisation combinatoire NP-difficile avec de nombreuses applications pratiques dans divers domaines tels que la détection communautaire, la bioinformatique et la vision par ordinateur. Etant donnée sa complexité intrinsèque, des approches heuristiques et métaheuristiques constituent un moyen convenable pour résoudre des instances de grande taille. Cette thèse est consacrée au développement d’algorithmes métaheuristiques performants pour le MC-GPP. Plus précisément, nous proposons un algorithme «Stagnat

APA, Harvard, Vancouver, ISO, and other styles

37

Jaini, Nor. "An efficient ranking analysis in multi-criteria decision making." Thesis, University of Manchester, 2017. https://www.research.manchester.ac.uk/portal/en/theses/an-efficient-ranking-analysis-in-multicriteria-decision-making(c5a694d5-fd43-434f-9f9f-b86f7581b97c).html.

Full text

Abstract:

This study is conducted with the aims to develop a new ranking method for multi-criteria decision making problem with conflicting criteria. Such a problem has a set of Pareto solutions, where the act of improving a value of one solution will result in depreciating some of the others. Thus, in this type of problem, there is no unique solution. However, out of many available options, the Decision Maker eventually has to choose only one solution. With this problem as the motivation, the current study develops a compromise ranking algorithm, namely a trade-off ranking method. The trade-off ranking

APA, Harvard, Vancouver, ISO, and other styles

38

Ceolin, Celina. "A equação unidimensional de difusão de nêutrons com modelo multigrupo de energia e meio heterogêneo : avaliação do fluxo para problemas estacionários e de cinética." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2014. http://hdl.handle.net/10183/96762.

Full text

Abstract:

Na presente tese é resolvida a equação de difusão de nêutrons estacionária, bem como problemas de cinética, em geometria unidimensional cartesiana multi-região considerando o modelo de multigrupos de energia. Um dos objetivos e inovação neste trabalho é a obtenção de uma solução aproximada com estimativa de erro, controle de precisão e na forma de uma expressão analítica. Com esse tipo de solução não há a necessidade de recorrer a esquemas de interpolação, geralmente necessários em caso de discretizações do domínio. O fluxo de nêutrons é expandido em uma série de Taylor cujos coeficientes são

APA, Harvard, Vancouver, ISO, and other styles

39

Vaillaud, Hugo. "Algorithms for the Search of a Moving Air Target with a Radar Onboard an Airborne Platform." Electronic Thesis or Diss., Sorbonne université, 2023. http://www.theses.fr/2023SORUS695.

Full text

Abstract:

Dans le contexte actuel des missions aériennes, les pilotes et opérateurs à bord d'une plateforme aéroportée sont confrontés à des situations tactiques de plus en plus complexes.Outre la trajectoire de l'appareil, ils doivent aussi utiliser au mieux plusieurs capteurs pour effectuer de multiples tâches essentielles à une bonne représentation de la situation tactique — allant de la surveillance et de la poursuite des cibles à l'identification des cibles, ainsi que la conduite de tir.Ils doivent également faire face à de nouveaux types de cibles plus difficiles à détecter, connectées en réseau e

APA, Harvard, Vancouver, ISO, and other styles

40

Besbes, Mariem. "Modélisation et résolution du problème d’implantation des ateliers de production : proposition d’une approche combinée Algorithme Génétique – Algorithme A*." Thesis, Université Paris-Saclay (ComUE), 2019. http://www.theses.fr/2019SACLC094.

Full text

Abstract:

Pour faire face à la concurrence, les entreprises cherchent à améliorer leurs performances industrielles. L’une des solutions à ce défi réside dans la détermination de la meilleure configuration des ateliers de production. Ce type de problème est connu en anglais par Facility Layout Problem « FLP». Dans ce contexte, notre travail propose une méthodologie pour la définition de la configuration d’atelier à travers une approche réaliste. Plus précisément, notre objectif est de prendre en compte les distances réelles parcourues par les pièces dans l’atelier et des contraintes liées au système qui

APA, Harvard, Vancouver, ISO, and other styles

41

Wu, Yanghui. "Problem dependent metaheuristic performance in Bayesian network structure learning." Thesis, Robert Gordon University, 2012. http://hdl.handle.net/10059/790.

Full text

Abstract:

Bayesian network (BN) structure learning from data has been an active research area in the machine learning field in recent decades. Much of the research has considered BN structure learning as an optimization problem. However, the finding of optimal BN from data is NP-hard. This fact has driven the use of heuristic algorithms for solving this kind of problem. Amajor recent focus in BN structure learning is on search and score algorithms. In these algorithms, a scoring function is introduced and a heuristic search algorithm is used to evaluate each network with respect to the training data. Th

APA, Harvard, Vancouver, ISO, and other styles

42

Chlebík, Jakub. "Evoluční návrh ultrazvukových operačních plánů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2020. http://www.nusl.cz/ntk/nusl-417217.

Full text

Abstract:

The thesis studies selected evolution systems to use in planning of high intensity focused ultrasound surgeries. Considered algorithms are statistically analyzed and compared by appropriate criteria to find the one that adds the most value to the potential real world medical problems.

APA, Harvard, Vancouver, ISO, and other styles

43

Ben, cheikh Sondes. "Optimisation avancée au service du covoiturage dynamique." Thesis, Ecole centrale de Lille, 2016. http://www.theses.fr/2016ECLI0002/document.

Full text

Abstract:

Le covoiturage se présente comme une solution de transport alternative qui vient soigner l’image environnementale, économique et sociétale de la voiture personnelle. Le problème du covoiturage dynamique consiste à élaborer en temps réel des tournées de véhicules optimisés, afin de répondre au mieux aux demandes instantanées de transport.C’est dans ce cadre que s’inscrivent nos travaux où l’optimisation et le temps réel sont les maître-mots. Étant donné la complexité exponentielle du problème, nous optons pour des méthodes approximatives pour le résoudre. Nous présentons notre première contribu

APA, Harvard, Vancouver, ISO, and other styles

44

Weyrová, Dominika. "Využití simulačního modelu na vývoj automatického algoritmu pro tvorbu routovací tabulky a ohodnocení cesty v dopravníkovém systému." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2021. http://www.nusl.cz/ntk/nusl-442868.

Full text

Abstract:

The diploma thesis deals with the use of a simulation model for the development of an automatic algorithm for the creation of a routing table and route evaluation in a transport system. It includes a search of modeling and simulation issues and state-space search issues with an analysis of available search methods. The simulation model of the transport system is created in the software Tecnomatix Plant Simulation, where an algorithm for automatic creation of routing tables for routing and evaluation of routes according to static criteria is subsequently developed and tested. The work presents

APA, Harvard, Vancouver, ISO, and other styles

45

Ahmad, Maqsood. "Mathematical models and methods based on metaheuristic approach for timetabling problem." Thesis, Clermont-Ferrand 2, 2013. http://www.theses.fr/2013CLF22393/document.

Full text

Abstract:

Résumé indisponible<br>In this thesis we have concerned ourselves with university timetabling problems both course timetabling and examination timetabling problems. Most of the timetabling problems are computationally NP-complete problems, which means that the amount of computation required to ﬁnd solutions increases exponentially with problem size. These are idiosyncratic nature problems, for example different universities have their own set of constraints, their own definition of good timetable, feasible timetable and their own choice about the use of constraint type (as a soft or hard const

APA, Harvard, Vancouver, ISO, and other styles

46

Jin, Yan. "Hybrid metaheuristic algorithms for sum coloring and bandwidth coloring." Thesis, Angers, 2015. http://www.theses.fr/2015ANGE0062/document.

Full text

Abstract:

Le problème de somme coloration minimum (MSCP) et le problème de coloration de bande passante (BCP) sont deux généralisations importantes du problème de coloration des sommets classique avec de nombreuses applications dans divers domaines, y compris la conception de circuits imprimés, la planication, l’allocation de ressource, l’affectation de fréquence dans les réseaux mobiles, etc. Les problèmes MSCP et BCP étant NP-difficiles, les heuristiques et métaheuristiques sont souvent utilisées en pratique pour obtenir des solutions de bonne qualité en un temps de calcul acceptable. Cette thèse est

APA, Harvard, Vancouver, ISO, and other styles

47

GAMBA, CAMACHO JUAN DAVID. "Hopping, Landing, and Balancing with Springs." Doctoral thesis, Università degli studi di Genova, 2022. http://hdl.handle.net/11567/1079807.

Full text

Abstract:

This work investigates the interaction of a planar double pendulum robot and springs, where the lower body (the leg) has been modified to include a spring-loaded passive prismatic joint. The thesis explores the mechanical advantage of adding a spring to the robot in hopping, landing, and balancing activities by formulating the motion problem as a boundary value problem; and also provides a control strategy for such scenarios. It also analyses the robustness of the developed controller to uncertain spring parameters, and an observer solution is provided to estimate these parameters while the ro

APA, Harvard, Vancouver, ISO, and other styles

48

Hart, Pavel. "Mravenčí kolonie." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2008. http://www.nusl.cz/ntk/nusl-217700.

Full text

Abstract:

First part of the thesis is about literature research of optimization algorithms. Three of the algorithms were implemented and tested, concretely the ant colony algorithm, tabu search and simulated annealing. All three algorithms were implemented to solve the traveling salesman problem. In second part of the thesis the algorithms were tested and compared. In last part the influence of the ant colony parameters was evaluated.

APA, Harvard, Vancouver, ISO, and other styles

49

CHEN, JENG-YUNG, and 陳政擁. "A Discrete Backtracking Search Optimization Algorithm for Solving Stochastic Job Shop Scheduling Problem." Thesis, 2016. http://ndltd.ncl.edu.tw/handle/49yw3u.

Full text

Abstract:

碩士<br>朝陽科技大學<br>資訊工程系<br>105<br>This thesis proposes a discrete backtracking search optimization algorithm (DBSA) to solve the stochastic job shop scheduling problem (SJSSP). The proposed DBSA utilizes the advantage of multi-directional search in backtracking search optimization algorithm (BSA) and quickly and efficiently selecting candidate solution in optimal computing budget allocation (OCBA). The goal is to find a good enough and high reliable solution in a reasonable computation time. The SJSSP is a practical and popular job shop scheduling problem. The stochastic characteristic indicates

APA, Harvard, Vancouver, ISO, and other styles

50

Ho, Hsin-Wei, and 何信威. "An Integer Backtracking Search Optimization Algorithm for Solving Inventory Control Problem of Assemble-To-Order System." Thesis, 2015. http://ndltd.ncl.edu.tw/handle/07869229594855433780.

Full text

Abstract:

碩士<br>朝陽科技大學<br>資訊工程系<br>103<br>This thesis proposes an integer backtracking search optimization algorithm (IBSA) to solve a problem for a good enough base stock level of the assemble-to-order (ATO) system. ATO systems refer to a production environment in which the customer must first order specified products before the item is manufactured. The items of the products are already produced in ATO system, where every item is produced after receiving an order. Businesses often stock the inventory required to make the product. As soon as an order is placed, they often have every item they need to g

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!