Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
From MaRDI portal
Publication:3391964
DOI10.1287/opre.1050.0243zbMath1167.90654OpenAlexW2031585418MaRDI QIDQ3391964
Belarmino Adenso-Díaz, Manuel Laguna
Publication date: 13 August 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/c116698352a119a1e8c5522846a71d474ea99d6f
Approximation methods and heuristics in mathematical programming (90C59) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design ⋮ The consultation timetabling problem at Danish high schools ⋮ ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms ⋮ The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design ⋮ MaxSAT by improved instance-specific algorithm configuration ⋮ Improving the performance of metaheuristics: an approach combining response surface methodology and racing algorithms ⋮ Capacity consumption analysis using heuristic solution method for under construction railway routes ⋮ A multi-level Taguchi-factorial two-stage stochastic programming approach for characterization of parameter uncertainties and their interactions: an application to water resources management ⋮ Hybrid metaheuristics for the accessibility windows assembly line balancing problem level 2 (AWALBP-L2) ⋮ Local search-based hybrid algorithms for finding Golomb rulers ⋮ Minimising maximum response time ⋮ Heuristics and simulated annealing procedures for the accessibility windows assembly line problem level 1 (AWALBP-L1) ⋮ MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration ⋮ Solving the accessibility windows assembly line problem level 1 and variant 1 (AWALBP-L1-1) with precedence constraints ⋮ Optimizing the periodic pick-up of raw materials for a manufacturer of auto parts ⋮ An efficient heuristic algorithm for the capacitated \(p\)-median problem ⋮ Profiling effects in industrial data mining by non-parametric DOE methods: an application on screening checkweighing systems in packaging operations ⋮ MPILS: an automatic tuner for MILP solvers ⋮ A multilevel evaluation method for heuristics with an application to the VRPTW ⋮ Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences ⋮ Algorithms for the minmax regret path problem with interval data ⋮ A branch and bound algorithm for the response time variability problem ⋮ Instance-specific multi-objective parameter tuning based on fuzzy logic ⋮ Optimization for simulation: LAD accelerator ⋮ Methods for improving the efficiency of swarm optimization algorithms. A survey ⋮ Hybridizing the cross-entropy method: An application to the max-cut problem ⋮ Introducing dynamic diversity into a discrete particle swarm optimization ⋮ Markov chain methods for the bipartite Boolean quadratic programming problem ⋮ Automatically improving the anytime behaviour of optimisation algorithms ⋮ A hybrid genetic algorithm for the single machine maximum lateness problem with release times and family setups ⋮ Solving the response time variability problem by means of a psychoclonal approach ⋮ Minimizing labor requirements in a periodic vehicle loading problem ⋮ An ant colony optimization approach for the multidimensional knapsack problem ⋮ Hyper-heuristic approaches for the response time variability problem ⋮ Scheduling taxi services for a team of car relocators ⋮ Reliable wireless multimedia sensor network design: comparison of hybrid metaheuristics and a matheuristic ⋮ Solving the response time variability problem by means of a genetic algorithm ⋮ A tabu search algorithm for scheduling pharmaceutical packaging operations ⋮ Metaheuristics—the metaphor exposed ⋮ The influence of problem specific neighborhood structures in metaheuristics performance ⋮ OptiLog: a framework for SAT-based systems ⋮ PyDGGA: distributed GGA for automatic configuration
Uses Software
