Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
From MaRDI portal
Recommendations
Cited in
(53)- Local search-based hybrid algorithms for finding Golomb rulers
- A branch and bound algorithm for the response time variability problem
- Methods for improving the efficiency of swarm optimization algorithms. A survey
- Reliable wireless multimedia sensor network design: comparison of hybrid metaheuristics and a matheuristic
- Configuring mixed-integer programming solvers for large-scale instances
- ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
- Algorithms for the minmax regret path problem with interval data
- Solving the response time variability problem by means of a psychoclonal approach
- MaxSAT by improved instance-specific algorithm configuration
- The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design
- OptiLog: a framework for SAT-based systems
- PyDGGA: distributed GGA for automatic configuration
- Reducing cross-validation variance through seed blocking in hyperparameter tuning
- Improving the performance of metaheuristics: an approach combining response surface methodology and racing algorithms
- Realtime gray-box algorithm configuration using cost-sensitive classification
- Using experimental design to find effective parameter settings for heuristics
- The influence of problem specific neighborhood structures in metaheuristics performance
- Capacity consumption analysis using heuristic solution method for under construction railway routes
- Markov chain methods for the bipartite Boolean quadratic programming problem
- Instance-specific multi-objective parameter tuning based on fuzzy logic
- MPILS: an automatic tuner for MILP solvers
- A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design
- Scheduling taxi services for a team of car relocators
- A demonstration of the utility of fractional experimental design for finding optimal genetic algorithm parameter settings
- MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
- Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2)
- Minimising maximum response time
- Heuristics and simulated annealing procedures for the accessibility windows assembly line problem level 1 (AWALBP-L1)
- Hybridizing the cross-entropy method: An application to the max-cut problem
- A tabu search algorithm for scheduling pharmaceutical packaging operations
- A multilevel evaluation method for heuristics with an application to the VRPTW
- The consultation timetabling problem at Danish high schools
- Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts
- Minimizing labor requirements in a periodic vehicle loading problem
- Introducing dynamic diversity into a discrete particle swarm optimization
- An ant colony optimization approach for the multidimensional knapsack problem
- Solving the response time variability problem by means of a genetic algorithm
- Optimization for simulation: LAD accelerator
- Profiling effects in industrial data mining by non-parametric DOE methods: an application on screening checkweighing systems in packaging operations
- An adaptive genetic algorithm with optimal recombination for scheduling problems with energy resource
- Metaheuristics -- the metaphor exposed
- Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences
- Local tuning and partition strategies for diagonal GO methods
- Bayesian quality-diversity optimization for conditional search-space problems
- Solving the accessibility windows assembly line problem level 1 and variant 1 (AWALBP-L1-1) with precedence constraints
- A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups
- Automatically improving the anytime behaviour of optimisation algorithms
- Tuning an Algorithm Using Design of Experiments
- An auxiliary hybrid heuristic approach for objective function design evaluation -- using train unit scheduling as an example
- An efficient heuristic algorithm for the capacitated \(p\)-median problem
- Hyper-heuristic approaches for the response time variability problem
- A multi-level Taguchi-factorial two-stage stochastic programming approach for characterization of parameter uncertainties and their interactions: an application to water resources management
- Enhanced branching Latin hypercube design and its application in automatic algorithm configuration
This page was built for publication: Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3391964)
