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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(89)90185-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2120230601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4734782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>N</i>-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3347816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diffusions for Global Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Future paths for integer programming and links to artificial intelligence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A network-related nuclear power plant model with an intelligent branch- and-bound solution approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3829367 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming with Linear Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3829370 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the maximum satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using tabu search techniques for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Neural'' computation of decisions in optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Self-organization and associative memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logical calculus of the ideas immanent in nervous activity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The capacity of the Hopfield associative memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3809291 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519782 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:00, 19 June 2024

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
    0 references