1. Genetic Algorithms with Heuristic
Abstract- Genetic algorithms are good search techniques for finding solutions to NP problems. However, their high degree of randomness sometimes fails to guide the search towards finding solutions within reasonable costs. The Knight’s tour problem is an example of where pure GAs fail (practically) to find solutions. Combining GAs with other approaches on the other hand can highly improve their efficiency. In this paper, we present a new approach for improving the performance and effectiveness of GAs by applying heuristic. In our method, while the population is evolving using GA operators, a heuristic is applied to evolve the population either...

2. A Seed-Growth Heuristic for Graph - Wheeler Ruml,Stuart M. Shieber,J. Thomas Ngo,A Seed-growth,Heuristic Graph Bisection
We present a new heuristic algorithm for graph bisection, based on an implicit notion of clustering.

3. Análisis de heurísticos para el problema del cartero rural - Benavent, Enrique; Campos, V.; Corberán Salvador, Angel; Mota, Enrique
In this paper we study the worst case performance of two heuristic algorithms proposed for the Rural Postman Problem on a non directed graph (RPP) and on a directed graph (DRPP). In both cases the worst case ratio is obtained; for the RPP this ratio is 3/2, whereas for the DRPP the ratio is unbounded. In order to obtain more significant bounds, this ratio has also been obtained as a function of certain parameters that can be computed from the particular data of each instance, thus producing a finite bound for the worst case ratio of the heuristic algorithm for...

4. Avaliação heurística para protótipos de jogos digitais: adaptação do método de heurísticas para a aplicação no primeiro protótipo funcional de jogos digitais - Felipe Borba Breyer
Este trabalho descreve o processo de pesquisa e adaptação de um método avaliação de usabilidade para a aplicação no primeiro protótipo funcional de um jogo digital. Para alcançar este objetivo foram estudados vários conceitos de jogos e os elementos que os compõem para que estes pudessem servir de entidade unificadora para a fundamentação do método de avaliação escolhido. Para isso, as experiências do jogador, que são resultados de sua interação com os elementos do jogo, foram classificadas de acordo com uma adaptação de modelos de design experiencial e experiência do jogador desenvolvidos por diversos autores. Para auxiliar a construção deste...

5. The capacitated arc routing problem: a heuristic algorithm - Benavent López, Enrique; Campos, V.; Corberán Salvador, Angel; Mota Vidal, Enrique
In this paper we consider the Capacitated Arc Routing Problem, in which a fleet of K vehicles, all of them based on a specific vertex (the depot) and with a known capacity Q, must service a subset of the edges of the graph, with minimum total cost and such that the load assigned to each vehicle does not exceed its capacity. A heuristic algorithm for this problem is proposed consisting of: the selection of K centers, the construction of K connected graphs with associated loads not exceeding the vehicle capacities, the resolution of a General Assignment Problem, if necessary, to get...

6. Efectos de un programa heurístico sobre el pensamiento hipotéticodeductivo en estudiantes de primer semestre de ingenierías - Iriarte Diazgranados, Fernando; Rojas Alvarez, Carlos Javier; Carrillo Sánchez, Orlando
In this article, results of a study carried out in engineering first semester students of Universidad del Norte are presented. Its aim was to determine the effects of a heuristic approach program on students¿ hypothetical deductive thinking. To do this, a pre and postquasi experimental design, with a non equivalent control group, was used. The sample of the experimental group consisted of 20 students, who were subjected to a program with a heuristic approach week. Fifteen students (the sample of the control group) were not subjected to this program, but were taught the subject in the traditional way. The heuristic approach...

7. A Heuristic for the Continuous Capacity and Flow Assignment - Marcelo Queiroz; Carlos Humes
This work deals with the Continuous Capacity and Flow Assignment (CFA) problem for the design of computer networks. This is a nonconvex optimization problem which has been usually solved by applying local optimization techniques. By rephrasing the problem in the context of concave programming and bringing an alternative formulation of the projected pairwise multicommodity flow polyhedron, a heuristic method for the search of a global minimum of the CFA is proposed. Its implementation is discussed, and computational tests with real backbone networks show that the proposed method compares favorably to previous approaches.

8. Goal Programming and Heuristic Search - L. Mandow; E. Millán
. The A* algorithm belongs to the class of best first graph-search algorithms and is frequently used to find minimum-cost paths. Recently, A* has been generalised to solve multiple-objective search problems, returning the set of non-dominated solution paths. This paper presents METAL-A*, an admissible heuristic search algorithm for search problems with lexicographic goals that returns the set of non-dominated paths that best achieves a set of lexicographic goals. Keywords. Lexicographic goals, heuristic search, goal programming 1 Introduction Most real world problems involve the achievement of multiple objectives or goals. In Artificial Intelligence, problem solving is frequently defined as search in...

9. HSP: Heuristic Search Planner
Introduction hsp is a planner based on the ideas of heuristic search. 1 Heuristic search algorithms perform forward search from an initial state to a goal state using an heuristic function that provides an estimate of the distance to the goal. The 8-puzzle is the standard example of heuristic search and is treated in most AI textbooks [9, 10]. The main difference between the 8-puzzle and our approach to planning is in the heuristic function. While in domains specific tasks like the 8-puzzle the heuristic function is given (e.g., as the sum of the Manhattan distances); in domain independent planning, it has to be derived from the high-level representation of the...

10. HSP: Heuristic Search Planner
Introduction hsp is a planner based on the ideas of heuristic search. 1 Heuristic search algorithms perform forward search from an initial state to a goal state using an heuristic function that provides an estimate of the distance to the goal. The 8-puzzle is the standard example of heuristic search and is treated in most AI textbooks [9, 10]. The main difference between the 8-puzzle and our approach to planning is in the heuristic function. While in domains specific tasks like the 8-puzzle the heuristic function is given (e.g., as the sum of the Manhattan distances); in domain independent planning, it has to be derived from the high-level representation of the...

11. The Pruned N-Best Heuristic Search Algorithm - Jorge Pais; Carlos Pinto-ferreira
This paper presents a semi-optimal heuristic search algorithm called Pruned N-Best, which has both the search behavior of the N-Best heuristic search algorithm and the minimization of backtracking search to applying a pruning technique over certain search paths. This minimization increases the Pruned N-Best algorithm efficiency when compared with others semi-optimal algorithms. In domains where the number of operators grows up exponentially with the problem dimension the Pruned NBest algorithm have been applied successfully (e.g. qualitative spatial reasoning area. Spatial reasoning planners usually tackle with problem models, where the interaction among elements is higher and change should be modeled not...

12. The Pruned N-Best Heuristic Search Algorithm - Jorge Pais
This paper presents a semi-optimal heuristic search algorithm called Pruned N-Best, which has both the search behavior of the N-Best heuristic search algorithm and the minimization of backtracking search to applying a pruning technique over certain search paths. This minimization increases the Pruned N-Best algorithm efficiency when compared with others semi-optimal algorithms. In domains where the number of operators grows up exponentially with the problem dimension the Pruned N-Best algorithm have been applied successfully (e.g. qualitative spatial reasoning area. Spatial reasoning planners usually tackle with problem models, where the interaction among elements is higher and change should be modeled not...

13. Structured Heuristic Evaluation of Online Documentation - Laurie Kantner; Roberta Shroyer; Stephanie Rosenbaum
This paper presents a structured process for evaluating the usability of online documentation, based on a list of heuristics for navigating through and finding content. Keywords: heuristic evaluation, online documentation, usability, online help. The Need for Usability Inspections of Online Documentation Adopting best practices from software development, documentation development teams are starting to employ principles such as reuse of content and iterative usability evaluation: .# Reuse of content helps ensure consistency of information and simplifies maintenance. It also creates authoring challenges because the information must remain accurate regardless of the context or order in which the user accesses it

14. LAO*: A heuristic search algorithm that finds solutions with loops - Eric A. Hansen A; Shlomo Zilberstein B
Classic heuristic search algorithms can find solutions that take the form of a simple path (A*), a tree, or an acyclic graph (AO*). In this paper, we describe a novel generalization of heuristic search, called LAO*, that can find solutions with loops. We show that LAO * can be used to solve Markov decision problems and that it shares the advantage heuristic search has over dynamic programming for other classes of problems. Given a start state, it can find an optimal solution without evaluating

15. LAO*: A heuristic search algorithm that finds solutions with loops - Eric A. Hansen; Shlomo Zilberstein
Classic heuristic search algorithms can find solutions that take the form of a simple path (A*), a tree, or an acyclic graph (AO*). In this paper, we describe a novel generalization of heuristic search, called LAO*, that can find solutions with loops. We show that LAO* can be used to solve Markov decision problems and that it shares the advantage heuristic search has over dynamic programming for other classes of problems. Given a start state, it can find an optimal solution without evaluating the entire state space. 2001 Elsevier Science B.V. All rights reserved. Keywords: Heuristic search; Dynamic programming; Markov...

16. The Probabilistic Heuristic In Local (PHIL) Search Meta-strategy - Randall, Marcus
Local search, in either best or first admissible form, generally suffers from poor solution qualities as search cannot be continued beyond locally optimal points. Even multiple start local search strategies can suffer this problem. Meta-heuristic search algorithms, such as simulated annealing and tabu search, implement often computationally expensive optimisation strategies in which local search becomes a subordinate heuristic. To overcome this, a new form of local search is proposed. The Probabilistic Heuristic In Local (PHIL) search meta- strategy uses a recursive branching mechanism in order to overcome local optima. This strategy imposes only a small computational load over and above...

17. AN OVERVIEW OF SOME HEURISTIC ALGORITHMS FOR COMBINATORIAL OPTIMIZATION PROBLEMS - Alfonsas Misevičius; Tomas Blažauskas; Jonas Blonskis; Jonas Smolinskas
Abstract. Heuristic algorithms (or simply heuristics) are methods that seek for high quality solutions within a reasonable (limited) amount of time without being able to guarantee optimality. They often come out as a result of imitation of the real world (physics, nature, biology, etc.). In this paper, we give an overview of some heuristic algorithms for combinatorial optimization problems. At the beginning, some definitions related to combinatorial optimization, as well as the principle (framework) and basic features of the heuristics for combinatorial problems are concerned. Then, several popular heuristic algorithms are discussed, namely: descent local search, simulated annealing, tabu search,...

18. Optimization of a Chess Heuristic Using an Evolutionary Algorithm Abstract - Benjamin Rhew
Chess and Artificial Intelligence have long been associated with one another. Since playing chess is a good way of testing how well an AI works, a logical extension of that is to use a chess state evaluation heuristic as the search space for an optimizing evolutionary algorithm. This is done using the Island Model in conjunction with a parallelization

19. Escalonamento com restrição de mão-de-obra : heuristicas combinatorias e limitantes inferiores - Cristina Celia Barros Cavalcante
This dissertation studies the scheduling problem under labour constraints (SPLC) and presents some strategies to obtain lower and upper bounds for this NP-hard problem. Concerning the lower bounds, two integer programming formulations are presented and the lower bounds associated with their linear relaxations are discussed. A branch-and-bound algorithm is also implemented as an essay to provide exact solutions for this problem. Finally, integer programming is used as a basis to extend a procedure reported in the literature to compute lower bounds for the resourte constrained project scheduling problem. In order to get upper bounds for SPLC, four heuristic approaches (priority...

20. Heurística para logística reversa de material não conforme na indústria aeronáutica. - Wilson Antonio Mancia
Em qualquer setor onde exista fornecimento de materiais, as decisões da recuperação do material não conforme são relevantes. Este trabalho estuda as decisões da recuperação de material não conforme na indústria Aeronáutica, onde o seu produto final tem um longo ciclo de fabricação e de suprimento e elevado custo o que exige que o tempo dessa recuperação seja o mínimo possível. O material não conforme tem diferentes destinos, podendo ser recuperado através do retorno ao fornecedor ou oficina autorizada, ou ainda ser destruído. Esse trabalho utiliza o conhecimento da Logística Reversa como suporte para essa decisão de recuperação, porém sob...

Página de resultados:
1  2  3  4  5  6  7  8  9  10  Siguiente