Location and layout planning. A survey

DOI10.1007/BF01545586zbMath0885.90068OpenAlexW4211198550MaRDI QIDQ1372765

Wolfgang Domschke, Gabriela Krispin

Publication date: 30 October 1997

Published in: OR Spektrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01545586

zbMATH Keywords

facility locationlayout planningmicroeconomic location planning

Mathematics Subject Classification ID

Continuous location (90B85) Discrete location and assignment (90B80)

Related Items (5)

Metaheuristics: A bibliography ⋮ Integer linear programming models for grid-based light post location problem ⋮ Sequential competitive location on networks ⋮ A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem ⋮ Models and methods for standardization problems

Uses Software

• Microlay
• QAPLIB
• OR-Library
• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Constrained Large-Region Multifacility Location Problems
• Networking Policies for Hub-and-Spoke Systems with Application to the Air Transportation System
• The Capacitated Traveling Salesman Location Problem
• Competitive Location Models: A Framework and Bibliography
• The m-Center Problem
• Modelling Inter-city Road Distances by Mathematical Functions
• The Transportation-Location Problem
• Local Search Algorithms for the Maximal Planar Layout Problem
• Optimal and Suboptimal Algorithms for the Quadratic Assignment Problem
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Construction properties of combinatorial deltahedra
• On worst-case aggregation analysis for network location problems
• Good solutions to discrete noxious location problems via metaheuristics
• A clustering approach to the planar hub location problem
• On the convergence of cross decomposition
• An improved annealing scheme for the QAP
• A thermodynamically motivated simulation procedure for combinatorial optimization problems
• A branch-and-bound algorithm for the multi-level uncapacitated facility location problem
• QAPLIB-A quadratic assignment problem library
• The zone-constrained location problem on a network
• A comparison of heuristics and relaxations for the capacitated plant location problem
• A projection method for the uncapacitated facility location problem
• Models for multimode multicommodity location problems with interdepot balancing requirements
• Heuristics for the capacitated plant location model
• A note on solving large p-median problems
• ADD-heuristics' starting procedures for capacitated plant location models
• The facility layout problem
• An algorithm for solving large capacitated warehouse location problems
• Competitive spatial models
• On the exact solution of large-scale simple plant location problems
• Algodesk: An experimental comparison of eight evolutionary heuristics applied to the quadratic assignment problem
• A parallel depth first search branch and bound algorithm for the quadratic assignment problem
• Algorithms for the m-center problems: A survey
• Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
• Locational analysis
• An algorithm for finding the absolute center of a network
• Recent models and techniques for solving the layout problem
• Experimental analysis of simulated annealing based algorithms for the layout problem
• An interactive layout heuristic based on hexagonal adjacency graphs
• Genetic algorithms, function optimization, and facility layout design
• Simple approaches to parallel branch and bound
• A heuristic solution to the warehouse location-routing problem
• Strengthening Gilmore's bound for the quadratic assignment problem
• Uncapacitated facility location: General solution procedure and computational experience
• Extensions of a tabu search adaptation to the quadratic assignment problem
• A study of diversification strategies for the quadratic assignment problem
• A genetic approach to the quadratic assignment problem
• Two new heuristic algorithms for the maximal planar layout problem
• The hub location and routing problem
• The capacitated plant location problem
• A branch-and-bound method for multicommodity location with balancing requirements
• Facilities layout generalized model solved by n-boundary shortest path heuristics
• Microlay: An interactive computer program for factory layout planning on microcomputers
• Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue
• A parallel heuristic for quadratic assignment problems
• Optimal bin location and sequencing in printed circuit board assembly
• A Dual-Based Algorithm for Multiproduct Uncapacitated Facility Location
• Assignment Problems and the Location of Economic Activities
• State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
• Facilities Layout Adjacency Determination: An Experimental Comparison of Three Graph Theoretic Heuristics
• A Cross Decomposition Algorithm for Capacitated Facility Location
• Finding the Optimal a Priori Tour and Location of a Traveling Salesman with Nonhomogeneous Customers
• An Overview of Representative Problems in Location Research
• Multi-Terminal Network Flows
• A Dual-Based Procedure for Uncapacitated Facility Location
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
• Properties and Solution Methods for Large Location-Allocation Problems
• An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes
• A simulated annealing algorithm for allocating space to manufacturing cells
• CLASS: Computerized LAyout Solutions using Simulated annealing
• A dual-based optimization procedure for the two-echelon uncapacitated facility location problem
• A polynomial time algorithm for finding the absolute center of a network
• A squared-euclidean distance location-allocation problem
• A New Graph-Theoretic Heuristic for Facility Layout
• Tabu Search Applied to the Quadratic Assignment Problem
• A New Lower Bound Via Projection for the Quadratic Assignment Problem
• TESSA—A new greedy heuristic for facilities layout planning
• Dynamic facility location: The progressive p-median problem
• Comparison of iterative searches for the quadratic assignment problem
• A new simulated annealing algorithm for the facility layout problem
• An integrated methodology for automating the determination of layout and materials handling system
• A comparative evaluation of heuristics forthe adjacency problem in facility layout planning
• Global Convergence of a Generalized Iterative Procedure for the Minisum Location Problem with lp Distances
• On the Convergence of a Hyperboloid Approximation Procedure for the Perturbed Euclidean Multifacility Location Problem
• Is Linear Programming Necessary for Single Facility Location with Maximin of Rectilinear Distance?
• Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
• The Reactive Tabu Search
• Technical Note—A Polynomial Algorithm for the Equal Capacity p-Center Problem on Trees
• An Improvement-Type Layout Algorithm for Single and Multiple-Floor Facilities
• Solving Location-Allocation Problems with Rectilinear Distances by Simulated Annealing
• Replacing continuous demand with discrete demand in a competitive location model

This page was built for publication: Location and layout planning. A survey