Pages that link to "Item:Q5933519"
From MaRDI portal
The following pages link to Using experimental design to find effective parameter settings for heuristics (Q5933519):
Displaying 25 items.
- MaxSAT by improved instance-specific algorithm configuration (Q274404) (← links)
- Improving the performance of metaheuristics: an approach combining response surface methodology and racing algorithms (Q277580) (← links)
- Capacity consumption analysis using heuristic solution method for under construction railway routes (Q291652) (← links)
- Minimising maximum response time (Q336510) (← links)
- Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm (Q337247) (← links)
- An efficient heuristic algorithm for the capacitated \(p\)-median problem (Q385459) (← links)
- Instance-specific multi-objective parameter tuning based on fuzzy logic (Q439495) (← links)
- An effective and simple heuristic for the set covering problem (Q853015) (← links)
- Optimizing heuristic search in forest planning (Q867984) (← links)
- Matheuristics for the single-path design-balanced service network design problem (Q1652031) (← links)
- Tabu search and iterated local search for the cyclic bottleneck assignment problem (Q1652664) (← links)
- Solving the vehicle routing problem with adaptive memory programming methodology (Q1772865) (← links)
- Algorithms for the minmax regret path problem with interval data (Q2198244) (← links)
- Automatically improving the anytime behaviour of optimisation algorithms (Q2256321) (← links)
- Reliable wireless multimedia sensor network design: comparison of hybrid metaheuristics and a matheuristic (Q2322749) (← links)
- A genetic algorithm based on relaxation induced neighborhood search in a local branching framework for capacitated multicommodity network design (Q2357911) (← links)
- A new bilevel formulation for the vehicle routing problem and a solution method using a genetic algorithm (Q2465483) (← links)
- DYNAMIC FACILITY LAYOUT WITH MULTI-OBJECTIVES (Q2931727) (← links)
- Tuning an Algorithm Using Design of Experiments (Q3064524) (← links)
- Bio-inspired scheduling for dynamic job shops with flexible routing and sequence-dependent setups (Q3430252) (← links)
- Comparative Analysis of Constraint Handling Techniques Based on Taguchi Design of Experiments (Q5011409) (← links)
- Tuning Algorithms for Stochastic Black-Box Optimization: State of the Art and Future Perspectives (Q5153496) (← links)
- Metaheuristics—the metaphor exposed (Q5246818) (← links)
- A memetic algorithm for solving rich waste collection problems (Q6167528) (← links)
- On the benefits of knowledge compilation for feature-model analyses (Q6630715) (← links)
