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

Simple item page
dc.contributor.authorMarcela Villa Marulanda
dc.contributor.authorGabriela Inés Leguizamón
dc.contributor.authorKaren Yineth Niño Mora
dc.coverage.spatialBolivia
dc.date.accessioned2026-03-22T15:54:24Z
dc.date.available2026-03-22T15:54:24Z
dc.date.issued2017
dc.descriptionCitaciones: 2
dc.description.abstractThis 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.
dc.identifier.doi10.18566/puente.v4n2.a07
dc.identifier.urihttps://doi.org/10.18566/puente.v4n2.a07
dc.identifier.urihttps://andeanlibrary.org/handle/123456789/55109
dc.language.isoes
dc.publisherUniversidad Pontificia Bolivariana
dc.relation.ispartofRevista Digital Palabra (Universidad Pontificia Bolivariana)
dc.sourceUniversidad Pontificia Bolivariana
dc.subjectConstraint (computer-aided design)
dc.subjectMathematics
dc.subjectTabu search
dc.subjectComputer science
dc.subjectHumanities
dc.subjectCombinatorics
dc.titleSolució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
dc.typearticle

Files

Collections

Artículo Científico Publicado