Log in

Relevant bibliographies by topics / Meta-heuristic method / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Meta-heuristic method.

Dissertations / Theses on the topic 'Meta-heuristic method'

Author: Grafiati

Published: 7 June 2025

Last updated: 16 July 2025

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

Select a source type:

Consult the top 20 dissertations / theses for your research on the topic 'Meta-heuristic method.'

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

Tatjana, Jakšić Krüger. "Development, implementation and theoretical analysis of the bee colony optimization meta-heuristic method." Phd thesis, Univerzitet u Novom Sadu, Fakultet tehničkih nauka u Novom Sadu, 2017. https://www.cris.uns.ac.rs/record.jsf?recordId=104550&source=NDLTD&language=en.

Full text

Abstract:

The Ph.D. thesis addresses a comprehensive study of the bee colonyoptimization meta-heuristic method (BCO). Theoretical analysis of themethod is conducted with the tools of probability theory. Necessary andsufficient conditions are presented that establish convergence of the BCOmethod towards an optimal solution. Three parallelization strategies and fivecorresponding implementations are proposed for BCO for distributed-memorysystems. The influence of method’s parameters on the performance of theBCO algorithm for two combinatorial optimization problems is analyzedthrough the experimental

APA, Harvard, Vancouver, ISO, and other styles

2

Eusuff, Muzaffar M. "Water resources decision making using meta-heuristic optimization methods." Diss., The University of Arizona, 2004. http://etd.library.arizona.edu/etd/GetFileServlet?file=file:///data1/pdf/etd/azu_e9791_2004_051_sip1_w.pdf&type=application/pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

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

4

Loubiere, Peio. "Amélioration des métaheuristiques d'optimisation à l'aide de l'analyse de sensibilité." Thesis, Paris Est, 2016. http://www.theses.fr/2016PESC1051/document.

Full text

Abstract:

L'optimisation difficile représente une classe de problèmes dont la résolution ne peut être obtenue par une méthode exacte en un temps polynomial.Trouver une solution en un temps raisonnable oblige à trouver un compromis quant à son exactitude.Les métaheuristiques sont une classe d'algorithmes permettant de résoudre de tels problèmes, de manière générique et efficiente (i.e. trouver une solution satisfaisante selon des critères définis: temps, erreur, etc.).Le premier chapitre de cette thèse est notamment consacré à la description de cette problématique et à l'étude détaillée de deux familles

APA, Harvard, Vancouver, ISO, and other styles

5

Zuloaga, Maximiliano S. (Maximiliano Sebastian). "Optimizing resource allocation in a portfolio of projects related to technology infusion using heuristic and meta-heuristic methods." Thesis, Massachusetts Institute of Technology, 2017. http://hdl.handle.net/1721.1/110145.

Full text

Abstract:

Thesis: S.M. in Engineering and Management, Massachusetts Institute of Technology, School of Engineering, System Design and Management Program, 2017.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (pages 115-120).<br>In today's competitive environment, manufacturing companies are under constant pressure to improve previous products or release new ones. Nonetheless, most products are not designed and built from scratch, but rather, are based on previous versions of the product with the addition of incremental improvements given by the infusion of new technologie

APA, Harvard, Vancouver, ISO, and other styles

6

Bauer, Andreas, Bernd Bullnheimer, Richard F. Hartl, and Christine Strauß. "Applying ant colony optimization to solve the single machine total tardiness problem." SFB Adaptive Information Systems and Modelling in Economics and Management Science, WU Vienna University of Economics and Business, 1999. http://epub.wu.ac.at/1368/1/document.pdf.

Full text

Abstract:

Ant Colony Optimization is a relatively new meta-heuristic that has proven its quality and versatility on various combinatorial optimization problems such as the traveling salesman problem, the vehicle routing problem and the job shop scheduling problem. The paper introduces an Ant Colony Optimization approach to solve the problem of determining a job-sequence that minimizes the overall tardiness for a given set of jobs to be processed on a single, continuously available machine, the Single Machine Total Tardiness Problem. We experiment with various heuristic information as well as with varian

APA, Harvard, Vancouver, ISO, and other styles

7

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

8

Chen, Bai-Jie, and 陳百傑. "A Meta-Heuristic Method for Vehicle Routing Problem with Time Window Constraints." Thesis, 2002. http://ndltd.ncl.edu.tw/handle/21993520915168074947.

Full text

Abstract:

碩士<br>中原大學<br>工業工程研究所<br>90<br>ABSTRACT This research proposes a heuristic, Tabu-Disturbance Algorithm (TDA), to efficiently and effectively solve Vehicle Routing Problem with Time Window Constraints (VRPTW). TDA integrates Tabu Search (TS) and Noising Method (NM). TS is the most popular generic heuristic in solving VRPHTW in recent years and NM is a combinatorial optimization meta-heuristic. The first objective is to determine the route that minimizes the total vehicle travel distances. This leads to quick response to satisfy customer demands. The second objective is to find the minimum requ

APA, Harvard, Vancouver, ISO, and other styles

9

Tsai, Yu-Jing, and 蔡玉晶. "A Meta-Heuristic Method for Vehicle Routing Problem with Hard Time Window Constraints." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/06187522153149675757.

Full text

Abstract:

碩士<br>中原大學<br>工業工程研究所<br>92<br>This research proposes a heuristic, Tabu-Threshold Genetic Algorithm (TTGA), to efficiently and effectively solve Vehicle Routing Problem with Hard Time Window Constraints (VRPHTW). TTGA integrates Tabu Search (TS), Threshold Accepting (TA) and Genetic Algorithms (GAs) that are the most popular generic heuristic in solving VRPHTW in recent years. The first objective is to determine the routes that minimize the total vehicle travel distances, and the second objective is to find the minimum required number of vehicles. Both objectives lead to quick response to s

APA, Harvard, Vancouver, ISO, and other styles

10

Zlobinsky, Natasha. "A new hybrid meta-heuristic algorithm for solving single machine scheduling problems." Thesis, 2017. http://hdl.handle.net/10539/23456.

Full text

Abstract:

A dissertation submitted in partial ful lment of the degree of Master of Science in Engineering (Electrical) (50/50) in the Faculty of Engineering and the Built Environment Department of Electrical and Information Engineering May 2017<br>Numerous applications in a wide variety of elds has resulted in a rich history of research into optimisation for scheduling. Although it is a fundamental form of the problem, the single machine scheduling problem with two or more objectives is known to be NP-hard. For this reason we consider the single machine problem a good test bed for solution alg

APA, Harvard, Vancouver, ISO, and other styles

11

Yang, Shu-Fang, and 楊淑芳. "A Study on the Meta-Heuristic Solution Method for the Van Pooling Problem with Real Time Information." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/96988294092033103957.

Full text

Abstract:

碩士<br>淡江大學<br>運輸管理學系碩士班<br>94<br>With vanpooling emerging as a viable potential policy for reducing private car in congested area, the vigorous study on the vanpooling problem is critical for its success. However, in the current practice, the supervisors of the vanpool program usually focus on the assignment of the patronages to the vans, but not on the routes taken. In practice, the routes are determined by driver’s experiences. With the rapid development in communication technology, we should be able to perform the van pooling program more effectively with these techniques. To deal with t

APA, Harvard, Vancouver, ISO, and other styles

12

Lo, Shih-Tang, and 羅仕堂. "Solving Multiprocessor Scheduling Problem Using Meta-heuristic Methods." Thesis, 2007. http://ndltd.ncl.edu.tw/handle/82468158814641870269.

Full text

Abstract:

博士<br>國立成功大學<br>工程科學系碩博士班<br>95<br>Scheduling problems have been extensively found in many applications and most of them have demonstrated as NP complete. Many schemes are introduced to solve scheduling problem. Some meta-heuristic methods to solve interested scheduling problems are presents and evaluates in this dissertation, such as simulated annealing (SA), genetic algorithm (GA), ant colony optimization (ACO) and Hopfield neural network (HNN) approaches. The studied scheduling problems are focus on the precedence and resource-constrained multiprocessor scheduling problems. Different sched

APA, Harvard, Vancouver, ISO, and other styles

13

Nguyen, Khanh Phuong. "Meta-heuristic Solution Methods for Rich Vehicle Routing Problems." Thèse, 2014. http://hdl.handle.net/1866/11200.

Full text

Abstract:

Le problème de tournées de véhicules (VRP), introduit par Dantzig and Ramser en 1959, est devenu l'un des problèmes les plus étudiés en recherche opérationnelle, et ce, en raison de son intérêt méthodologique et de ses retombées pratiques dans de nombreux domaines tels que le transport, la logistique, les télécommunications et la production. L'objectif général du VRP est d'optimiser l'utilisation des ressources de transport afin de répondre aux besoins des clients tout en respectant les contraintes découlant des exigences du contexte d’application. Les applications réelles du VRP doivent te

APA, Harvard, Vancouver, ISO, and other styles

14

Minooei, Mazloom Seyed Mohammad. "Design optimization of large-scale structures with advanced meta-heuristic methods." Doctoral thesis, 2022. http://hdl.handle.net/11589/239680.

Full text

Abstract:

Metaheuristic algorithms nowadays represent the standard approach to engineering optimization. A very challenging field is large scale structural optimization entailing hundreds of design variables and thousands of nonlinear constraints on element stresses and nodal displacements. However, a very few studies documented the use of metaheuristic algorithms in large scale structural optimization. In order to fill this gap, an enhanced hybrid harmony search (HS) algorithm for weight minimization of large scale truss structures is presented in this PhD dissertation. The new algorithm, Large Scale S

APA, Harvard, Vancouver, ISO, and other styles

15

楊佳翰. "TWO-PHASED META-HEURISTIC METHODS FOR THE POST-MAPPING YIELD CONTROL PROBLEM." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/p94hsj.

Full text

Abstract:

碩士<br>國立交通大學<br>工業工程與管理系所<br>92<br>Yield control plays an important role in the TFT-LCD manufacturing firms, and the post-mapping operation is a crucial step. The post-mapping operation combines one TFT plate and one CF plate to form a LCD. Each TFT and CF plate is divided into a number of panels. The LCD panel is acceptable only when both TFT and CF panels are good. The TFT-LCD manufacturing firms use the sorter, a kind of robot, to increase the yield for matching TFT and CF plates. Evidently, there will be a great loss if a random mapping policy is executed. In this study, we first apply two

APA, Harvard, Vancouver, ISO, and other styles

16

Mei, Chih-Hau, and 梅智皓. "Applying Meta-heuristic Algorithms-based Clustering Ensembles Methods for App Customer Segmentation." Thesis, 2014. http://ndltd.ncl.edu.tw/handle/35189180596067878001.

Full text

Abstract:

碩士<br>國立臺灣科技大學<br>工業管理系<br>102<br>Recently, many clustering algorithms have been presented. However, there is no clustering method which can process all datasets correctly. This study proposes a model of meta-heuristic algorithms combining with clustering ensembles. The proposed clustering ensembles use subsets of data and different algorithms to generate clustering results. Then, co-association matrix is applied to integrate all the clustering results. In the process, principal component analysis is employed to reduce the computational time. The meta-heuristic algorithms based K-means cluster

APA, Harvard, Vancouver, ISO, and other styles

17

YEAP, BIOW-KIAM, and 葉謀銓. "Application of Meta-Heuristic Methods in Finding Maximum Likelihood Estimates for Multinomial Probit (MNP) Model." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/79354394000109717240.

Full text

Abstract:

碩士<br>國立暨南國際大學<br>土木工程學系<br>91<br>This research focused on assessing the efficacy of applying heuristic methods in finding the global maximum likelihood estimates in multinomial probit (MNP) model. Four types of heuristic methods were compared in terms of accuracy and efficiency. They were scatter search (SSOrig), improved scatter search (SSImp) and two hybrid methods─one combined genetic algorithm and Nelder-Mead simplex method (GANM) and the other combined genetic algorithm and nonlinear programming (GAMNP). In an attempt to increase the searching efficiency of the scatter search, a screenin

APA, Harvard, Vancouver, ISO, and other styles

18

Wei-ChinChen and 陳偉欽. "Using Mathematical Programming and Meta-heuristic Methods to Optimize the Design of Die-cuts for Angle Constrained Product." Thesis, 2017. http://ndltd.ncl.edu.tw/handle/7hf6ex.

Full text

Abstract:

碩士<br>國立成功大學<br>工程管理碩士在職專班<br>105<br>Die-cutting is a common process of reel processing in the manufacturing industry, and it can continuously generate products with pre-determined shapes. Currently, to the best of our knowledge, there are no methods to optimize the design of die-cuts for angle constrained optical film products; in particular, the units in the die-cuts must be arranged in a specific angle. In this study, a mixed integer programming (MIP) and a particle swarm optimization (PSO) algorithm are proposed by using mathematical programming technique and meta-heuristic algorithm respe

APA, Harvard, Vancouver, ISO, and other styles

19

Wang, Jian-Hung, and 王健鴻. "Combining Taguchi Methods, Neural Networks Desirability Function and Meta-Heuristic Algorithm for Optimizing the Parameter Design of Solder Paste Printing Process." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/58385624249541543804.

Full text

Abstract:

碩士<br>國立清華大學<br>工業工程與工程管理學系<br>101<br>With the demand for various types of electronic products tend to be light, thin, short and small. The precision of parts and the density between the parts of the printed circuit board will increase. In order to control product cost effectively and enhance production quality and efficiency, the manufacturers must find the advanced manufacturing technology to improve surface mount technology. Most surface mount technology problems are correlated to solder paste printing (Pan et al. 1999 , Huang 2010, Tsai 2008), and solder paste volume is an important qualit

APA, Harvard, Vancouver, ISO, and other styles

20

Bhatt, Vikram. "Stability Preserving Bisection Algorithms in Reaction-Diffusion Complex Networks." Thesis, 2020. https://etd.iisc.ac.in/handle/2005/4424.

Full text

Abstract:

Reaction-Diffusion complex networks are ubiquitous in many pragmatic models of network of interacting nodes with individual dynamics, such as social interactions, neuronal functions, transportation models, ecological systems and metabolic reactions. In particular case of reaction-diffusion network, with two different agents interacting together by specifi ed inter-node dynamics, coupling between nodes and uniform rate of di usion, under type I instability the network is stable only, Fiedler value(second smallest eigenvalue of Laplacian operator) is greater than certain threshold. Given

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!