Comparison of iterative searches for the quadratic assignment problem
From MaRDI portal
Publication:4229645
DOI10.1016/0966-8349(95)00008-6zbMath0916.90235OpenAlexW2020696014MaRDI QIDQ4229645
Publication date: 22 February 1999
Published in: Location Science (Search for Journal in Brave)
Full work available at URL: http://arodes.hes-so.ch/record/8220
Related Items
A multi-parent genetic algorithm for the quadratic assignment problem, Facility layout problem with QAP formulation under scenario-based uncertainty, Taking advantage of symmetry in some quadratic assignment problems, A multi-alternative approach to control in open systems: origins, current state, and future prospects, SIMD tabu search for the quadratic assignment problem with graphics hardware acceleration, The extended concentric tabu for the quadratic assignment problem, AN EFFICIENT AND PRACTICALLY ROBUST HYBRID METAHEURISTIC ALGORITHM FOR SOLVING FUZZY BUS TERMINAL LOCATION PROBLEMS, A survey for the quadratic assignment problem, Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances, Location and layout planning. A survey, A landscape-based analysis of fixed temperature and simulated annealing, Metaheuristics: A bibliography, Minimum energy configurations on a toric lattice as a quadratic assignment problem, Generating QAP instances with known optimum solution and additively decomposable cost function, An efficient heuristic for the \(k\)-partitioning problem, A New Neighborhood for the QAP, Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming, A parallel water flow algorithm with local search for solving the quadratic assignment problem, The repeated p-dispersion problem, A branch-and-bound algorithm for the single-row equidistant facility layout problem, Genetic local search with distance preserving recombination operator for a vehicle routing problem., An implementation of the iterated tabu search algorithm for the quadratic assignment problem, Revisiting simulated annealing: a component-based analysis, Extensive experiments with hybrid genetic algorithms for the solution of the quadratic assignment problem, Exact algorithms for the solution of the grey pattern quadratic assignment problem, An experimental study of variable depth search algorithms for the quadratic assignment problem, Experimental analysis of crossover and mutation operators on the quadratic assignment problem, Random assignment problems, A Complex-Networks View of Hard Combinatorial Search Spaces, Heuristic algorithms for Hadamard matrices with two circulant cores, Mapping the convergence of genetic algorithms, Distance preserving recombination operator for Earth observation satellites operations scheduling, New linearizations of quadratic assignment problems, Measuring instance difficulty for combinatorial optimization problems, Compounded genetic algorithms for the quadratic assignment problem, Ant colony optimization algorithm to the inter-cell layout problem in cellular manufacturing, On the landscape ruggedness of the quadratic assignment problem, Accelerated tabu search for no-wait flowshop scheduling problem with maximum lateness criterion, A new relaxation framework for quadratic assignment problems based on matrix splitting, Iterated local search for the quadratic assignment problem, Adaptive memory programming: a unified view of metaheuristics, Genetic local search for multi-objective combinatorial optimization, A hybrid metaheuristic for the quadratic assignment problem, Hybrid population-based algorithms for the bi-objective quadratic assignment problem, Finding a cluster of points and the grey pattern quadratic assignment problem, On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem, Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting, A linear formulation with \(O(n^2)\) variables for quadratic assignment problems with Manhattan distance matrices, Sequential Monte Carlo for maximum weight subgraphs with application to solving image jigsaw puzzles, Confidence in heuristic solutions?, Two effective hybrid metaheuristic algorithms for minimization of multimodal functions, $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices, APPLICATION OF ADAPTIVE NEURO FUZZY INFERENCE SYSTEM IN THE PROCESS OF TRANSPORTATION SUPPORT, A study of stochastic local search algorithms for the biobjective QAP with correlated flow matrices, A novel chaotic search for quadratic assignment problems, Finding optimal solutions to several gray pattern instances, Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
Uses Software
