Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
From MaRDI portal
Publication:1130046
DOI10.1016/0377-2217(93)E0128-KzbMath0912.90240OpenAlexW2073636971WikidataQ56972186 ScholiaQ56972186MaRDI QIDQ1130046
Marco Dorigo, Vittorio Maniezzo, Alberto Colorni
Publication date: 25 May 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(93)e0128-k
Quadratic programming (90C20) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration ⋮ A survey for the quadratic assignment problem ⋮ Stochastic resource allocation using a predictor-based heuristic for optimization via simulation ⋮ Location and layout planning. A survey ⋮ Combined discrete-event simulation and ant colony optimisation approach for selecting optimal screening policies for diabetic retinopathy ⋮ Metaheuristics: A bibliography ⋮ Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs ⋮ On the quality of local search for the quadratic assignment problem ⋮ Hybrid meta-heuristic algorithms for solving network design problem ⋮ Ant colony search algorithms for optimal polygonal approximation of plane curves. ⋮ A simple ant colony optimizer for stochastic shortest path problems ⋮ On the finite-time dynamics of ant colony optimization ⋮ An ACO algorithm for a dynamic regional nurse-scheduling problem in Austria ⋮ A simple model for the multiple traveling salesmen problem with single depot and multiple sink ⋮ Performance of Sine–Cosine Algorithm on Large-Scale Optimization Problems ⋮ On the classification of NP-complete problems in terms of their correlation coefficient ⋮ Heuristics from Nature for Hard Combinatorial Optimization Problems ⋮ An effective ant colony optimization algorithm (ACO) for multi-objective resource allocation problem (MORAP) ⋮ Boosting the Exploration of Huge Dynamic Graphs ⋮ Ant algorithms and simulated annealing for multicriteria dynamic programming ⋮ First steps to the runtime complexity analysis of ant colony optimization ⋮ Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation ⋮ Ant colony optimization for the nonlinear resource allocation problem ⋮ Ant colony optimization and the minimum spanning tree problem ⋮ On the landscape ruggedness of the quadratic assignment problem ⋮ A provably convergent heuristic for stochastic bicriteria integer programming ⋮ A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints ⋮ A unified ant colony optimization algorithm for continuous optimization ⋮ A novel hybrid algorithm for scheduling steel-making continuous casting production ⋮ Analyzing the behaviors of virtual cells (VCs) and traditional manufacturing systems: Ant colony optimization (ACO)-based metamodels ⋮ Optimization of the keyboard arrangement problem using an ant colony algorithm. ⋮ Runtime analysis of a simple ant colony optimization algorithm ⋮ A survey on metaheuristics for stochastic combinatorial optimization ⋮ Unnamed Item ⋮ A framework for the description of evolutionary algorithms ⋮ An ant colony system approach for variants of the traveling salesman problem with time windows ⋮ Searching the components of the solution: The factor-based random search algorithm for ETSP ⋮ New advances in spatial network modelling: Towards evolutionary algorithms
Cites Work
- Optimization by Simulated Annealing
- Implicit parallelism in genetic algorithms
- An improved annealing scheme for the QAP
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- A note on asymptotic properties of the quadratic assignment problem
- A connectionist approach to the quadratic assignment problem
- A stochastic method for global optimization
- Assignment Problems and the Location of Economic Activities
- Some experience in applying a stochastic method to location problems
- Tabu Search—Part I
- Tabu Search—Part II
- Tabu Search Applied to the Quadratic Assignment Problem
- P-Complete Approximation Problems
- Hospital Layout as a Quadratic Assignment Problem
- Equation of State Calculations by Fast Computing Machines
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
