Bounds for the single source modular capacitated plant location problem

DOI10.1016/J.COR.2005.02.030MaRDI QIDQ2489136zbMATH OpenOpenAlexFDO

Authors Isabel H. Correia, Maria Eugénia Captivo

Publication date 16 May 2006

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

Full work available at URL https://doi.org/10.1016/j.cor.2005.02.030

zbMATH Keywords

Lagrangean heuristicTabu searchCapacitated location

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Continuous location (90B85)

Recommendations

• Upper and lower bounds for the single source capacitated location problem.
• Efficient solution of large scale, single-source, capacitated plant location problems
• Lower and upper bounds for a capacitated plant location problem with multicommodity flow
• A Lagrangian heuristic for the capacitated plant location problem with single source constraints
• Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
• A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
• Valid inequalities and facets of the capacitated plant location problem
• Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
• The capacity and distance constrained plant location problem
• An exact algorithm for the capacitated facility location problems with single sourcing

Cites work

• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• scientific article; zbMATH DE number 1062113 (Why is no real title available?)
• A Lagrangean heuristic for a modular capacitated location problem
• A Lagrangean heuristic for the facility location problem with staircase costs
• A two-phase tabu search approach to the location routing problem
• An algorithm for solving large capacitated warehouse location problems
• An efficient tabu search procedure for the \(p\)-median problem
• Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
• Lagrangean heuristics for location problems
• Solving the staircase cost facility location problem with decomposition and piecewise linearization
• Upper and lower bounds for the single source capacitated location problem.
• Validation of subgradient optimization

Cited in

(12)

• Stochastic facility location with general long-run costs and convex short-run costs
• Discretized formulations for capacitated location problems with modular distribution costs
• The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches
• Location of slaughterhouses under economies of scale
• A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
• Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem
• Upper and lower bounds for the single source capacitated location problem.
• A Lagrangean heuristic for a modular capacitated location problem
• Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem
• Lagrangian heuristics for large-scale dynamic facility location with generalized modular capacities
• Solution method for the location planning problem of logistics park with variable capacity
• The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem

Describes a project that uses

Uses Software

• CPLEX
• Tabu search

This page was built for publication: Bounds for the single source modular capacitated plant location problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489136)