Problem solving search methods page 162

Analaytical techniques: Use a mathematical formula to derive an optimal solution directly or to predict a certain result. Used primarily for solving structured problems, usually of a tactical or operational nature. areas such as resources allocation, inventory mgt

Algorithms: Step-by-step process for obtaining an optimal solution. Solutions generated and tested for possible improvements. The process continues until no further improvment is possible.

Blind Searching: In conducting a search, a description of a desired outcome may be given. This is called a goal. A set of possible steps leading from the initial consitions to the goal is called the search steps. Problem solving is odne by searching through possible solutions.

Heuristic Searching: Via knowledge, common sense, rule of thumb. Heuristics are the informal, judgemental kowl,edge of an application area that constitute the rules of good judgement in the feild. Domain KNowledge.

Find-by-search approaches

These are analytical techniques (algorithms) for finding possible outcomes for structured problems

• A general step-by-step search for solutions that eventually obtains (finds) an optimal solution.

Blind searching
Complete enumeration search
All alternatives explored
Incomplete search
Partial search

• Achieves satysficing of particular goal
• May obtain optimal goal

Heurisitic searching
Repeated, step-by-step searches
Rule-based, so used for specific situations
Will find a “good enough” solution, but eventually will obtain optimal outcome
Examples of heuristics
Tabu search
Remembers and directs toward higher quality choices
Genetic algorithms
Randomly examines pairs of solutions, chooses best solutions so far and mutates them to find even better solutions