Using experimental design to find effective parameter settings for heuristics

DOI10.1023/A:1026569813391MaRDI QIDQ5933519zbMATH OpenOpenAlexFDO

Authors Steven P. Coy, Bruce Golden, George Runger, Edward Wasil

Publication date 2001

Published in Journal of Heuristics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1026569813391

zbMATH Keywords

heuristicsvehicle routingstatistical design of experiments

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)

Recommendations

• A parametric analysis of heuristics for the vehicle routing problem with side-constraints
• Tuning a parametric Clarke–Wright heuristic via a genetic algorithm
• Experimental evaluation of heuristic optimization algorithms: A tutorial
• A heuristic for the vehicle routing problem with time windows
• Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search

Cited in

(32)

• Reliable wireless multimedia sensor network design: comparison of hybrid metaheuristics and a matheuristic
• Algorithms for the minmax regret path problem with interval data
• A memetic algorithm for solving rich waste collection problems
• MaxSAT by improved instance-specific algorithm configuration
• Bio-inspired scheduling for dynamic job shops with flexible routing and sequence-dependent setups
• Dynamic facility layout with multi-objectives
• Solving the vehicle routing problem with adaptive memory programming methodology
• Improving the performance of metaheuristics: an approach combining response surface methodology and racing algorithms
• An effective and simple heuristic for the set covering problem
• Capacity consumption analysis using heuristic solution method for under construction railway routes
• Instance-specific multi-objective parameter tuning based on fuzzy logic
• A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design
• Comparative Analysis of Constraint Handling Techniques Based on Taguchi Design of Experiments
• Optimizing heuristic search in forest planning
• DOE-based parameter tuning for local branching algorithm
• Matheuristics for the single-path design-balanced service network design problem
• Tabu search and iterated local search for the cyclic bottleneck assignment problem
• A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm
• Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives
• Minimising maximum response time
• Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm
• On the benefits of knowledge compilation for feature-model analyses
• How much do we ``pay for using default parameters?
• Automating the parameter selection in VRP: an off-line parameter tuning tool comparison
• Tuning a parametric Clarke–Wright heuristic via a genetic algorithm
• A parametric analysis of heuristics for the vehicle routing problem with side-constraints
• Metaheuristics -- the metaphor exposed
• Determining Whether a Problem Characteristic Affects Heuristic Performance
• Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
• Automatically improving the anytime behaviour of optimisation algorithms
• Tuning an Algorithm Using Design of Experiments
• An efficient heuristic algorithm for the capacitated \(p\)-median problem

This page was built for publication: Using experimental design to find effective parameter settings for heuristics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5933519)