Ant colonies for the quadratic assignment problem
From MaRDI portal
Publication:3157308
DOI10.1057/palgrave.jors.2600676zbMath1054.90621OpenAlexW2048698391WikidataQ56972157 ScholiaQ56972157MaRDI QIDQ3157308
Marco Dorigo, Éric D. Taillard, Luca Maria Gambardella
Publication date: 13 January 2005
Published in: Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1057/palgrave.jors.2600676
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Recent advances in dynamic facility layout research, An ant algorithm for the single row layout problem in flexible manufacturing systems, 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, A survey for the quadratic assignment problem, 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, Optimization of the quadratic assignment problem using an ant colony algorithm, An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups, DYNAMIC FACILITY LAYOUT WITH MULTI-OBJECTIVES, 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, Metaheuristics: A Canadian Perspective, An Ant-bidding Algorithm for Multistage Flowshop Scheduling Problem: Optimization and Phase Transitions, 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, Fresh seafood delivery routing problem using an improved 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, Backbone analysis and algorithm design for the quadratic assignment problem, 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 search based control optimisation strategy for a class of chaotic system, 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, Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search, 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, A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem, Probabilistic Model of Ant Colony Optimization for Multiple Knapsack Problem, Decomposition-based evolutionary algorithm with automatic estimation to handle many-objective optimization problem, USING ANT COLONY OPTIMIZATION TO MINIMIZE THE FUZZY MAKESPAN AND TOTAL WEIGHTED FUZZY COMPLETION TIME IN FLOW SHOP SCHEDULING PROBLEMS, HAS-QAP, The single-finger keyboard layout problem, A TWO-STATE ANT COLONY ALGORITHM FOR SOLVING THE MINIMUM GRAPH BISECTION PROBLEM, Forward Backward Transformation, 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, An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem, Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods, Metaheuristics in combinatorial optimization
Uses Software
