Pages that link to "Item:Q1130046"
From MaRDI portal
The following pages link to Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem (Q1130046):
Displaying 38 items.
- Stochastic resource allocation using a predictor-based heuristic for optimization via simulation (Q336991) (← links)
- A survey for the quadratic assignment problem (Q852928) (← links)
- Combined discrete-event simulation and ant colony optimisation approach for selecting optimal screening policies for diabetic retinopathy (Q871693) (← links)
- Hybrid meta-heuristic algorithms for solving network design problem (Q881517) (← links)
- An effective ant colony optimization algorithm (ACO) for multi-objective resource allocation problem (MORAP) (Q929430) (← links)
- Ant algorithms and simulated annealing for multicriteria dynamic programming (Q954043) (← links)
- Ant colony optimization and the minimum spanning tree problem (Q974104) (← links)
- A novel hybrid algorithm for scheduling steel-making continuous casting production (Q1010303) (← links)
- Analyzing the behaviors of virtual cells (VCs) and traditional manufacturing systems: Ant colony optimization (ACO)-based metamodels (Q1013408) (← links)
- Runtime analysis of a simple ant colony optimization algorithm (Q1022344) (← links)
- A survey on metaheuristics for stochastic combinatorial optimization (Q1024034) (← links)
- Location and layout planning. A survey (Q1372765) (← links)
- On the quality of local search for the quadratic assignment problem (Q1383366) (← links)
- Ant colony search algorithms for optimal polygonal approximation of plane curves. (Q1403765) (← links)
- A framework for the description of evolutionary algorithms (Q1584807) (← links)
- New advances in spatial network modelling: Towards evolutionary algorithms (Q1595442) (← links)
- Optimization of the keyboard arrangement problem using an ant colony algorithm. (Q1812016) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs (Q1922632) (← links)
- A simple ant colony optimizer for stochastic shortest path problems (Q1945168) (← links)
- On the classification of NP-complete problems in terms of their correlation coefficient (Q1962048) (← links)
- A provably convergent heuristic for stochastic bicriteria integer programming (Q2271125) (← links)
- On the finite-time dynamics of ant colony optimization (Q2433257) (← links)
- An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria (Q2433375) (← links)
- First steps to the runtime complexity analysis of ant colony optimization (Q2475836) (← links)
- Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation (Q2479841) (← links)
- Ant colony optimization for the nonlinear resource allocation problem (Q2489380) (← links)
- A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints (Q2503082) (← links)
- A unified ant colony optimization algorithm for continuous optimization (Q2514761) (← links)
- A simple model for the multiple traveling salesmen problem with single depot and multiple sink (Q2970607) (← links)
- SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration (Q3163728) (← links)
- Boosting the Exploration of Huge Dynamic Graphs (Q3297380) (← links)
- An ant colony system approach for variants of the traveling salesman problem with time windows (Q3429053) (← links)
- Searching the components of the solution: The factor-based random search algorithm for ETSP (Q4229560) (← links)
- Performance of Sine–Cosine Algorithm on Large-Scale Optimization Problems (Q4613894) (← links)
- (Q5148970) (← links)
- Heuristics from Nature for Hard Combinatorial Optimization Problems (Q5690286) (← links)
- On the landscape ruggedness of the quadratic assignment problem (Q5941510) (← links)
