Search the World's Largest Database of Information Science & Technology Terms & Definitions
InfInfoScipedia LogoScipedia
A Free Service of IGI Global Publishing House
Below please find a list of definitions for the term that
you selected from multiple scholarly research resources.

What is Meta-Heuristics

Advanced Methodologies and Technologies in Business Operations and Management
High-level, overarching heuristic approaches that have wide-ranging applicability to many different mathematical programming problems.
Published in Chapter:
A Nature-Inspired Metaheuristic Approach for Generating Alternatives
Julian Scott Yeomans (York University, Canada)
DOI: 10.4018/978-1-5225-7362-3.ch054
Abstract
“Real-world” decision making often involves complex problems that are riddled with incompatible and inconsistent performance objectives. These problems typically possess competing design requirements which are very difficult—if not impossible—to quantify and capture at the time that any supporting decision models are constructed. There are invariably unmodeled design issues, not apparent during the time of model construction, which can greatly impact the acceptability of the model's solutions. Consequently, when solving many practical mathematical programming applications, it is generally preferable to formulate numerous quantifiably good alternatives that provide very different perspectives to the problem. This solution approach is referred to as modelling to generate alternatives (MGA). This study demonstrates how the nature-inspired firefly algorithm can be used to efficiently create multiple solution alternatives that both satisfy required system performance criteria and yet are maximally different in their decision spaces.
Full Text Chapter Download: US $37.50 Add to Cart
More Results
A Genetic Algorithm's Approach to the Optimization of Capacitated Vehicle Routing Problems
A search procedure intended to solve computational problems, by seeking appropriate solution methods by adjusting parameters and specifications.
Full Text Chapter Download: US $37.50 Add to Cart
Bio-Inspired Modelling to Generate Alternatives
High-level, overarching heuristic approaches that have wide-ranging applicability to many different mathematical programming problems.
Full Text Chapter Download: US $37.50 Add to Cart
A Nature-Inspired Metaheuristic Approach for Generating Alternatives
High-level, overarching heuristic approaches that have wide-ranging applicability to many different mathematical programming problems.
Full Text Chapter Download: US $37.50 Add to Cart
Designing Parallel Meta-Heuristic Methods
General computational algorithms using stochastic search processes applied to the various search and optimization problems.
Full Text Chapter Download: US $37.50 Add to Cart
Hybrid Meta-Heuristics Based System for Dynamic Scheduling
Form a class of powerful and practical solution techniques for tackling complex, large-scale combinatorial problems producing efficiently high-quality solutions.
Full Text Chapter Download: US $37.50 Add to Cart
Evolutionary Computing to Examine Variation in Proteins with Evolution
A meta-heuristic is an elevated stage procedure for heuristics. It has been designed to analyze, produce or opt for a comparatively lower stage of heuristics to generate the preeminent probable elucidation, especially with partial or inadequate data availability or restricted computation capacity. Unlike optimization algorithms and iterative techniques, meta-heuristics do not confirm regarding a globally optimal deduction to resolve certain problems. Many meta-heuristics employ certain type of stochastic optimization, so that the deduction inferred is dependent upon the cluster of random variables produced.
Full Text Chapter Download: US $37.50 Add to Cart
Ant Colony Algorithm for Single Stage Supply Chain
A general algorithmic framework which guide the search process in order to find optimal solutions.
Full Text Chapter Download: US $37.50 Add to Cart
Consensus Clustering
In computer methods used in optimization, by metaheuristic we understand an algorithm that finds a satisfactory solution to a given optimization problem by iteratively trying to improve a candidate solution with respect to a given measure of quality. When a single solution is iteratively improved we say about local search algorithm, and when a set of candidate solutions is simultaneously modified, we say about population-based search methods. A well known example of such methods is evolutionary algorithm, being elaborated version of so-called genetic algorithm.
Full Text Chapter Download: US $37.50 Add to Cart
eContent Pro Discount Banner
InfoSci OnDemandECP Editorial ServicesAGOSR