Using experimental design to find effective parameter settings for heuristics
From MaRDI portal
Publication:5933519
DOI10.1023/A:1026569813391zbMath0967.90018OpenAlexW1532637815MaRDI QIDQ5933519
Edward A. Wasil, George C. Runger, Steven P. Coy, Bruce L. Golden
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
Approximation methods and heuristics in mathematical programming (90C59) Traffic problems in operations research (90B20)
Related Items (23)
A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity 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 ⋮ An effective and simple heuristic for the set covering problem ⋮ Minimising maximum response time ⋮ Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm ⋮ Matheuristics for the single-path design-balanced service network design problem ⋮ Tabu search and iterated local search for the cyclic bottleneck assignment problem ⋮ Optimizing heuristic search in forest planning ⋮ DYNAMIC FACILITY LAYOUT WITH MULTI-OBJECTIVES ⋮ An efficient heuristic algorithm for the capacitated \(p\)-median problem ⋮ A memetic algorithm for solving rich waste collection problems ⋮ Algorithms for the minmax regret path problem with interval data ⋮ Instance-specific multi-objective parameter tuning based on fuzzy logic ⋮ 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 ⋮ Automatically improving the anytime behaviour of optimisation algorithms ⋮ Solving the vehicle routing problem with adaptive memory programming methodology ⋮ Reliable wireless multimedia sensor network design: comparison of hybrid metaheuristics and a matheuristic ⋮ Metaheuristics—the metaphor exposed ⋮ Bio-inspired scheduling for dynamic job shops with flexible routing and sequence-dependent setups ⋮ Comparative Analysis of Constraint Handling Techniques Based on Taguchi Design of Experiments
This page was built for publication: Using experimental design to find effective parameter settings for heuristics
