Solución al problema de localización (CFLP) a través de búsqueda tabú y relajación Lagrangeana, caso de estudio: Industria de Productos Alimentarios

Abstract

This paper addresses the localization problem with capacity constraint. Demand data, number of customers, number and capacity of these plants are known. The problem is solved by applying Lagrangean Relaxation and Tabu Search which provide good solutions for these problems. The test program was conducted instances encountered in the literature for finding workable results with acceptable computational times.