Facility location models for distribution planning

DOI10.1016/0377-2217(85)90246-2zbMath0583.90022OpenAlexW2065608738MaRDI QIDQ1069423

C. H. Aikens

Publication date: 1985

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

Full work available at URL: https://doi.org/10.1016/0377-2217(85)90246-2

zbMATH Keywords

heuristicsdistributiondecompositiondesignlocationreviewoptimization techniques

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Inventory, storage, reservoirs (90B05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

A localization and reformulation discrete programming approach for the rectilinear distance location-allocation problem, Application of facility location modeling constructs to vendor selection problems, Reason based solutions and the complexity of distribution network design problems, Uncapacitated facility location: General solution procedure and computational experience, A cross decomposition algorithm for a multiproduct-multitype facility location problem, An algorithm for solving large capacitated warehouse location problems, A multi-objective model for locating search and rescue boats, Multiobjective analysis of facility location decisions, Dynamic supply chain design with inventory, Vehicle routing considerations in distribution system design, An integrated model for logistics network design, On the exact solution of large-scale simple plant location problems, A location-distribution application for a beer company, Multinational plant location as a game of timing, Logistics network design for perishable products with heterogeneous quality decay, A supply chain design problem with facility location and bi-objective transportation choices, A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution., Sequential competitive location on networks, Application of facilities location to an insurance company’s office reconfiguration, Unnamed Item, Approximate solutions to large scale capacitated facility location problems, Models for multimode multicommodity location problems with interdepot balancing requirements, Analysis of relaxations for the multi-item capacitated lot-sizing problem, Variations in the flow approach to CFCLP-TC for multiobjective supply chain design, Research challenges in environmental management, A two-phased approach to the supply network reconfiguration problem, Optimization of competitive facility location for chain stores, A bi-level programming model and solution algorithm for the location of logistics distribution centers, A smoothing algorithm for a new two-stage stochastic model of supply chain based on sample average approximation, An integrated evaluation of facility location, capacity aquisition, and technology selection for designing global manufacturing strategies, A fuzzy approach to select the location of the distribution center, A multi-criteria decision making approach for location planning for urban distribution centers under uncertainty, An algorithm for the capacitated, multi-commodity multi-period facility location problem., A stochastic programming approach for supply chain network design under uncertainty, Solving the simple plant location problem by genetic algorithm, The dynamic replica placement problem with service levels in content delivery networks: a model and a simulated annealing heuristic, Facility location models for distribution system design, Planning and coordination of production and distribution facilities for multiple commodities, Integrated design and operation of remnant inventory supply chains under uncertainty, A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application, A genetic algorithm for two-stage transportation problem using priority-based encoding, A branch-and-bound method for multicommodity location with balancing requirements, Lagrangean heuristics for location problems, International facilities location: A heuristic procedure for the dynamic uncapacitated problem, Strategic facility location: A review, Multi-commodity supply network planning in the forest supply chain, A bi-objective uncapacitated facility location problem, Strategic production-distribution models: A critical review with emphasis on global supply chain models, Design of Less-than-Truckload Networks: Models and Methods, A multiperiod two-echelon multicommodity capacitated plant location problem, An exact method for the two-echelon, single-source, capacitated facility location problem, An elliptical cover problem in drone delivery network design and its solution algorithms, Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem, The dynamic relocation and phase-out of a hybrid two-echelon plant/warehousing facility: A multiple objective approach, Combined location-routing problems: A synthesis and future research directions, Uncapacitated and Capacitated Facility Location Problems, Designing distribution systems with transport economies of scale, Heuristics for the p-hub location problem, The capacitated facility location problem with random input data, Designing a distribution network in a supply chain system: formulation and efficient solution procedure

Cites Work

• Unnamed Item
• Unnamed Item
• A branch-and-bound algorithm for the multi-level uncapacitated facility location problem
• Partitioning procedures for solving mixed-variables programming problems
• A comparative study of heuristics for a two-level routing-location problem
• Solving a distribution problem with side constraints
• A large scale location-allocation problem in the natural rubber industry
• Facility location models for planning a transatlantic communications network
• A heuristic approach for large scale discrete stochastic transportation- location problems
• Some branch-and-bound procedures for fixed-cost transportation problems
• A Dual-Based Procedure for Uncapacitated Facility Location
• An Improved Algorithm for the Multi-Commodity Location Problem
• The Multi-Commodity Facilities Location Problem
• A Capacitated Bottleneck Facility Location Problem
• A Dual-Based Procedure for Dynamic Facility Location
• Multicommodity Distribution System Design by Benders Decomposition
• The Multiperiod Location-Allocation Problem with Relocation of Facilities
• OPTIMAL FACILITY LOCATION UNDER RANDOM DEMAND WITH GENERAL COST STRUCTURE
• An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
• A primal algorithm for solving a capacitated network flow problem with additional linear constraints
• A Plant and Warehouse Location Problem
• A Note on Warszawski's Multi-Commodity Location Problem
• An Improved Algorithm for the Capacitated Facility Location Problem
• Algorithms for the Simple Plant-Location Problem with Some Side Conditions
• Technical Note—An Improved Branch-and-Bound Method for Integer Programming
• Site Location via Mixed-integer Programming
• An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
• Multi-Dimensional Location Problems
• The bottleneck transportation problem