A comparison of heuristics and relaxations for the capacitated plant location problem

DOI10.1016/0377-2217(91)90261-SzbMath0734.90046MaRDI QIDQ811347

N. E. Zubov

Publication date: 1991

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

zbMATH Keywords

relaxationsCapacitated Plant Locationheuristic feasible solutions

Mathematics Subject Classification ID

Mixed integer programming (90C11) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Maximal covering code multiplexing access telecommunication networks, Solving the staircase cost facility location problem with decomposition and piecewise linearization, A Lagrangian heuristic for the capacitated plant location problem with single source constraints, Multiple-type, two-dimensional bin packing problems: Applications and algorithms, A cutting plane algorithm for the capacitated facility location problem, Benders decomposition without separability: a computational study for capacitated facility location problems, Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort, Restructuring bank networks after mergers and acquisitions: a capacitated delocation model for closing and resizing branches, A branch-and-price algorithm for the capacitated facility location problem, Lower bounds for the two-stage uncapacitated facility location problem, Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems, Unnamed Item, Location and layout planning. A survey, Learning pseudo-backdoors for mixed integer programs, Designing and reporting on computational experiments with heuristic methods, Polyhedral analysis and decompositions for capacitated plant location-type problems, A cut-and-solve based algorithm for the single-source capacitated facility location problem, Revisiting Lagrangian relaxation for network design, The capacitated plant location problem, Continuous cutting plane algorithms in integer programming, Adjustable robust optimization with objective uncertainty, Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods, Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing, The capacitated plant location problem with multiple facilities in the same site, Electric aircraft charging network design for regional routes: a novel mathematical formulation and kernel search heuristic, A hybrid approach using an artificial bee algorithm with mixed integer programming applied to a large-scale capacitated facility location problem, An effective hybrid approach to the two-stage capacitated facility location problem, Solving the variable size bin packing problem with discretized formulations, Dynamic-demand capacitated facility location problems with and without relocation, Solving the facility location and fixed charge solid transportation problem, An improved cut-and-solve algorithm for the single-source capacitated facility location problem, Observations on some heuristic methods for the capacitated facility location problem, RAMP algorithms for the capacitated facility location problem, A hybrid firefly-genetic algorithm for the capacitated facility location problem, Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem, A Langrangean heuristic for the \(p_ k\)-median dynamic location problem, A dynamic location problem with maximum decreasing capacities, Solving the weighted capacitated planned maintenance problem and its variants, Star \(p\)-hub median problem with modular arc capacities, The convex hull of two core capacitated network design problems, Compressor scheduling in oil fields. Piecewise-linear formulation, valid inequalities, and computational analysis, Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths, A capacitated facility location problem with constrained backlogging probabilities, Facility location models for distribution system design, A Lagrangean heuristic for the plant location problem with multiple facilities in the same site, Capacitated facility location problem with general setup cost, Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers, Near-optimal solutions to large-scale facility location problems, Weak flow cover inequalities for the capacitated facility location problem, Heuristics for the dynamic facility location problem with modular capacities, A fast exact method for the capacitated facility location problem with differentiable convex production costs, Towards optimizing the deployment of optical access networks, Lower and upper bounds for a two-stage capacitated facility location problem with handling costs, Lagrangean heuristics for location problems, A genetic algorithm for a single product network design model with lead time and safety stock considerations, A Simple but Usually Fast Branch-and-Bound Algorithm for the Capacitated Facility Location Problem, The capacitated distribution and waste disposal problem, Lower and upper bounds for a capacitated plant location problem with multicommodity flow, A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem, A Lagrangean heuristic for the facility location problem with staircase costs, Environmental integrated production and recycling management, An exact method for the two-echelon, single-source, capacitated facility location problem, Capacitated facility location: Separation algorithms and computational experience, Some personal views on the current state and the future of locational analysis, An effective heuristic for large-scale capacitated facility location problems, Planning models for long-haul operations of postal and express shipment companies, A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem, Locating repair shops in a stochastic environment, Planning and scheduling packaging lines in food industry, A hierarchical model for the location of perinatal facilities in the municipality of Rio de Janeiro, Models for planning capacity expansion in local access telecommunication networks, A comparison of heuristics and relaxations for the capacitated plant location problem, Facility location with increasing production costs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
• A comparison of heuristics and relaxations for the capacitated plant location problem
• Heuristics for the capacitated plant location model
• ADD-heuristics' starting procedures for capacitated plant location models
• Lot-size models with backlogging: Strong reformulations and cutting planes
• Facility location models for planning a transatlantic communications network
• An algorithm for the solution of the 0-1 knapsack problem
• The ellipsoid method and its consequences in combinatorial optimization
• Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
• Locational analysis
• The capacitated plant location problem
• A direct dual method for the mixed plant location problem with some side constraints
• An operator theory of parametric programming for the transportation problem-I
• On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
• Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
• A Cross Decomposition Algorithm for Capacitated Facility Location
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Lagrangean decomposition for integer programming : theory and applications
• A Dual-Based Procedure for Uncapacitated Facility Location
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Linear Relaxations of the Capacitated Warehouse Location Problem
• An efficient heuristic procedure for the capacitated warehouse location problem
• An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
• An Improved Algorithm for the Capacitated Facility Location Problem
• Paths, Trees, and Flowers
• A branch‐bound algorithm for the capacitated facilities location problem