Log in

Relevant bibliographies by topics / Heuristic Optimization / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Heuristic Optimization.

Dissertations / Theses on the topic 'Heuristic Optimization'

Author: Grafiati

Published: 4 June 2021

Last updated: 26 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 'Heuristic Optimization.'

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

Sanusi, Afeez Ayinla. "Train Dispatching: Heuristic Optimization." Thesis, Högskolan Dalarna, Datateknik, 2006. http://urn.kb.se/resolve?urn=urn:nbn:se:du-4107.

Full text

Abstract:

Train dispatchers faces lots of challenges due to conflicts which causes delays of trains as a result of solving possible dispatching problems the network faces. The major challenge is for the train dispatchers to make the right decision and have reliable, cost effective and much more faster approaches needed to solve dispatching problems. This thesis work provides detail information on the implementation of different heuristic algorithms for train dispatchers in solving train dispatching problems. The library data files used are in xml file format and deals with both single and double tracks

APA, Harvard, Vancouver, ISO, and other styles

2

Yahaya, Abubakar. "Heuristic approaches to portfolio optimization." Thesis, Lancaster University, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.587501.

Full text

Abstract:

One of the most frequently studied areas in finance is the classical mean-variance portfolio selection model pioneered by Harry Markowitz; which is also, undoubtedly recognized as the foundation of modem portfolio theory. The model in its basic form deals with the selection of portfolio of assets such that a reasonable trade-off is achieved between the conflicting objectives. of maximum possible return at a minimum risk, given that the right choice of constituent assets is made and proper weights are allocated. However, despite its enormous contribution to this branch of knowledge, the model i

APA, Harvard, Vancouver, ISO, and other styles

3

Collether, John. "Portfolio optimization by heuristic algorithms." Thesis, University of Essex, 2014. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.635985.

Full text

Abstract:

Portfolio optimization is a major activity in business. It is intensively studied by researchers. Conventional portfolio optimization research made simplifying assumptions. For example, they assumed no constraint in how many assets one holds (cardinality constraint). They also assume no minimum and maximum holding sizes (holding size constraint). Once these assumptions are relaxed, conventional methods become inapplicable. New methods are demanded. Threshold Accepting is an established algorithm in the extended portfolio optimization problem.

APA, Harvard, Vancouver, ISO, and other styles

4

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

5

Kronfeld, Marcel [Verfasser]. "Niching Methods in Heuristic Optimization / Marcel Kronfeld." München : Verlag Dr. Hut, 2011. http://d-nb.info/1017353530/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Olekas, Patrick T. "Characterization and Heuristic Optimization of Complex Networks." University of Cincinnati / OhioLINK, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1224187184.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

KRISHNAMURTHY, KALYANAKRISHNAN. "HEURISTIC OPTIMIZATION OF GROUND TRAFFIC AT AN AIRPORT." University of Cincinnati / OhioLINK, 2004. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1085578701.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Kovalskyy, Valeriy. "Application of Heuristic Optimization Techniques in Land Evaluation." Ohio University / OhioLINK, 2004. http://www.ohiolink.edu/etd/view.cgi?ohiou1102709552.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Cabezas, García José Xavier. "Heuristic methods for solving two discrete optimization problems." Thesis, University of Edinburgh, 2018. http://hdl.handle.net/1842/31093.

Full text

Abstract:

In this thesis we study two discrete optimization problems: Traffic Light Synchronization and Location with Customers Orderings. A widely used approach to solve the synchronization of traffic lights on transport networks is the maximization of the time during which cars start at one end of a street and can go to the other without stopping for a red light (bandwidth maximization). The mixed integer linear model found in the literature, named MAXBAND, can be solved by optimization solvers only for small instances. In this manuscript we review in detail all the constraints of the original linear

APA, Harvard, Vancouver, ISO, and other styles

10

Sochor, Jana, and Cecilia Yu. "A Heuristic Method for Routing Snowplows After Snowfall." Thesis, Linköping University, Department of Mathematics, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2550.

Full text

Abstract:

<p>Sweden experiences heavy snowfall during the winter season and cost effective road maintenance is significantly affected by the routing of snowplows. The routing problem becomes more complex as the SwedishNational Road Administration (Vägverket) sets operational requirements such as satisfying a time window for each road segment. </p><p>This thesis focuses on route optimization for snowplows after snowfall; to develop and implement an algorithm for finding combinations of generated routes which minimize the total cost. The results are compared to those stated in the licentiate thesis by Doc

APA, Harvard, Vancouver, ISO, and other styles

11

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

12

Karapetyan, Daniil. "Design, evaluation and analysis of combinatorial optimization heuristic algorithms." Thesis, Royal Holloway, University of London, 2010. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.531316.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Zhou, Tao. "Meta-heuristic based Construction Supply Chain Modelling and Optimization." Thesis, Curtin University, 2018. http://hdl.handle.net/20.500.11937/75225.

Full text

Abstract:

Driven by the severe competition within the construction industry, the necessity of improving and optimizing the performance of construction supply chain has been aroused. This thesis proposes three problems with regard to the construction supply chain optimization from three perspectives, namely, deterministic single objective optimization, stochastic optimization and multi-objective optimization respectively. Mathematical models for each problem are constructed accordingly and meta-heuristic algorithms are developed and applied for resolving these three problems.

APA, Harvard, Vancouver, ISO, and other styles

14

Na, Byungsoo. "Optimization of automated float glass lines." Diss., Georgia Institute of Technology, 2010. http://hdl.handle.net/1853/39637.

Full text

Abstract:

Motivated by operational issues in real-world glass manufacturing, this thesis addresses a problem of laying out and sequencing the orders so as to minimize wasted glass, called scrap. This optimization problem combines aspects of traditional cutting problems and traditional scheduling and sequencing problems. In so far as we know, the combination of cutting and scheduling has not been modeled, or solved. We propose a two-phase approach: snap construction and constructing cutting and offload schedules. Regarding the second phase problem, we introduce FGSP (float glass scheduling problem), and

APA, Harvard, Vancouver, ISO, and other styles

15

Fritsche, Gian Mauricio. "Hyper-heuristic based particle swarm optimization for many-objective problems." reponame:Repositório Institucional da UFPR, 2016. http://hdl.handle.net/1884/41790.

Full text

Abstract:

Orientadora : Profª. Ph.D. Aurora Pozo<br>Dissertação (mestrado) - Universidade Federal do Paraná, Setor de Ciências Exatas, Programa de Pós-Graduação em Informática. Defesa: Curitiba, 29/02/2016<br>Inclui referências : f. 81-87<br>Resumo: O algoritmo de Otimização por Enxame de Partículas (PSO) e uma meta-heurística inspirada no comportamento de bandos de aves a procura de alimento. Os bons resultados obtidos por esta técnica na otimização de problemas mono-objetivo incentivaram o estudo de variações para problemas multi- objetivo (MOPSO), que também alcançaram bons resultados. Para a adaptaç

APA, Harvard, Vancouver, ISO, and other styles

16

Burnett, Linda Dee. "Heuristic Optimization of Boolean Functions and Substitution Boxes for Cryptography." Thesis, Queensland University of Technology, 2005. https://eprints.qut.edu.au/16023/1/Linda_Burnett_Thesis.pdf.

Full text

Abstract:

Fundamental to the electronic security of information and communication systems, is the correct use and application of appropriate ciphers. The strength of these ciphers, particularly in their ability to resist cryptanalytic attacks, directly in uences the overall strength of the entire system. The strength of the underlying cipher is reliant upon a robust structure and the carefully designed interaction between components in its architecture. Most importantly, however, cipher strength is critically dependent on the strength of the individual components of which it is comprised. Bool

APA, Harvard, Vancouver, ISO, and other styles

17

Burnett, Linda Dee. "Heuristic Optimization of Boolean Functions and Substitution Boxes for Cryptography." Queensland University of Technology, 2005. http://eprints.qut.edu.au/16023/.

Full text

Abstract:

Fundamental to the electronic security of information and communication systems, is the correct use and application of appropriate ciphers. The strength of these ciphers, particularly in their ability to resist cryptanalytic attacks, directly in uences the overall strength of the entire system. The strength of the underlying cipher is reliant upon a robust structure and the carefully designed interaction between components in its architecture. Most importantly, however, cipher strength is critically dependent on the strength of the individual components of which it is comprised. Boolean fu

APA, Harvard, Vancouver, ISO, and other styles

18

Frye, David Carl. "Heuristic robustness in capital rationing with uncertain data." Diss., Georgia Institute of Technology, 1999. http://hdl.handle.net/1853/30761.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Skidmore, Gerald. "Metaheuristics and combinatorial optimization problems /." Online version of thesis, 2006. https://ritdml.rit.edu/dspace/handle/1850/2319.

Full text

APA, Harvard, Vancouver, ISO, and other styles

20

Bader-El-Den, Mohamed Bahr. "Investigation of genetic programming as a hyper-heuristic for combinatorial optimization." Thesis, University of Essex, 2009. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.510512.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Han, Mengjie. "Heuristic optimization of the p-median problem and population re-distribution." Doctoral thesis, Högskolan Dalarna, Statistik, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:du-13255.

Full text

Abstract:

This thesis contributes to the heuristic optimization of the p-median problem and Swedish population redistribution. The p-median model is the most representative model in the location analysis. When facilities are located to a population geographically distributed in Q demand points, the p-median model systematically considers all the demand points such that each demand point will have an effect on the decision of the location. However, a series of questions arise. How do we measure the distances? Does the number of facilities to be located have a strong impact on the result? What scale of

APA, Harvard, Vancouver, ISO, and other styles

22

Murray, Angus. "Modelling and heuristic optimization of a hydrogen producing renewable energy system." Thesis, University of Aberdeen, 2013. http://digitool.abdn.ac.uk:80/webclient/DeliveryManager?pid=202138.

Full text

Abstract:

The reliable supply of hydrogen to a vehicle re-fuelling station has been tackled in this thesis. A currently operational system based on supplying energy from a bio-generator, fuelled from biogas generated by organic matter in an Anaerobic Digester, formed the basis of an expanded renewable energy system. The criterion for the new design was the supply of energy to an electrolyser/compressor/storage system at minimum cost and minimum interruption to supply. By separating hydrogen production from energy generation, the operating parameters of the electrolyser and compressor were optimized, lea

APA, Harvard, Vancouver, ISO, and other styles

23

Chandrika, Vedurmudi Shruti. "A Simulation Based Inventory Optimization Heuristic for a Retail Supply Chain." University of Cincinnati / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1439309194.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Lam, Yun-sang Albert, and 林潤生. "Theory of optimization and a novel chemical reaction-inspired metaheuristic." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 2009. http://hub.hku.hk/bib/B4322412X.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

26

Lam, Yun-sang Albert. "Theory of optimization and a novel chemical reaction-inspired metaheuristic." Click to view the E-thesis via HKUTO, 2009. http://sunzi.lib.hku.hk/hkuto/record/B4322412X.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Henderson, Dale Lawrence. "Heuristic and Exact Techniques for Solving a Temperature Estimation Model." Diss., Tucson, Arizona : University of Arizona, 2005. http://etd.library.arizona.edu/etd/GetFileServlet?file=file:///data1/pdf/etd/azu%5Fetd%5F1396%5F1%5Fm.pdf&type=application/pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

Henderson, Dale L. "Heuristic and exact techniques for solving a temperature estimation model /." Find on the web, 2005. http://etd.library.arizona.edu/etd/GetFileServlet?file=file:///data1/pdf/etd/azu%5Fetd%5F1396%5F1%5Fm.pdf&type=application/pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Singley, Andrew M. "Heuristic solution methods for the 1-dimensional and 2-dimensional mastermind problem." [Gainesville, Fla.] : University of Florida, 2005. http://purl.fcla.edu/fcla/etd/UFE0010554.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

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

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

31

Tang, Jiqing. "A Lagrangian heuristic for winner determination problem in combinatorial auctions /." View abstract or full-text, 2004. http://library.ust.hk/cgi/db/thesis.pl?IEEM%202004%20TANG.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Oremland, Matthew Scott. "Techniques for mathematical analysis and optimization of agent-based models." Diss., Virginia Tech, 2014. http://hdl.handle.net/10919/25138.

Full text

Abstract:

Agent-based models are computer simulations in which entities (agents) interact with each other and their environment according to local update rules. Local interactions give rise to global dynamics. These models can be thought of as in silico laboratories that can be used to investigate the system being modeled. Optimization problems for agent-based models are problems concerning the optimal way of steering a particular model to a desired state. Given that agent-based models have no rigorous mathematical formulation, standard analysis is difficult, and traditional mathematical approaches are

APA, Harvard, Vancouver, ISO, and other styles

33

Liao, Tianjun. "Population-based heuristic algorithms for continuous and mixed discrete-continuous optimization problems." Doctoral thesis, Universite Libre de Bruxelles, 2013. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/209439.

Full text

Abstract:

Continuous optimization problems are optimization problems where all variables<p>have a domain that typically is a subset of the real numbers; mixed discrete-continuous<p>optimization problems have additionally other types of variables, so<p>that some variables are continuous and others are on an ordinal or categorical<p>scale. Continuous and mixed discrete-continuous problems have a wide range<p>of applications in disciplines such as computer science, mechanical or electrical<p>engineering, economics and bioinformatics. These problems are also often hard to<p>solve due to their inherent diffi

APA, Harvard, Vancouver, ISO, and other styles

34

Na, Sungsoo. "A Heuristic Approach to a Portfolio Optimization Model with Nonlinear Transaction Costs." NCSU, 2008. http://www.lib.ncsu.edu/theses/available/etd-04242008-122235/.

Full text

Abstract:

In this thesis we extend the Markowitz Mean-Variance model to a rebalancing portfolio optimization problem incorporating realistic considerations such as transaction costs and a risk-free asset with short-selling allowed, and we apply the Tabu Search (TS) heuristic to solve practical portfolio problems. First of all, we propose a biobjective portfolio optimization model which we expect to yield a portfolio equilibrium by combining the two objectives: maximize the portfolioâs expected return and minimize its risk. For realistic portfolio problems we consider the multi-objective portfolio optimi

APA, Harvard, Vancouver, ISO, and other styles

35

Zambrano, Abad Julio Cesar. "Identification of nonlinear processes based on Wiener-Hammerstein models and heuristic optimization." Doctoral thesis, Universitat Politècnica de València, 2021. http://hdl.handle.net/10251/171739.

Full text

Abstract:

[ES] En muchos campos de la ingeniería los modelos matemáticos son utilizados para describir el comportamiento de los sistemas, procesos o fenómenos. Hoy en día, existen varias técnicas o métodos que pueden ser usadas para obtener estos modelos. Debido a su versatilidad y simplicidad, a menudo se prefieren los métodos de identificación de sistemas. Por lo general, estos métodos requieren la definición de una estructura y la estimación computacional de los parámetros que la componen utilizando un conjunto de procedimientos y mediciones de las señales de entrada y salida del sistema. En el conte

APA, Harvard, Vancouver, ISO, and other styles

36

Samarghandi, Hamed. "Scheduling optimization of manufacturing systems with no-wait constraints." International Journal of Industrial Engineering, 2011. http://hdl.handle.net/1993/21709.

Full text

Abstract:

No-wait scheduling problem refers to the set of problems in which a number of jobs are available for processing on a number of machines with the added constraint that there should be no waiting time between consecutive operations of the jobs. It is well-known that most of the no-wait scheduling problems are strongly NP-hard. Moreover, no-wait scheduling problems have numerous real-life applications. This thesis studies a wide range of no-wait scheduling problems, along with side constraints that make such problems more applicable. First, 2-machine no-wait flow shop problem is studied. Afterwar

APA, Harvard, Vancouver, ISO, and other styles

37

Urbani, Michele. "Maintenance policies optimization in the Industry 4.0 paradigm." Doctoral thesis, Università degli studi di Trento, 2021. http://hdl.handle.net/11572/323269.

Full text

Abstract:

Maintenance management is a relevant issue in modern technical systems due to its financial, safety, and environmental implications. The need to rely on physical assets makes maintenance a necessary evil, which, on the other hand, allows achieving a high quality of end products, or services, and a safety level that is adequate for the regulatory requirements. The advent of the fourth industrial revolution offers meaningful opportunities to improve maintenance management; technologies such as Cyber-Physical Systems, the Internet of Things, and cloud computing enable realizing modern infrastruct

APA, Harvard, Vancouver, ISO, and other styles

38

Pavski, Johann Joachim. "Handover Optimization in GSM." Thesis, Linköpings universitet, Optimeringslära, 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-123445.

Full text

Abstract:

In telecommunications in general and in GSM in particular, the handover is a feature that guarantees a smooth transition of a call from one base station - that is for the purpose of this project an antenna - to another. In the recent ten years, the amount of data traffic through mobile telecommunications has doubled annually, putting an enormous strain on the network and forcing operators to upgrade with more and more base stations and new features. Although 3G and 4G are responsible for data traffic in most countries, GSM still provides more than 80% of the coverage for mobile devices around

APA, Harvard, Vancouver, ISO, and other styles

39

RONCO, ROBERTO. "Exact and Heuristic Algorithms for Energy-Efficient Scheduling." Doctoral thesis, Università degli studi di Genova, 2022. http://hdl.handle.net/11567/1068456.

Full text

Abstract:

The combined increase of energy demand and environmental pollution at a global scale is entailing a rethinking of the production models in sustainable terms. As a consequence, energy suppliers are starting to adopt strategies that flatten demand peaks in power plants by means of pricing policies that stimulate a change in the consumption practices of customers. A representative example is the Time-of-Use (TOU)-based tariffs policy, which encourages electricity usage at off-peak hours by means of low prices, while penalizing peak hours with higher prices. To avoid a sharp increment of the ener

APA, Harvard, Vancouver, ISO, and other styles

40

Assis, Laura Silva de 1983. "Problema de reagrupamento capacitado." [s.n.], 2009. http://repositorio.unicamp.br/jspui/handle/REPOSIP/259714.

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-14T08:51:37Z (GMT). No. of bitstreams: 1 Assis_LauraSilvade_M.pdf: 1632808 bytes, checksum: dfd28dc2bbd2bb5fe453a2fb1c2b7b6e (MD5) Previous issue date: 2009<br>Resumo: O objetivo desta dissertação é desenvolver uma metodologia eficiente para solucionar o problema de agrupamento capacitado multicritério (PACM), no qual objetos com pesos associados são dados, os quais devem ser particionados em agrupamentos com

APA, Harvard, Vancouver, ISO, and other styles

41

Saleh, Sagvan Ali. "Contribution à la résolution des problèmes combinatoires : optimisation séquentielle et parallèle." Thesis, Amiens, 2015. http://www.theses.fr/2015AMIE0010/document.

Full text

Abstract:

Les problèmes d’optimisation combinatoire sont d’un grand intérêt à la fois pour le monde scientifique et le monde industriel. La communauté scientifique a oeuvré pour la simplification de certains problèmes issus du monde industriel vers des modèles d’optimisation combinatoire. Parmi ces problèmes, on peut trouver des problèmes appartenant à la famille du problème du sac à dos (knapsack). Dans cette thèse, nous considérons une variante du problème du sac à dos : le problème du sac à dos avec des contraintes disjonctives (Knapsack with Disjunctive Constraints). En raison de la difficulté de ce

APA, Harvard, Vancouver, ISO, and other styles

42

Hornig, Klaus H. Flowers George T. "Heuristic optimization methods for the characterization of dynamic mechanical properties of composite materials." Auburn, Ala., 2007. http://repo.lib.auburn.edu/2006%20Fall/Dissertations/HORNIG_KLAUS_7.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

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

44

Fors, Mikael, and Madelen Hermelin. "The Difficulty of Designing a General Heuristic Agent Navigation Strategy." Thesis, Uppsala universitet, Informationssystem, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-154690.

Full text

Abstract:

We consider an abstract representation of some environment in which an agent is located. Given a goal sequence, we ask what strategy said agent - utilizing readily available algorithmic tools - should incorporate to successfully find a valid traversal route such that it is optimal in accordance with a predefined error-margin. We present four scenarios that each incorporate aspects common to general navigation to further illustrate some of the difficult problems needed to be solved in any general navigation strategy. Two reinforcement learning and four graph path planning algorithms are studied

APA, Harvard, Vancouver, ISO, and other styles

45

Prado, Daniel Fernando Mechlin. "Busca Tabu aplicada ao problema de localização de facilidades com restrições de capacidade e fonte unica." [s.n.], 2007. http://repositorio.unicamp.br/jspui/handle/REPOSIP/259932.

Full text

Abstract:

Orientador: Vinicius Amaral Armentano<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação<br>Made available in DSpace on 2018-08-09T05:53:35Z (GMT). No. of bitstreams: 1 Prado_DanielFernandoMechlin_M.pdf: 451492 bytes, checksum: 0350938f30a018718f3b59654e155a93 (MD5) Previous issue date: 2007<br>Resumo: Localização de facilidades é uma das atividades da área de logística que envolve decisões do número, localização e tamanho das facilidades a serem usadas. A localização de facilidades é uma questão central no planejamento estratégico

APA, Harvard, Vancouver, ISO, and other styles

46

Fink, Claudia. "O problema de minimização de pilhas abertas - novas contribuições." Universidade de São Paulo, 2012. http://www.teses.usp.br/teses/disponiveis/55/55134/tde-19022013-084858/.

Full text

Abstract:

O Problema de Minimização do Número Máximo de Pilhas Abertas (MOSP, do inglês minimization of open stacks problem) é um problema de otimização combinatória da família NP-Difícil que vem recebendo grande atenção na literatura especializada. Este trabalho apresenta novas contribuições em termos de modelos e técnicas de resolução para o problema. A primeira parte deste trabalho lidou com modelos matemáticos, sendo analisados os modelos existentes que se baseiam em programação inteira mista. Variações de um modelo da literatura foram propostas, com o objetivo de tentar diminuir o tempo de execução

APA, Harvard, Vancouver, ISO, and other styles

47

Duarte, Tiago Miguel Mendonça. "Escalonamento de provas de avaliação : uma aplicação." Master's thesis, Instituto Superior de Economia e Gestão, 2017. http://hdl.handle.net/10400.5/14790.

Full text

Abstract:

Mestrado em Métodos Quantitativos para a Decisão Económica e Empresarial<br>O presente projeto reside na criação, em parceria com a Secretaria das Licenciaturas do ISEG, de uma plataforma para o escalonamento de todas as provas escritas das Licenciaturas. Para facilitar a utilização da plataforma, houve um cuidado particular em reproduzir o procedimento manual, no processo automático. Esta ferramenta, a ser aplicada na secretaria do ISEG, permite otimizar o escalonamento das provas aplicando métodos que observam as regras impostas pelo regulamento de avaliação. A plataforma desenvolvida permi

APA, Harvard, Vancouver, ISO, and other styles

48

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

49

Cronsioe, Carl. "Optimization of Quality in Home Care." Thesis, KTH, Optimeringslära och systemteori, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-209671.

Full text

Abstract:

As the older population grows larger there is a growing need to provide health care at home. This services are generally done without operational research. As more people will require home care there will be a need to increase the efficiency of the service while keeping the quality high. The purpose of this thesis is to investigate how we can use operation research in home care as well as define how we can model the quality and use those quality parameters in order to offer the best possible service. The model uses VRP with Time windows in order to schedule the routes and incorporates service

APA, Harvard, Vancouver, ISO, and other styles

50

Nowak, Maciek A. "The Pickup and Delivery Problem with Split Loads." Diss., Georgia Institute of Technology, 2005. http://hdl.handle.net/1853/7223.

Full text

Abstract:

This dissertation focuses on improvements in vehicle routing that can be gained by allowing multiple vehicles to service a common load. We explore how costs can be reduced through the elimination of the constraint that a load must be serviced by only one vehicle. Specifically, we look at the problem of routing vehicles to service loads that have distinct origins and destinations, with no constraint on the amount of a load that a vehicle may service. We call this the Pickup and Delivery Problem with Split Loads (PDPSL). We model this problem as a dynamic program and introduce structural res

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!