Log in

Relevant bibliographies by topics / A* Heuristic Search / Dissertations / Theses

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

Dissertations / Theses on the topic 'A* Heuristic Search'

Author: Grafiati

Published: 4 June 2025

Last updated: 1 August 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 'A* Heuristic Search.'

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

Furcy, David Andre. "Speeding Up the Convergence of Online Heuristic Search and Scaling Up Offline Heuristic Search." Diss., Georgia Institute of Technology, 2004. http://hdl.handle.net/1853/4855.

Full text

Abstract:

The most popular methods for solving the shortest-path problem in Artificial Intelligence are heuristic search algorithms. The main contributions of this research are new heuristic search algorithms that are either faster or scale up to larger problems than existing algorithms. Our contributions apply to both online and offline tasks. For online tasks, existing real-time heuristic search algorithms learn better informed heuristic values and in some cases eventually converge to a shortest path by repeatedly executing the action leading to a successor state with a minimum cost-to-goal estimate.

APA, Harvard, Vancouver, ISO, and other styles

2

Jochumsson, Thorvaldur. "Heuristic multi-sequence search methods." Thesis, University of Skövde, Department of Computer Science, 2001. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-530.

Full text

Abstract:

<p>With increasing size of sequence databases heuristic search approaches have become necessary. Hidden Markov models are the best performing search methods known today with respect to discriminative power, but are too time complex to be practical when searching in large sequence databases. In this report, heuristic algorithms that reduce the search space before searching with traditional search algorithms of hidden Markov models are presented and experimentally validated. The results of the validation show that the heuristic search algorithms will speed up the searches without decreasing thei

APA, Harvard, Vancouver, ISO, and other styles

3

Garrett, Caelan Reed. "Heuristic search for manipulation planning." Thesis, Massachusetts Institute of Technology, 2015. http://hdl.handle.net/1721.1/100596.

Full text

Abstract:

Thesis: M. Eng., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2015.<br>This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.<br>Cataloged from student-submitted PDF version of thesis.<br>Includes bibliographical references (pages 61-64).<br>Manipulation problems involving many objects present substantial challenges for planning algorithms due to the high dimensionality and multi-modality of the search space. Symbolic task planners can efficiently con

APA, Harvard, Vancouver, ISO, and other styles

4

Richards, Simon Kim. "Symbolic bidirectional breadth-first heuristic search." Master's thesis, Mississippi State : Mississippi State University, 2004. http://library.msstate.edu/etd/show.asp?etd=etd-08302004-085304.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Rodic, Daniel. "A Hybrid search heuristic-exhaustive search approach for rule extraction." Pretoria : [s.n.], 2000. http://upetd.up.ac.za/thesis/available/etd-05292006-110006/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Rolland, Erik. "Abstract heuristic search methods for graph partitioning." Connect to resource, 1991. http://rave.ohiolink.edu/etdc/view.cgi?acc%5Fnum=osu1262633923.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Rolland, Eric. "Abstract heuristic search methods for graph partitioning." The Ohio State University, 1991. http://rave.ohiolink.edu/etdc/view?acc_num=osu1262633923.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Rashid, Mahmood Abdur. "Heuristic Based Search for Protein Structure Prediction." Thesis, Griffith University, 2014. http://hdl.handle.net/10072/367134.

Full text

Abstract:

Proteins that are essentially sequences of amino acids, adopt specific folded 3-dimensional (3D) structures to perform their specific tasks. However, misfolded proteins cause fatal diseases. Hence, protein structure prediction (PSP) has emerged as an important multi-disciplinary research problem. Given a protein sequence, the PSP problem is to find a 3D structure of the protein such that the total free energy amongst the amino acids in the sequence is minimised. In-vitro laboratory methods are time-consuming, expensive, and failure-prone. Conversely, computational methods are NP-hard even when

APA, Harvard, Vancouver, ISO, and other styles

9

Machemer, Kevin Scott 1958. "Heuristic search strategies on a dataflow computer." Thesis, The University of Arizona, 1990. http://hdl.handle.net/10150/291529.

Full text

Abstract:

In recent years, sweeping changes in computer architecture have been transpiring as the technology continues to advance. As the physical limits for computational speed are approached, different design alternatives to the standard von Neumann architecture must be explored. The static dataflow architecture is one of the new possibilities being examined and involves a completely different concept in computation. By programming an irregular computational problem such as a heuristic search strategy on a static dataflow computer, its usefulness for solving difficult problems can be demonstrated. A s

APA, Harvard, Vancouver, ISO, and other styles

10

Henry, Obit Joe. "Developing novel meta-heuristic, hyper-heuristic and cooperative search for course timetabling problems." Thesis, University of Nottingham, 2010. http://eprints.nottingham.ac.uk/13581/.

Full text

Abstract:

The research presented in this PhD thesis focuses on the problem of university course timetabling, and examines the various ways in which metaheuristics, hyperheuristics and cooperative heuristic search techniques might be applied to this sort of problem. The university course timetabling problem is an NP-hard and also highly constrained combinatorial problem. Various techniques have been developed in the literature to tackle this problem. The research work presented in this thesis approaches this problem in two stages. For the first stage, the construction of initial solutions or timetables,

APA, Harvard, Vancouver, ISO, and other styles

11

Burfoot, Daniel. "Limitations of and extensions to heuristic search planning." Thesis, McGill University, 2006. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=100779.

Full text

Abstract:

This thesis explores limitations of heuristic search planning, and presents techniques to overcome those limitations. The two halves of the thesis discuss problems in standard propositional planning (STRIPS) and in planning with numeric state variables respectively.<br>In the context of STRIPS, the primary focus is on the widely used relaxed plan heuristic (h+). A variety of cases are shown in which h+ provides systematically bad estimates of goal distance. To address this breakdown, a planning system called RRT-Plan is presented. This system is inspired by the concept of Rapidly-exploring Ran

APA, Harvard, Vancouver, ISO, and other styles

12

Guo, Peili. "Heuristic for vehicle motion planning with search trees." Thesis, Uppsala universitet, Institutionen för informationsteknologi, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-432185.

Full text

Abstract:

Motion planning is an essential part of an autonomous system. It finds a sequence of actions for the vehicle to move from start to goal. In this thesis, we study the use of heuristic in the context of motion planning. We propose a heuristic method using a pre-computed heuristic look up table for sampling based motion planning method Rapidly-exploring random trees (RRT). The proposed method is successfully implemented and evaluated in nine different scenarios. We have found improvement in the quality of the path at a short time out in at least six out of the nine scenarios. In certain scenario

APA, Harvard, Vancouver, ISO, and other styles

13

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

14

Schulz, Stephan. "Leaning search control knowlledge for equational deduction /." Berlin : AKA, 2000. http://www.loc.gov/catdir/toc/fy0804/2007440965.html.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Qian, Kairong Computer Science &amp Engineering Faculty of Engineering UNSW. "Formal symbolic verification using heuristic search and abstraction techniques." Awarded by:University of New South Wales. School of Computer Science and Engineering, 2006. http://handle.unsw.edu.au/1959.4/25703.

Full text

Abstract:

Computing devices are pervading our everyday life and imposing challenges for designers that have the responsibility of producing reliable hardware and software systems. As systems grow in size and complexity, it becomes increasingly difficult to verify whether a design works as intended. Conventional verification methods, such as simulation and testing, exercise only parts of the system and from these parts, draw conclusions about the correctness of the total design. For complex designs, the parts of the system that can be verified are relatively small. Formal verification aims to overcome th

APA, Harvard, Vancouver, ISO, and other styles

16

Hussin, Naimah Mohd. "Tabu search based hyper-heuristic for examination timetabling problem." Thesis, University of Nottingham, 2005. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.423286.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

Kern, Mathias. "Parameter adaptationn in heuristic search : a population based approach." Thesis, University of Essex, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.423539.

Full text

APA, Harvard, Vancouver, ISO, and other styles

18

Temple, Thomas J. (Thomas John). "A general index heuristic for search with mobile agents." Thesis, Massachusetts Institute of Technology, 2011. http://hdl.handle.net/1721.1/67175.

Full text

Abstract:

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Aeronautics and Astronautics, 2011.<br>Cataloged from PDF version of thesis.<br>Includes bibliographical references (p. 181-187) and index.<br>This dissertation considers a suite of search problems in which agents are trying to find goals in minimum expected time. Unlike search in data structures in which time is measured by a number operations, search in metric spaces measures time by units of distance and has received much less attention. In particular, search strategies that attempt to minimize expected search time are only av

APA, Harvard, Vancouver, ISO, and other styles

19

Benlic, Una. "Heuristic search for allocation of slots at network level." Elsevier, 2017. https://publish.fid-move.qucosa.de/id/qucosa%3A72805.

Full text

Abstract:

This paper considers the allocation of slots for a network of coordinated (congested) airports, where the term “slot” refers to a time on a specific day when a carrier is given permission to use the full range of airport infrastructure for the purpose of landing and take-off at a slot-controlled airport. We take into account the existing IATA rules and guidelines: priorities of requests for slots, the capacity limitations at each airport, the minimal turnaround time between arrival and subsequent departure of the same aircraft, and allocation to series of slots rather than to individual slots.

APA, Harvard, Vancouver, ISO, and other styles

20

Chan, Evelyn Yu-San. "Heuristic optimisation for the minimum distance problem." Thesis, Nottingham Trent University, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.324569.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Bedrax-Weiss, Tania. "Optimal search protocols /." view abstract or download file of text, 1999. http://wwwlib.umi.com/cr/uoregon/fullcit?p9948016.

Full text

Abstract:

Thesis (Ph. D.)--University of Oregon, 1999.<br>Typescript. Includes vita and abstract. Includes bibliographical references (leaves 206-211). Also available for download via the World Wide Web; free to University of Oregon users. Address: http://wwwlib.umi.com/cr/uoregon/fullcit?p9948016.

APA, Harvard, Vancouver, ISO, and other styles

22

Bergmark, Max. "Tetris: A Heuristic Study : Using height-based weighing functions and breadth-first search heuristics for playing Tetris." Thesis, KTH, Skolan för teknikvetenskap (SCI), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-168306.

Full text

Abstract:

This paper studies the performance of height-based weighing functions and compares the results to using the commonly used non height-based weighing functions for holes. For every test performed, the heuristic methods studied in this paper performed better than the commonly used heuristic function. This study also analyses the effect of adding levels of prediction to the heuristic algorithm, which increases the average number of cleared lines by a factor of 85 in total. Utilising these methods can provide increased performance for a Tetris AI. The polynomic weighing functions discussed in this

APA, Harvard, Vancouver, ISO, and other styles

23

Narayanamurthy, Nithya. "Finding resilience-friendly compiler optimizations using meta-heuristic search techniques." Thesis, University of British Columbia, 2015. http://hdl.handle.net/2429/54951.

Full text

Abstract:

With the projected increase in hardware error rates in the future, software needs to be resilient to hardware faults. An important factor affecting a program's error resilience is the set of optimizations used when compiling it. Compiler optimizations typically optimize for performance or space, and rarely for error resilience. However, prior work has found that applying optimizations injudiciously can lower the program's error resilience as they often eliminate redundancy in the program. In this work, we propose automated techniques to find the set of compiler optimizations that can boost per

APA, Harvard, Vancouver, ISO, and other styles

24

Keller, Thomas [Verfasser], and Bernhard [Akademischer Betreuer] Nebel. "Anytime optimal MDP planning with trial-based heuristic tree search." Freiburg : Universität, 2015. http://d-nb.info/1122594054/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Rodohan, Darren Patrick. "The associative evaluation of logic programs and heuristic search techniques." Thesis, Brunel University, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.334391.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Clay, Paul. "The application of heuristic search to the leather-nesting problem." Thesis, Leeds Beckett University, 2006. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.435609.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Al-Guwaizani, Abdulrahman. "Variable neighbourhood search based heuristic for K-harmonic means clustering." Thesis, Brunel University, 2011. http://bura.brunel.ac.uk/handle/2438/5827.

Full text

Abstract:

Although there has been a rapid development of technology and increase of computation speeds, most of the real-world optimization problems still cannot be solved in a reasonable time. Some times it is impossible for them to be optimally solved, as there are many instances of real problems which cannot be addressed by computers at their present speed. In such cases, the heuristic approach can be used. Heuristic research has been used by many researchers to supply this need. It gives a sufficient solution in reasonable time. The clustering problem is one example of this, formed in many applicati

APA, Harvard, Vancouver, ISO, and other styles

28

Campbell, Newton Henry Jr. "Algorithmic Foundations of Heuristic Search using Higher-Order Polygon Inequalities." NSUWorks, 2016. http://nsuworks.nova.edu/gscis_etd/374.

Full text

Abstract:

The shortest path problem in graphs is both a classic combinatorial optimization problem and a practical problem that admits many applications. Techniques for preprocessing a graph are useful for reducing shortest path query times. This dissertation studies the foundations of a class of algorithms that use preprocessed landmark information and the triangle inequality to guide A* search in graphs. A new heuristic is presented for solving shortest path queries that enables the use of higher order polygon inequalities. We demonstrate this capability by leveraging distance information from two lan

APA, Harvard, Vancouver, ISO, and other styles

29

Hassan, Fadratul Hafinaz. "Heuristic search methods and cellular automata modelling for layout design." Thesis, Brunel University, 2013. http://bura.brunel.ac.uk/handle/2438/7581.

Full text

Abstract:

Spatial layout design must consider not only ease of movement for pedestrians under normal conditions, but also their safety in panic situations, such as an emergency evacuation in a theatre, stadium or hospital. Using pedestrian simulation statistics, the movement of crowds can be used to study the consequences of different spatial layouts. Previous works either create an optimal spatial arrangement or an optimal pedestrian circulation. They do not automatically optimise both problems simultaneously. Thus, the idea behind the research in this thesis is to achieve a vital architectural design

APA, Harvard, Vancouver, ISO, and other styles

30

Patel, Mayank Raman. "HARDWARE COMPILER DRIVEN HEURISTIC SEARCH FOR DIGITAL IC TEST SEQUENCES." Thesis, The University of Arizona, 1985. http://hdl.handle.net/10150/275246.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Liu, Wen-Hsing. "Tabu search heuristics for the dynamic facility layout problem." Morgantown, W. Va. : [West Virginia University Libraries], 2005. https://eidr.wvu.edu/etd/documentdata.eTD?documentid=3973.

Full text

Abstract:

Thesis (M.S.)--West Virginia University, 2005.<br>Title from document title page. Document formatted into pages; contains vii, 88 p. : ill. Includes abstract. Includes bibliographical references (p. 83-88).

APA, Harvard, Vancouver, ISO, and other styles

32

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

33

Hölscher, Anton. "A Cycle-Trade Heuristic for the Weighted k-Chinese Postman Problem." Thesis, Linköpings universitet, Artificiell intelligens och integrerade datorsystem, 2018. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-153631.

Full text

Abstract:

This study aims to answer whether a heuristic that trades cycles between the tours in a solution would show good results when trying to solve the Weighted k-Chinese Postman Problem for undirected graphs, of varying size, representing neighbourhoods in Sweden.A tabu search heuristic was implemented with each iteration consisting of giving a cycle from the most expensive tour to the cheapest. The heuristic performed increasingly well for graphs of increasing size, although the solution quality decreased when increasing the number of tours to be used in the solution. It is suspected that the caus

APA, Harvard, Vancouver, ISO, and other styles

34

Ahmad, Norfaieqah. "Heuristic search for the solution of environmental VRP incorporating vehicle load." Thesis, University of Kent, 2018. https://kar.kent.ac.uk/69767/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Doan, Khoa Dang. "Generative models meet similarity search: efficient, heuristic-free and robust retrieval." Diss., Virginia Tech, 2021. http://hdl.handle.net/10919/105052.

Full text

Abstract:

The rapid growth of digital data, especially visual and textual contents, brings many challenges to the problem of finding similar data. Exact similarity search, which aims to exhaustively find all relevant items through a linear scan in a dataset, is impractical due to its high computational complexity. Approximate-nearest-neighbor (ANN) search methods, especially the Learning-to-hash or Hashing methods, provide principled approaches that balance the trade-offs between the quality of the guesses and the computational cost for web-scale databases. In this era of data explosion, it is crucial f

APA, Harvard, Vancouver, ISO, and other styles

36

Khambhampati, Surya Sudha. "A Tabu Search Heuristic for Multi-Period Clustering to Rationalize Delivery Operations." Wright State University / OhioLINK, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=wright1210959864.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

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

38

Crosby, Matthew David. "Multiagent classical planning." Thesis, University of Edinburgh, 2014. http://hdl.handle.net/1842/8853.

Full text

Abstract:

Classical planning problems consist of an environment in a predefined state; a set of deterministic actions that, under certain conditions, change the state of the environment; and a set of goal conditions. A solution to a classical planning problem is a sequence of actions that leads from the initial state to a state satisfying the problem’s goal conditions. There are many methods for finding solutions to classical planning problems, and a popular technique is to exploit structures that commonly occur. One such structure, apparent in many planning domains, is a breakdown of the problem into m

APA, Harvard, Vancouver, ISO, and other styles

39

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

40

Nilsson, Håkan. "In Search of Prototypes and Feminist Bank-Tellers: Exploring the Representativeness Heuristic." Doctoral thesis, Uppsala University, Department of Psychology, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-8476.

Full text

Abstract:

<p>According to the heuristics and biases approach, the representativeness heuristic (RH) is one of the heuristics available for assessing subjective probabilities (A. Tversky & D. Kahneman, 1974). A subjective probability assessed by the RH is determined by how representative the target object is of the target category. Several aspects of the RH are argued to cause systematic biases, for example: (<i>i</i>) When the RH is used, the category is represented by one single prototypical exemplar. This feature is argued to cause biases such as misperception of chance and insensitivity to sample siz

APA, Harvard, Vancouver, ISO, and other styles

41

Soto, Manuel. "Unmanned aerial vehicle real-time guidance system via state space heuristic search." To access this resource online via ProQuest Dissertations and Theses @ UTEP, 2007. http://0-proquest.umi.com.lib.utep.edu/login?COPT=REJTPTU0YmImSU5UPTAmVkVSPTI=&clientId=2515.

Full text

APA, Harvard, Vancouver, ISO, and other styles

42

Nilsson, Håkan. "In search of prototypes and feminist bank-tellers : exploring the representativeness heuristic /." Uppsala : Acta Universitatis Upsaliensis, 2008. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-8476.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Parker, Gary B. "Genetic algorithms for the development of real-time multi-heuristic search strategies." Thesis, Monterey, California. Naval Postgraduate School, 1992. http://hdl.handle.net/10945/23911.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Steed, Arnold F. "A heuristic search method of selecting range-range sites for hydrographic surveys." Thesis, Monterey, California. Naval Postgraduate School, 1991. http://hdl.handle.net/10945/27078.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Greer, Kieran R. C. "A neural network based search heuristic and its application to computer chess." Thesis, University of Ulster, 1998. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.243736.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Gurram, Abhinav. "Multi-Domain Clustering using the A* Search." University of Cincinnati / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1470671379.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Lagerqvist, Victor. "A comparison of SL- and unit-resolution search rules for stratified logic programs." Thesis, Linköping University, TCSLAB - Theoretical Computer Science Laboratory, 2010. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-57363.

Full text

Abstract:

<p>There are two symmetrical resolution rules applicable to logic programs - SL-resolution which yields a top-down refutation and unit-resolution which yields a bottom-up refutation. Both resolution principles need to be coupled with a search rule before they can be used in practice. The search rule determines in which order program clauses are used in the refutation and affects both performance, completeness and quality of solutions. The thesis surveys exhaustive and heuristic search rules for SL-resolution and transformation techniques for (general) logic programs that makes unit-resolution

APA, Harvard, Vancouver, ISO, and other styles

48

Mousavi, Nogholi Amin Alah. "Optimisation of open pit mine block sequencing." Thesis, Queensland University of Technology, 2015. https://eprints.qut.edu.au/86697/1/Amin%20Alah_Mousavi%20Nogholi_Thesis.pdf.

Full text

Abstract:

This study presents a comprehensive mathematical model for open pit mine block sequencing problem which considers technical aspects of real-life mine operations. As the open pit block sequencing problem is an NP-hard, state-of-the-art heuristics algorithms, including constructive heuristic, local search, simulated annealing, and tabu search are developed and coded using MATLAB programming language. Computational experiments show that the proposed algorithms are satisfactory to solve industrial-scale instances. Numerical investigation and sensitivity analysis based on real-world data are also c

APA, Harvard, Vancouver, ISO, and other styles

49

Lidberg, Simon. "Evolving Cuckoo Search : From single-objective to multi-objective." Thesis, Högskolan i Skövde, Institutionen för teknik och samhälle, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:his:diva-5309.

Full text

Abstract:

This thesis aims to produce a novel multi-objective algorithm that is based on Cuckoo Search by Dr. Xin-She Yang. Cuckoo Search is a promising nature-inspired meta-heuristic optimization algorithm, which currently is only able to solve single-objective optimization problems. After an introduction, a number of theoretical points are presented as a basis for the decision of which algorithms to hybridize Cuckoo Search with. These are then reviewed in detail and verified against current benchmark algorithms to evaluate their efficiency. To test the proposed algorithm in a new setting, a real-world

APA, Harvard, Vancouver, ISO, and other styles

50

Remde, Stephen M., Peter I. Cowling, Keshav P. Dahal, and N. J. Colledge. "Exact/heuristic hybrids using rVNS and hyperheuristics for workforce scheduling." Springer-Verlag, 2007. http://hdl.handle.net/10454/2510.

Full text

Abstract:

In this paper we study a complex real-world workforce scheduling problem. We propose a method of splitting the problem into smaller parts and solving each part using exhaustive search. These smaller parts comprise a combination of choosing a method to select a task to be scheduled and a method to allocate resources, including time, to the selected task. We use reduced Variable Neighbourhood Search (rVNS) and hyperheuristic approaches to decide which sub problems to tackle. The resulting methods are compared to local search and Genetic Algorithm approaches. Parallelisation is used to pe

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!