HAS-QAP
From MaRDI portal
Software:32324
No author found.
Related Items (35)
Recent advances in dynamic facility layout research ⋮ Problems of discrete optimization: challenges and main approaches to solve them ⋮ 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 ⋮ An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups ⋮ New variable-length data compression scheme for solution representation of meta-heuristics ⋮ A Restricted Dual Peaceman-Rachford Splitting Method for a Strengthened DNN Relaxation for QAP ⋮ An implementation of the iterated tabu search algorithm for the quadratic assignment problem ⋮ An ant colony system for permutation flow-shop sequencing ⋮ Combining two pheromone structures for solving the car sequencing problem with ant colony optimization ⋮ 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 ⋮ Optimum exact/approximate point synthesis of planar mechanisms ⋮ Mapping the convergence of genetic algorithms ⋮ ACS-TS: Train scheduling using ant colony system ⋮ Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation ⋮ Ant colony approach to constrained redundancy optimization in binary systems ⋮ Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing ⋮ A study of ACO capabilities for solving the maximum clique problem ⋮ Effective formulation reductions for the quadratic assignment problem ⋮ Solving the vehicle routing problem with adaptive memory programming methodology ⋮ An aggregated clustering approach using multi-ant colonies algorithms ⋮ Iterated local search for the quadratic assignment problem ⋮ Adaptive memory programming: a unified view of metaheuristics ⋮ A hybrid metaheuristic for the quadratic assignment problem ⋮ Hybrid population-based algorithms for the bi-objective quadratic assignment 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 ⋮ Decomposition-based evolutionary algorithm with automatic estimation to handle many-objective optimization problem ⋮ Hybrid ant systems for the dynamic facility layout problem ⋮ A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices ⋮ Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods ⋮ Metaheuristics in combinatorial optimization
This page was built for software: HAS-QAP
