Pages that link to "Item:Q336931"
From MaRDI portal
The following pages link to Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances (Q336931):
Displaying 9 items.
- Anytime Pareto local search (Q319099) (← links)
- A biased random key genetic algorithm for the field Technician scheduling problem (Q342506) (← links)
- Effect of transformations of numerical parameters in automatic algorithm configuration (Q1634780) (← links)
- Fast simulated annealing for single-row equidistant facility layout (Q1663580) (← links)
- A methodology to exploit profit allocation in logistics joint distribution network optimization (Q1666679) (← links)
- An improved discrete PSO for tugboat assignment problem under a hybrid scheduling rule in container terminal (Q1719017) (← links)
- Revisiting simulated annealing: a component-based analysis (Q1725612) (← links)
- A landscape-based analysis of fixed temperature and simulated annealing (Q2171587) (← links)
- Selection hyper-heuristics for the multi and many-objective quadratic assignment problem (Q2676362) (← links)
