Tuning metaheuristics. A machine learning Perspective
From MaRDI portal
Cited in
(43)- Best practices for comparing optimization algorithms
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
- An efficient algorithm for unconstrained optimization
- A hybrid steady-state genetic algorithm for the min-degree constrained minimum spanning tree problem
- New genetic algorithm approach for the MIN-degree constrained minimum spanning tree
- A methodology for determining an effective subset of heuristics in selection hyper-heuristics
- Collaborative vehicle routing: a survey
- Large neighbourhood search algorithms for the founder sequence reconstruction problem
- Synergies between operations research and data mining: the emerging use of multi-objective approaches
- An optimization algorithm inspired by social creativity systems
- Review on nature-inspired algorithms
- Methods for improving the efficiency of swarm optimization algorithms. A survey
- Incorporating decision-maker's preferences into the automatic configuration of bi-objective optimisation algorithms
- Heuristics for optimization and learning. Selected papers based on the presentations of the 7th international conference on metaheuristics and nature inspired computing, META'18, Marrakech, Morocco, October 27--31, 2018
- Rollout-based routing strategies with embedded prediction: a fish trawling application
- Algorithms for the minmax regret path problem with interval data
- A joint problem of strategic workforce planning and fleet renewal: with an application in defense
- Automatically improving the anytime behaviour of optimisation algorithms
- OREX-J: Towards a universal software framework for the experimental analysis of optimization algorithms
- Adaptation of the method of musical composition for solving the multiple sequence alignment problem
- Runtime analysis for self-adaptive mutation rates
- Capping methods for the automatic configuration of optimization algorithms
- A statistical learning based approach for parameter fine-tuning of metaheuristics
- A heuristic and an exact method for the gate matrix connection cost minimization problem
- Memory and learning in metaheuristics
- Effective learning hyper-heuristics for the course timetabling problem
- Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools
- An experimental comparison of algebraic crossover operators for permutation problems
- Comparison of metaheuristics for the k-labeled spanning forest problem
- MPILS: an automatic tuner for MILP solvers
- Initialization of metaheuristics: comprehensive review, critical analysis, and research directions
- Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem
- Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems
- A matheuristic algorithm for the pollution and energy minimization traveling salesman problems
- A multilevel evaluation method for heuristics with an application to the VRPTW
- Automatic performance tuning for Albany Land Ice
- Automatic MILP Solver configuration by learning problem similarities
- Hyperparameter optimization in machine learning
- Enhanced branching Latin hypercube design and its application in automatic algorithm configuration
- Metaheuristic Solutions to Order-of-Addition Design Problems
- Divide-and-conquer initialization and mutation operators for the large-scale mixed capacitated arc routing problem
- Region based memetic algorithm for real-parameter optimisation
- Estimation-based metaheuristics for the probabilistic traveling salesman problem
This page was built for publication: Tuning metaheuristics. A machine learning Perspective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1012715)
