New approaches for heuristic search: A bilateral linkage with artificial intelligence (Q1111942)

From MaRDI portal
Revision as of 13:51, 13 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
New approaches for heuristic search: A bilateral linkage with artificial intelligence
scientific article

    Statements

    New approaches for heuristic search: A bilateral linkage with artificial intelligence (English)
    0 references
    0 references
    0 references
    1989
    0 references
    This survey considers emerging approaches of heuristic search for solutions to combinatorially complex problems. Such problems arise in business applications, of traditional interest to operations research, such as in manufacturing operations, financial investment, capital budgeting and resource management. Artificial intelligence is a revived approach to problem-solving that requires heuristic search intrinsically in knowledge-base operations, especially for logical and analogical reasoning mechanisms. Thus, one bilateral linkage between operations research and artificial intelligence is their common interest in solving hard problems with heuristic search. That is the focus here. But longstanding methods of directed tree search with classical problem heuristics, such as for the Traveling Salesman Problem - a paradigm for combinatorially difficult problems - are not wholly satisfactory. Thus, new approaches are needed, and it is at least stimulating that some of these are inspired by natural phenomena.
    0 references
    decision support
    0 references
    genetic algorithm
    0 references
    neural networks
    0 references
    simulated annealing
    0 references
    tabu search
    0 references
    survey
    0 references
    heuristic search
    0 references
    artificial intelligence
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references