Show simple item record

dc.creatorRomero-Conrado, Alfonso R.
dc.creatorCoronado-Hernandez, Jairo R.
dc.creatorVisbal Acevedo, Renso Raul
dc.description.abstractIn this work, a study of the application of the taboo search for the resolution of the problem of production planning in multilevel systems with capacity restrictions is approached from the literature. This family of problems is classified in the literature as Np-Hard. Relaxation and search strategies, especially Taboo Search, have played a decisive role in the development of alternative solutions for this type of problem, allowing to obtain solutions close to the optimal minimum cost value, in operationally acceptable times. The purpose of this article is to collect, describe and analyze the use and application of taboo search in the solution of the problem of lotification in multilevel production systems. Contemplating the large number of variations of the problem and emphasizing the methodology used and the configuration of the search, it is intended to establish the baseline for the development of new solution algorithms for the lotification
dc.description.abstractEn este trabajo, se aborda desde la literatura, un estudio de la aplicación de la búsqueda tabú para la resolución del problema de planificación de la producción en sistemas multinivel con restricciones de capacidad. Esta familia de problemas está clasificada dentro de la literatura como Np-Hard. Las estrategias de relajación y búsqueda, especialmente la búsqueda tabú, han jugado un papel determinante en el desarrollo de alternativas de solución de este tipo de problemas, permitiendo obtener de soluciones cercanas al valor óptimo de mínimo costo, en tiempos operativamente aceptables. El presente artículo tiene por objetivo recopilar, describir y analizar el uso y aplicación de la búsqueda tabú en la solución del problema de lotificación en sistemas de producción multinivel. Contemplando la gran cantidad de variaciones del problema y haciendo énfasis en la metodología utilizada y la configuración de la búsqueda, se pretende establecer la línea base para el desarrollo de nuevos algoritmos de solución para el problema de lotificació
dc.publisherFundación I+D+Ispa
dc.rightsCC0 1.0 Universal*
dc.sourceBoletín de innovación, logística y operacionesspa
dc.subjectTaboo searchspa
dc.subjectMultilevel systemspa
dc.subjectCapacity restrictionsspa
dc.titleAplicación de la búsqueda tabú en la resolución del problema capacitado de lotificación en sistemas de producción multinivel: un estado del artespa
dc.title.alternativeApplication of the taboo search in solving the qualified problem of lotification in multilevel production systems: a state of the art
dcterms.references[1] F. Glover, “Tabu Search—Part I,” ORSA J. Comput., vol. 1, no. 3, pp. 190–206, Aug.
dcterms.references[2] F. Glover, “Tabu Search—Part II,” ORSA J. Comput., vol. 2, no. 1, pp. 4–32, Feb.
dcterms.references[3] F. Glover and E. Taillard, “A user’s guide to tabu search,” Ann. Oper. Res., vol. 41, no. 1, pp. 1–28, Mar.
dcterms.references[4] K. S. Hindi, “Solving the single-item, capacitated dynamic lot-sizing problem with startup and reservation costs by tabu search,” Comput. Ind. Eng., vol. 28, no. 4, pp. 701–707,
dcterms.references[5] K. S. Hindi, “Solving the CLSP by a Tabu Search Heuristic,” J. Oper. Res. Soc., vol. 47, no. 1, pp. 151–161,
dcterms.references[6] M. Gopalakrishnan, K. Ding, J.-M. Bourjolly, and S. Mohan, “A Tabu-Search Heuristic for the Capacitated Lot- Sizing Problem with Set-up Carryover,” Manage. Sci., vol. 47, no. 6, pp. 851–863, Jun.
dcterms.references[7] Y. F. Hung, C. P. Chen, C. C. Shih, and M. H. Hung, “Using tabu search with ranking candidate list to solve production planning problems with setups,” Comput. Ind. Eng., vol. 45, no. 4, pp. 615–634,
dcterms.references[8] B. Karimi, S. M. T. F. Ghomi, and J. M. Wilson, “A Tabu Search Heuristic for Solving the CLSP with Backlogging and Set-up Carry-over,” J. Oper. Res. Soc., vol. 57, no. 2, pp. 140–147, Feb.
dcterms.references[9] X. Li, F. Baki, P. Tian, and B. A. Chaouch, “A robust block-chain based tabu search algorithm for the dynamic lot sizing problem with product returns and remanufacturing,” Omega, vol. 42, no. 1, pp. 75–87, Jan.
dcterms.references[10] R. Kuik, M. Salomon, L. N. Van Wassenhove, and J. Maes, “Linear Programming, Simulated Annealing and Tabu Search Heuristics for Lotsizing in Bottleneck Assembly Systems,” IIE Trans., vol. 25, no. 1, pp. 62–72,spa
dcterms.references[11] A. Kimms, “Competitive methods for multi-level lot sizing and scheduling: tabu search and randomized regrets,” Int. J. Prod. Res., vol. 34, no. 8, pp. 2279–2298, Aug.
dcterms.references[12] Y.-F. Hung and K.-L. Chien, “A Multi-Class Multi-Level Capacitated Lot Sizing Model,” J. Oper. Res. Soc., vol. 51, no. 11, p. 1309, Nov.
dcterms.references[13] R. Berretta, P. M. França, and V. A. Armentano, “Metaheuristic approaches for the multilevel resource- constrained lot-sizing problem with setup and lead times,” Asia-Pacific J. Oper. Res., vol. 22, no. 02, pp. 261– 286, Jun.
dcterms.references[14] Ortiz Gaitán, S., & Ruiz, C. (2017). Modelo de Programación Lineal Entera Mixta para la Programación de Sistemas tipo Job-Shop Flexible en Entornos Make to Order. INGE CUC, 13(2), 28-34.
dcterms.references[15] Oliva San Martín, C., & Ramírez Guzmán, G. (2014). Algoritmo de tipo búsqueda tabú para un problema de programación de horarios universitarios vespertinos. INGE CUC, 9(2), 58-65. Recuperado a partir de
dcterms.references[16] Sepúlveda Perico, A., Martínez Castro, R., Medina Roncancio, S., & Salazar Arrieta, F. (2016). Proposed design of a network supply chain for the cocoa agro chain of Viota municipality, Cundinamarca. IJMSOR: International Journal of Management Science & Operation Research, 1(1), 35-42. Retrieved from

Files in this item


This item appears in the following Collection(s)

Show simple item record

CC0 1.0 Universal
Except where otherwise noted, this item's license is described as CC0 1.0 Universal