Ant colonies for the quadratic assignment problem
From MaRDI portal
Recommendations
- Parallel Ant Colonies for the quadratic assignment problem
- A genetic ant colony optimisation system (GenANT) for quadratic assignment problems
- Optimization of the quadratic assignment problem using an ant colony algorithm
- Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
- scientific article; zbMATH DE number 2242691
Cited in
(68)- The single-finger keyboard layout problem
- An ant colony system for permutation flow-shop sequencing
- Fresh seafood delivery routing problem using an improved ant colony optimization
- Solving the vehicle routing problem with adaptive memory programming methodology
- An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
- An ant algorithm for the single row layout problem in flexible manufacturing systems
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
- Decomposition-based evolutionary algorithm with automatic estimation to handle many-objective optimization problem
- A novel ant colony optimization strategy for the quantum circuit compilation problem
- Application of a fuzzy ant colony system to solve the dynamic vehicle routing problem with uncertain service time
- Gene selection via a new hybrid ant colony optimization algorithm for cancer classification in high-dimensional data
- Ant colony optimization for solving an industrial layout problem
- Problems of discrete optimization: challenges and main approaches to solve them
- A cooperative parallel tabu search algorithm for the quadratic assignment problem
- An improved ant colony optimization for vehicle routing problem
- Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
- Time dependent vehicle routing problem with a multi ant colony system
- A new ant colony optimization algorithm for the multidimensional Knapsack problem
- A modified ant colony system for solving the travelling salesman problem with time windows
- Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation
- A study of ACO capabilities for solving the maximum clique problem
- An aggregated clustering approach using multi-ant colonies algorithms
- Iterated local search for the quadratic assignment problem
- A hybrid metaheuristic for the quadratic assignment problem
- Hybrid population-based algorithms for the bi-objective quadratic assignment problem
- Hybrid ant systems for the dynamic facility layout problem
- Allocation of advertising space by a web service provider using combinatorial auctions
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
- New variable-length data compression scheme for solution representation of meta-heuristics
- Dynamic facility layout with multi-objectives
- HAS-QAP
- Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances
- Variable neighborhood search for the workload balancing problem in service enterprises
- Maintaining explicit diversity within individual ant colonies
- A TWO-STATE ANT COLONY ALGORITHM FOR SOLVING THE MINIMUM GRAPH BISECTION PROBLEM
- Ant colony system solving capacitated location-allocation problems on a line
- An Ant-bidding Algorithm for Multistage Flowshop Scheduling Problem: Optimization and Phase Transitions
- Probabilistic Model of Ant Colony Optimization for Multiple Knapsack Problem
- USING ANT COLONY OPTIMIZATION TO MINIMIZE THE FUZZY MAKESPAN AND TOTAL WEIGHTED FUZZY COMPLETION TIME IN FLOW SHOP SCHEDULING PROBLEMS
- Forward backward transformation
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem
- Parallel Ant Colonies for the quadratic assignment problem
- scientific article; zbMATH DE number 6311365 (Why is no real title available?)
- A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP
- Ant search based control optimisation strategy for a class of chaotic system
- Evolutionary Computation in Combinatorial Optimization
- scientific article; zbMATH DE number 2242691 (Why is no real title available?)
- Recent advances in dynamic facility layout research
- Adaptive memory programming: a unified view of metaheuristics
- Metaheuristics: A Canadian Perspective
- An exceptionally difficult binary quadratic optimization problem with symmetry: a challenge for the largest unsolved QAP instance Tai256c
- Enhanced migrating birds optimization algorithm for optimization problems in different domains
- Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing
- Hardware-compatible single-shot feasible-space heuristics for solving the quadratic assignment problem
- A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- Metaheuristics in combinatorial optimization
- A genetic ant colony optimisation system (GenANT) for quadratic assignment problems
- A survey for the quadratic assignment problem
- Optimization of the quadratic assignment problem using an ant colony algorithm
- An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups
- Combining two pheromone structures for solving the car sequencing problem with ant colony optimization
- Optimum exact/approximate point synthesis of planar mechanisms
- Backbone analysis and algorithm design for the quadratic assignment problem
- Mapping the convergence of genetic algorithms
- ACS-TS: Train scheduling using ant colony system
- Ant colony approach to constrained redundancy optimization in binary systems
- Effective formulation reductions for the quadratic assignment problem
This page was built for publication: 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 Q3157308)
