Iterated local search for the quadratic assignment problem
From MaRDI portal
Recommendations
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem
- Solving the quadratic assignment problem by the repeated iterated tabu search method
- scientific article; zbMATH DE number 1203226
- Tabu Search Applied to the Quadratic Assignment Problem
- Comparison of iterative searches for the quadratic assignment problem
Cites work
- scientific article; zbMATH DE number 3643044 (Why is no real title available?)
- scientific article; zbMATH DE number 23663 (Why is no real title available?)
- scientific article; zbMATH DE number 3551675 (Why is no real title available?)
- scientific article; zbMATH DE number 714526 (Why is no real title available?)
- scientific article; zbMATH DE number 714533 (Why is no real title available?)
- scientific article; zbMATH DE number 1082106 (Why is no real title available?)
- scientific article; zbMATH DE number 2049005 (Why is no real title available?)
- scientific article; zbMATH DE number 2050711 (Why is no real title available?)
- scientific article; zbMATH DE number 2064412 (Why is no real title available?)
- scientific article; zbMATH DE number 1488097 (Why is no real title available?)
- scientific article; zbMATH DE number 2196289 (Why is no real title available?)
- A new genetic algorithm for the quadratic assignment problem
- An improved annealing scheme for the QAP
- An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
- Analysing the run-time behaviour of iterated local search for the travelling salesman problem.
- Ant colonies for the quadratic assignment problem
- Combining simulated annealing with local search heuristics
- Comparison of iterative searches for the quadratic assignment problem
- Correlated and uncorrelated fitness landscapes and how to tell the difference
- Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme
- Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
- Fast Algorithms for Geometric Traveling Salesman Problems
- Guided local search with shifting bottleneck for job shop scheduling
- Hospital Layout as a Quadratic Assignment Problem
- Improved large-step Markov chain variants for the symmetric TSP
- Landscapes, operators and heuristic search
- P-Complete Approximation Problems
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- Solving large quadratic assignment problems on computational grids
- Stochastic local search. Foundations and applications.
- Tabu Search Applied to the Quadratic Assignment Problem
- The Backboard Wiring Problem: A Placement Algorithm
- The Reactive Tabu Search
Cited in
(49)- Heuristic algorithms for the single allocation p-hub center problem with routing considerations
- An ejection chain algorithm for the quadratic assignment problem
- Multi-level departments-to-offices assignment with different room types
- Parallel hybrid genetic algorithms for solving Q3AP on computational grid
- Adaptive multi-operator metaheuristics for quadratic assignment problems
- On solving a hard quadratic 3-dimensional assignment problem
- Applying topological data analysis to local search problems
- The fractal geometry of fitness landscapes at the local optima level
- A matheuristic approach for the design of multiproduct batch plants with parallel production lines
- A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
- In and out forests on combinatorial landscapes
- A survey for the quadratic assignment problem
- An implementation of the iterated tabu search algorithm for the quadratic assignment problem
- A New Neighborhood for the QAP
- The multi-story space assignment problem
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
- On the limitations of classical benchmark functions for evaluating robustness of evolutionary algorithms
- Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem
- An opposition-based memetic algorithm for the maximum quasi-clique problem
- Worst improvement based iterated local search
- A solution approach from an analytic model to heuristic algorithm for special case of vehicle routing problem with stochastic demands
- An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints
- GEM: A novel evolutionary optimization method with improved neighborhood search
- A priority-based genetic algorithm for a flexible job shop scheduling problem
- Variable neighborhood search for the workload balancing problem in service enterprises
- Breakout local search for maximum clique problems
- Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion
- Neighborhood decomposition-driven variable neighborhood search for capacitated clustering
- scientific article; zbMATH DE number 2050711 (Why is no real title available?)
- On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem
- Neighborhood portfolio approach for local search applied to timetabling problems
- An experimental study of variable depth search algorithms for the quadratic assignment problem
- Very large-scale neighborhood search for the quadratic assignment problem
- A comparison of three metaheuristics for the workover rig routing problem
- The quadratic three-dimensional assignment problem: exact and approximate solution methods
- An iterative local search approach applied to the optimal stratification problem
- A hybrid iterated local search algorithm with adaptive perturbation mechanism by success-history based parameter adaptation for differential evolution (SHADE)
- Breakout local search for the quadratic assignment problem
- Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search
- Kernel technology to solve discrete optimization problems
- Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study
- An iterated local search algorithm for the vehicle routing problem with backhauls
- Applying an extended guided local search to the quadratic assignment problem
- Local search methods for the flowshop scheduling problem with flowtime minimization
- Approaching the rank aggregation problem by local search-based metaheuristics
- Heuristics and matheuristics for a real-life machine reassignment problem
- Solving the quadratic assignment problem by the repeated iterated tabu search method
- Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report
- An iterated local search algorithm for the lot-streaming flow shop scheduling problem
This page was built for publication: Iterated local search for the quadratic assignment problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2503224)
