Iterated local search for the quadratic assignment problem
From MaRDI portal
Publication:2503224
DOI10.1016/j.ejor.2005.01.066zbMath1103.90066OpenAlexW2107709238MaRDI QIDQ2503224
Publication date: 14 September 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.01.066
Related Items
A priority-based genetic algorithm for a flexible job shop scheduling problem, A matheuristic approach for the design of multiproduct batch plants with parallel production lines, In and out forests on combinatorial landscapes, On the limitations of classical benchmark functions for evaluating robustness of evolutionary algorithms, A hybrid iterated local search algorithm with adaptive perturbation mechanism by success-history based parameter adaptation for differential evolution (SHADE), PARALLEL HYBRID GENETIC ALGORITHMS FOR SOLVING Q3AP ON COMPUTATIONAL GRID, An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints, The quadratic three-dimensional assignment problem: exact and approximate solution methods, A survey for the quadratic assignment problem, Variable neighborhood search for the workload balancing problem in service enterprises, Perturbed decomposition algorithm applied to the multi-objective traveling salesman problem, A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem, Breakout local search for maximum clique problems, Neighborhood decomposition-driven variable neighborhood search for capacitated clustering, Metaheuristics with restart and learning mechanisms for the no-idle flowshop scheduling problem with makespan criterion, A comparison of three metaheuristics for the workover rig routing problem, Local search methods for the flowshop scheduling problem with flowtime minimization, The multi-story space assignment problem, An opposition-based memetic algorithm for the maximum quasi-clique problem, A New Neighborhood for the QAP, Approaching the rank aggregation problem by local search-based metaheuristics, The fractal geometry of fitness landscapes at the local optima level, Applying topological data analysis to local search problems, Kernel technology to solve discrete optimization problems, An implementation of the iterated tabu search algorithm for the quadratic assignment problem, Randomized Decomposition Solver with the Quadratic Assignment Problem as a Case Study, Heuristic algorithms for the single allocation \(p\)-hub center problem with routing considerations, An experimental study of variable depth search algorithms for the quadratic assignment problem, Solving the quadratic assignment problem by the repeated iterated tabu search method, Multi-level departments-to-offices assignment with different room types, An Iterated Local Search Algorithm for the Lot-Streaming Flow Shop Scheduling Problem, An ejection chain algorithm for the quadratic assignment problem, Neighborhood portfolio approach for local search applied to timetabling problems, Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search, On the use of fitness landscape features in meta-learning based algorithm selection for the quadratic assignment problem, The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances, An iterated local search algorithm for the vehicle routing problem with backhauls, On solving a hard quadratic 3-dimensional assignment problem, GEM: A novel evolutionary optimization method with improved neighborhood search, A solution approach from an analytic model to heuristic algorithm for special case of vehicle routing problem with stochastic demands, Hybrid metaheuristics with evolutionary algorithms specializing in intensification and diversification: overview and progress report, Heuristics and matheuristics for a real‐life machine reassignment problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improved annealing scheme for the QAP
- Recent advances for the quadratic assignment problem with special emphasis on instances that are difficult for meta-heuristic methods
- Correlated and uncorrelated fitness landscapes and how to tell the difference
- Landscapes, operators and heuristic search
- Solving large quadratic assignment problems on computational grids
- Combining simulated annealing with local search heuristics
- Improved large-step Markov chain variants for the symmetric TSP
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem
- A New Genetic Algorithm for the Quadratic Assignment Problem
- Ant colonies for the quadratic assignment problem
- The Backboard Wiring Problem: A Placement Algorithm
- Tabu Search Applied to the Quadratic Assignment Problem
- Fast Algorithms for Geometric Traveling Salesman Problems
- P-Complete Approximation Problems
- Entwurf von Schreibmaschinentastaturen mittels quadratischer Zuordnungsprobleme
- Hospital Layout as a Quadratic Assignment Problem
- Comparison of iterative searches for the quadratic assignment problem
- The Reactive Tabu Search
- Exact and Approximate Nondeterministic Tree-Search Procedures for the Quadratic Assignment Problem
