Locational analysis

DOI10.1016/0377-2217(83)90194-7zbMath0502.90019OpenAlexW2914332956MaRDI QIDQ1173002

Richard L. Francis, John A. White, Leon F. McGinnis

Publication date: 1983

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(83)90194-7

zbMATH Keywords

facility locationlogisticsnetwork modelsmixed-integer programming modelslocational analysisliterature surveyplanar modelsreliable algorithmsselective reviewwarehousing models

Mathematics Subject Classification ID

Inventory, storage, reservoirs (90B05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (46)

Application of facility location modeling constructs to vendor selection problems ⋮ Uncapacitated facility location: General solution procedure and computational experience ⋮ Solving the staircase cost facility location problem with decomposition and piecewise linearization ⋮ Equilibria in non-cooperative competition of political parties having a common rate of morality ⋮ On the set partitioning type formulation for the discrete location problem ⋮ On the coordination of product and by-product flows in two-level distribution networks: Model formulations and solution procedures ⋮ A multi-objective model for locating search and rescue boats ⋮ Multiobjective analysis of facility location decisions ⋮ Single facility location problem with region-dependent distance metrics ⋮ A review of hierarchical facility location models ⋮ Location and layout planning. A survey ⋮ On the exact solution of large-scale simple plant location problems ⋮ Maxpolynomial equations ⋮ New approach to facility locations decisions ⋮ A location-distribution application for a beer company ⋮ Comments on ‘Facility location problem on network under multiple criteria fuzzy set theoretic approach’ ⋮ Algebraic solution of minimax single-facility constrained location problems with Chebyshev and rectilinear distances ⋮ Application of facilities location to an insurance company’s office reconfiguration ⋮ The general optimal market area model ⋮ Optimization models for the dynamic facility location and allocation problem ⋮ Minimax algebra and applications ⋮ Lower and upper bounds for a two-level hierarchical location problem in computer networks ⋮ Steiner diagrams and \(k\)-star hubs ⋮ An integrated evaluation of facility location, capacity aquisition, and technology selection for designing global manufacturing strategies ⋮ On worst-case aggregation analysis for network location problems ⋮ A particle swarm optimization algorithm with path relinking for the location routing problem ⋮ An algorithm for the capacitated, multi-commodity multi-period facility location problem. ⋮ Solving the simple plant location problem by genetic algorithm ⋮ Using tropical optimization to solve constrained minimax single-facility location problems with rectilinear distance ⋮ Capacitated location-allocation problems on a line ⋮ ISO-cost contours to facility location problems in the presence of circular and polygonal forbidden regions ⋮ International facilities location: A heuristic procedure for the dynamic uncapacitated problem ⋮ Strategic facility location: A review ⋮ Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing ⋮ The capacitated distribution and waste disposal problem ⋮ A multifactor model for international plant location and financing under uncertainty ⋮ A bi-objective uncapacitated facility location problem ⋮ Solving the fixed charge problem with Lagrangian relaxation and cost allocation heuristics ⋮ Ant colony system solving capacitated location-allocation problems on a line ⋮ Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing ⋮ A correction to the definition of local center ⋮ A simple plant-location model for quantity-setting firms subject to price uncertainty ⋮ Location problems ⋮ ADD-heuristics' starting procedures for capacitated plant location models ⋮ A comparison of heuristics and relaxations for the capacitated plant location problem ⋮ Designing a distribution network in a supply chain system: formulation and efficient solution procedure

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
• Matchings and transversals in hypergraphs, domination and independence in trees
• Easy and hard bottleneck location problems
• Finding efficient solutions for rectilinear distance location problems efficiently
• Relations between packing and covering numbers of a tree
• A characterisation of rigid circuit graphs
• Selected Families of Location Problems
• A Class of Balanced Matrices Arising from Location Problems
• State of the Art—Location on Networks: A Survey. Part II: Exploiting Tree Network Structure
• Order-Picking in a Rectangular Warehouse: A Solvable Case of the Traveling Salesman Problem
• A Cross Decomposition Algorithm for Capacitated Facility Location
• Location-Allocation Problems
• Mathematical Models of Road Travel Distances
• A Dual-Based Procedure for Uncapacitated Facility Location
• Minimax location problems with nonlinear costs
• Benders' partitioning scheme applied to a new formulation of the quadratic assignment problem
• An Algorithmic Approach to Network Location Problems. I: Thep-Centers
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Trade-off analysis for optimal design of automated warehouses
• Technical Note—Minisum I_p Distance Location Problems Solved via a Perturbed Problem and Weiszfeld's Algorithm
• Technical Note—A New Norm for Measuring Distance Which Yields Linear Location Problems
• Note—On the Maximal Covering Location Problem and the Generalized Assignment Problem
• A Dual-Bounded Algorithm for the p-Median Problem
• Convergence of the Weiszfeld Algorithm for Weber Problems Using a Generalized “Distance” Function
• Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
• Technical Note—Equivalence between the Direct Search Approach and the Cut Approach to the Rectilinear Distance Location Problem
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• A Graph Theoretic Analysis of Bounds for the Quadratic Assignment Problem
• Polynomially bounded algorithms for locatingp-centers on a tree
• Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network
• Efficient Algorithms for the (Weighted) Minimum Circle Problem
• Location on Tree Networks: P-Centre and n-Dispersion Problems
• Locating Centers on a Tree with Discontinuous Supply and Demand Regions
• Multicommodity Distribution System Design by Benders Decomposition
• A branch and bound algorithm for the generalized assignment problem
• Technical Note—Solving Constrained Multi-Facility Location Problems Involving l_p Distances Using Convex Programming
• Optimal Storage Assignment in Automatic Warehousing Systems
• An Efficient Computational Procedure for Solving the Multi-Facility Rectilinear Facilities Location Problem
• Scheduling Parallel Production Lines with Changeover Costs: Practical Application of a Quadratic Assignment/LP Approach
• Convex Location Problems on Tree Networks
• An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
• Hospital Layout as a Quadratic Assignment Problem
• Storage-Retrieval Interleaving in Automatic Warehousing Systems
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• The m-Center Problem: Minimax Facility Location
• Modeling Facility Location Problems as Generalized Assignment Problems
• A Cut Approach to the Rectilinear Distance Facility Location Problem
• Implicit representation of generalized variable upper bounds in linear programming
• The Set-Covering Problem: A New Implicit Enumeration Algorithm
• Distance Constraints for Tree Network Multifacility Location Problems
• A subgradient algorithm for certain minimax and minisum problems
• An Improved Algorithm for the Capacitated Facility Location Problem
• An exact branch-and-bound procedure for the quadratic-assignment problem
• Optimal Facility Location with Concave Costs
• On the Core of Cost Allocation Games Defined on Location Problems
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Sufficient Conditions for Some Optimum-Property Facility Designs
• The Set-Partitioning Problem: Set Covering with Equality Constraints
• On the Convergence of a Numerical Scheme for Solving Some Locational Equilibrium Problems
• An Algorithm for the Quadratic Assignment Problem
• The m-Center Problem
• An Analysis of Private and Public Sector Location Models
• Technical Note—The Optimal Location of New Facilities Using Rectangular Distances
• The Optimum Location of Multi-centres on a Graph
• The Location of Emergency Service Facilities
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• Modelling Inter-city Road Distances by Mathematical Functions
• Integer Programming Algorithms: A Framework and State-of-the-Art Survey
• An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
• A Review of the Placement and Quadratic Assignment Problems
• Exact and approximate solutions to the multisource weber problem
• An integer programming approach to a class of combinatorial problems
• A note on Fermat's problem
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph

This page was built for publication: Locational analysis