A Lagrangian heuristic for the capacitated plant location problem with side constraints

Abstract

In this paper we present a Lagrangian relaxation approach for solving the capacitated plant location problem with side constraints. The side constraints are upper bound constraints on disjoint subsets of the (0-1) variables. We also provides on application where this procedure can be used to solve a particular vehicle routing problem. Computational results are provided for some problems both on the main frames computer as well as the personal computer.