A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution.

DOI10.1016/S0305-0548(97)00096-8zbMath1042.90580MaRDI QIDQ1406697

Vaidyanathan Jayaraman, Hasan Pirkul

Publication date: 7 September 2003

Published in: Computers \& Operations Research (Search for Journal in Brave)

Mathematics Subject Classification ID

90C59: Approximation methods and heuristics in mathematical programming

90B80: Discrete location and assignment

Related Items

An algorithm for the capacitated, multi-commodity multi-period facility location problem., Facility location models for distribution system design, Designing a distribution network in a supply chain system: formulation and efficient solution procedure, A new spanning tree-based genetic algorithm for the design of multi-stage supply chain networks with nonlinear transportation costs, A review of hierarchical facility location models, A scatter search-based heuristic to locate capacitated transshipment points, Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem, A heuristic algorithm for master planning that satisfies multiple objectives, Formulations and relaxations for a multi-echelon capacitated location-distribution problem, Lower and upper bounds for a capacitated plant location problem with multicommodity flow, Facility location and supply chain management. A review, Resource planning and a depot location model for electric power restoration., A model and methodologies for the location problem with logistical components, Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers, A multiperiod planning model for the capacitated minimal spanning tree problem, A genetic algorithm for two-stage transportation problem using priority-based encoding, Airfreight forwarder shipment planning: A mixed 0-1 model and managerial issues in the integration and consolidation of shipments, Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning

Uses Software

• SCICONIC

Cites Work

• Unnamed Item
• Unnamed Item
• A heuristic lagrangean algorithm for the capacitated plant location problem
• Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
• Facility location models for distribution planning
• Efficient algorithms for the capacitated concentrator location problem
• The capacitated plant location problem
• Lagrangean heuristics for location problems
• The simple plant location problem: Survey and synthesis
• A Lagrangian heuristic for the capacitated plant location problem with single source constraints
• A cross decomposition algorithm for a multiproduct-multitype facility location problem
• A direct dual method for the mixed plant location problem with some side constraints
• Fixed-cost transportation problems
• The Maximal Covering Location Problem with Capacities on Total Workload
• A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
• Multicommodity Distribution System Design by Benders Decomposition
• Algorithms for the Simple Plant-Location Problem with Some Side Conditions
• Site Location via Mixed-integer Programming