Complementary remarks and improvements to a lagrangean heuristic for capacitated plant location problems

Abstract

In a former paper, [1], a heuristic using multipliers from a langrean relaxation was proposed for getting feasible solutions to a class of pure integer capacited plant location problems. The heuristic consisted of three steps, the last one being a plant interchange step. Further computational experience has shown that the proposed interchange procedure could fail. In this paper we investigate the computational behaviour of the heuristic without interchange procedure, and we give the result of our computational experience.