New approaches for heuristic search: A bilateral linkage with artificial intelligence
نویسنده
چکیده
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 ap$roaches are needed, and it is at least stimulating that some of these are inspired by natural phenomena.
منابع مشابه
Neuro-Optimizer: A New Artificial Intelligent Optimization Tool and Its Application for Robot Optimal Controller Design
The main objective of this paper is to introduce a new intelligent optimization technique that uses a predictioncorrectionstrategy supported by a recurrent neural network for finding a near optimal solution of a givenobjective function. Recently there have been attempts for using artificial neural networks (ANNs) in optimizationproblems and some types of ANNs such as Hopfield network and Boltzm...
متن کاملA Monte Carlo-Based Search Strategy for Dimensionality Reduction in Performance Tuning Parameters
Redundant and irrelevant features in high dimensional data increase the complexity in underlying mathematical models. It is necessary to conduct pre-processing steps that search for the most relevant features in order to reduce the dimensionality of the data. This study made use of a meta-heuristic search approach which uses lightweight random simulations to balance between the exploitation of ...
متن کاملNetwork Planning Using Iterative Improvement Methods and Heuristic Techniques
The problem of minimum-cost expansion of power transmission network is formulated as a genetic algorithm with the cost of new lines and security constraints and Kirchhoff’s Law at each bus bar included. A genetic algorithm (GA) is a search or optimization algorithm based on the mechanics of natural selection and genetics. An applied example is presented. The results from a set of tests carried ...
متن کاملCombined Petri net modelling and AI-based heuristic hybrid search for flexible manufacturing systemsラpart II. Heuristic hybrid search
This two-part paper presents modelling and scheduling approaches of flexible manufacturing systems using Petri nets (PNs) and artificial intelligence (AI)-based heuristic search methods. In Part I, PN-based modelling approaches and basic AI-based heuristic search algorithms were presented. In Part II, a new heuristic function that exploits PN information is proposed. Heuristic information obtai...
متن کاملA novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003