Artificial Intelligence, Heuristic Frameworks and Tabu Search
نویسنده
چکیده
This paper examines some of the characteristics of Al-based heuristic procedures that have emerged as frameworks for solving difficult optimization problems. Consideration of attributes shared to some degree by human prohlem solvers leads to focusing in greater detail on one of the more -ituccessful procedures, tabu search, which employs a flexible memory system (in contrast to 'memoryless^ systems, as in simulated annealing and genetic algorithms, and rigid memory systems as in branch and bound and A* search). Specific attention is given to the short-term memory component of tahu search, which has provided solutions superior to the best obtained by other methods for a variety of problems. Our development emphasizes the principles underlying the interplay between restricting tbe searcb to avoid unproductive retracing of patbs (by tneans of tabu conditions) and freeing the search to explore otherwise forbidden avenues (by aspiration criteria). Finally, we discuss briefly the relevance of a supplementary framework, called target analysis, which is a method for determining good decision rules to enable heuristics to perform more effectively.
منابع مشابه
Tabu Search With Target Analysis To The Assembly Line Balancing Problems -- An Artificial Intelligence Approach
This paper describes the application of tabu search, a recent heuristic technique for combinatorial optimization problems, to the assembly line balancing problems. Computational experiments with different search strategies have been performed for some assembly ine problems from literature. Computational results show that except for few cases tabu search always finds optimal solutions.
متن کاملTabu Programming Method: A New Meta-Heuristics Algorithm Using Tree Data Structures for Problem Solving
The core of artificial intelligence and machine learning is to get computers to solve problems automatically. One of the great tools that attempt to achieve that goal is Genetic Programming (GP). GP is a generalization procedure of the well-known meta-heuristic of Genetic Algorithms (GAs). Meta-heuristics have shown successful performance in solving many combinatorial search problems. In this p...
متن کاملModelling, Simulation and Optimisation of Network Planning Methods
In this paper, three iterative improvement methods, simulated annealing, genetic algorithm and tabu search, are proposed to search for solutions to network planning problems. Then, a brief summary of the heuristic methods, single-stage optimization methods, time-phased optimization methods, artificial intelligence techniques and iterative improvement methods are presented. Finally, the performa...
متن کاملTSDLMRA: an efficient multicast routing algorithm based on Tabu search
As a NP-Complete problem, multicast routing with delay constraint is a research difficulty in routing problem. Tabu Search is artificial intelligence algorithm, which is an extension of local search algorithm and has simple realization and well properties. In this paper, an efficient algorithm based on Tabu Search for Delay-Constrained Low-Cost Multicast Routing is proposed to solve delay-const...
متن کاملA Comparison of Intelligent Admission Control Schemes for Next Generation Wireless Systems using Genetic Algorithms, Simulated Annealing and Tabu Search
Mobile users will have a variety of services including high-speed data and real-time multimedia services with Next Generation Wireless Systems (NGWS). A unified and efficient handoff management is one of the key issues for NGWS to support global roaming of mobile users among different network architectures. In this paper, different artificial intelligence algorithms such as genetic algorithms (...
متن کامل