Log in

Relevant bibliographies by topics / Meta heuristics algorithms / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Meta heuristics algorithms.

Dissertations / Theses on the topic 'Meta heuristics algorithms'

Author: Grafiati

Published: 4 June 2021

Last updated: 20 April 2024

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 'Meta heuristics algorithms.'

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

Lü, Haili, and 吕海利. "A comparative study of assembly job shop scheduling using simulation, heuristics and meta-heuristics." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2011. http://hub.hku.hk/bib/B47029018.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Randall, Marcus Christian, and n/a. "A General Modelling System and Meta-Heuristic Based Solver for Combinatorial Optimisation Problems." Griffith University. School of Environmental and Applied Science, 1999. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20051116.120133.

Full text

Abstract:

There are many real world assignment, scheduling and planning tasks which can be classified as combinatorial optimisation problems (COPs). These are usually formulated as a mathematical problem of minimising or maximising some cost function subject to a number of constraints. Usually, such problems are NP hard, and thus, whilst it is possible to find exact solutions to specific problems, in general only approximate solutions can be found. There are many algorithms that have been proposed for finding approximate solutions to COPs, ranging from special purpose heuristics to general search meta-h

APA, Harvard, Vancouver, ISO, and other styles

3

Randall, Marcus. "A General Modelling System and Meta-Heuristic Based Solver for Combinatorial Optimisation Problems." Thesis, Griffith University, 1999. http://hdl.handle.net/10072/367399.

Full text

Abstract:

There are many real world assignment, scheduling and planning tasks which can be classified as combinatorial optimisation problems (COPs). These are usually formulated as a mathematical problem of minimising or maximising some cost function subject to a number of constraints. Usually, such problems are NP hard, and thus, whilst it is possible to find exact solutions to specific problems, in general only approximate solutions can be found. There are many algorithms that have been proposed for finding approximate solutions to COPs, ranging from special purpose heuristics to general search meta-h

APA, Harvard, Vancouver, ISO, and other styles

4

Hachimi, Hanaa. "Hybridations d'algorithmes métaheuristiques en optimisation globale et leurs applications." Phd thesis, INSA de Rouen, 2013. http://tel.archives-ouvertes.fr/tel-00905604.

Full text

Abstract:

L'optimisation des structures est un processus essentiel dans la conception des systèmes mécaniques et électroniques. Cette thèse s'intéresse à la résolution des problèmes mono-objectifs et multi-objectifs des structures mécaniques et mécatroniques. En effet, les industriels ne sont pas seulement préoccupés à améliorer les performances mécaniques des pièces qu'ils conçoivent, mais ils cherchent aussi à optimiser leurs poids, leurs tailles, ainsi que leurs coûts de production. Pour résoudre ce type de problème, nous avons fait appel à des métaheuristiques robustes qui nous permettent de minimis

APA, Harvard, Vancouver, ISO, and other styles

5

Kaja, Sai Chandana. "A New Approach for Solving the Disruption in Vehicle Routing Problem During the Delivery : A Comparative Analysis of VRP Meta-Heuristics." Thesis, Blekinge Tekniska Högskola, Institutionen för datavetenskap, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:bth-19576.

Full text

Abstract:

Context. The purpose of this research paper is to describe a new approach for solving the disruption in the vehicle routing problem (DVRP) which deals with the disturbance that will occur unexpectedly within the distribution area when executing the original VRP plan. The paper then focuses further on the foremost common and usual problem in real-time scenarios i.e., vehicle-breakdown part. Therefore, the research needs to be accomplished to deal with these major disruption in routing problems in transportation. Objectives. The study first investigates to find suitable and efficient metaheurist

APA, Harvard, Vancouver, ISO, and other styles

6

Diaz, Leiva Juan Esteban. "Simulation-based optimization for production planning : integrating meta-heuristics, simulation and exact techniques to address the uncertainty and complexity of manufacturing systems." Thesis, University of Manchester, 2016. https://www.research.manchester.ac.uk/portal/en/theses/simulationbased-optimization-for-production-planning-integrating-metaheuristics-simulation-and-exact-techniques-to-address-the-uncertainty-and-complexity-of-manufacturing-systems(9ef8cb33-99ba-4eb7-aa06-67c9271a50d0).html.

Full text

Abstract:

This doctoral thesis investigates the application of simulation-based optimization (SBO) as an alternative to conventional optimization techniques when the inherent uncertainty and complex features of real manufacturing systems need to be considered. Inspired by a real-world production planning setting, we provide a general formulation of the situation as an extended knapsack problem. We proceed by proposing a solution approach based on single and multi-objective SBO models, which use simulation to capture the uncertainty and complexity of the manufacturing system and employ meta-heuristic opt

APA, Harvard, Vancouver, ISO, and other styles

7

Hachimi, Hanaa. "Hybridations d'algorithmes métaheuristiques en optimisation globale et leurs applications." Electronic Thesis or Diss., Rouen, INSA, 2013. http://www.theses.fr/2013ISAM0017.

Full text

Abstract:

L’optimisation des structures est un processus essentiel dans la conception des systèmes mécaniques et électroniques. Cette thèse s’intéresse à la résolution des problèmes mono-objectifs et multi-objectifs des structures mécaniques et mécatroniques. En effet, les industriels ne sont pas seulement préoccupés à améliorer les performances mécaniques des pièces qu’ils conçoivent, mais ils cherchent aussi à optimiser leurs poids, leurs tailles, ainsi que leurs coûts de production. Pour résoudre ce type de problème, nous avons fait appel à des métaheuristiques robustes qui nous permettent de minimis

APA, Harvard, Vancouver, ISO, and other styles

8

De, Souza Bento Da Silva Pedro Paulo. "On the mapping of distributed applications onto multiple Clouds." Thesis, Lyon, 2017. http://www.theses.fr/2017LYSEN089/document.

Full text

Abstract:

Le Cloud est devenu une plate-forme très répandue pour le déploiement d'applications distribuées. Beaucoup d'entreprises peuvent sous-traiter leurs infrastructures d'hébergement et, ainsi, éviter des dépenses provenant d'investissements initiaux en infrastructure et de maintenance.Des petites et moyennes entreprises, en particulier, attirés par le modèle de coûts sur demande du Cloud, ont désormais accès à des fonctionnalités comme le passage à l'échelle, la disponibilité et la fiabilité, qui avant le Cloud étaient presque réservées à de grandes entreprises.Les services du Cloud peuvent être o

APA, Harvard, Vancouver, ISO, and other styles

9

Sanchez, Fernando Rodrigo Lopes. "Times assíncronos inicializadores para o planejamento da expansão da transmissão de energia elétrica baseados no modelo híbrido linear /." Ilha Solteira : [s.n.], 2008. http://hdl.handle.net/11449/87259.

Full text

Abstract:

Orientador: Sérgio Azevedo de Oliveira<br>Banca: Rubén Augusto Romero Lazaro<br>Banca: Eduardo Nobuhiro Asada<br>Resumo: Neste trabalho foram implementados diversos agentes heuristicos construtivos, baseados no modelo híbrido linear, que fazem parte de um time assíncrono que tem como objetivo gerar configurações de boa qualidade para inicializar as metaheuríticas que resolvem o problema do planejamento da expansão da transmissão dos sistemas de energia elétrica. A teoria de times assíncronos foi aplicada para reunir as qualidades individuais dos métodos heurísticos, de uma maneira que, partind

APA, Harvard, Vancouver, ISO, and other styles

10

Bonavero, Yoann. "Une approche basée sur les préférences et les méta-heuristiques pour améliorer l’accessibilité des pages Web pour les personnes déficientes visuelles." Thesis, Montpellier, 2015. http://www.theses.fr/2015MONTS274/document.

Full text

Abstract:

Lorsque la vue, qui est un important moyen de communication, est altérée, alors l'acquisition de l'information s'en trouve modifiée, dégradée ou limitée. A l'ère du monde numérique, le Web regorge d'informations réparties sur différents sites et mises en forme par les développeurs et designers. De nombreuses pathologies visuelles peuvent entraîner des difficultés dans l'accès à ces informations. Au-delà même de ces informations, l'accès aux outils et services est lui aussi limité. Des difficultés dans la perception des couleurs, des taches dans le champ visuel ou un champ visuel réduit sont to

APA, Harvard, Vancouver, ISO, and other styles

11

Uzinski, Henrique [UNESP]. "Otimização de problemas multimodais usando meta-heurísticas evolutivas." Universidade Estadual Paulista (UNESP), 2014. http://hdl.handle.net/11449/115780.

Full text

Abstract:

Made available in DSpace on 2015-03-03T11:52:33Z (GMT). No. of bitstreams: 0 Previous issue date: 2014-10-24Bitstream added on 2015-03-03T12:06:30Z : No. of bitstreams: 1 000808114.pdf: 869921 bytes, checksum: d49e859927277a17ca43ba9e2d635677 (MD5)<br>Neste trabalho é proposta a resolução de problemas multimodais usando duas diferentes meta-heurísticas: Algoritmo Genético de Chu-Beasley modificado e o Algoritmo Genético de Chaves Aleatórias Viciadas (BRKGA), com foco principal nos resultados obtidos por esta última. É feita especificamente a implementação das meta-heurísticas e comparação do

APA, Harvard, Vancouver, ISO, and other styles

12

Uzinski, Henrique. "Otimização de problemas multimodais usando meta-heurísticas evolutivas /." Ilha Solteira, 2014. http://hdl.handle.net/11449/115780.

Full text

Abstract:

Orientador: Rubén Augusto Romero Lázaro<br>Banca: Marina Lavorato de Oliveira<br>Banca: Marcelo Escobar de Oliveira<br>Resumo: Neste trabalho é proposta a resolução de problemas multimodais usando duas diferentes meta-heurísticas: Algoritmo Genético de Chu-Beasley modificado e o Algoritmo Genético de Chaves Aleatórias Viciadas (BRKGA), com foco principal nos resultados obtidos por esta última. É feita especificamente a implementação das meta-heurísticas e comparação dos resultados obtidos por estas diferentes técnicas. Uma característica muito importante do BRKGA é a estruturação que permite s

APA, Harvard, Vancouver, ISO, and other styles

13

Sanchez, Fernando Rodrigo Lopes [UNESP]. "Times assíncronos inicializadores para o planejamento da expansão da transmissão de energia elétrica baseados no modelo híbrido linear." Universidade Estadual Paulista (UNESP), 2008. http://hdl.handle.net/11449/87259.

Full text

Abstract:

Made available in DSpace on 2014-06-11T19:22:35Z (GMT). No. of bitstreams: 0 Previous issue date: 2008-06-06Bitstream added on 2014-06-13T20:09:51Z : No. of bitstreams: 1 sanchez_frl_me_ilha.pdf: 660422 bytes, checksum: f8ab299d7cef18ca3a218acf27a94f43 (MD5)<br>Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)<br>Neste trabalho foram implementados diversos agentes heuristicos construtivos, baseados no modelo híbrido linear, que fazem parte de um time assíncrono que tem como objetivo gerar configurações de boa qualidade para inicializar as metaheuríticas que resolvem o probl

APA, Harvard, Vancouver, ISO, and other styles

14

Carvalho, Marcia Braga de. "Aplicações de meta-heuristica genetica e fuzzy no sistema de colonia de formigas para o problema do caixeiro viajante." [s.n.], 2007. http://repositorio.unicamp.br/jspui/handle/REPOSIP/261876.

Full text

Abstract:

Orientador: Akebo Yamakami<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação<br>Made available in DSpace on 2018-08-08T23:52:00Z (GMT). No. of bitstreams: 1 Carvalho_MarciaBragade_M.pdf: 2154346 bytes, checksum: caafd847980349294a73d2ad38d6414c (MD5) Previous issue date: 2007<br>Resumo: Dentre as várias técnicas heurísticas e exatas existentes para a resolução de problemas combinatórios, os algoritmos populacionais de otimização por colônia de formigas e genéticos têm se destacado devido à sua boa performance. Em especial os algor

APA, Harvard, Vancouver, ISO, and other styles

15

Tian, Zhong Huan. "Gender based meta-heuristic optimization algorithms." Thesis, University of Macau, 2017. http://umaclib3.umac.mo/record=b3691331.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Hanek, Petr. "Implementace problému směrování vozidel pomocí algoritmu mravenčích kolonií a částicových rojů." Master's thesis, Vysoké učení technické v Brně. Fakulta elektrotechniky a komunikačních technologií, 2019. http://www.nusl.cz/ntk/nusl-400931.

Full text

Abstract:

This diploma thesis focuses on meta-heuristic algorithms and their ability to solve difficult optimization problems in polynomial time. The thesis describes different kinds of meta-heuristic algorithms such as genetic algorithm, particle swarm optimization or ant colony optimization. The implemented application was written in Java and contains ant colony optimization for capacitated vehicle routing problem and particle swarm optimization which finds the best possible parameters for ant colonies.

APA, Harvard, Vancouver, ISO, and other styles

17

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

18

Hosny, Manar Ibrahim. "Investigating heuristic and meta-heuristic algorithms for solving pickup and delivery problems." Thesis, Cardiff University, 2010. http://orca.cf.ac.uk/55181/.

Full text

Abstract:

The development of effective decision support tools that can be adopted in the transportation industry is vital in the world we live in today, since it can lead to substantial cost reduction and efficient resource consumption. Solving the Vehicle Routing Problem (VRP) and its related variants is at the heart of scientific research for optimizing logistic planning. One important variant of the VRP is the Pickup and Delivery Problem (PDP). In the PDP, it is generally required to find one or more minimum cost routes to serve a number of customers, where two types of services may be performed at a

APA, Harvard, Vancouver, ISO, and other styles

19

Barbosa, Eduardo Batista de Moraes. "Uma heurística para otimização de meta-heurísticas por meio de métodos estatísticos /." Guaratinguetá, 2016. http://hdl.handle.net/11449/141911.

Full text

Abstract:

Orientador: Edson Luiz França Senne<br>Coorientador: Messias Borges Silva<br>Banca: Marcos Antonio Pereira<br>Banca: Fernando Augusto Silva Marins<br>Banca: Antonio Augusto Chaves<br>Banca: Fabrício Maciel Gomes<br>Resumo: A configuração de parâmetros de algoritmos, em especial, das meta-heurísticas, nem sempre é trivial e, frequentemente, é realizada ad hoc de acordo com o problema sob análise. A fim de resolver o problema de sintonização de meta-heurísticas, a presente pesquisa propõe uma metodologia que combina o uso de técnicas estatísticas robustas (ex.: Planejamento de Experimentos) e mé

APA, Harvard, Vancouver, ISO, and other styles

20

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

21

Mathirajan, M. "Heuristic Scheduling Algorithms For Parallel Heterogeneous Batch Processors." Thesis, Indian Institute of Science, 2000. https://etd.iisc.ac.in/handle/2005/196.

Full text

Abstract:

In the last decade, market pressures for greater variety of products forced a gradual shift from continuous manufacturing to batch manufacturing in various industries. Consequently batch scheduling problems have attracted the attention of researchers in production and operations management. This thesis addresses the scheduling of parallel non-identical batch processors in the presence of dynamic job arrivals, incompatible job-families and non-identical job sizes. This problem abstracts the scheduling of heat-treatment furnace operations of castings in a steel foundry. The problem is of cons

APA, Harvard, Vancouver, ISO, and other styles

22

Mathirajan, M. "Heuristic Scheduling Algorithms For Parallel Heterogeneous Batch Processors." Thesis, Indian Institute of Science, 2000. http://hdl.handle.net/2005/196.

Full text

Abstract:

In the last decade, market pressures for greater variety of products forced a gradual shift from continuous manufacturing to batch manufacturing in various industries. Consequently batch scheduling problems have attracted the attention of researchers in production and operations management. This thesis addresses the scheduling of parallel non-identical batch processors in the presence of dynamic job arrivals, incompatible job-families and non-identical job sizes. This problem abstracts the scheduling of heat-treatment furnace operations of castings in a steel foundry. The problem is of consid

APA, Harvard, Vancouver, ISO, and other styles

23

Hopper, Eva. "Two-dimensional packing utilising evolutionary algorithms and other meta-heuristic methods." Thesis, Cardiff University, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.342878.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Fossati, Giovani Gaiardo. "Otimização multiobjetivo dos parâmetros do sistema de suspensão de um modelo de veículo completo através de um algoritmo meta-heurístico." reponame:Biblioteca Digital de Teses e Dissertações da UFRGS, 2017. http://hdl.handle.net/10183/163437.

Full text

Abstract:

O presente trabalho otimizou os parâmetros concentrados do sistema de suspensão de um modelo de veículo completo, representando um automóvel de passeio que trafega a uma velocidade constante por um determinado perfil de pista previsto na norma ISO 8608, 1995, através da utilização de um algoritmo meta-heurístico de otimização multiobjetivo. Duas rotinas numérico-computacionais foram desenvolvidas, visando realizar tal otimização tanto no domínio do tempo quanto no domínio da frequência. A utilização de algoritmos meta-heurísticos vem ganhando espaço na otimização de sistemas mecânicos, proporc

APA, Harvard, Vancouver, ISO, and other styles

25

Kendall, Graham. "Applying meta-heuristic algorithms to the nesting problem utilising the no fit polygon." Thesis, University of Nottingham, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.342064.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Jiang, Siyu. "A Comparison of PSO, GA and PSO-GA Hybrid Algorithms for Model-based Fuel Economy Optimization of a Hybrid-Electric Vehicle." The Ohio State University, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu156612591067731.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Bettemir, Onder Halis. "Optimization Of Time-cost-resource Trade-off Problems In Project Scheduling Using Meta-heuristic Algorithms." Phd thesis, METU, 2009. http://etd.lib.metu.edu.tr/upload/12611971/index.pdf.

Full text

Abstract:

In this thesis, meta-heuristic algorithms are developed to obtain optimum or near optimum solutions for the time-cost-resource trade-off and resource leveling problems in project scheduling. Time cost trade-off, resource leveling, single-mode resource constrained project scheduling, multi-mode resource constrained project scheduling and resource constrained time cost trade-off problems are analyzed. Genetic algorithm simulated annealing, quantum simulated annealing, memetic algorithm, variable neighborhood search, particle swarm optimization, ant colony optimization and electromagnetic scatt

APA, Harvard, Vancouver, ISO, and other styles

28

Kanda, Jorge Yoshio. "Uso de meta-aprendizado na recomendação de meta-heurísticas para o problema do caixeiro viajante." Universidade de São Paulo, 2012. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-19022013-142839/.

Full text

Abstract:

O problema do caixeiro viajante (PCV) é um problema clássico de otimização que possui diversas variações, aplicações e instâncias. Encontrar a solução ótima para muitas instâncias desse problema é geralmente muito difícil devido o alto custo computacional. Vários métodos de otimização, conhecidos como meta-heurísticas (MHs), são capazes de encontrar boas soluções para o PCV. Muitos algoritmos baseados em diversas MHs têm sido propostos e investigados para diferentes variações do PCV. Como não existe um algoritmo universal que encontre a melhor solução para todas as instâncias de um problema, d

APA, Harvard, Vancouver, ISO, and other styles

29

Carraro, Luiz Antonio. "Algoritmo de seleção clonal para a minimização de rearranjos em operações de pilhas de contêineres." Universidade Presbiteriana Mackenzie, 2012. http://tede.mackenzie.br/jspui/handle/tede/1425.

Full text

Abstract:

Made available in DSpace on 2016-03-15T19:37:43Z (GMT). No. of bitstreams: 1 Luiz Antonio Carraro.pdf: 1226702 bytes, checksum: 3cef29694a4e26f233b0aae16da69cf0 (MD5) Previous issue date: 2012-02-16<br>Universidade Presbiteriana Mackenzie<br>A container is a broadly used solution for the cargo storage to be transported between ports, playing a central role in international trade. Consequently, ships grew in size in order to maximize their container transportation capacity in each trip. Due to increasing demand, container terminals face the challenges of increasing their service capacity and

APA, Harvard, Vancouver, ISO, and other styles

30

Graham, James. "Definition of a common formulation of military frequency assignment problems and the application of meta-heuristic algorithms." Thesis, University of South Wales, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.416558.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Van, Zyl Fritz. "Determining the optimal log position during primary breakdown using internal wood scanning techniques and meta-heuristic algorithms." Thesis, Stellenbosch : University of Stellenbosch, 2011. http://hdl.handle.net/10019.1/6715.

Full text

Abstract:

Thesis (MScEng (Industrial Engineering))--University of Stellenbosch, 2011.<br>ENGLISH ABSTRACT: During the 2009 financial year the sawlog production from plantations in South Africa amounted to 4.4 million m 3 and sawn timber of R4.2 billion was produced from these logs. At the current average price for structural timber, a 1% increase in volume recovery at a medium-sized South African sawmill with an annual log intake of 100 000m 3 will result in additional profit of about R2.2 million annually. The purpose of this project was to evaluate the potential of increasing in value

APA, Harvard, Vancouver, ISO, and other styles

32

Gomes, Lalinka de Campos Teixeira. "Inteligencia computacional na sintese de meta-heuristicas para otimização combinatoria e multimodal." [s.n.], 2006. http://repositorio.unicamp.br/jspui/handle/REPOSIP/260779.

Full text

Abstract:

Orientadores: Fernando Jose Von Zuben, Leandro Nunes de Castro<br>Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação<br>Made available in DSpace on 2018-08-15T01:42:44Z (GMT). No. of bitstreams: 1 Gomes_LalinkadeCamposTeixeira_D.pdf: 3303378 bytes, checksum: 65adc8d5ec20cd1f431eaca2fe3765cc (MD5) Previous issue date: 2006<br>Resumo: Problemas de otimização combinatória apresentam grande relevância prática e surgem em uma ampla gama de aplicações. Em geral, a otimização combinatória está associada a uma explosão de candidatos à solução, invi

APA, Harvard, Vancouver, ISO, and other styles

33

Zhao, Xiagang. "Algorithmes pour les problèmes de tournées à la demande." Phd thesis, Université Blaise Pascal - Clermont-Ferrand II, 2011. http://tel.archives-ouvertes.fr/tel-00671350.

Full text

Abstract:

Dans le cadre de cette thèse, nous nous intéressons au problème du transport à la demande. Nous proposons des heuristiques pour résoudre ce problème de manière rapide et efficace. Dans cette thèse, nous traitons trois problèmes : le premier est le Dial-a-ride (DARP standard). Pour ce problème, nous proposons des heuristiques basées sur la technique d'insertion et une technique de propagation de contrainte. Nous proposons aussi la procédure SPLIT et des opérateurs classiques de recherche locale pour résoudre ce problème. Le second est le DARP multicritères pour laquelle nous proposons un schéma

APA, Harvard, Vancouver, ISO, and other styles

34

Proença, Diogo Alexandre Breites de Campos. "Adaptive complex system modeling for realistic modern ground warfare simulation analysis based on evolutionary multi-objective meta-heuristic techniques." Master's thesis, Instituto Politécnico de Leiria, 2011. http://hdl.handle.net/10400.8/1332.

Full text

Abstract:

Dissertação apresentada à Escola Superior de Tecnologia e Gestão do IPL para obtenção do grau de Mestre em Engenharia Informática - Computação Móvel, orientada pelo Professor Silvio Priem Mendes.<br>The battlefield is a harsh and inhuman environment, where deaths and destruction take lead role. Through many millennia there was blood shed all over the world, people who many time died in a battle that sometimes they didn‘t even care about. Today, the battle field is very different, machines take most damage and there are less casualties, this is because of the advancements made in the fields of

APA, Harvard, Vancouver, ISO, and other styles

35

Luche, José Roberto Dale. "Modelos e algoritmos para a otimização do planejamento da produção de grãos eletrofundidos." Universidade Federal de São Carlos, 2011. https://repositorio.ufscar.br/handle/ufscar/3396.

Full text

Abstract:

Made available in DSpace on 2016-06-02T19:50:15Z (GMT). No. of bitstreams: 1 4224.pdf: 4088163 bytes, checksum: f36f82cf58386b4174743eccaa446df4 (MD5) Previous issue date: 2011-02-12<br>The number of successful applications that use optimization models has followed the evolution of the computers, as much in hardware, with more powerful machines, as in software, with more intelligent algorithms. Due to importance of the modeling as a decision support tool, much effort has been made to mathematically describe systems of interest and devise techniques for solving such models. This work presents

APA, Harvard, Vancouver, ISO, and other styles

36

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

37

Hillblom, Jonathan. "Evaluating Different Genetic Algorithms for a State-machine Combining Assignment Problem." Thesis, Karlstads universitet, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:kau:diva-79019.

Full text

Abstract:

Deep packet inspection (DPI) is useful as a tool for analyzing internet traffic. Regular expressions (regexps) can be used to detect the network traffic patterns that the DPI is able to identify. These regexps can be represented as state-machines, and sometimes combining smaller state-machines into larger state-machines can result in more efficient processing. This thesis looks at how to decide which state-machines used in DPI-classes should be combined with which other state-machines in an efficient manner using genetic algorithms. The goal being to create as few resulting state-machines from

APA, Harvard, Vancouver, ISO, and other styles

38

LAI, MICHELA. "Models and algorithms for the empty container repositioning and its integration with routing problems." Doctoral thesis, Università degli Studi di Cagliari, 2013. http://hdl.handle.net/11584/266107.

Full text

Abstract:

The introduction of containers has fostered intermodal freight transportation. A definition of intermodality was provided by the European Commission as “a characteristic of a transport system whereby at least two different modes are used in an integrated manner in order to complete a door-to-door transport sequence”. The intermodal container transportation leads to several benefits, such as higher productivity during handling phases and advantages in terms of security, losses and damages. However, the distribution of containers comes with a drawback: due to directional imbalances in freight

APA, Harvard, Vancouver, ISO, and other styles

39

Ramos, Edson da Silva. "Modelos de simulação e otimização para sistemas hidrotérmicos." Universidade Federal de Goiás, 2016. http://repositorio.bc.ufg.br/tede/handle/tede/7713.

Full text

Abstract:

Submitted by JÚLIO HEBER SILVA (julioheber@yahoo.com.br) on 2017-08-31T17:54:58Z No. of bitstreams: 2 Dissertação - Edson da Silva Ramos - 2017.pdf: 3997839 bytes, checksum: 46c0db17187cdc3a0d29e581ce8b11f0 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)<br>Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2017-09-15T13:42:24Z (GMT) No. of bitstreams: 2 Dissertação - Edson da Silva Ramos - 2017.pdf: 3997839 bytes, checksum: 46c0db17187cdc3a0d29e581ce8b11f0 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5)<br>Made

APA, Harvard, Vancouver, ISO, and other styles

40

Mazzini, Renata. "Estudo de meta-heuristicas populacionais para a programação de maquinas paralelas com tempos de preparação dependentes da sequencia e datas de entrega." [s.n.], 1998. http://repositorio.unicamp.br/jspui/handle/REPOSIP/261178.

Full text

Abstract:

Orientador: Vinicius Amaral Armentano<br>Tese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação<br>Made available in DSpace on 2018-07-24T07:54:32Z (GMT). No. of bitstreams: 1 Mazzini_Renata_D.pdf: 12936662 bytes, checksum: 581f180b73d247423b83bd197041667d (MD5) Previous issue date: 1998<br>Resumo: Neste trabalho estuda-se a aplicação de meta-heurísticas populacionais em problemas de programação da produção. O problema abordado consiste da minimização do atraso total na programação de tarefas em máquinas paralelas idênticas onde se consideram t

APA, Harvard, Vancouver, ISO, and other styles

41

Ndiaye, Ndèye Fatma. "Algorithmes d'optimisation pour la résolution du problème de stockage de conteneurs dans un terminal portuaire." Thesis, Le Havre, 2015. http://www.theses.fr/2015LEHA0002/document.

Full text

Abstract:

ADans cette thède, nous traitons le problème de stockage de conteneurs dans un terminal portuaire. Dans un premier temps, noux présentons une étude bibliographique dans laquelle sont analysés les travaux qui ont déhà été rélisé dans ce domaine. Ensuite, nous présentons une étude analytique, puis une modélisation mathématique et des méthodes de résolution numérique qui englobent des algorithmes efficaces. Nous proposons une démonstration de la compexité du problème de stockage de conteneurs en considérant différents cas de stockage. Ce problème étant "Np_difficile" peut être difficilement résol

APA, Harvard, Vancouver, ISO, and other styles

42

Caetano, Samuel Sabino. "O uso de algoritmos evolutivos para a formação de grupos na aprendizagem colaborativa no contexto corporativo." Universidade Federal de Goiás, 2013. http://repositorio.bc.ufg.br/tede/handle/tede/3195.

Full text

Abstract:

Submitted by Jaqueline Silva (jtas29@gmail.com) on 2014-09-26T21:10:33Z No. of bitstreams: 2 Caetano, Samuel Sabino-2013-dissertação.pdf: 1031464 bytes, checksum: 39f6a5947aed90b8f7c8e56b76d93e5a (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)<br>Approved for entry into archive by Jaqueline Silva (jtas29@gmail.com) on 2014-09-26T21:12:31Z (GMT) No. of bitstreams: 2 Caetano, Samuel Sabino-2013-dissertação.pdf: 1031464 bytes, checksum: 39f6a5947aed90b8f7c8e56b76d93e5a (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5)<br>Made availab

APA, Harvard, Vancouver, ISO, and other styles

43

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

44

Garcia, André Mendes. "Algoritmo de busca dispersa aplicado ao problema de fluxo de potência ótimo considerando o desligamento de linhas de transmissão /." Ilha Solteira, 2019. http://hdl.handle.net/11449/190981.

Full text

Abstract:

Orientador: Rubén Augusto Romero Lázaro<br>Resumo: O principal objetivo deste trabalho é a implementação de uma metodologia que, utilizando a meta-heurística de busca dispersa (BD) resolva o problema de fluxo de potência ótimo (FPO) considerando o desligamento de linhas de transmissão (OTS) para a redução dos custos de ope-ração. Com o objetivo de avaliar o potencial da meta-heurística, o algoritmo de BD foi imple-mentado para otimizar funções multimodais restritas, metodologia denominada BD-FMR, e para resolver o problema de FPO, metodologia denominada BD-FPO. Foram realizados testes com onze

APA, Harvard, Vancouver, ISO, and other styles

45

Gomes, Fabrício Maciel [UNESP]. "Diferentes métodos de aglutinação para melhoria de processos com múltiplas respostas." Universidade Estadual Paulista (UNESP), 2015. http://hdl.handle.net/11449/132419.

Full text

Abstract:

Submitted by FABRÍCIO MACIEL GOMES null (fabricio@dequi.eel.usp.br) on 2016-01-04T00:06:19Z No. of bitstreams: 1 Tese_Fabricio_Maciel_Gomes.pdf: 1836829 bytes, checksum: 3ec7860a9d87ebfeaef21b25dc157d25 (MD5)<br>Approved for entry into archive by Juliano Benedito Ferreira (julianoferreira@reitoria.unesp.br) on 2016-01-06T16:12:19Z (GMT) No. of bitstreams: 1 gomes_fm_dr_guara.pdf: 1836829 bytes, checksum: 3ec7860a9d87ebfeaef21b25dc157d25 (MD5)<br>Made available in DSpace on 2016-01-06T16:12:19Z (GMT). No. of bitstreams: 1 gomes_fm_dr_guara.pdf: 1836829 bytes, checksum: 3ec7860a9d87ebfeaef21

APA, Harvard, Vancouver, ISO, and other styles

46

Ameli, Mostafa. "Heuristic Methods for Calculating Dynamic Traffic Assignment Simulation-based dynamic traffic assignment: meta-heuristic solution methods with parallel computing Non-unicity of day-to-day multimodal user equilibrium: the network design history effect Improving traffic network performance with road banning strategy: a simulation approach comparing user equilibrium and system optimum." Thesis, Lyon, 2019. http://www.theses.fr/2019LYSET009.

Full text

Abstract:

Les systèmes de transport sont caractérisés de manière dynamique non seulement par des interactions non linéaires entre les différents composants, mais également par des boucles de rétroaction entre l'état du réseau et les décisions des utilisateurs. En particulier, la congestion du réseau impacte à la fois la répartition de la demande locale en modifiant les choix d’itinéraire et la demande multimodale globale. Selon les conditions du réseau, ils peuvent décider de changer, par exemple, leur mode de transport. Plusieurs équilibres peuvent être définis pour les systèmes de transport. L'équilib

APA, Harvard, Vancouver, ISO, and other styles

47

Scalabrin, Marlon Henrique. "Mega busca harmônica: algoritmo de busca harmônica baseado em população e implementado em unidades de processamento gráfico." Universidade Tecnológica Federal do Paraná, 2012. http://repositorio.utfpr.edu.br/jspui/handle/1/308.

Full text

Abstract:

CAPES<br>Este trabalho propõe uma modificação da meta-heurística Busca Harmônica (HS) a partir de uma nova abordagem baseada em população, empregando, também, algumas estratégias inspiradas em outras meta-heurísticas. Este novo modelo foi implementado utilizando a arquitetura de programação paralela CUDA em uma GPU. O uso de placas de processamento gráficas (GPU) para processamento de propósito geral está crescendo, e estas têm sido utilizadas por muitos pesquisadores para processamento científico. Seu uso se mostra interessante para meta-heurísticas populacionais, podendo realizar muitas oper

APA, Harvard, Vancouver, ISO, and other styles

48

Frascati, Giuliano. "Programação da produção em máquina única com setup dependente da sequência e terceirização permitida: uma abordagem de otimização por colônia de formigas." Universidade Federal de São Carlos, 2014. https://repositorio.ufscar.br/handle/ufscar/3745.

Full text

Abstract:

Made available in DSpace on 2016-06-02T19:52:03Z (GMT). No. of bitstreams: 1 5761.pdf: 2593684 bytes, checksum: 000d3a163875f2beb7e15774305fbab2 (MD5) Previous issue date: 2014-02-18<br>Financiadora de Estudos e Projetos<br>Many scheduling problems found in the literature are classified as NP-Hard, which means that the computational costs of the solutions within known exact mathematical methods can be very time consuming. In the case of partial outsourcing it is essential to consider the outsourcing decisions inside the scheduling problem to achieve optimal results from outsourcing. This pro

APA, Harvard, Vancouver, ISO, and other styles

49

Viana, Monique Simplicio. "Algoritmo genético com operador de transgenia para minimização de makespan da programação reativa da produção." Universidade Federal de São Carlos, 2016. https://repositorio.ufscar.br/handle/ufscar/9087.

Full text

Abstract:

Submitted by Alison Vanceto (alison-vanceto@hotmail.com) on 2017-08-30T12:26:40Z No. of bitstreams: 1 DissMSV.pdf: 2771156 bytes, checksum: add74067c9db203edececa7202e83a52 (MD5)<br>Approved for entry into archive by Ronildo Prado (ronisp@ufscar.br) on 2017-09-20T14:06:15Z (GMT) No. of bitstreams: 1 DissMSV.pdf: 2771156 bytes, checksum: add74067c9db203edececa7202e83a52 (MD5)<br>Approved for entry into archive by Ronildo Prado (ronisp@ufscar.br) on 2017-09-20T14:06:22Z (GMT) No. of bitstreams: 1 DissMSV.pdf: 2771156 bytes, checksum: add74067c9db203edececa7202e83a52 (MD5)<br>Made available i

APA, Harvard, Vancouver, ISO, and other styles

50

El, Hayek Joseph. "Le problème de bin-packing en deux-dimensions, le cas non-orienté : résolution approchée et bornes inférieures." Phd thesis, Université de Technologie de Compiègne, 2006. http://tel.archives-ouvertes.fr/tel-00158728.

Full text

Abstract:

Notre travail porte sur le problème de bin-packing qui consiste à déterminer le nombre minimum de grands rectangles (bins) nécessaires pour ranger un ensemble de petits rectangles (objets). Ce problème d'optimisation combinatoire est NP-difficile au sens fort. Nous proposons des prétraitements des objets permettant la valorisation des espaces perdus dans les bins et la diminution de la taille du problème à résoudre. Nous proposons une nouvelle méthode d'évaluation de bornes inférieures tenant compte de la possibilité de tourner les objets de 90 degrés. Nous procédons à une résolution approchée

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!