A column generation approach to capacitated p-median problems

Authors:
Luiz A. N. Lorena;Edson L. F. Senne
Affiliations:
LAC-Laboratório Associado de Computação e Matemática Aplicada, INPE-Instituto Nacional de Pesquisas Espaciais, Caixa Postal 515, 12245-970 São José dos Campos, SP, Br ...;FEG/UNESP, Universidade Estadual Paulista, Faculdade de Engenharia, Departamento de Matemática, Caixa Postal 205, 12515-410 Guaratinguetá, SP, Brazil
Venue:
Computers and Operations Research
Year:
2004

Citing 8
Cited 17

Knapsack problems: algorithms and computer implementations

Knapsack problems: algorithms and computer implementations
A new optimization algorithm for the vehicle routing problem with time windows

Operations Research
Solving binary cutting stock problems by column generation and branch-and-bound

Computational Optimization and Applications
On Improvements to the Analytic Center Cutting Plane Method

Computational Optimization and Applications
Stabilized column generation

Discrete Mathematics
A Bionomic Approach to the Capacitated p-Median Problem

Journal of Heuristics
Branch-And-Price: Column Generation for Solving Huge Integer Programs

Operations Research
Constructive Genetic Algorithm for Clustering Problems

Evolutionary Computation

An exact algorithm for the capacitated vertex p-center problem

Computers and Operations Research
The capacitated centred clustering problem

Computers and Operations Research
Genetic subgradient method for solving location-allocation problems

Applied Soft Computing
A scatter search-based heuristic to locate capacitated transshipment points

Computers and Operations Research
A branch-and-price approach to p-median location problems

Computers and Operations Research
Lower and upper bounds for a capacitated plant location problem with multicommodity flow

Computers and Operations Research
Clustering search algorithm for the capacitated centered clustering problem

Computers and Operations Research
An exact algorithm for the capacitated vertex p-center problem

Computers and Operations Research
The capacitated centred clustering problem

Computers and Operations Research
A reactive GRASP with path relinking for capacitated clustering

Journal of Heuristics
Capacitated clustering problem in computational biology: Combinatorial and statistical approach for sibling reconstruction

Computers and Operations Research
A novel grouping heuristic algorithm for the switch location problem based on a hybrid dual harmony search technique

IWANN'11 Proceedings of the 11th international conference on Artificial neural networks conference on Advances in computational intelligence - Volume Part I
A Lagrangian relaxation approach for a large scale new variant of capacitated clustering problem

Computers and Industrial Engineering
Integrated use of fuzzy c-means and convex programming for capacitated multi-facility location problem

Expert Systems with Applications: An International Journal
A comparative study of two hybrid grouping evolutionary techniques for the capacitated P-median problem

Computers and Operations Research
Relax-and-fix decomposition technique for solving large scale grid-based location problems

Computers and Industrial Engineering
A hybrid metaheuristic approach for the capacitated p-median problem

Applied Soft Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

The Capacitated p-median problem (CPMP) seeks to solve the optimal location of p facilities, considering distances and capacities for the service to be given by each median. In this paper we present a column generation approach to CPMP. The identified restricted master problem optimizes the covering of 1-median clusters satisfying the capacity constraints, and new columns are generated considering knapsack subproblems. The Lagrangean/surrogate relaxation has been used recently to accelerate subgradient like methods. In this work the Lagrangean/surrogate relaxation is directly identified from the master problem dual and provides new bounds and new productive columns through a modified knapsack subproblem. The overall column generation process is accelerated, even when multiple pricing is observed. Computational tests are presented using instances taken from real data from São José dos Campos' city.