Large-scale layout of facilities using a heuristic hybrid algorithm
From MaRDI portal
Publication:1337243
DOI10.1016/0307-904X(94)90328-XzbMath0811.90055MaRDI QIDQ1337243
Publication date: 30 October 1994
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
A survey for the quadratic assignment problem ⋮ Metaheuristics: A bibliography ⋮ An efficient multiple-stage mathematical programming method for advanced single and multi-floor facility layout problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- An improved annealing scheme for the QAP
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- A thermodynamically motivated simulation procedure for combinatorial optimization problems
- A heuristic method for the multi-story layout problem
- Tabu search and design optimization
- Experimental analysis of simulated annealing based algorithms for the layout problem
- Future paths for integer programming and links to artificial intelligence
- The Backboard Wiring Problem: A Placement Algorithm
- Assignment Problems and the Location of Economic Activities
- A branch-and-bound-based heuristic for solving the quadratic assignment problem
- Tabu Search—Part I
- Tabu Search—Part II
- Tabu Search Applied to the Quadratic Assignment Problem
- Hospital Layout as a Quadratic Assignment Problem
- Numerical investigations on quadratic assignment problems
- An exact branch-and-bound procedure for the quadratic-assignment problem
- Equation of State Calculations by Fast Computing Machines
- An Algorithm for the Quadratic Assignment Problem
This page was built for publication: Large-scale layout of facilities using a heuristic hybrid algorithm
