• No results found

search heuristic

STUDY ON DIVIDE-AND-CONQUER LOCAL SEARCH HEURISTIC

STUDY ON DIVIDE-AND-CONQUER LOCAL SEARCH HEURISTIC

... local search heuristic, we used problems generated from a two-dimensional lattice, as it is easy to compare the quality of the computational results when the original set of points is in two ...local ...

7

Few heuristic optimization algorithms to solve the multi-period fixed charge production-distribution problem

Few heuristic optimization algorithms to solve the multi-period fixed charge production-distribution problem

... population search heuristic, Simulated annealing algorithm (SAA) based neighbourhood search heuristic and an Equivalent variable cost (EVC) based simple heuristic are proposed to solve ...

11

The Vehicle routing problem with a volunteer workforce

The Vehicle routing problem with a volunteer workforce

... Non-profit organizations like the Meals on Wheels association of America rely on a volunteer workforce to prepare and deliver meals to approximately one million homebound citizens nation- wide. At the community level, ...

92

Disaster recovery heuristic

Disaster recovery heuristic

... popular search heuristic is called the ‘Tabu’ ...This heuristic repeatedly takes a solution and moves it to best solution found amongst its ...Tabu search method is very customizable and can ...

70

Scheduling In Cloud Based On Hyper Heuristics

Scheduling In Cloud Based On Hyper Heuristics

... This heuristic scheduling mainly involves the following ...a heuristic algorithm from the candidate pool of low level ...search heuristic. It mimics the natural selection process. This ...

6

A tensor based selection hyper heuristic for cross domain heuristic search

A tensor based selection hyper heuristic for cross domain heuristic search

... local search (LS)(also referred to as hill climbing), Ruin and Re-create (RR) and crossover (XO) heuristics ...level heuristic, depending on it’s nature ...local search operator) comes with an ...

47

On Delay versus Congestion in Designing Rearrangeable Multihop Lightwave Networks

On Delay versus Congestion in Designing Rearrangeable Multihop Lightwave Networks

... minimization. We assume the network has an arbitrary topology, the flow can be split and sent via different routes, and it can be transferred via intermediate nodes. Tabu search heuristic is used to compare ...

6

Subset selection routing : modelling and heuristics : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Operations Research at Massey University

Subset selection routing : modelling and heuristics : a thesis presented in partial fulfilment of the requirements for the degree of Doctor of Philosophy in Operations Research at Massey University

... tree search. They used an abbreviated branch-and-bound search, with partial routes abandoned if they don't meet some heuristically determined ...insertion heuristic, wherein the customer with the ...

496

ANALYSIS OF DIVIDE-AND CONQUER LOCAL SEARCH HEURISTICS WITH QUADRANT AND NEIGHBOR RESTRICTIONS

ANALYSIS OF DIVIDE-AND CONQUER LOCAL SEARCH HEURISTICS WITH QUADRANT AND NEIGHBOR RESTRICTIONS

... local search heuristic with quadrant restrictions (DACQ) and a divide-and-conquer local search heuristic with neighbor restrictions ...local search algorithms, there are neighborhood ...

9

Dynamic Node Recovery in MANET for High Recovery Probability

Dynamic Node Recovery in MANET for High Recovery Probability

... a search heuristic approach that generates best optimal solution to the search problems from a set of possible solutions by imitating the natural evolution ...

7

A Comparison of Neural Models for Word Ordering

A Comparison of Neural Models for Word Ordering

... of heuristic estimates of its ...of search errors. More formally, at each time step t our beam search keeps the n best hypothe- ses according to scoring function S(·) using partial model score s(·) ...

5

Web Search Result Clustering using Heuristic Search and Latent Semantic Indexing

Web Search Result Clustering using Heuristic Search and Latent Semantic Indexing

... web search are [15] and ...in search results: Hub and ...commercial search engines such as Google (based on PageRank) and Yahoo are being used by people across the globe, the relevancy of documents ...

6

An Exact A* Method for Deciphering Letter Substitution Ciphers

An Exact A* Method for Deciphering Letter Substitution Ciphers

... a search over the n-gram probabilities of possible solutions to the cipher, us- ing a generalization of the Viterbi algorithm that is wrapped in an A* search, which determines at each step which partial ...

8

Minimization of Active Power Loss and Voltage Profile Fortification by Using Differential Evolution – Harmony Search Algorithm

Minimization of Active Power Loss and Voltage Profile Fortification by Using Differential Evolution – Harmony Search Algorithm

... Evolution-harmony Search) algorithm for solving the multi- objective reactive power dispatch problem ....Harmony Search is a new heuristic algorithm, which mimics the procedure of a music player to ...

19

Sensor Distribution Optimization Based on Heuristic Algorithms for Structural Health Monitoring

Sensor Distribution Optimization Based on Heuristic Algorithms for Structural Health Monitoring

... global search method that offers an efficient parameter search optimization technique without the construction of a model of the structural system under ...

6

Contributions to the theory of a heuristic search for feasibility in design automation

Contributions to the theory of a heuristic search for feasibility in design automation

... Utility search ' s explicit separation of effort and quality circumvents one of A*'s difficulties.. The problem-domain representation,.[r] ...

85

Heuristic Neighbourhood Search Approach for Bulk Transportation Problem

Heuristic Neighbourhood Search Approach for Bulk Transportation Problem

... For heuristic bulk transportation problem, there are ‘m’ sources and ‘n’ destinations. All destinations should get required capacity from sources. The ‘m’ sources should have capacity more than requirement of ‘n’ ...

12

Dynamic real time hierarchical heuristic search for pathfinding

Dynamic real time hierarchical heuristic search for pathfinding

... Pathfinding in RTS becomes a complex and challenging task mainly due to the presence of a huge search space and very little time-span to solve it. In commercial games, a very small amount of CPU time is spared for ...

7

A Review of Discrete Optimization Heuristics

A Review of Discrete Optimization Heuristics

... Another meta-heuristic which relies on local search is called simulated annealing. Simulated annealing was rst introduced by Kirkpatrick et. al. (1983) and Cerny (1985) and has roots in the work of ...

5

On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods

On the Computing of the Minimum Distance of Linear Block Codes by Heuristic Methods

... Genetic Algorithms was first proposed by John Holland’s, as a means to find good solutions to problems that were otherwise computationally intractable. Holland’s schema theorem [21], and the related building block ...

11

Show all 10000 documents...

Related subjects