definition · term 8 of 25
heuristics.
Rules of thumb or search procedures that find good solutions quickly without proving how good they are.
worked examplegood fast, distance unknownThe nearest-neighbour rule builds a delivery route in a second. It is often decent, but on its own it cannot say whether a route 10 % shorter exists.
in plain language
Heuristics range from simple rules (always send the nearest truck) to metaheuristics such as simulated annealing, tabu search or genetic algorithms. They scale to very large problems and are often fast. What they cannot tell you is how far a solution is from the best possible one.
heuristics, on your own decision.
Bring one recurring decision. Your planners see the terms of this glossary applied to their own rules and data.
- Glossary
- all 25 terms, a to z
- Problem types
- the decisions kint solves
- Comparisons
- kint next to other approaches
- Contact
- hello@kint.pro