Stack Overflow
Stack Overflow

Questions tagged [heuristics]

Heuristics refers to the use of algorithms to deal with highly complex problems.

Heuristics refers to the use of algorithms to deal with highly complex problems. A heuristic approach seeks to provide an approximate solution for a problem that is otherwise unsolvable.

683 questions
0
votes
0 answers

Corners heuristic pacman (Berkley's AI project)

Can someone please suggest which of the following distance formula to be used for corners heuristic problem? When I use manhattan distance, the results are incorrect. When I use euclidean distance, the pacman starts moving after 23.5 seconds which…
user2204586
  • 1
  • 1
  • 3
0
votes
1 answer

What does it mean for a heuristic to be considered admissible?

I've been told that an admissible heuristic for a search algorithm is one which never overestimates the shortest path to the goal. However is it valid to have non-goal state nodes have a heuristic value of 0 or is their an additional rule of…
0123
  • 85
  • 2
  • 9
0
votes
1 answer

What does heuristic h: {1, ... , N} --> R mean?

I want to know what does a heuristic h: {1, ... , N} --> R with the goal state always being 1 mean? The state are represented as points in a 2D Cartesian system, with coordinates (x,y).
Bibrak
  • 544
  • 4
  • 20
0
votes
1 answer

How to implement an heuristic for selecting appropriate image in Java

For a page that displays product information, we have to select the best product image from a set of images that show the same content, but have different formats (gif, png, jpg, etc.), different quality (jpeg comrpession), different sizes…
Paula23463
  • 1
0
votes
2 answers

Algorithm for choosing tiles to cover a path?

I have a segmented path/route on a map, and my software needs to request imagery from a server to completely cover the route. Image requests to the server can only be for rectangular regions (aligned with the cardinal directions). Simply…
WeatherLightning
  • 1
  • 1
0
votes
1 answer

CPLEX heuristics give different computational results

when we solve a maximization mip problem using cplex, can cplex heuristics affect the upper bound of the objective value? as far as I understand, cplex heuristic can improve the lower bound of the optimal value but NOT the upper bound. but in my…
abouttime
  • 1
0
votes
0 answers

Implementing A* for maze solving

I have a project for school. I have to read from a file a maze that is formed by the character 'X' for walls and '*' for walk-able cells. Maze entry is at top left and exit at bottom right. I have implemented a breadth-first search, which is pretty…
Henry
  • 149
  • 2
  • 8
0
votes
0 answers

Simulated annealing for solving mixed chinese postman prob

a guy asked me to solve the MCPP using heuristics. He pointed out simulated annealing. I'm doing my research and as far as I'm concerned this algorithm can not be applied for this problem. Why? Cause to find a solution some roads (edges, arcs) have…
user6321065
  • 11
  • 1
0
votes
1 answer

X-Y Heuristic on the N-Puzzle

First of all I have seen this answer and yes it explains X-Y heuristic but the example board was too simple for me to understand the general heuristic. X-Y heuristic function for solving N-puzzle So could someone please explain the X-Y heuristic…
Justin Jankunas
  • 3
  • 1
0
votes
0 answers

Integer Linear Programming- Efficient algorithm for optimization prob

I have a very specific Integer Linear Programming problem to tackle:- https://math.stackexchange.com/questions/1724708/efficient-time-complexity-algorithm-for-linear-programming-problems I did ask this question on the math forum but I think its more…
kurtgodel95
  • 31
  • 4
0
votes
0 answers

Graph generation from 2D array in java

I want to generate a graph from a 2D array to implement the game 'floodit'(you can play it here http://unixpapa.com/floodit). So the logic is that adjacent blocks of same colors are counted as one node. The code is not working as intended(Anything I…
Shawon0418
  • 181
  • 1
  • 3
  • 12
0
votes
1 answer

Possible Heuristic Function for Word Ladder

Hey I'm thinking of using A* to find and optimal solution for the Word Ladder problem but I'm having a bit of difficulty thinking of an appropriate g(x) and h(x). For this particular problem, could g(x) be the number of hops from the start vertex…
user4858185
0
votes
1 answer

Term for a Heuristic for 2 Arbitrary Nodes

Is there a term or expression for a heuristic function (as in pathfinding, state space, or combinatorial search) which can estimate the distance between any two nodes (goal or non-goal nodes)? Furthermore, is there a term for such a function which…
A Frayed Knot
  • 476
  • 5
  • 20
0
votes
2 answers

Simulated annealing doesn't return (an) optimal solution

I decided to learn simulated annealing as a new method to attack this problem with. It essentially asks how to fill a grid with -1, 0, or 1 so that each row and column sum is unique. As a test case, I used a 6x6 grid, for which there is definitely…
qwr
  • 9,525
  • 5
  • 58
  • 102
0
votes
1 answer

Strategy to tackle knapsack binded with travelling salesman

I have been assigned the following problem as a research topic for summer. However, I have not been able to successfully find related problem, except that it seems to be a combination of travelling salesman with the knapsack, even though I'm not…
addictedtohaskell
  • 521
  • 6
  • 16
1 2 3
…
45 46