Large-scale layout of facilities using a heuristic hybrid algorithm

DOI10.1016/0307-904X(94)90328-XzbMATH Open0811.90055MaRDI QIDQ1337243FDOQ1337243

Authors: J. A. Bland, G. P. Dawson 

Publication date: 30 October 1994

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Recommendations

• Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
• A hybrid heuristic for the facilities layout problem
• An improved tabu search heuristic for solving facility layout design problems
• A heuristic algorithm for the quadratic assignment formulation to the plant layout problem
• The facility layout problem

zbMATH Keywords

simulated annealingtabu searchquadratic assignmentheuristic hybrid algorithmlayout of facilities

Mathematics Subject Classification ID

Quadratic programming (90C20) Large-scale problems in mathematical programming (90C06) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Cites Work

• Optimization by simulated annealing
• Equation of state calculations by fast computing machines
• Title not available (Why is that?)
• Future paths for integer programming and links to artificial intelligence
• Tabu Search—Part I
• Assignment Problems and the Location of Economic Activities
• Title not available (Why is that?)
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Tabu Search—Part II
• Experimental analysis of simulated annealing based algorithms for the layout problem
• Tabu Search Applied to the Quadratic Assignment Problem
• The Backboard Wiring Problem: A Placement Algorithm
• Title not available (Why is that?)
• Hospital Layout as a Quadratic Assignment Problem
• An improved annealing scheme for the QAP
• A thermodynamically motivated simulation procedure for combinatorial optimization problems
• Numerical investigations on quadratic assignment problems
• An exact branch-and-bound procedure for the quadratic-assignment problem
• An Algorithm for the Quadratic Assignment Problem
• A heuristic method for the multi-story layout problem
• A branch-and-bound-based heuristic for solving the quadratic assignment problem
• Tabu search and design optimization

Cited In (5)

• A survey for the quadratic assignment problem
• An efficient multiple-stage mathematical programming method for advanced single and multi-floor facility layout problems
• Intelligent local search strategies for solving facility layout problems with the quadratic assignment problem formulation
• Metaheuristics: A bibliography
• MASS -- modified assignment algorithm in facilities layout planning

This page was built for publication: Large-scale layout of facilities using a heuristic hybrid algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1337243)