A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints

DOI10.2307/2582672zbMath0588.90025OpenAlexW4252586089MaRDI QIDQ3716773

Hanan Luss, John G. Klincewicz

Publication date: 1986

Published in: The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2582672

zbMATH Keywords

Computational resultscapacitated problemsFacility location modelsLagrangian relaxation heuristic algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Inventory, storage, reservoirs (90B05)

Related Items (44)

Lagrangian heuristic for simultaneous subsidization and penalization: implementations on rooted travelling salesman games ⋮ A Lagrangian heuristic for the capacitated plant location problem with single source constraints ⋮ Efficient algorithms for the capacitated concentrator location problem ⋮ A two-phase hybrid heuristic algorithm for the capacitated location-routing problem ⋮ On the exact solution of large-scale simple plant location problems ⋮ An exact algorithm for the capacitated facility location problems with single sourcing ⋮ A cut-and-solve based algorithm for the single-source capacitated facility location problem ⋮ Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing ⋮ A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem ⋮ Locating Satellite Yards in Forestry Operations ⋮ A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution. ⋮ Upper and lower bounds for the single source capacitated location problem. ⋮ Approximate solutions to large scale capacitated facility location problems ⋮ Scatter search for the single source capacitated facility location problem ⋮ Lower and upper bounds for a two-level hierarchical location problem in computer networks ⋮ An improved cut-and-solve algorithm for the single-source capacitated facility location problem ⋮ A dual RAMP algorithm for single source capacitated facility location problems ⋮ The \(K\)-coverage concentrator location problem ⋮ Sequential location of two facilities: comparing random to optimal location of the first facility ⋮ Hybrid heuristic for the location‐inventory‐routing problem in closed‐loop supply chain ⋮ Locating concentrators in centralized computer networks ⋮ A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand ⋮ Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm ⋮ The vendor location problem ⋮ Facility location models for distribution system design ⋮ Planning and coordination of production and distribution facilities for multiple commodities ⋮ Benders decomposition, Lagrangean relaxation and metaheuristic design ⋮ Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers ⋮ NAFTA supply chains: facilities location and logistics ⋮ Lagrangean heuristics for location problems ⋮ A genetic algorithm for a single product network design model with lead time and safety stock considerations ⋮ Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type ⋮ Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing ⋮ Auxiliary tool allocation in flexible manufacturing systems ⋮ A computational evaluation of a general branch-and-price framework for capacitated network location problems ⋮ Heuristic methods and applications: A categorized survey ⋮ A feasibility-ensured Lagrangian heuristic for general decomposable problems ⋮ An exact method for the two-echelon, single-source, capacitated facility location problem ⋮ Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem ⋮ A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem ⋮ An integrated approach for planning the adoption of client/server systems ⋮ Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem ⋮ A simulated annealing methodology to distribution network design and management ⋮ A repeated matching heuristic for the single-source capacitated facility location problem

This page was built for publication: A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints