Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
From MaRDI portal
Publication:1609910
DOI10.1016/S0377-2217(97)00285-3zbMath0991.90127MaRDI QIDQ1609910
Publication date: 18 August 2002
Published in: European Journal of Operational Research (Search for Journal in Brave)
Search theory (90B40) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Ant colony optimization for solving an industrial layout problem ⋮ A survey for the quadratic assignment problem ⋮ Tabu search vs. simulated annealing as a function of the size of quadratic assignment problem instances ⋮ Integrated Facility Layout Design and Flow Assignment Problem Under Uncertainty ⋮ Improved tabu search heuristics for the dynamic space allocation problem ⋮ A new hybrid tabu-simulated annealing heuristic for the dynamic facility layout problem ⋮ Quadratic assignment problem variants: a survey and an effective parallel memetic iterated tabu search ⋮ Heuristic approach for solving the multi-objective facility layout problem ⋮ Heuristics for the dynamic facility layout problem with unequal-area departments ⋮ A tabu search heuristic for the dynamic space allocation problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- KBSS: A knowledge-based system for scheduling in automated manufacturing
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- The facility layout problem
- Experimental analysis of simulated annealing based algorithms for the layout problem
- Simulated annealing for machine layout problems in the presence of zoning constraints
- A distance assignment approach to the facility layout problem
- A simulated annealing approach for the one-machine mean tardiness scheduling problem
- Simulated annealing and tabu search in the long run: A comparison on QAP tasks
- Extensions of a tabu search adaptation to the quadratic assignment problem
- A study of diversification strategies for the quadratic assignment problem
- Massively parallel tabu search for the quadratic assignment problem
- The Quadratic Assignment Problem
- Statistical Mechanics: a General Approach to Combinatorial Optimization
- Techniques for Facilities Layout: Deciding which Pairs of Activities Should be Adjacent
- A Perturbation Scheme to Improve Hillier’s Solution to the Facilities Layout Problem
- Assignment Problems and the Location of Economic Activities
- The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
- Heuristic unidirectional flowpath design approaches for automated guided vehicle systems
- A heuristic algorithm for the quadratic assignment formulation to the plant layout problem
- Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- CLASS: Computerized LAyout Solutions using Simulated annealing
- Tabu Search—Part I
- Tabu Search Applied to the Quadratic Assignment Problem
- P-Complete Approximation Problems
- Numerical investigations on quadratic assignment problems
- An exact branch-and-bound procedure for the quadratic-assignment problem
- Bandwidth Packing: A Tabu Search Approach
- Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming
- Tree-search algorithms for quadratic assignment problems
- Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
