An effective heuristic for large-scale capacitated facility location problems

DOI10.1007/s10732-008-9078-yzbMath1176.90367OpenAlexW1985951797MaRDI QIDQ1044245

Maurizio Boccia, Pasquale Avella, Igor' Leonidovich Vasilyev, Aantonio Sforza

Publication date: 11 December 2009

Published in: Journal of Heuristics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10732-008-9078-y

zbMATH Keywords

Lagrangean relaxationbranch-and-cutcapacitated facility location problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

The fixed charge transportation problem: a strong formulation based on Lagrangian decomposition and column generation, A cutting plane algorithm for the capacitated facility location problem, Benders decomposition without separability: a computational study for capacitated facility location problems, Restructuring bank networks after mergers and acquisitions: a capacitated delocation model for closing and resizing branches, Some heuristic methods for solving \(p\)-median problems with a coverage constraint, Towards a machine learning-aided metaheuristic framework for a production/distribution system design problem, Matheuristics: survey and synthesis, Semi-supervised \(k\)-means clustering via DC programming approach, 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, A computational study of a nonlinear minsum facility location problem, Capacitated clustering problem in computational biology: combinatorial and statistical approach for sibling reconstruction, An aggregation heuristic for large scale p-median problem, Fixed charge transportation problems: a new heuristic approach based on Lagrangean relaxation and the solving of core problems, An improved Lagrangian relaxation and dual ascent approach to facility location problems, Near-optimal large-scale k-medoids clustering

Cites Work

• A comparison of heuristics and relaxations for the capacitated plant location problem
• An algorithm for solving large capacitated warehouse location problems
• Capacitated facility location: Separation algorithms and computational experience
• Algorithms for railway crew management
• The volume algorithm: Producing primal solutions with a subgradient method
• Near-optimal solutions to large-scale facility location problems
• Lagrangean heuristics for location problems
• An Algorithm for Large Zero-One Knapsack Problems
• Capacitated Facility Location: Valid Inequalities and Facets
• Unnamed Item
• Unnamed Item
• Unnamed Item