Thematische Bibliographien / Heuristic

Inhaltsverzeichnis

  1. Zeitschriftenartikel
  2. Dissertationen
  3. Bücher
  4. Buchteile
  5. Konferenzberichte
  6. Berichte der Organisationen

Auswahl der wissenschaftlichen Literatur zum Thema „Heuristic“

Autor: Grafiati
Veröffentlicht am 4. Juni 2021
Zuletzt aktualisiert am 31. Juli 2024

Geben Sie eine Quelle nach APA, MLA, Chicago, Harvard und anderen Zitierweisen an

Wählen Sie eine Art der Quelle aus:

Machen Sie sich mit den Listen der aktuellen Artikel, Bücher, Dissertationen, Berichten und anderer wissenschaftlichen Quellen zum Thema "Heuristic" bekannt.

Neben jedem Werk im Literaturverzeichnis ist die Option "Zur Bibliographie hinzufügen" verfügbar. Nutzen Sie sie, wird Ihre bibliographische Angabe des gewählten Werkes nach der nötigen Zitierweise (APA, MLA, Harvard, Chicago, Vancouver usw.) automatisch gestaltet.

Sie können auch den vollen Text der wissenschaftlichen Publikation im PDF-Format herunterladen und eine Online-Annotation der Arbeit lesen, wenn die relevanten Parameter in den Metadaten verfügbar sind.

Zeitschriftenartikel zum Thema "Heuristic"

1

Sanggala, Ekra, und Muhammad Ardhya Bisma. „Perbandingan Savings Algorithm dengan Nearest Neighbour dalam Menyelesaikan Russian TSP Instances“. Jurnal Media Teknik dan Sistem Industri 7, Nr. 1 (31.03.2023): 27. http://dx.doi.org/10.35194/jmtsi.v7i1.3039.

Der volle Inhalt der Quelle
Annotation:
Travelling Salesman Problem (TSP) is the problem for finding the shortest route starting from start node then visiting number of nodes exactly once and finally go back to start node. Several heuristics are popular for solving TSP, for example Savings Algorithm and Nearest Neighbour. Performance heuristics on solving TSP are diverse, so there is need of reference for choosing a heuristic. Comparing heuristics on solving instance can be a reference for choosing a heuristic. This paper will discuss about comparison Savings Algorithm and Nearest Neighbour on Solving Russian TSP Instances. For generating length of route, Savings Algorithm is better than Nearest Neighbour, while for generating CPU time, Nearest Neighbour is better than Savings Algorithm. Travelling Salesman Problem (TSP) merupakan permasalahan penentuan rute terpendek yang diawali dari titik start untuk mengunjungi sekumpulan titik tepat sekali dan diakhiri dengan kembali ke titik start. Beberapa Heuristik yang cukup populer untuk menyelesaikan TSP antara lain Savings Algorithm dan Nearest Neighbour. Kemampuan Heuristik dalam menyelesaikan TSP berbeda-beda, sehingga diperlukan sebuah acuan untuk menentukan Heuristik yang akan digunakan. Membandingkan Heuristik dalam menyelesaikan instance dapat menjadi acuan untuk pemilihan Heuristik. Pada paper ini akan dibahas mengenai perbandingan Savings Algorithm dan Nearest Neighbour dalam menyelesaikan Russian TSP Instances. Untuk panjang rute yang dihasilkan, maka Savings Algorithm lebih baik dibandingkan Nearest Neighbour, sedangkan untuk CPU Time yang dihasilkan, maka Nearest Neighbour lebih baik dibandingkan Savings Algorithm.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Seipp, Jendrik. „Better Orders for Saturated Cost Partitioning in Optimal Classical Planning“. Proceedings of the International Symposium on Combinatorial Search 8, Nr. 1 (01.09.2021): 149–53. http://dx.doi.org/10.1609/socs.v8i1.18438.

Der volle Inhalt der Quelle
Annotation:
Cost partitioning is a general method for adding multiple heuristic values admissibly. In the setting of optimal classical planning, saturated cost partitioning has recently been shown to be the cost partitioning algorithm of choice for pattern database heuristics found by hill climbing, systematic pattern database heuristics and Cartesian abstraction heuristics. To evaluate the synergy of the three heuristic types, we compute the saturated cost partitioning over the combined sets of heuristics and observe that the resulting heuristic is outperformed by the heuristic that simply maximizes over the three saturated cost partitioning heuristics computed separately for each heuristic type. Our new algorithm for choosing the orders in which saturated cost partitioning considers the heuristics allows us to compute heuristics outperforming not only the maximizing heuristic but even state-of-the-art planners.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Wilt, Christopher, und Wheeler Ruml. „Effective Heuristics for Suboptimal Best-First Search“. Journal of Artificial Intelligence Research 57 (31.10.2016): 273–306. http://dx.doi.org/10.1613/jair.5036.

Der volle Inhalt der Quelle
Annotation:
Suboptimal heuristic search algorithms such as weighted A* and greedy best-first search are widely used to solve problems for which guaranteed optimal solutions are too expensive to obtain. These algorithms crucially rely on a heuristic function to guide their search. However, most research on building heuristics addresses optimal solving. In this paper, we illustrate how established wisdom for constructing heuristics for optimal search can fail when considering suboptimal search. We consider the behavior of greedy best-first search in detail and we test several hypotheses for predicting when a heuristic will be effective for it. Our results suggest that a predictive characteristic is a heuristic's goal distance rank correlation (GDRC), a robust measure of whether it orders nodes according to distance to a goal. We demonstrate that GDRC can be used to automatically construct abstraction-based heuristics for greedy best-first search that are more effective than those built by methods oriented toward optimal search. These results reinforce the point that suboptimal search deserves sustained attention and specialized methods of its own.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Ursani, Ziauddin, und David W. Corne. „Introducing Complexity Curtailing Techniques for the Tour Construction Heuristics for the Travelling Salesperson Problem“. Journal of Optimization 2016 (2016): 1–15. http://dx.doi.org/10.1155/2016/4786268.

Der volle Inhalt der Quelle
Annotation:
In this paper, complexity curtailing techniques are introduced to create faster version of insertion heuristics, that is, cheapest insertion heuristic (CIH) and largest insertion heuristic (LIH), effectively reducing their complexities fromO(n3)toO(n2)with no significant effect on quality of solution. This paper also examines relatively not very known heuristic concept of max difference and shows that it can be culminated into a full-fledged max difference insertion heuristic (MDIH) by defining its missing steps. Further to this the paper extends the complexity curtailing techniques to MDIH to create its faster version. The resultant heuristic, that is, fast max difference insertion heuristic (FMDIH), outperforms the “farthest insertion” heuristic (FIH) across a wide spectrum of popular datasets with statistical significance, even though both the heuristics have the same worst case complexity ofO(n2). It should be noted that FIH is considered best among lowest order complexity heuristics. The complexity curtailing techniques presented here open up the new area of research for their possible extension to other heuristics.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Shperberg, Shahaf, Ariel Felner, Lior Siag und Nathan R. Sturtevant. „On the Properties of All-Pair Heuristics“. Proceedings of the International Symposium on Combinatorial Search 17 (01.06.2024): 127–33. http://dx.doi.org/10.1609/socs.v17i1.31550.

Der volle Inhalt der Quelle
Annotation:
While most work in heuristic search concentrates on goal-specific heuristics, which estimate the shortest path cost from any state to the goal, we explore all-pair heuristics that estimate distances between all pairs of states. We examine the relationship between these heuristic functions and the shortest distance function they estimate, revealing that all-pair consistent heuristics may violate the triangle inequality. Thus, we introduce a new property for heuristics called Δ-consistency, requiring adherence to the triangle inequality. Additionally, we present a method for transforming standard consistent heuristics to be Δ-consistent, showcasing its benefits through a synthetic example. We then show that common heuristic families inherently exhibit Δ-consistency. This positive finding encourages the use of all-pair consistent heuristics, and prompts further investigation into the optimality of A*, when given an all-pair heuristic instead of a goal-specific heuristic.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Chen, Dillon Z., und Sylvie Thiébaux. „Novelty Heuristics, Multi-Queue Search, and Portfolios for Numeric Planning“. Proceedings of the International Symposium on Combinatorial Search 17 (01.06.2024): 203–7. http://dx.doi.org/10.1609/socs.v17i1.31559.

Der volle Inhalt der Quelle
Annotation:
Heuristic search is a powerful approach for solving planning problems and numeric planning is no exception. In this paper, we boost the performance of heuristic search for numeric planning with various powerful techniques orthogonal to improving heuristic informedness: numeric novelty heuristics, the Manhattan distance heuristic, and exploring the use of multi-queue search and portfolios for combining heuristics.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Özcan, Ender, Mustafa Misir, Gabriela Ochoa und Edmund K. Burke. „A Reinforcement Learning - Great-Deluge Hyper-Heuristic for Examination Timetabling“. International Journal of Applied Metaheuristic Computing 1, Nr. 1 (Januar 2010): 39–59. http://dx.doi.org/10.4018/jamc.2010102603.

Der volle Inhalt der Quelle
Annotation:
Hyper-heuristics can be identified as methodologies that search the space generated by a finite set of low level heuristics for solving search problems. An iterative hyper-heuristic framework can be thought of as requiring a single candidate solution and multiple perturbation low level heuristics. An initially generated complete solution goes through two successive processes (heuristic selection and move acceptance) until a set of termination criteria is satisfied. A motivating goal of hyper-heuristic research is to create automated techniques that are applicable to a wide range of problems with different characteristics. Some previous studies show that different combinations of heuristic selection and move acceptance as hyper-heuristic components might yield different performances. This study investigates whether learning heuristic selection can improve the performance of a great deluge based hyper-heuristic using an examination timetabling problem as a case study.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Kuroiwa, Ryo, Alexander Shleyfman, Chiara Piacentini, Margarita P. Castro und J. Christopher Beck. „LM-cut and Operator Counting Heuristics for Optimal Numeric Planning with Simple Conditions“. Proceedings of the International Conference on Automated Planning and Scheduling 31 (17.05.2021): 210–18. http://dx.doi.org/10.1609/icaps.v31i1.15964.

Der volle Inhalt der Quelle
Annotation:
We consider optimal numeric planning with numeric conditions consisting of linear expressions of numeric state variables and actions that increase or decrease numeric state variables by constant quantities. We build on previous research to introduce a new variant of the numeric hmax heuristic based on the delete-relaxed version of such planning tasks. Although our hmax heuristic is inadmissible, it yields a numeric version of the classical LM-cut heuristic which is admissible. Further, we prove that our LM-cut heuristic neither dominates nor is dominated by the existing numeric heuristic hmax(hbd). We show that admissibility also holds when integrating the numeric cuts into the operator-counting (OC) heuristic producing an admissible numeric version of the OC heuristic. Through experiments, we demonstrate that both these heuristics compete favorably with the state-of-the-art heuristics: in particular, while sometimes expanding more nodes than other heuristics, numeric OC solves 19 more problem instances than the next closest heuristic.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

BOUZY, BRUNO. „HISTORY AND TERRITORY HEURISTICS FOR MONTE CARLO GO“. New Mathematics and Natural Computation 02, Nr. 02 (Juli 2006): 139–46. http://dx.doi.org/10.1142/s1793005706000427.

Der volle Inhalt der Quelle
Annotation:
Recently, the Monte Carlo approach has been applied to computer go with promising success. INDIGO uses such an approach which can be enhanced with specific heuristics. This paper assesses two heuristics within the 19 × 19 Monte Carlo go framework of INDIGO: the territory heuristic and the history heuristic, both in their internal and external versions. The external territory heuristic is more effective, leading to a 40-point improvement on 19 × 19 boards. The external history heuristic brings about a 10-point improvement. The internal territory heuristic yields a few points improvement, and the internal history heuristic has already been assessed on 19 × 19 boards in previous publications. Most of these heuristics were used by INDIGO at the 2004 Computer Olympiad.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Wilt, Christopher, und Wheeler Ruml. „Speedy Versus Greedy Search“. Proceedings of the International Symposium on Combinatorial Search 5, Nr. 1 (01.09.2021): 184–92. http://dx.doi.org/10.1609/socs.v5i1.18320.

Der volle Inhalt der Quelle
Annotation:
In work on satisficing search, there has been substantial attention devoted to how to solve problems associated with local minima or plateaus in the heuristic function. One technique that has been shown to be quite promising is using an alternative heuristic function that does not estimate cost-to-go, but rather estimates distance-to-go. Empirical results generally favor using the distance-to-go heuristic over the cost-to-go heuristic, but there is currently little beyond intuition to explain the difference. We begin by empirically showing that the success of the distance-to-go heuristic appears related to its having smaller local minima. We then discuss a reasonable theoretical model of heuristics and show that, under this model, the expected size of local minima is higher for a cost- to-go heuristic than a distance-to-go heuristic, offering a possible explanation as to why distance-to-go heuristics tend to outperform cost-to-go heuristics.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Dissertationen zum Thema "Heuristic"

1

Peake, Katharine Louise. „Composition heuristics and theories and a proposed heuristic for business writing“. CSUSB ScholarWorks, 2007. https://scholarworks.lib.csusb.edu/etd-project/3282.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Ambrogi, Timothy. „Heuristic counterpoint“. Diss., Connect to the thesis, 2004. http://hdl.handle.net/10066/1484.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Murthy, Sapna Guniguntla. „Disaster recovery heuristic : a mapping heuristic for optimum retrieval /“. Online version of thesis, 2009. http://hdl.handle.net/1850/10733.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

GUTIERRES, RICARDO. „ADAPTIVE HEURISTIC CONTROLLERS“. PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 1991. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=9409@1.

Der volle Inhalt der Quelle
Annotation:
CENTRO DE PESQUISAS LEOPOLDO AMÉRICO MIGUEZ DE MELLO
Um controlador Heurístico Adaptativo baseia-se num conjunto de regras lingüísticas para conduzir um processo com modelo impreciso ou complexo ao estado desejado. O comportamento do processo deve respeitar os requisitos de performance predefinidos. Para satisfazer estes objetivos, a estrutura interna do controle sofre mudanças para adequá- la as condições vigentes no processo. Os métodos de adaptação abordados consideram a modificação de uma estrutura matricial interpretada como as correções incrementais, compatíveis com os ajustes a serem efetuados sobre o processo, ou como regras, constituídas por variáveis nebulosas, que requerem manipulações adicionais para produzir a saída do controlador. Em qualquer dos casos, a adaptação é realizada a partir de uma Tabela de Índices de Performance. Para facilitar a sua obtenção é implementado um procedimento, que fornece a representação matricial das regras lingüísticas, concatenadas na forma de um Algoritmo Lingüístico de Controle. O comportamento dinâmico do Sistema, composto pelos Controladores Heurísticos e por processos com modelos distintos, é considerado para Tabelas de índices de Performance com várias dimensões. As regras lingüísticas, correlacionadas com estas tabelas, foram elaboradas com diversas classes de atributos. As simulações realizadas concentram-se sobre os parâmetros dos controladores, que influenciam significativa- Os estudos abordam também o comportamento da estrutura interna destes controladores e o seu desempenho em termos da velocidade de atuação sobre o processo.
A heuristic Controller uses a set of linguistic rules, which are derived from expertise or human operators´ skills, in order to achieve control of processes that have inaccurate or complex models. An adaptative Heuristic Controller adjusts the set of rules in an automatic and continuous way, aiming to achieve prescribed objectives indicated by a performance measure. The adaptative procedures modify a matrix, the elements of which are either incremental corrections or numeric rules associated with fuzzy variables. In both cases a Performance Index Table and a learning method are employed to correct that matrix. The Performance Table is a matrix calculated from a set of linguistic rules. The controllers are implemented with different Performance Tables, considering various sets of linguistic values and quantization levels. The dynamic behaviour of overdamped and underdamped processes is investigated. The performance of simulated systems is analyzed with respect to relevant parameters that affect their behaviour.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Perry, Kristine. „Heuristic weighted voting /“. Diss., CLICK HERE for online access, 2007. http://contentdm.lib.byu.edu/ETD/image/etd2120.pdf.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Monteith, Kristine Perry. „Heuristic Weighted Voting“. BYU ScholarsArchive, 2007. https://scholarsarchive.byu.edu/etd/1206.

Der volle Inhalt der Quelle
Annotation:
Selecting an effective method for combining the votes of classifiers in an ensemble can have a significant impact on the overall classification accuracy an ensemble is able to achieve. With some methods, the ensemble cannot even achieve as high a classification accuracy as the most accurate individual classifying component. To address this issue, we present the strategy of Heuristic Weighted Voting, a technique that uses heuristics to determine the confidence that a classifier has in its predictions on an instance by instance basis. Using these heuristics to weight the votes in an ensemble results in an overall average increase in classification accuracy over when compared to the most accurate classifier in the ensemble. When considering performance over 18 data sets, Heuristic Weighted Voting compares favorably both in terms of average classification accuracy and algorithm-by-algorithm comparisons in accuracy when evaluated against three baseline ensemble creation strategies as well as the methods of stacking and arbitration.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Silva, Renato Teixeira da [UNESP]. „Aplicação de meta-heurísticas na resolução do problema de balanceamento e designação de trabalhadores com deficiência em linha de produção“. Universidade Estadual Paulista (UNESP), 2012. http://hdl.handle.net/11449/93081.

Der volle Inhalt der Quelle
Annotation:
Made available in DSpace on 2014-06-11T19:26:18Z (GMT). No. of bitstreams: 0 Previous issue date: 2012-10-26Bitstream added on 2014-06-13T19:33:57Z : No. of bitstreams: 1 silva_rt_me_guara.pdf: 445223 bytes, checksum: f6563e16194940a8f4f8abc7c03ac033 (MD5)
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
A Organização Internacional do Trabalho estima que existem cerca de 650 milhões de pessoas com deficiência em idade produtiva. No entanto, esta parcela da população possui altos índices de desemprego devido a várias barreiras. Uma alternativa para facilitar a inclusão dessas pessoas é a criação de Centros de Trabalho para pessoas com Deficiência (CTD`s) onde as pessoas com deficiência tenham a oportunidade de experimentar um ambiente de trabalho real antes de irem para um emprego “normal”. Neste tipo de ambiente, onde é impossível ao gestor prever quais trabalhadores estarão disponíveis a cada dia devido às altas taxas de absenteísmo, há a necessidade de se definir uma organização mais produtiva diariamente. Neste contexto se torna oportuna a utilização do Problema de Balanceamento de Linha e Designação de Trabalhadores (em inglês ALWABP), onde se busca minimizar o tempo de ciclo a partir de um dado número de trabalhadores, alocando tarefas às estações de trabalho e trabalhadores às estações, tendo em vista que alguns trabalhadores podem ser muito lentos para executar certas tarefas ou até incapazes, devido a alguma deficiência que eles apresentam, e muito eficientes na execução de outras. O objetivo geral desta dissertação consiste em empregar diferentes meta-heurísticas para resolver o ALWABP, comparando com os melhores resultados das instâncias encontradas na literatura. Dentre várias meta-heurísticas disponíveis na literatura foram utilizados o Harmony Search (HS), o Adaptive Large Neighborhood Search (ALNS) e o Clustering Search (CS) utilizando o HS e o ALNS como heurísticas geradoras de soluções. Cada uma das quatro implementações foram testadas em 320 instâncias propostas na literatura divididas em quatro famílias. Os experimentos computacionais mostraram bons resultados...
The International Labour Organization estimates that there are approximately 650 million disabled people in working age. However, this population presents high rates of unemployment due to numerous barriers. An alternative to facilitate the inclusion of these people is the establishment of Centers for Working People with Disabilities where people with disabilities have the opportunity to experience a real work environment before going to a “normal” job. In this type of environment, where it is impossible to predict which workers will be available each day due to high rates of absence in this population, there is a need to define a more productive organization on a daily basis. In this context it becomes appropriate to use the Assembly Line Worker Assignment and Balancing Problem (ALWABP), which seeks to minimize the cycle time for a given number of workers, assigning tasks to workstations and workers to stations, considering that some workers may be too slow to perform certain tasks, or even unable due to some deficiency they present, and very efficient in performing others. The aim of this dissertation is to employ different meta-heuristics to solve the ALWABP, comparing with the best results of instances found in the literature. Among several meta-heuristics available in the literature were used Harmony Search (HS), Adaptive Large Neighborhood Search (ALNS) and Clustering Search (CS) using the HS and ALNS as heuristics for the generation of solutions. Each of the four implementations has been tested in 320 instances proposed in the literature, classified into four families. The computational experiments showed good results, and in some instances obtaining better solution values best known. Conclusions regarding... (Complete abstract click electronic access below)
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Silva, Renato Teixeira da. „Aplicação de meta-heurísticas na resolução do problema de balanceamento e designação de trabalhadores com deficiência em linha de produção /“. Guaratinguetá : [s.n.], 2012. http://hdl.handle.net/11449/93081.

Der volle Inhalt der Quelle
Annotation:
Orientador: Galeno José de Sena
Banca: Marcos Antonio Pereira
Banca: Anibal Tavares de Azevedo
Resumo: A Organização Internacional do Trabalho estima que existem cerca de 650 milhões de pessoas com deficiência em idade produtiva. No entanto, esta parcela da população possui altos índices de desemprego devido a várias barreiras. Uma alternativa para facilitar a inclusão dessas pessoas é a criação de Centros de Trabalho para pessoas com Deficiência (CTD's) onde as pessoas com deficiência tenham a oportunidade de experimentar um ambiente de trabalho real antes de irem para um emprego "normal". Neste tipo de ambiente, onde é impossível ao gestor prever quais trabalhadores estarão disponíveis a cada dia devido às altas taxas de absenteísmo, há a necessidade de se definir uma organização mais produtiva diariamente. Neste contexto se torna oportuna a utilização do Problema de Balanceamento de Linha e Designação de Trabalhadores (em inglês ALWABP), onde se busca minimizar o tempo de ciclo a partir de um dado número de trabalhadores, alocando tarefas às estações de trabalho e trabalhadores às estações, tendo em vista que alguns trabalhadores podem ser muito lentos para executar certas tarefas ou até incapazes, devido a alguma deficiência que eles apresentam, e muito eficientes na execução de outras. O objetivo geral desta dissertação consiste em empregar diferentes meta-heurísticas para resolver o ALWABP, comparando com os melhores resultados das instâncias encontradas na literatura. Dentre várias meta-heurísticas disponíveis na literatura foram utilizados o Harmony Search (HS), o Adaptive Large Neighborhood Search (ALNS) e o Clustering Search (CS) utilizando o HS e o ALNS como heurísticas geradoras de soluções. Cada uma das quatro implementações foram testadas em 320 instâncias propostas na literatura divididas em quatro famílias. Os experimentos computacionais mostraram bons resultados... (Resumo completo, clicar acesso eletrônico abaixo)
Abstract: The International Labour Organization estimates that there are approximately 650 million disabled people in working age. However, this population presents high rates of unemployment due to numerous barriers. An alternative to facilitate the inclusion of these people is the establishment of Centers for Working People with Disabilities where people with disabilities have the opportunity to experience a real work environment before going to a "normal" job. In this type of environment, where it is impossible to predict which workers will be available each day due to high rates of absence in this population, there is a need to define a more productive organization on a daily basis. In this context it becomes appropriate to use the Assembly Line Worker Assignment and Balancing Problem (ALWABP), which seeks to minimize the cycle time for a given number of workers, assigning tasks to workstations and workers to stations, considering that some workers may be too slow to perform certain tasks, or even unable due to some deficiency they present, and very efficient in performing others. The aim of this dissertation is to employ different meta-heuristics to solve the ALWABP, comparing with the best results of instances found in the literature. Among several meta-heuristics available in the literature were used Harmony Search (HS), Adaptive Large Neighborhood Search (ALNS) and Clustering Search (CS) using the HS and ALNS as heuristics for the generation of solutions. Each of the four implementations has been tested in 320 instances proposed in the literature, classified into four families. The computational experiments showed good results, and in some instances obtaining better solution values best known. Conclusions regarding... (Complete abstract click electronic access below)
Mestre
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

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/.

Der volle Inhalt der Quelle
Annotation:
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 customer location, a pickup or a delivery. Applications of the PDP are frequently encountered in every day transportation and logistic services, and the problem is likely to assume even greater prominence in the future, due to the increase in e-commerce and Internet shopping. In this research we considered two particular variants of the PDP, the Pickup and Delivery Problem with Time Windows (PDPTW), and the One-commodity Pickup and Delivery Problem (1-PDP). In both problems, the total transportation cost should be minimized, without violating a number of pre-specified problem constraints. In our research, we investigate heuristic and meta-heuristic approaches for solving the selected PDP variants. Unlike previous research in this area, though, we try to focus on handling the difficult problem constraints in a simple and effective way, without complicating the overall solution methodology. Two main aspects of the solution algorithm are directed to achieve this goal, the solution representation and the neighbourhood moves. Based on this perception, we tailored a number of heuristic and meta-heuristic algorithms for solving our problems. Among these algorithms are: Genetic Algorithms, Simulated Annealing, Hill Climbing and Variable Neighbourhood Search. In general, the findings of the research indicate the success of our approach in handling the difficult problem constraints and devising simple and robust solution mechanisms that can be integrated with vehicle routing optimization tools and used in a variety of real world applications
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

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

Der volle Inhalt der Quelle
Annotation:
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 between main stations. The main objective of this work is to build different heuristic algorithms to solve unexpected delays faced by train dispatchers and to help in making right decisions on steps to take to have reliable and cost effective solution to the problems. These heuristics algorithms proposed were able to help dispatchers in making right decisions when solving train dispatching problems.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Bücher zum Thema "Heuristic"

1

Salhi, Saïd. Heuristic Search. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-49355-8.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Ippoliti, Emiliano, Hrsg. Heuristic Reasoning. Cham: Springer International Publishing, 2015. http://dx.doi.org/10.1007/978-3-319-09159-4.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Tahin, Gábor. Heuristic Rhetoric. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-98482-3.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Nirmal, Arvind P. Heuristic explorations. Madras: Published for Gurukul Lutheran Theological College & Research Institute by Christian Literature Society, 1990.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Clancey, William J. Heuristic classification. [Alexandria, Va.]: DTIC, 1985.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Moustakas, Clark E. Heuristic research: Design, methodology, and applications. Newbury Park: Sage Publications, 1990.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Lappin, Gerald F. Heuristic symbolic integration. [S.l: The Author], 1987.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Dasgupta, Pallab, P. P. Chakrabarti und S. C. DeSarkar. Multiobjective Heuristic Search. Wiesbaden: Vieweg+Teubner Verlag, 1999. http://dx.doi.org/10.1007/978-3-322-86853-4.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Lee, Kwang Y., und Mohamed A. El-Sharkawi, Hrsg. Modern Heuristic Optimization Techniques. Hoboken, NJ, USA: John Wiley & Sons, Inc., 2008. http://dx.doi.org/10.1002/9780470225868.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Hegeman, J. H. Justifying policy: A heuristic. Amsterdam: Free University Press, 1989.

Den vollen Inhalt der Quelle finden
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Mehr Quellen

Buchteile zum Thema "Heuristic"

1

Pirrone, Angelo, Peter C. R. Lane, Laura Bartlett, Noman Javed und Fernand Gobet. „Heuristic Search of Heuristics“. In Artificial Intelligence XL, 407–20. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-47994-6_36.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Gass, Saul I., und Carl M. Harris. „heuristic“. In Encyclopedia of Operations Research and Management Science, 731. New York, NY: Springer US, 2001. http://dx.doi.org/10.1007/1-4020-0611-x_905.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Gass, Saul I., und Carl M. Harris. „heuristic“. In Encyclopedia of Operations Research and Management Science, 731. New York, NY: Springer US, 2001. http://dx.doi.org/10.1007/1-4020-0611-x_906.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Weik, Martin H. „heuristic“. In Computer Science and Communications Dictionary, 721. Boston, MA: Springer US, 2000. http://dx.doi.org/10.1007/1-4020-0613-6_8330.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Xiang, Yao, und Yan Guoli. „Heuristic“. In The ECPH Encyclopedia of Psychology, 1–2. Singapore: Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-99-6000-2_311-1.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Salhi, Saïd. „Introduction“. In Heuristic Search, 1–18. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-49355-8_1.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Salhi, Saïd. „Improvement-Only Heuristics“. In Heuristic Search, 19–47. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-49355-8_2.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Salhi, Saïd. „Not Necessary Improving Heuristics“. In Heuristic Search, 49–76. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-49355-8_3.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Salhi, Saïd. „Population-Based Heuristics“. In Heuristic Search, 77–128. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-49355-8_4.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Salhi, Saïd. „Hybridisation Search“. In Heuristic Search, 129–56. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-49355-8_5.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Konferenzberichte zum Thema "Heuristic"

1

Hitomi, Nozomi, und Daniel Selva. „The Effect of Credit Definition and Aggregation Strategies on Multi-Objective Hyper-Heuristics“. In ASME 2015 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2015. http://dx.doi.org/10.1115/detc2015-47445.

Der volle Inhalt der Quelle
Annotation:
Heuristics and meta-heuristics are often used to solve complex real-world problems such as the non-linear, non-convex, and multi-objective combinatorial optimization problems that regularly appear in system design and architecture. Unfortunately, the performance of a specific heuristic is largely dependent on the specific problem at hand. Moreover, a heuristic’s performance can vary throughout the optimization process. Hyper-heuristics is one approach that can maintain relatively good performance over the course of an optimization process and across a variety of problems without parameter retuning or major modifications. Given a set of domain-specific and domain-independent heuristics, a hyper-heuristic adapts its search strategy over time by selecting the most promising heuristics to use at a given point. A hyper-heuristic must have: 1) a credit assignment strategy to rank the heuristics by their likelihood of producing improving solutions; and 2) a heuristic selection strategy based on the credits assigned to each heuristic. The literature contains many examples of hyper-heuristics with effective credit assignment and heuristic selection strategies for single-objective optimization problems. In multi-objective optimization problems, however, defining credit is less straightforward because there are often competing objectives. Therefore, there is a need to define and assign credit so that heuristics are rewarded for finding solutions with good trades between the objectives. This paper studies, for the first time, different combinations of credit definition, credit aggregation, and heuristic selection strategies. Credit definitions are based on different applications of the notion of Pareto dominance, namely: A1) dominance of the offspring with respect to the parent solutions; A2) ability to produce non-dominated solutions with respect to the entire population; A3) Pareto ranking with respect to the entire population. Two different credit aggregation strategies for assigning credit are also examined. A heuristic will receive credit for: B1) only the solutions it created in the current iteration or B2) all solutions it created that are in the current population. Different heuristic selection strategies are considered including: C1) probability matching; C2) dynamic multi-armed bandit; and C3) Hyper-GA. Thus, we conduct an experiment with three factors: credit definition (A1, A2, A3), credit aggregation (B1, B2), and heuristic selection (C1, C2, C3) and conduct a full factorial experiment. Performance is measured by hyper-volume of the last population. All algorithms are tested on a design problem for a climate monitoring satellite constellation instead of classical benchmarking problems to apply domain-specific heuristics within the hyper-heuristic.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Puentes, Lucas, Jonathan Cagan und Christopher McComb. „Automated Heuristic Induction From Human Design Data“. In ASME 2020 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2020. http://dx.doi.org/10.1115/detc2020-22151.

Der volle Inhalt der Quelle
Annotation:
Abstract Through experience, designers develop guiding principles, or heuristics, to aid decision-making in familiar design domains. Generalized versions of common design heuristics have been identified across multiple domains and applied by novices to design problems. Previous work leveraged a sample of these common heuristics to assist in an agent-based design process, which typically lacks heuristics. These predefined heuristics were translated into sequences of specifically applied design changes that followed the theme of the heuristic. To overcome the upfront burden, need for human interpretation, and lack of generality of this manual process, this paper presents a methodology that induces frequent heuristic sequences from an existing timeseries design change dataset. Individual induced sequences are then algorithmically grouped based on similarity to form groups that each represent a shared general heuristic. The heuristic induction methodology is applied to data from two human design studies in different design domains. The first dataset, collected from a truss design task, finds a highly similar set of general heuristics used by human designers to that which was hand selected for the previous computational agent study. The second dataset, collected from a cooling system design problem, demonstrates further applicability and generality of the heuristic induction process. Through this heuristic induction technique, designers working in a specified domain can learn from others’ prior problem-solving strategies and use these strategies in their own future design problems.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Koriche, Frederic, Christophe Lecoutre, Anastasia Paparrizou und Hugues Wattez. „Best Heuristic Identification for Constraint Satisfaction“. In Thirty-First International Joint Conference on Artificial Intelligence {IJCAI-22}. California: International Joint Conferences on Artificial Intelligence Organization, 2022. http://dx.doi.org/10.24963/ijcai.2022/258.

Der volle Inhalt der Quelle
Annotation:
In constraint satisfaction problems, the variable ordering heuristic takes a central place by selecting the variables to branch on during backtrack search. As many hand-crafted branching heuristics have been proposed in the literature, a key issue is to identify, from a pool of candidate heuristics, which one is the best for solving a given constraint satisfaction task. Based on the observation that modern constraint solvers are using restart sequences, the best heuristic identification problem can be cast in the context of multi-armed bandits as a non-stochastic best arm identification problem. Namely, during each run of some given restart sequence, the bandit algorithm selects a branching heuristic and receives a reward for this heuristic before proceeding to the next run. The goal is to identify the best heuristic using few runs, and without any stochastic assumption about the constraint solver. In this study, we propose an adaptive variant of Successive Halving that exploits Luby's universal restart sequence. We analyze the convergence of this bandit algorithm in the non-stochastic setting, and we demonstrate its empirical effectiveness on various constraint satisfaction benchmarks.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Núñez-Molina, Carlos, Masataro Asai, Pablo Mesejo und Juan Fernandez-Olivares. „On Using Admissible Bounds for Learning Forward Search Heuristics“. In Thirty-Third International Joint Conference on Artificial Intelligence {IJCAI-24}. California: International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/ijcai.2024/747.

Der volle Inhalt der Quelle
Annotation:
In recent years, there has been growing interest in utilizing modern machine learning techniques to learn heuristic functions for forward search algorithms. Despite this, there has been little theoretical understanding of what they should learn, how to train them, and why we do so. This lack of understanding has resulted in the adoption of diverse training targets (suboptimal vs optimal costs vs admissible heuristics) and loss functions (e.g., square vs absolute errors) in the literature. In this work, we focus on how to effectively utilize the information provided by admissible heuristics in heuristic learning. We argue that learning from poly-time admissible heuristics by minimizing mean square errors (MSE) is not the correct approach, since its result is merely a noisy, inadmissible copy of an efficiently computable heuristic. Instead, we propose to model the learned heuristic as a truncated gaussian, where admissible heuristics are used not as training targets but as lower bounds of this distribution. This results in a different loss function from the MSE commonly employed in the literature, which implicitly models the learned heuristic as a gaussian distribution. We conduct experiments where both MSE and our novel loss function are applied to learning a heuristic from optimal plan costs. Results show that our proposed method converges faster during training and yields better heuristics.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Liang, Jia, Hari Govind, Pascal Poupart, Krzysztof Czarnecki und Vijay Ganesh. „An Empirical Study of Branching Heuristics through the Lens of Global Learning Rate“. In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/745.

Der volle Inhalt der Quelle
Annotation:
In this paper, we analyze a suite of 7 well-known branching heuristics proposed by the SAT community and show that the better heuristics tend to generate more learnt clauses per decision, a metric we define as the global learning rate (GLR). We propose GLR as a metric for the branching heuristic to optimize. We test our hypothesis by developing a new branching heuristic that maximizes GLR greedily. We show empirically that this heuristic achieves very high GLR and interestingly very low literal block distance (LBD) over the learnt clauses. In our experiments this greedy branching heuristic enables the solver to solve instances faster than VSIDS, when the branching time is taken out of the equation. This experiment is a good proof of concept that a branching heuristic maximizing GLR will lead to good solver performance modulo the computational overhead. Finally, we propose a new branching heuristic, called SGDB, that uses machine learning to cheapily approximate greedy maximization of GLR. We show experimentally that SGDB performs on par with the VSIDS branching heuristic.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Bercher, Pascal, Gregor Behnke, Daniel Höller und Susanne Biundo. „An Admissible HTN Planning Heuristic“. In Twenty-Sixth International Joint Conference on Artificial Intelligence. California: International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/68.

Der volle Inhalt der Quelle
Annotation:
Hierarchical task network (HTN) planning is well-known for being an efficient planning approach. This is mainly due to the success of the HTN planning system SHOP2. However, its performance depends on hand-designed search control knowledge. At the time being, there are only very few domain-independent heuristics, which are designed for differing hierarchical planning formalisms. Here, we propose an admissible heuristic for standard HTN planning, which allows to find optimal solutions heuristically. It bases upon the so-called task decomposition graph (TDG), a data structure reflecting reachable parts of the task hierarchy. We show (both in theory and empirically) that rebuilding it during planning can improve heuristic accuracy thereby decreasing the explored search space. The evaluation further studies the heuristic both in terms of plan quality and coverage.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Yokoyama, Soichiro, Ikuo Suzuki, Masahito Yamamoto und Masashi Furukawa. „A New Heuristic for Traveling Salesman Problem Based on LCO“. In ASME/ISCIE 2012 International Symposium on Flexible Automation. American Society of Mechanical Engineers, 2012. http://dx.doi.org/10.1115/isfa2012-7227.

Der volle Inhalt der Quelle
Annotation:
The Traveling Salesman Problem (TSP) is one of the most well known combinatorial optimization problem and has wide range of application. Since the TSP is NP-hard, many heuristics for the TSP have been developed. This study proposes a new heuristic for the TSP based on one of these heuristics named Local Clustering Optimization (LCO). LCO is a metaheuristic proposed by Furukawa at el. to give an accurate solution for large scale problems in a reasonable time. However, conventional LCO-based heuristics for the TSP is not suited to solving asymmetric instances. The proposed method iteratively adopts tour construction heuristics such as nearest neighbor and random insertion to get an accurate solution more efficiently for the both asymmetric and symmetric TSP. The proposed method and other heuristics are applied to benchmark instances from TSPLIB and randomly generated instances. The experiment shows the proposed method is superior to conventional LCO in terms of accuracy of the solution. However, the proposed method is inefficient for instances which are not close to Euclidean due to the same property of insertion heuristic.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Hu, Shuli, und Nathan R. Sturtevant. „Direction-Optimizing Breadth-First Search with External Memory Storage“. In Twenty-Eighth International Joint Conference on Artificial Intelligence {IJCAI-19}. California: International Joint Conferences on Artificial Intelligence Organization, 2019. http://dx.doi.org/10.24963/ijcai.2019/175.

Der volle Inhalt der Quelle
Annotation:
While computing resources have continued to grow, methods for building and using large heuristics have not seen significant advances in recent years. We have observed that direction-optimizing breadth-first search, developed for and used broadly in the Graph 500 competition, can also be applied for building heuristics. But, the algorithm cannot run efficiently using external memory -- when the heuristics being built are larger than RAM. This paper shows how to modify direction-optimizing breadth-first search to build external-memory heuristics. We show that the new approach is not effective in state spaces with low asymptotic branching factors, but in other domains we are able to achieve up to a 3x reducing in runtime when building an external-memory heuristic. The approach is then used to build a 2.6TiB Rubik's Cube heuristic with 5.8 trillion entries, the largest pattern database heuristic ever built.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Cohen, Liron, Tansel Uras, Shiva Jahangiri, Aliyah Arunasalam, Sven Koenig und T. K. Satish Kumar. „The FastMap Algorithm for Shortest Path Computations“. In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/198.

Der volle Inhalt der Quelle
Annotation:
We present a new preprocessing algorithm for embedding the nodes of a given edge-weighted undirected graph into a Euclidean space. The Euclidean distance between any two nodes in this space approximates the length of the shortest path between them in the given graph. Later, at runtime, a shortest path between any two nodes can be computed with an A* search using the Euclidean distances as heuristic. Our preprocessing algorithm, called FastMap, is inspired by the data-mining algorithm of the same name and runs in near-linear time. Hence, FastMap is orders of magnitude faster than competing approaches that produce a Euclidean embedding using Semidefinite Programming. FastMap also produces admissible and consistent heuristics and therefore guarantees the generation of shortest paths. Moreover, FastMap applies to general undirected graphs for which many traditional heuristics, such as the Manhattan Distance heuristic, are not well defined. Empirically, we demonstrate that A* search using the FastMap heuristic is competitive with A* search using other state-of-the-art heuristics, such as the Differential heuristic.
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Renan de Carvalho, Vinicius, und Jaime Simão Sichman. „Multi-Agent Election-Based Hyper-Heuristics“. In Twenty-Seventh International Joint Conference on Artificial Intelligence {IJCAI-18}. California: International Joint Conferences on Artificial Intelligence Organization, 2018. http://dx.doi.org/10.24963/ijcai.2018/833.

Der volle Inhalt der Quelle
Annotation:
Hyper-heuristics are high-level methodologies responsible for automatically discover how to combine elements from a low-level heuristic set in order to solve optimization problems. Agents, in turn, are autonomous component responsible for watching an environment and perform some actions according to their perceptions. Thus, agent-based techniques seem suitable for the design of hyper-heuristics. This work presents an agent-based hyper-heuristic framework for choosing the best low-level heuristic. The proposed framework performs a cooperative voting procedure, considering a set of quality indicator voters, to define which multi-objective evolutionary algorithm (MOEA) should generate more new solutions along the execution.
APA, Harvard, Vancouver, ISO und andere Zitierweisen

Berichte der Organisationen zum Thema "Heuristic"

1

Feigenbaum, Edward A., und Bruce G. Buchanan. Heuristic Programming Project. Fort Belvoir, VA: Defense Technical Information Center, März 1986. http://dx.doi.org/10.21236/ada165995.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
2

Carter, Lynn. Probability driven heuristic nets. Portland State University Library, Januar 2000. http://dx.doi.org/10.15760/etd.1998.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
3

Evett, Matthew, James Hendler, Ambuj Mahanti und Dana Nau. PRA: Massively Parallel Heuristic Search. Fort Belvoir, VA: Defense Technical Information Center, Januar 1991. http://dx.doi.org/10.21236/ada454848.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
4

Hirshleifer, David, Yaron Levi, Ben Lourie und Siew Hong Teoh. Decision Fatigue and Heuristic Analyst Forecasts. Cambridge, MA: National Bureau of Economic Research, Februar 2018. http://dx.doi.org/10.3386/w24293.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
5

Skiena, Steven S. Heuristic Approaches to Optimization with Applications. Fort Belvoir, VA: Defense Technical Information Center, August 2001. http://dx.doi.org/10.21236/ada390374.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
6

Skiena, Steven S. Heuristic Approaches to Optimization With Applications. Fort Belvoir, VA: Defense Technical Information Center, August 2000. http://dx.doi.org/10.21236/ada382413.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
7

Nemhauser, George L., und Martin W. Savelsbergh. Combining Exact and Heuristic Approaches for Discrete Optimization. Fort Belvoir, VA: Defense Technical Information Center, Februar 2009. http://dx.doi.org/10.21236/ada495432.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
8

Kaku, Bharat K., Thomas E. Morton und Gerald L. Thompson. A Heuristic Algorithm for the Facilities Layout Problem. Fort Belvoir, VA: Defense Technical Information Center, Mai 1988. http://dx.doi.org/10.21236/ada196093.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
9

Nemhauser, George L. Combining Exact ad Heuristic Approaches for Discrete Optimization. Fort Belvoir, VA: Defense Technical Information Center, Dezember 2011. http://dx.doi.org/10.21236/ada567596.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
10

Martínez Martínez, Luis Enrique, und Juan M. Monserrat Gauchi. Heuristic Evaluation of Optical and Optometry Franchise Websites. Revista Latina de Comunicación Social, 2010. http://dx.doi.org/10.4185/rlcs-65-2010-884-071-088-en.

Der volle Inhalt der Quelle
APA, Harvard, Vancouver, ISO und andere Zitierweisen
Die Auswahlen zum Thema "Heuristic" für konkrete Quellenarten können Sie auch interessieren:
Zeitschriftenartikel Dissertationen Bücher
Wir bieten Rabatte auf alle Premium-Pläne für Autoren, deren Werke in thematische Literatursammlungen aufgenommen wurden. Kontaktieren Sie uns, um einen einzigartigen Promo-Code zu erhalten!

Zur Bibliographie