Parallel Ant Colonies for the quadratic assignment problem
From MaRDI portal
Publication:4538530
Recommendations
Cited in
(20)- Evolutionary Computation in Combinatorial Optimization
- Ant colonies for the quadratic assignment problem
- scientific article; zbMATH DE number 5525616 (Why is no real title available?)
- A modified ant colony system for solving the travelling salesman problem with time windows
- Optimization of the quadratic assignment problem using an ant colony algorithm
- A survey for the quadratic assignment problem
- scientific article; zbMATH DE number 2209375 (Why is no real title available?)
- Multi colony ant algorithms
- scientific article; zbMATH DE number 1617352 (Why is no real title available?)
- Maintaining explicit diversity within individual ant colonies
- A hybrid ant colony optimization algorithm for solving facility layout problems formulated as quadratic assignment problems
- Analyzing the behaviors of virtual cells (VCs) and traditional manufacturing systems: Ant colony optimization (ACO)-based metamodels
- A new solution algorithm for improving performance of ant colony optimization
- ACS-TS: Train scheduling using ant colony system
- A heuristic approach to find the global optimum of function
- Ant colony optimization for finding the global minimum
- A hybrid metaheuristic for the quadratic assignment problem
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
- Ant colony optimization for solving an industrial layout problem
- Replenishment policy based on modified ant colony optimisation and statistical analysis under the pre-order penetration point
This page was built for publication: Parallel Ant Colonies for the quadratic assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4538530)