Log in

Relevant bibliographies by topics / Algoritmi memetici / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Algoritmi memetici.

Dissertations / Theses on the topic 'Algoritmi memetici'

Author: Grafiati

Published: 10 March 2023

Last updated: 31 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 'Algoritmi memetici.'

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

Vitiello, Autilia. "Memetic algorithms for ontology alignment." Doctoral thesis, Universita degli studi di Salerno, 2013. http://hdl.handle.net/10556/1156.

Full text

Abstract:

2011 - 2012<br>Semantic interoperability represents the capability of two or more systems to meaningfully and accurately interpret the exchanged data so as to produce useful results. It is an essential feature of all distributed and open knowledge based systems designed for both e-government and private businesses, since it enables machine interpretation, inferencing and computable logic. Unfortunately, the task of achieving semantic interoperability is very difficult because it requires that the meanings of any data must be specified in an appropriate detail in order to resolve any pot

APA, Harvard, Vancouver, ISO, and other styles

2

Maciel, Cristiano Baptista Faria. "A memetic algorithm for logistics network design problems." Master's thesis, Instituto Superior de Economia e Gestão, 2014. http://hdl.handle.net/10400.5/8601.

Full text

Abstract:

Mestrado em Decisão Económica e Empresarial<br>Neste trabalho, um algoritmo memético é desenvolvido com o intuito de ser aplicado a uma rede logística, com três níveis, múltiplos períodos, seleção do meio de transporte e com recurso a outsourcing. O algoritmo memético pode ser aplicado a uma rede logística existente, no sentido de otimizar a sua configuração ou, se necessário, pode ser utilizado para criar uma rede logística de raiz. A produção pode ser internalizada e é permitido o envio direto de produtos para os clientes. Neste problema, as capacidades das diferentes infraestruturas podem s

APA, Harvard, Vancouver, ISO, and other styles

3

Filák, Jakub. "Evoluční optimalizace turnusů jízdních řádů." Master's thesis, Vysoké učení technické v Brně. Fakulta informačních technologií, 2009. http://www.nusl.cz/ntk/nusl-236673.

Full text

Abstract:

This thesis deals with the problem of vehicle scheduling in public transport. It contains a theoretical introduction to vehicles scheduling and evolutionary algorithms. Vehicle scheduling is analyzed with respect to the bus timetables. Analysis of evolutionary algorithms is done with emphasis on the genetic algorithms and tabu-search method After the theoretical introduction, a memetic algorithm for the given problem is analyzed. Finally, the thesis contains a description of the optimization system implementation and discusses the experiments with the system.

APA, Harvard, Vancouver, ISO, and other styles

4

Bonfim, Tatiane Regina. "Escalonamento memetico e neuro-memetico de tarefas." [s.n.], 2006. http://repositorio.unicamp.br/jspui/handle/REPOSIP/260503.

Full text

Abstract:

Orientador: Akebo Yamakami<br>Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação<br>Made available in DSpace on 2018-08-06T10:47:10Z (GMT). No. of bitstreams: 1 Bonfim_TatianeRegina_D.pdf: 1154007 bytes, checksum: 1b6dd7bc9c2e3eef16c1e3258710730c (MD5) Previous issue date: 2006<br>Resumo: Este trabalho apresenta uma nova abordagem de resolução, por algoritmo memético e pela coevolução de algoritmo memético com redes neurais, para o problema de escalonamento de tarefas em máquinas paralelas idênticas e para o problema de job shop com parâmet

APA, Harvard, Vancouver, ISO, and other styles

5

Procházka, Vít. "Pokročilé optimalizační modely v odpadovém hospodářství." Master's thesis, Vysoké učení technické v Brně. Fakulta strojního inženýrství, 2014. http://www.nusl.cz/ntk/nusl-231395.

Full text

Abstract:

This thesis deals with an optimization of waste collection in a mid-sized town. The model is formulated based on requirements from a real process. To deal with this problem, the original memetic algorithm was developed and implemented in C++.

APA, Harvard, Vancouver, ISO, and other styles

6

Buriol, Luciana Salete. "Algoritmo memetico para o problema do caixeiro viajante assimetrico como parte de um framework para algoritmos evolutivos." [s.n.], 2000. http://repositorio.unicamp.br/jspui/handle/REPOSIP/261832.

Full text

Abstract:

Orientador: Paulo Morelato França<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação<br>Made available in DSpace on 2018-08-12T02:08:09Z (GMT). No. of bitstreams: 1 Buriol_LucianaSalete_M.pdf: 8595148 bytes, checksum: 8048854c00a24631aefeb449304ce2bd (MD5) Previous issue date: 2000<br>Resumo: Dentre a gama de técnicas heurísticas e exatas existentes para a resolução de problemas combinatórios, os algoritmos populacionais genéticos e meméticos têm se destacado devido a sua boa performance. Em especial, os algoritmos meméticos podem

APA, Harvard, Vancouver, ISO, and other styles

7

Dang, Hieu. "Adaptive multiobjective memetic optimization: algorithms and applications." Journal of Cognitive Informatics and Natural Intelligence, 2012. http://hdl.handle.net/1993/30856.

Full text

Abstract:

The thesis presents research on multiobjective optimization based on memetic computing and its applications in engineering. We have introduced a framework for adaptive multiobjective memetic optimization algorithms (AMMOA) with an information theoretic criterion for guiding the selection, clustering, and local refinements. A robust stopping criterion for AMMOA has also been introduced to solve non-linear and large-scale optimization problems. The framework has been implemented for different benchmark test problems with remarkable results. This thesis also presents two applications of these

APA, Harvard, Vancouver, ISO, and other styles

8

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

9

Fischer, Thomas. "Distributed memetic algorithms for graph theoretical combinatorial optimization problems." Berlin Logos-Verl, 2008. http://d-nb.info/994066945/04.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Caraffini, Fabio. "Novel memetic computing structures for continuous optimisation." Thesis, De Montfort University, 2014. http://hdl.handle.net/2086/10629.

Full text

Abstract:

This thesis studies a class of optimisation algorithms, namely Memetic Computing Structures, and proposes a novel set of promising algorithms that move the first step towards an implementation for the automatic generation of optimisation algorithms for continuous domains. This thesis after a thorough review of local search algorithms and popular meta-heuristics, focuses on Memetic Computing in terms of algorithm structures and design philosophy. In particular, most of the design carried out during my doctoral studies is inspired by the lex parsimoniae, aka Ockham’s Razor. It has been shown how

APA, Harvard, Vancouver, ISO, and other styles

11

Correa, Leonardo de Lima. "Uma proposta de algoritmo memético baseado em conhecimento para o problema de predição de estruturas 3-D de proteínas." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2017. http://hdl.handle.net/10183/156640.

Full text

Abstract:

Algoritmos meméticos são meta-heurísticas evolutivas voltadas intrinsecamente à exploração e incorporação de conhecimentos relacionados ao problema em estudo. Nesta dissertação, foi proposto um algoritmo memético multi populacional baseado em conhecimento para lidar com o problema de predição de estruturas tridimensionais de proteínas voltado à modelagem de estruturas livres de similaridades conformacionais com estruturas de proteínas determinadas experimentalmente. O algoritmo em questão, foi estruturado em duas etapas principais de processamento: (i) amostragem e inicialização de soluções; e

APA, Harvard, Vancouver, ISO, and other styles

12

Krasnogor, Natalio. "Studies on the theory and design space of memetic algorithms." Thesis, University of the West of England, Bristol, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.249135.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Arshad, Shakeel. "Sequence based memetic algorithms for static and dynamic travelling salesman problems." Thesis, University of Leicester, 2012. http://hdl.handle.net/2381/10809.

Full text

Abstract:

Hybridization of genetic algorithms (GAs) with local search techniques has received significant attention in recent years and is being widely used to solve real-world problems. These hybrid GAs, also called memetic algorithms (MAs), are able to incorporate other powerful techniques within the framework of GAs, working as a single unit and counterbalancing each other’s disadvantages. In this thesis, we propose a hybrid GA, called Sequence Based Memetic Algorithm (SBMA) with Inver Over (IO), for solving the travelling salesman problem (TSP). This is a 2-phase MA. The first phase (SBMA) consists

APA, Harvard, Vancouver, ISO, and other styles

14

Mendes, Alexandre de Sousa. "Algoritmos memeticos aplicados aos problemas de sequenciamento em maquinas." [s.n.], 1999. http://repositorio.unicamp.br/jspui/handle/REPOSIP/259722.

Full text

Abstract:

Orientador: Paulo Morelato França<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação<br>Made available in DSpace on 2018-07-24T23:50:37Z (GMT). No. of bitstreams: 1 Mendes_AlexandredeSousa_M.pdf: 5716869 bytes, checksum: d4fc0f51958206c88c6748e11399ddb5 (MD5) Previous issue date: 1999<br>Resumo: O problema de Sequenciamento em Máquina Simples (SMS) é um dos mais tradicionais na área de sequenciamento. Neste trabalho é explorado inicialmente o problema de SMS com restrições de tempo (datas de entrega de produtos e tempos de preparaç

APA, Harvard, Vancouver, ISO, and other styles

15

Tin, Junior Gilberto Jorge. "Algoritmos memeticos aplicados ao problema de no-wait flowshop." [s.n.], 2001. http://repositorio.unicamp.br/jspui/handle/REPOSIP/259672.

Full text

Abstract:

Orientador: Paulo Morelato França<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação<br>Made available in DSpace on 2018-07-27T16:54:50Z (GMT). No. of bitstreams: 1 TinJunior_GilbertoJorge_M.pdf: 1402287 bytes, checksum: f569d1e1e8c6b5a1b10dfd3a2739c6ca (MD5) Previous issue date: 2001<br>Mestrado

APA, Harvard, Vancouver, ISO, and other styles

16

Garcia, Vinicius Jacques. "Algoritmos memeticos paralelos aplicados a problemas de otimização combinatoria." [s.n.], 2002. http://repositorio.unicamp.br/jspui/handle/REPOSIP/260167.

Full text

Abstract:

Orientador : Paulo Morelato França<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação<br>Made available in DSpace on 2018-08-01T22:11:51Z (GMT). No. of bitstreams: 1 Garcia_ViniciusJacques_M.pdf: 1139020 bytes, checksum: 17565f60e3c310bc25176ac8734a07b6 (MD5) Previous issue date: 2002<br>Mestrado

APA, Harvard, Vancouver, ISO, and other styles

17

Merz, Peter. "Memetic algorithms for combinatorial optimization problems fitness landscapes and effective search strategies /." [S.l. : s.n.], 2000. http://deposit.ddb.de/cgi-bin/dokserv?idn=960860029.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

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

19

Caleiro, Diego. "Simulando Dennett: ferramentas e construções de um naturalista." Universidade de São Paulo, 2014. http://www.teses.usp.br/teses/disponiveis/8/8133/tde-17102014-145500/.

Full text

Abstract:

A dissertação pretende permitir ao leitor simular a forma de pensar de Daniel Dennett, e perpassa toda sua filosofia, com ênfase em seu tratamento de o que são padrões, o algoritmo evolutivo, intuition pumps, consciência, e seu uso dos conceitos de illata, abstracta, semântica e sintaxe para compreender a natureza, a biologia e a mente humana. O trabalho reapresenta, sob nova luz, grande parte das ideias mais importantes de Dennett, e procura fazer a engenharia reversa de o que o levou a pensar de determinadas maneiras, guiando o leitor através de caminhos similares, procurando fomentar um apr

APA, Harvard, Vancouver, ISO, and other styles

20

Teodoro, Felipe Gustavo Silva. "Seleção de características para reconhecimento biométrico baseado em sinais de eletrocardiograma." Universidade de São Paulo, 2016. http://www.teses.usp.br/teses/disponiveis/100/100131/tde-19122016-003653/.

Full text

Abstract:

O campo da Biometria abarca uma grande variedade de tecnologias usadas para identificar e verificar a identidade de uma pessoa por meio da mensuração e análise de vários aspectos físicos e/ou comportamentais do ser humano. Diversas modalidades biométricas têm sido propostas para reconhecimento de pessoas, como impressões digitais, íris, face e voz. Estas modalidades biométricas possuem características distintas em termos de desempenho, mensurabilidade e aceitabilidade. Uma questão a ser considerada com a aplicação de sistemas biométricos em mundo real é sua robustez a ataques por circunvenção,

APA, Harvard, Vancouver, ISO, and other styles

21

Silva, Jose, Noel Varela, Jesus Varas, Omar Lezama, José Maco, and Martín Villón. "Comparison of bioinspired algorithms applied to the timetabling problem." Springer Science and Business Media Deutschland GmbH, 2021. http://hdl.handle.net/10757/654075.

Full text

Abstract:

The problem of timetabling events is present in various organizations such as schools, hospitals, transportation centers. The purpose of timetabling activities at a university is to ensure that all students attend their required subjects in accordance with the available resources. The set of constraints that must be considered in the design of timetables involves students, teachers and infrastructure. This study shows that acceptable solutions are generated through the application of genetic, memetic and immune system algorithms for the problem of timetabling. The algorithms are applied to rea

APA, Harvard, Vancouver, ISO, and other styles

22

Schönberger, Jörn. "Operational freight carrier planning : basic concepts, optimization models and advanced memetic algorithms ; with 24 tables /." Berlin [u.a.] : Springer, 2005. http://www.loc.gov/catdir/enhancements/fy0663/2005922933-d.html.

Full text

APA, Harvard, Vancouver, ISO, and other styles

23

Coral, Daniel Bustos. "A cartographic approach to the dynamic vehicle routing problem with time windows and stochastic customers." Universidade de São Paulo, 2018. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-29102018-160027/.

Full text

Abstract:

This dissertation presents a cartographic approach to the dynamic vehicle routing problem with time windows and stochastic customers (DVRPTWSC). The objectives are to minimize the total travel time and maximize the number of new requests served. Addressing the DVRPTWSC requires solving the vehicle routing problem with time windows (VRPTW). A memetic algorithm (MA) for the VRPTW is proposed. The MA prunes the search space using the information gathered by a clustering procedure, which is applied to customers spatial data. The cartographic approach to the DVRPTWSC is incorporated into a multiage

APA, Harvard, Vancouver, ISO, and other styles

24

Esseghir, Mohamed Amir. "Metaheuristics for the feature selection problem : adaptive, memetic and swarm approaches." Thesis, Artois, 2011. http://www.theses.fr/2011ARTO0206/document.

Full text

Abstract:

Afin d’améliorer la qualité de prédiction des techniques de classification automatique et de fouilles de données, plusieurs modèles ont été proposés dans la littérature en vue d’extraire des connaissances à partir des données. Toutefois, avec l’expansion des systèmes d’information et des technologies associées, ces techniques d’apprentissage s’avèrent de moins en moins adaptées aux nouvelles tailles et dimensions des données. On s’intéresse dans cette étude aux problèmes de grande dimensionnalité et à l’amélioration du processus d’apprentissage des méthodes de classification à travers les tech

APA, Harvard, Vancouver, ISO, and other styles

25

Younes, Abdunnaser. "Adapting Evolutionary Approaches for Optimization in Dynamic Environments." Thesis, University of Waterloo, 2006. http://hdl.handle.net/10012/2835.

Full text

Abstract:

Many important applications in the real world that can be modelled as combinatorial optimization problems are actually dynamic in nature. However, research on dynamic optimization focuses on continuous optimization problems, and rarely targets combinatorial problems. Moreover, dynamic combinatorial problems, when addressed, are typically tackled within an application context. <br /><br /> In this thesis, dynamic combinatorial problems are addressed collectively by adopting an evolutionary based algorithmic approach. On the plus side, their ability to manipulate several solutions at a

APA, Harvard, Vancouver, ISO, and other styles

26

Chae, Junjae. "Concurrent design of facility layout and flow-based department formation." Diss., Texas A&M University, 2003. http://hdl.handle.net/1969.1/1606.

Full text

Abstract:

The design of facility layout takes into account a number of issues including the formation of departments, the layout of these, the determination of the material handling methods to be used, etc. To achieve an eﬃcient layout, these issues should be examined simultaneously. However, in practice, these problems are generally formulated and solved sequentially due to the complicated nature of the integrated problem. Speciﬁcally, there is close interaction between the formation of departments and layout of these departments. These problems are treated as separate problems that are solved sequenti

APA, Harvard, Vancouver, ISO, and other styles

27

Oliveira, Dayvid Victor Rodrigues de. "Algoritmos de Geração de Protótipos Para Bases Desbalanceadas." Universidade Federal de Pernambuco, 2014. https://repositorio.ufpe.br/handle/123456789/11330.

Full text

Abstract:

Submitted by Lucelia Lucena (lucelia.lucena@ufpe.br) on 2015-03-06T19:37:29Z No. of bitstreams: 2 DISSERTAÇÃO Dayvid Victor Rodrigues de Oliveira.pdf: 798881 bytes, checksum: 3b4ac40fda11573b025340c2b03e8903 (MD5) license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5)<br>Made available in DSpace on 2015-03-06T19:37:29Z (GMT). No. of bitstreams: 2 DISSERTAÇÃO Dayvid Victor Rodrigues de Oliveira.pdf: 798881 bytes, checksum: 3b4ac40fda11573b025340c2b03e8903 (MD5) license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Previous issue date: 2014-02-25<br>Técni

APA, Harvard, Vancouver, ISO, and other styles

28

Silva, Ana Cristina Girao e. "Busca heur?stica atrav?s de algoritmo gen?tico e mem?tico com constru??o de voc?bulos para o problema de atribui??o de localidades a an?is Sonet." Universidade Federal do Rio Grande do Norte, 2008. http://repositorio.ufrn.br:8080/jspui/handle/123456789/14914.

Full text

Abstract:

Made available in DSpace on 2014-12-17T14:52:43Z (GMT). No. of bitstreams: 1 AnaCGS.pdf: 4192359 bytes, checksum: 28eb36354363672f88a28074f9df8b42 (MD5) Previous issue date: 2008-12-23<br>Coordena??o de Aperfei?oamento de Pessoal de N?vel Superior<br>Telecommunications play a key role in contemporary society. However, as new technologies are put into the market, it also grows the demanding for new products and services that depend on the offered infrastructure, making the problems of planning telecommunications networks, despite the advances in technology, increasingly larger and complex. Ho

APA, Harvard, Vancouver, ISO, and other styles

29

Bitar, Abdoul. "Ordonnancement sur machines parallèles appliqué à la fabrication de semi-conducteurs : ateliers de photolithographie." Thesis, Saint-Etienne, EMSE, 2015. http://www.theses.fr/2015EMSE0808/document.

Full text

Abstract:

Le secteur des semi-conducteurs a connu un développement considérable ces dernières décennies, du fait des nouvelles applications de la microélectronique dans l'industrie. Le processus de fabrication est réputé pour sa complexité. L'un des ateliers les plus critiques de la production, l'atelier de photolithographie, est régi par un ensemble conséquent de contraintes de production. La multiplicité des ressources utilisées, le nombre important de produits traités, en font une zone importante à optimiser. Les objectifs de la thèse ont été de modéliser cet atelier sous la forme d'un problème d'ord

APA, Harvard, Vancouver, ISO, and other styles

30

Carneiro, Milena Bueno Pereira. "Reconhecimento de íris utilizando algoritmos genéticos e amostragem não uniforme." Universidade Federal de Uberlândia, 2010. https://repositorio.ufu.br/handle/123456789/14276.

Full text

Abstract:

The automatic recognition of individuals through the iris characteristics is an e±cient biometric technique that is widely studied and applied around the world. Many image processing stages are necessary to make possible the representation and the interpretation of the iris information. This work presents the state of the art in iris recognition systems where the most re- markable works and the di®erent techniques applied to perform each process- ing stage are quoted. The implementations of each processing stage using traditional techniques are presented and, afterwards, two innovator methods

APA, Harvard, Vancouver, ISO, and other styles

31

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

32

Póvoa, Caio José Fernandes. "Estratégias de otimização de trajetos e alocação de torres em projetos de linhas de transmissão aéreas." Universidade Federal de Goiás, 2018. http://repositorio.bc.ufg.br/tede/handle/tede/8294.

Full text

Abstract:

Submitted by Liliane Ferreira (ljuvencia30@gmail.com) on 2018-04-04T11:42:16Z No. of bitstreams: 2 Dissertação - Caio José Fernandes Póvoa - 2018.pdf: 6079271 bytes, checksum: 5efa21665d3c5f3bf6b4a58652fff6b4 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)<br>Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2018-04-04T13:23:10Z (GMT) No. of bitstreams: 2 Dissertação - Caio José Fernandes Póvoa - 2018.pdf: 6079271 bytes, checksum: 5efa21665d3c5f3bf6b4a58652fff6b4 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)<

APA, Harvard, Vancouver, ISO, and other styles

33

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

34

Costa, Vinícius Oliveira. "Alocação de antenas para rede celular de 4G utilizando algoritmos meméticos." Universidade Federal do Tocantins, 2016. http://hdl.handle.net/11612/973.

Full text

Abstract:

Este trabalho trata do problema de alocação de estações rádio base (ERBs) para o sistema de telefonia celular de 4G, que no Brasil utiliza o protocolo LTE (Long Term Evolution). Tal problema consiste em dada uma determinada região geográfica, onde se encontram os possíveis clientes, dispor antenas de modo a cobrir a maior área possível da região em estudo, levando em consideração a capacidade de cada antena em atender os clientes com qualidade de serviço. O algoritmo apresentado calcula o raio de alcance da ERB, a quantidade mínima de ERBs necessárias para cobrir a região em estudo e a l

APA, Harvard, Vancouver, ISO, and other styles

35

Nguyen, Thi Nguyet Que. "Nouveaux développements en histologie spectrale IR : application au tissu colique." Thesis, Reims, 2016. http://www.theses.fr/2016REIMS040/document.

Full text

Abstract:

Les développements continus en micro-spectroscopie vibrationnelle IR et en analyse numérique de données multidimensionnelles ont permis récemment l'émergence de l'histologie spectrale. A l'échelle tissulaire et sur une base biomoléculaire, cette nouvelle approche représente un outil prometteur pour une meilleure analyse et caractérisation de différents états physiopathologiques, et potentiellement une aide au diagnostic clinique. Dans ce travail, en utilisant un modèle tissulaire de côlon normal chez la Souris et chez l’Homme, nous avons apporté des améliorations à la chaîne de traitements des

APA, Harvard, Vancouver, ISO, and other styles

36

Brum, James Gladstone Fagundes. "Desenvolvimento de um protótipo de software para geração de grade de programação de comerciais aplicável à TV Digital/IPTV utilizando Metaheurísticas." Universidade do Vale do Rio dos Sinos, 2014. http://www.repositorio.jesuita.org.br/handle/UNISINOS/4658.

Full text

Abstract:

Submitted by Fabricia Fialho Reginato (fabriciar) on 2015-07-28T22:46:54Z No. of bitstreams: 1 JamesBrum.pdf: 2178179 bytes, checksum: 22c4d2e31ff012df7823bad3151fc4de (MD5)<br>Made available in DSpace on 2015-07-28T22:46:54Z (GMT). No. of bitstreams: 1 JamesBrum.pdf: 2178179 bytes, checksum: 22c4d2e31ff012df7823bad3151fc4de (MD5) Previous issue date: 2014<br>PROCERGS – Cia de Processamento Dados do Estado Rio Grande Sul<br>Este trabalho apresenta o desenvolvimento de um protótipo de software, utilizando metaheurísticas por meio de um Algoritmo Memético, para a Geração de Grade de Progra

APA, Harvard, Vancouver, ISO, and other styles

37

Mansouri, Abdelkhalek. "Generic heuristics on GPU to superpixel segmentation and application to optical flow estimation." Thesis, Bourgogne Franche-Comté, 2020. http://www.theses.fr/2020UBFCA012.

Full text

Abstract:

Déterminer des clusters dans des nuages de points et apparier des graphes sont des tâches primordiales en informatique, analyse de donnée, traitement d’image, généralement modélisées par des problèmes d’optimisation de classe NP-difficile. Avec l’avènement des multiprocesseurs à bas coût, l’accélération des procédures heuristiques pour ces tâches devient possible et nécessaire. Nous proposons des implantations parallèles sur système GPU (graphics processing unit) pour des algorithmes génériques appliqués ici à la segmentation d’image en superpixels et au problème du flot optique. Le but est de

APA, Harvard, Vancouver, ISO, and other styles

38

Vigneron, Vincent. "Programmation par contraintes et découverte de motifs sur données séquentielles." Thesis, Angers, 2017. http://www.theses.fr/2017ANGE0028/document.

Full text

Abstract:

Des travaux récents ont montré l’intérêt de la programmation par contraintes pour la fouille de données. Dans cette thèse, nous nous intéressons à la recherche de motifs sur séquences, et en particulier à la caractérisation, à l’aide de motifs, de classes de séquences pré-établies. Nous proposons à cet effet un langage de modélisation à base de contraintes qui suppose une représentation matricielle du jeu de séquences. Un motif s’y définit comme un ensemble de caractères (ou de patrons) et pour chacun une localisation dans différentes séquences. Diverses contraintes peuvent alors s’appliquer :

APA, Harvard, Vancouver, ISO, and other styles

39

Gach, Olivier. "Algorithmes mémétiques de détection de communautés dans les réseaux complexes : techniques palliatives de la limite de résolution." Phd thesis, Université du Maine, 2013. http://tel.archives-ouvertes.fr/tel-01037937.

Full text

Abstract:

Les réseaux complexes, issus de relevés de terrain d'origines trèsvariées, en biologie, science de l'information ou sociologie,présentent une caractéristique remarquable dénommée structurecommunautaire. Des groupes, ou communautés, à l'intérieur duréseau, ont une cohésion interne forte et des liens entre eux plusfaibles. Sans connaissance a priori du nombre de communautés, ladifficulté réside dans la caractérisation d'un bon partitionnement encommunautés. La modularité est une mesure globale de qualité departitionnement très utilisée qui capture les contraintes de cohésioninterne forte et de l

APA, Harvard, Vancouver, ISO, and other styles

40

Nesi, Luan Carlos. "Modelo hipermídia para geração de layouts de interfaces de aplicações." Universidade do Vale do Rio dos Sinos, 2014. http://www.repositorio.jesuita.org.br/handle/UNISINOS/3102.

Full text

Abstract:

Submitted by Maicon Juliano Schmidt (maicons) on 2015-03-23T14:28:22Z No. of bitstreams: 1 Luan Carlos Nesi.pdf: 100100607 bytes, checksum: 6012e0f177d7b8f3807de72ff7d98315 (MD5)<br>Made available in DSpace on 2015-03-23T14:28:22Z (GMT). No. of bitstreams: 1 Luan Carlos Nesi.pdf: 100100607 bytes, checksum: 6012e0f177d7b8f3807de72ff7d98315 (MD5) Previous issue date: 2014-03-27<br>Milton Valente<br>Nesse trabalho foi desenvolvido um modelo computacional de Hipermídia Adaptativa para geração de layouts de interface de aplicações. A pesquisa partiu de uma revisão sobre Hipermídia Adaptativa,

APA, Harvard, Vancouver, ISO, and other styles

41

Starke, Sebastian [Verfasser]. "Bio IK: A Memetic Evolutionary Algorithm for Generic Multi-Objective Inverse Kinematics : Bio IK: Ein memetischer evolutionärer Algorithmus für generische inverse Kinematik mit mehreren Zielen / Sebastian Starke." Hamburg : Staats- und Universitätsbibliothek Hamburg Carl von Ossietzky, 2020. http://d-nb.info/1221720910/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Silva, Neto Jo?o Saturnino da. "Aplica?a? das t?cnicas Path-relinking e Vocabulary buiding na melhoria de performance do algoritmo mem?tico para o problema do caixeiro viajante assim?trico." Universidade Federal do Rio Grande do Norte, 2009. http://repositorio.ufrn.br:8080/jspui/handle/123456789/17005.

Full text

Abstract:

Made available in DSpace on 2014-12-17T15:26:37Z (GMT). No. of bitstreams: 1 JoaoSSN.pdf: 5224762 bytes, checksum: 4021177e0509af10223ad40751ece2f0 (MD5) Previous issue date: 2009-07-10<br>The present essay shows strategies of improvement in a well succeded evolutionary metaheuristic to solve the Asymmetric Traveling Salesman Problem. Such steps consist in a Memetic Algorithm projected mainly to this problem. Basically this improvement applied optimizing techniques known as Path-Relinking and Vocabulary Building. Furthermore, this last one has being used in two different ways, in order to ev

APA, Harvard, Vancouver, ISO, and other styles

43

Silva, Leandro Mengue da. "Um modelo de otimização baseado em algoritmo memético para o escalonamento de ordens de produção utilizando divisão de lotes de tamanho variável." Universidade do Vale do Rio dos Sinos, 2017. http://www.repositorio.jesuita.org.br/handle/UNISINOS/6353.

Full text

Abstract:

Submitted by JOSIANE SANTOS DE OLIVEIRA (josianeso) on 2017-06-16T12:13:46Z No. of bitstreams: 2 Leandro Mengue da Silva_.pdf: 1918963 bytes, checksum: 8d329d578b6f3672b670f65fd2f7ea08 (MD5) Leandro Mengue da Silva_.pdf: 1918963 bytes, checksum: 8d329d578b6f3672b670f65fd2f7ea08 (MD5)<br>Made available in DSpace on 2017-06-16T12:13:47Z (GMT). No. of bitstreams: 2 Leandro Mengue da Silva_.pdf: 1918963 bytes, checksum: 8d329d578b6f3672b670f65fd2f7ea08 (MD5) Leandro Mengue da Silva_.pdf: 1918963 bytes, checksum: 8d329d578b6f3672b670f65fd2f7ea08 (MD5) Previous issue date: 2017-03-23<br>CNPQ

APA, Harvard, Vancouver, ISO, and other styles

44

Ferreira, Vanessa Danielle Santos. "Um algoritmo h?brido para o problema de roteamento de ve?culos com frotas heterog?neas." Universidade Federal do Rio Grande do Norte, 2011. http://repositorio.ufrn.br:8080/jspui/handle/123456789/15007.

Full text

Abstract:

Made available in DSpace on 2014-12-17T14:53:00Z (GMT). No. of bitstreams: 1 VanessaDSF_DISSERT.pdf: 862759 bytes, checksum: d1e5a8faf841592d593e48b4f4218e61 (MD5) Previous issue date: 2011-07-13<br>Conselho Nacional de Desenvolvimento Cient?fico e Tecnol?gico<br>This paper aims to propose a hybrid meta-heuristics for the Heterogeneous Fleet Vehicle Routing Problem (HVRP), which is a combinatorial optimization problem NP-hard, and is characterized by the use of a limited fleet consists of different vehicles with different capacities. The hybrid method developed makes use of a memetic algorit

APA, Harvard, Vancouver, ISO, and other styles

45

Fontes, F?bio Francisco da Costa. "Algoritmo mem?tico com infec??o viral: uma aplica??o ao problema do caixeiro viajante assim?trico." Universidade Federal do Rio Grande do Norte, 2006. http://repositorio.ufrn.br:8080/jspui/handle/123456789/15107.

Full text

Abstract:

Made available in DSpace on 2014-12-17T14:53:23Z (GMT). No. of bitstreams: 1 FabioFCF.pdf: 875120 bytes, checksum: 089fb9e8e722351411a9dbd3d86bbef4 (MD5) Previous issue date: 2006-05-19<br>The Combinatorial Optimization is a basic area to companies who look for competitive advantages in the diverse productive sectors and the Assimetric Travelling Salesman Problem, which one classifies as one of the most important problems of this area, for being a problem of the NP-hard class and for possessing diverse practical applications, has increased interest of researchers in the development of metahe

APA, Harvard, Vancouver, ISO, and other styles

46

Dang, Vinh Q. "Evolutionary approaches for feature selection in biological data." Thesis, Edith Cowan University, Research Online, Perth, Western Australia, 2014. https://ro.ecu.edu.au/theses/1276.

Full text

Abstract:

Data mining techniques have been used widely in many areas such as business, science, engineering and medicine. The techniques allow a vast amount of data to be explored in order to extract useful information from the data. One of the foci in the health area is finding interesting biomarkers from biomedical data. Mass throughput data generated from microarrays and mass spectrometry from biological samples are high dimensional and is small in sample size. Examples include DNA microarray datasets with up to 500,000 genes and mass spectrometry data with 300,000 m/z values. While the availability

APA, Harvard, Vancouver, ISO, and other styles

47

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

48

Moalic, Laurent. "Modélisation dynamique de la densité de population via les réseaux cellulaires et optimisation multiobjectif de l'auto-partage." Thesis, Besançon, 2013. http://www.theses.fr/2013BESA2051/document.

Full text

Abstract:

De nombreux problèmes de décision issus du monde réel sont de nature NP-difficile. Il est également fréquent que de tels problèmes rassemblent plusieurs objectifs à optimiser simultanément, généralement contradictoires entre eux. Pour aborder cette classe de problèmes, les métaheuristiques multiobjectifs fournissent des outils particulièrement efficaces. Par ailleurs, pour traiter des problèmes de transport, l'élaboration de modèles permettant de caractériser l’évolution spatio-temporelle d’une population est un élément essentiel. Dans le cadre de ces travaux, nous nous intéressons à la chaine

APA, Harvard, Vancouver, ISO, and other styles

49

Oliveira, Camila Nascimento de. "Uma investiga??o de algoritmos exatos e metaheur?sticos aplicados ao nonograma." Universidade Federal do Rio Grande do Norte, 2013. http://repositorio.ufrn.br:8080/jspui/handle/123456789/18081.

Full text

Abstract:

Made available in DSpace on 2014-12-17T15:48:07Z (GMT). No. of bitstreams: 1 CamilaNOT_DISSERT.pdf: 4321465 bytes, checksum: d103bd2da647997e8dfd0a8784c2060d (MD5) Previous issue date: 2013-02-01<br>Nonogram is a logical puzzle whose associated decision problem is NP-complete. It has applications in pattern recognition problems and data compression, among others. The puzzle consists in determining an assignment of colors to pixels distributed in a N  M matrix that satisfies line and column constraints. A Nonogram is encoded by a vector whose elements specify the number of pixels in e

APA, Harvard, Vancouver, ISO, and other styles

50

Larabi, Mohand. "Le problème de job-shop avec transport : modélisation et optimisation." Phd thesis, Université Blaise Pascal - Clermont-Ferrand II, 2010. http://tel.archives-ouvertes.fr/tel-00625528.

Full text

Abstract:

Dans cette thèse nous nous sommes intéressés à l'extension du problème job-shop en ajoutant la contrainte du transport des jobs entre les différentes machines. Dans cette étude nous avons retenu l'existence de deux types de robots, les robots de capacité de chargement unitaire (capacité=1 veut dire qu'un robot ne peut transporter qu'un seul job à la fois) et les robots de capacité de chargement non unitaire (capacité>1 veut dire qu'un robot peut transporter plusieurs job à la fois). Nous avons traité cette extension en deux étapes. Ainsi, la première étape est consacrée au problème du job-shop

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!