Initialization of metaheuristics: comprehensive review, critical analysis, and research directions
From MaRDI portal
Publication:6056893
DOI10.1111/itor.13237OpenAlexW4311497161MaRDI QIDQ6056893
Raka Jovanovic, Malek Sarhani, Stefan Voß
Publication date: 4 October 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.13237
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A hybrid algorithm for the DNA sequencing problem
- Particle swarm optimization with chaotic opposition-based population initialization and stochastic search technique
- 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
- Applying the corridor method to a blocks relocation problem
- Looking ahead with the pilot method
- How to select a small set of diverse solutions to mixed integer programming problems
- On initial populations of a genetic algorithm for continuous optimization problems
- Tabu search versus GRASP for the maximum diversity problem
- The particle swarm optimization algorithm: Convergence analysis and parameter selection
- Experiments concerning sequential versus simultaneous maximization of objective function and distance
- Tuning metaheuristics. A machine learning Perspective
- Global optimization based on novel heuristics, low-discrepancy sequences and genetic algorithms
- Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report
- Landscapes, operators and heuristic search
- A new adaptive multi-start technique for combinatorial global optimizations
- A greedy genetic algorithm for the quadratic assignment problem
- Quasi-random initial population for genetic algorithms
- Greedy randomized adaptive search procedures
- Semi-greedy heuristics: An empirical study
- An experimental evaluation of a scatter search for the linear ordering problem
- Inferring linear feasible regions using inverse optimization
- Chunking and cooperation in particle swarm optimization for feature selection
- Machine learning-based surrogate modeling for data-driven optimization: a comparison of subset selection for regression techniques
- Multi-start methods for combinatorial optimization
- On the benefits and risks of using fitness sharing for multimodal optimisation
- Path relinking for the vehicle routing problem
- A new tabu search algorithm for the vehicle routing problem with backhauls
- A novel population initialization method for accelerating evolutionary algorithms
- Some inverse optimization problems under the Hamming distance
- Subpopulation initialization driven by linkage learning for dealing with the long-way-to-stuck effect
- The pilot method: A strategy for heuristic repetition with application to the Steiner problem in graphs
- Efficient Multi-Start Strategies for Local Search Algorithms
- Mersenne twister
- The Reactive Tabu Search
- Heuristic algorithms for the maximum diversity problem
- The Theory and Practice of Simulated Annealing
- Centroidal Voronoi Tessellations: Applications and Algorithms
- The basins of attraction of the global minimizers of the non-convex sparse spike estimation problem
- Seeding the initial population with feasible solutions in metaheuristic optimization of steel trusses
- Machine Learning Foundations
- Exploiting Erraticism in Search
- Nature-Inspired Methods for Metaheuristics Optimization
- Metaheuristics—the metaphor exposed
- Principles and Practice of Constraint Programming – CP 2004
- Adaptive memory programming: a unified view of metaheuristics
- The noising methods: A generalization of some metaheuristics
- Exposing the grey wolf, moth‐flame, whale, firefly, bat, and antlion algorithms: six misleading optimization techniques inspired by bestial metaphors
