Cited in
(47)- Optimum exact/approximate point synthesis of planar mechanisms
- Ant colony approach to constrained redundancy optimization in binary systems
- A study of ACO capabilities for solving the maximum clique problem
- Hybrid ant systems for the dynamic facility layout problem
- A new ant colony optimization algorithm for the multidimensional Knapsack problem
- Combining two pheromone structures for solving the car sequencing problem with ant colony optimization
- An aggregated clustering approach using multi-ant colonies algorithms
- A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP
- Solving the vehicle routing problem with adaptive memory programming methodology
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- A modified ant colony system for solving the travelling salesman problem with time windows
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem
- An ant colony system for permutation flow-shop sequencing
- Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances
- QAPLIB
- PAES
- BoneRoute
- MACS-VRPTW
- FANT
- Beam-ACO
- AntNet
- Wumpus
- GIDEON
- bc-opt
- QAPgrid
- HAS-SOP
- Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing
- Application of a fuzzy ant colony system to solve the dynamic vehicle routing problem with uncertain service time
- An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups
- Variable neighborhood search for the workload balancing problem in service enterprises
- Time dependent vehicle routing problem with a multi ant colony system
- New variable-length data compression scheme for solution representation of meta-heuristics
- Metaheuristics in combinatorial optimization
- Decomposition-based evolutionary algorithm with automatic estimation to handle many-objective optimization problem
- Mapping the convergence of genetic algorithms
- ACS-TS: Train scheduling using ant colony system
- Gene selection via a new hybrid ant colony optimization algorithm for cancer classification in high-dimensional data
- Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation
- Iterated local search for the quadratic assignment problem
- Adaptive memory programming: a unified view of metaheuristics
- Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem
- A hybrid metaheuristic for the quadratic assignment problem
- Recent advances in dynamic facility layout research
- Hybrid population-based algorithms for the bi-objective quadratic assignment problem
- Effective formulation reductions for the quadratic assignment problem
- A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices
- Problems of discrete optimization: challenges and main approaches to solve them
This page was built for software: HAS-QAP
