Initialization of metaheuristics: comprehensive review, critical analysis, and research directions (Q6056893): Difference between revisions

From MaRDI portal

Jump to:navigation, search

← Older edit Newer edit →

Revision as of 13:04, 4 December 2024

scientific article; zbMATH DE number 7745330

Language	Label	Description	Also known as
English	Initialization of metaheuristics: comprehensive review, critical analysis, and research directions	scientific article; zbMATH DE number 7745330

Statements

scholarly article

0 references

Initialization of metaheuristics: comprehensive review, critical analysis, and research directions (English)

0 references

0 references

0 references

0 references

International Transactions in Operational Research

0 references

publication date

4 October 2023

0 references

zbMATH Keywords

metaheuristics

0 references

initialization

0 references

evolutionary algorithms

0 references

swarm intelligence

0 references

local search

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1111/itor.13237

0 references

A greedy genetic algorithm for the quadratic assignment problem

0 references

Tabu search versus GRASP for the maximum diversity problem

0 references

Seeding the initial population with feasible solutions in metaheuristic optimization of steel trusses

0 references

The Reactive Tabu Search

0 references

Nature-Inspired Methods for Metaheuristics Optimization

0 references

Tuning metaheuristics. A machine learning Perspective

0 references

A new adaptive multi-start technique for combinatorial global optimizations

0 references

A new tabu search algorithm for the vehicle routing problem with backhauls

0 references

Exposing the grey wolf, moth‐flame, whale, firefly, bat, and antlion algorithms: six misleading optimization techniques inspired by <i>bestial</i> metaphors

0 references

An experimental evaluation of a scatter search for the linear ordering problem

0 references

A hybrid algorithm for the DNA sequencing problem

0 references

Applying the corridor method to a blocks relocation problem

0 references

The noising methods: A generalization of some metaheuristics

0 references

How to select a small set of diverse solutions to mixed integer programming problems

0 references

Centroidal Voronoi Tessellations: Applications and Algorithms

0 references

Some inverse optimization problems under the Hamming distance

0 references

The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs

0 references

Greedy randomized adaptive search procedures

0 references

Exploiting Erraticism in Search

0 references

Particle swarm optimization with chaotic opposition-based population initialization and stochastic search technique

0 references

Global optimization based on novel heuristics, low-discrepancy sequences and genetic algorithms

0 references

Inferring linear feasible regions using inverse optimization

0 references

Heuristic algorithms for the maximum diversity problem

0 references

0 references

Experiments concerning sequential versus simultaneous maximization of objective function and distance

0 references

0 references

Efficient Multi-Start Strategies for Local Search Algorithms

0 references

Semi-greedy heuristics: An empirical study

0 references

The Theory and Practice of Simulated Annealing

0 references

Path relinking for the vehicle routing problem

0 references

Machine Learning Foundations

0 references

Machine learning-based surrogate modeling for data-driven optimization: a comparison of subset selection for regression techniques

0 references

0 references

Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report

0 references

Quasi-random initial population for genetic algorithms

0 references

On initial populations of a genetic algorithm for continuous optimization problems

0 references

Multi-start methods for combinatorial optimization

0 references

Mersenne twister

0 references

Principles and Practice of Constraint Programming – CP 2004

0 references

On the benefits and risks of using fitness sharing for multimodal optimisation

0 references

Subpopulation initialization driven by linkage learning for dealing with the long-way-to-stuck effect

0 references

A novel population initialization method for accelerating evolutionary algorithms

0 references

0 references

Landscapes, operators and heuristic search

0 references

Chunking and cooperation in particle swarm optimization for feature selection

0 references

Advances in computer science and information technology. First international conference on computer science and information technology, CCSIT 2011, Bangalore, India, January 2--4, 2011. Proceedings, Part I

0 references

0 references

0 references

0 references

Metaheuristics—the metaphor exposed

0 references

Adaptive memory programming: a unified view of metaheuristics

0 references

The basins of attraction of the global minimizers of the non-convex sparse spike estimation problem

0 references

The particle swarm optimization algorithm: Convergence analysis and parameter selection

0 references

0 references

Looking ahead with the pilot method

0 references

0 references

A Guided Tour of Artificial Intelligence Research

0 references

Identifiers

10.1111/itor.13237

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6056893

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6056893&oldid=38020095"