Simulated annealing algorithm applied to a flow-shop problem

Vista sencilla de ítem
dc.contributor.authorSanta Chávez, Jhon Jairo
dc.contributor.authorPeñuela Meneses, César Augusto
dc.contributor.authorGranada Echeverry, Mauricio
dc.date2014-12-01
dc.descriptionIn this paper a detailed description of the simulated annealing algorithm is presented. This strategy was employed to solve a well know flow-shop problem, which behavior is featured by the combinatorial explosion and non linear modeling. Therefore, the strategy could be focused to analyze the efficiency of the production in facilities with limited resources. Simulations results performed in a problem in the literature are presented. By this mean, the wide versatility, efficiency, and the easy implementation of the proposed algorithm is verified.en-US
dc.descriptionEn este trabajo se realizó una descripción detallada del algoritmo de Recocido Simulado como metodología de solución a problemas de optimización combinatorial. Este se enfocó especialmente a la solución del problema de secuenciamiento de tareas dentro de una planta de producción con recursos limitados. Se presentan resultados de simulaciones realizadas sobre un problema de la literatura especializada, mostrando la amplia versatilidad, eficiencia, y facilidad de implementación del algoritmo propuesto.es-ES
dc.formatapplication/pdf
dc.identifierhttps://revistas.unilibre.edu.co/index.php/avances/article/view/295
dc.identifier10.18041/1794-4953/avances.1.295
dc.identifier.urihttp://hdl.handle.net/10901/15085
dc.languagespa
dc.language.isospaspa
dc.publisherUniversidad Librees-ES
dc.relationhttps://revistas.unilibre.edu.co/index.php/avances/article/view/295/232
dc.relation/*ref*/Toro Ocampo, E. M., Restrepo G., J.S. and Granada E., M.: Algoritmo Genético Modificado Aplicado al Problema de Secuenciamiento de Tareas en Sistemas de Producción Lineal – Flow Shop. Scientia et Technica, año XII, No 30, mayo 2006, pp. 285-290.
dc.relation/*ref*/Kirkpatrick, S. and Toulouse, G.: 1985, Configuration space analysis of travelling salesman problems, J. Physique, 46 pp. 1277–1292.
dc.relation/*ref*/Cerny, V.: 1985, Thermodynamical approach to the traveling salesman problem: an efficient simulation algorithm, J. of Optimization Theory and Applications, 45(1) pp. 41–51.
dc.relation/*ref*/Metropolis, N., R. A. R. M. T. A. and Teller, E.: 1953, Equation of state calculations by fast computing machines, J. Chem. Phys., 21 pp. 1087–1090.
dc.relation/*ref*/Yong, Z. and Sannomiya, N.: 2000, A method for solving large-scale flowshop problems by reducing search space of genetic algorithms, IEEE International Conference on Systems, vol. 3 pp. 1776–1781.
dc.relation/*ref*/Kirkpatrick, S., G. C. and Vecchi, M.: 1983, Optimization by simulated annealing, Science, 220(4598) pp. 671–680.
dc.relation/*ref*/Rammal, R., T. G. and Virasoro, M.: 1986, Ultrametricity for physicists, Reviews of Modern Physics, 58(3) pp. 765–788.
dc.relation/*ref*/Solla, S., S. G. and White, S.: 1986, “Configuration space analysis for optimization problems”, In Bienenstock, E., Fogelman Soulie, F., and Weisbuch, G., editors, Disordered Systems and Biological Organization, New York, Springer-Verlag. pp. 283–292.
dc.relation/*ref*/Dréo, J., P. A. S. P. and Taillard, E.: 2003, Metaheuristics for Hard Optimization. Springer.
dc.relation/*ref*/Reeves Colin. A generis Algorithm for FlowshopSequencing. Pergamon. Computers Ops Res. Vol 22No 1, pp 5-13, 1995 Great Britain.
dc.relation/*ref*/Aarts, E. H. L. and Van Laarhoven, P. J. M.: 1985, Statistical cooling: a general approach to combinatorial optimization problems, Philips J. of Research, 40 pp. 193–226.
dc.relation/*ref*/Hajek, B.: 1988, Cooling schedules for optimal annealing, Math. Oper. Res., 13 pp. 311–329.
dc.relation/*ref*/Hajek, B. and Sasaki, G.: 1989, Simulated annealing to cool or not, Systems and Control Letters, 12 pp. 443–447.
dc.relation.ispartofjournalRevistas – Ingenieríasspa
dc.rights.licenseAtribución-NoComercial-SinDerivadas 2.5 Colombia*
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/2.5/co/*
dc.sourceAvances: Investigación en Ingeniería; Vol 11 No 1 (2014): Avances Investigación en Ingeniería; 9-17en-US
dc.sourceAvances: Investigación en Ingeniería; Vol. 11 Núm. 1 (2014): Avances Investigación en Ingeniería; 9-17es-ES
dc.source2619-6581
dc.source1794-4953
dc.subject.proposalSecuenciamiento de tareases-ES
dc.subject.proposalOptimización combinatoriales-ES
dc.subject.proposalRecocido simuladoes-ES
dc.titleSimulated annealing algorithm applied to a flow-shop problemen-US
dc.titleAlgoritmo de recocido simulado aplicado al problema de secuenciamiento regulares-ES
dc.type.coarhttp://purl.org/coar/resource_type/c_6501
dc.type.coarversionhttp://purl.org/coar/version/c_970fb48d4fbd8a85
dc.type.localPeer reviewed Articleen-US

Archivos

Colecciones

Avances: Investigación en Ingeniería