<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1405-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462009000300008</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Using Simulated Annealing with a Neighborhood Heuristic for Roll Cutting Optimization]]></article-title>
<article-title xml:lang="es"><![CDATA[Aplicando Recocido Simulado con Heurística de Vecindad a la Optimización de Cortes en Rollos]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Martínez Alfaro]]></surname>
<given-names><![CDATA[Horacio]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Valenzuela Rendón]]></surname>
<given-names><![CDATA[Manuel]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
</contrib-group>
<aff id="A01">
<institution><![CDATA[,Tecnológico de Monterrey Centro de Computación Inteligente y Robótica ]]></institution>
<addr-line><![CDATA[Monterrey N.L.]]></addr-line>
<country>México</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>09</month>
<year>2009</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>09</month>
<year>2009</year>
</pub-date>
<volume>13</volume>
<numero>1</numero>
<fpage>87</fpage>
<lpage>95</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462009000300008&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-55462009000300008&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-55462009000300008&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[This article presents the use of the Simulated Annealing algorithm with a heuristic to solve the waste minimization problem in roll cutting programming, in this case, paper. Client orders, which vary in weight, width, and external and internal diameter, are fully satisfied. Several tests were performed with real data from a paper company in which an average of 30% waste reduction and 100% reduction in production to inventory are obtained compare to the previous procedure.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[Este artículo presenta el uso del algoritmo de Recocido Simulado con una heurística para resolver el problema de minimización de desperdicio en la programación de cortes en rollos, en este caso de papel. Las órdenes de los clients, que varían en peso, ancho, y diámetro interno y externo, se satisfacen al 100%. Se realizan varias pruebas con datos reales de una compañía en donde en promedio se obtiene un ahorro del 30% de desperdicio y 100% de producción a inventario comparado con el procedimiento anterior.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Simulated Annealing]]></kwd>
<kwd lng="en"><![CDATA[optimization]]></kwd>
<kwd lng="en"><![CDATA[heuristics]]></kwd>
<kwd lng="en"><![CDATA[cutting]]></kwd>
<kwd lng="en"><![CDATA[paper rolls]]></kwd>
<kwd lng="es"><![CDATA[Recocido simulado]]></kwd>
<kwd lng="es"><![CDATA[optimización]]></kwd>
<kwd lng="es"><![CDATA[heurísticas]]></kwd>
<kwd lng="es"><![CDATA[corte]]></kwd>
<kwd lng="es"><![CDATA[rollos de papel]]></kwd>
</kwd-group>
</article-meta>
</front><body><![CDATA[ <p align="justify"><font face="verdana" size="4">Art&iacute;culos</font></p>     <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>     <p align="center"><font face="verdana" size="4"><b>Using Simulated Annealing with a Neighborhood Heuristic for Roll Cutting Optimization</b></font></p>     <p align="center"><font face="verdana" size="2">&nbsp;</font></p>     <p align="center"><font face="verdana" size="3"><b><i>Aplicando Recocido Simulado con Heur&iacute;stica de Vecindad a la Optimizaci&oacute;n de Cortes en Rollos</i></b></font></p>     <p align="center"><font face="verdana" size="2">&nbsp;</font></p>     <p align="center"><font face="verdana" size="2"><b>Horacio Mart&iacute;nez Alfaro and Manuel Valenzuela Rend&oacute;n</b></font></p>     <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>     <p align="justify"><font face="verdana" size="2"><i>Centro de Computaci&oacute;n Inteligente y Rob&oacute;tica Tecnol&oacute;gico de Monterrey Monterrey, N.L. 64849 M&eacute;xico Ph. +52 81.8328.4381 F. +52 81.8328.4189 <a href="mailto:hma@itesm.mx">hma@itesm.mx</a> ;   <a href="mailto:valenzuela@itesm.mx">valenzuela@itesm.mx</a></i></font></p>     <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>     ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2">Article received on July 15, 2008    <br>   Accepted on April 03, 2009</font></p>     <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>     <p align="justify"><font face="verdana" size="2"><b>Abstract</b></font></p>     <p align="justify"><font face="verdana" size="2">This article presents the use of the Simulated Annealing algorithm with a heuristic to solve the waste minimization problem in roll cutting programming, in this case, paper. Client orders, which vary in weight, width, and external and internal diameter, are fully satisfied. Several tests were performed with real data from a paper company in which an average of 30% waste reduction and 100% reduction in production to inventory are obtained compare to the previous procedure.</font></p>     <p align="justify"><font face="verdana" size="2"><b>Keywords: </b>Simulated Annealing, optimization, heuristics, cutting, paper rolls.</font></p>     <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>     <p align="justify"><font face="verdana" size="2"><b>Resumen</b></font></p>     <p align="justify"><font face="verdana" size="2">Este art&iacute;culo presenta el uso del algoritmo de Recocido Simulado con una heur&iacute;stica para resolver el problema de minimizaci&oacute;n de desperdicio en la programaci&oacute;n de cortes en rollos, en este caso de papel. Las &oacute;rdenes de los clients, que var&iacute;an en peso, ancho, y di&aacute;metro interno y externo, se satisfacen al 100%. Se realizan varias pruebas con datos reales de una compa&ntilde;&iacute;a en donde en promedio se obtiene un ahorro del 30% de desperdicio y 100% de producci&oacute;n a inventario comparado con el procedimiento anterior.</font></p>     <p align="justify"><font face="verdana" size="2"><b>Palabras clave: </b>Recocido simulado, optimizaci&oacute;n, heur&iacute;sticas, corte, rollos de papel.</font></p>     ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2">&nbsp;</font></p>     <p align="justify"><font face="verdana" size="2"><a href="/pdf/cys/v13n1/v13n1a8.pdf" target="_blank">DESCARGAR ART&Iacute;CULO EN FORMATO PDF</a></font></p>     <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>     <p align="justify"><font face="verdana" size="2"><b>References</b></font></p>     <!-- ref --><p align="justify"><font face="verdana" size="2">1. <b>Burkard, R., &amp; Rendl, F. </b>(1984). A thermodynamically motivated simulation procedure for combinatorial optimization problems. European J. of Oper. Res.(17), 169&#150;174.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2048058&pid=S1405-5546200900030000800001&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">2. <b>Elperin, T. </b>(1988). Monte carlo structural optimization in discrete variables with annealing algorithm. Int. J. for Numerical Methods in Eng.(26), 815&#150;821.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2048059&pid=S1405-5546200900030000800002&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">3. <b>Gelfand, S. B., &amp; Mitter, S. K. </b>(1985, December). Analysis of simulated annealing for optimization. In Proc. 24th Conf. on Decision and Control (pp. 779&#150;786). Ft. Lauderdale.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2048060&pid=S1405-5546200900030000800003&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">4. <b>Gielen, G. G. E., Walscharts, H. C. C., &amp; Sansen, W. M. C. </b>(1990, June). Analog circuit design optimization based on symbolic simulation and simulated annealing. IEEE Journal of Solid&#150;State Circuits (25), 707&#150;713.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2048061&pid=S1405-5546200900030000800004&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">5. <b>Kirkpatrick, S., Gelatt, C. D., &amp; Vecchi, M. P. </b>(1983). Optimization by simulated annealing. Science, 220, 671&#150;680.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2048062&pid=S1405-5546200900030000800005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">6. <b>Kirkpatrick, S., &amp; Toulouse, G. </b>(1985). Configuration space analysis of travelling salesman problems. J. Physique (46), 1277&#150;1292.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2048063&pid=S1405-5546200900030000800006&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">7. <b>Laarhoven, P. J. M. van, &amp; Aarts, E. H. L. </b>(1987). Simulated annealing: Theory and applications. Dordrecht, Holland: D. Reidel Pub. Co.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2048064&pid=S1405-5546200900030000800007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">8. <b>Malhotra, A., Oliver, J. H., </b>&amp; <b>Tu, W. </b>(1991). Synthesis of spatially and intrinsically constrained curves using simulated annealing. In Asme Design Engineering Technical Conferences: Advances in Design Automation (pp. 145&#150;155).</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2048065&pid=S1405-5546200900030000800008&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">9. <b>Mart&iacute;nez&#150;Alfaro, H., &amp; Flores&#150;Ter&aacute;n, G. </b>(1998). Solving the classroom assignment problem with simulated annealing. In Ieee Int. Conf. on Systems, Man, &amp; Cybernetics. San Diego, CA.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2048066&pid=S1405-5546200900030000800009&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">10. <b>Mart&iacute;nez &#150;Alfaro, H., &amp; Flugrad, D. R. </b>(1994, September). Collission&#150;free path planning of robots and/or AGVs using B&#150;splines and simulated annealing. In Asme 23rd Biennial Mechanisms Conference. Minneapolis.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2048067&pid=S1405-5546200900030000800010&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">11. <b>Mart&iacute;nez &#150;Alfaro, H., &amp; Ulloa&#150;P&eacute;rez, A. </b>(1996). Computing near optimal paths in C&#150;space using simulated annealing. In Asme Design Engineering Technical Conference/24th Biennial Mechanisms Conference. Irvine, CA.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2048068&pid=S1405-5546200900030000800011&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">12. <b>Mart&iacute;nez &#150;Alfaro, H., Valdez, H., &amp; Ortega, J. </b>(1998a). Linkage synthesis of a four&#150;bar mechanism for n precision points using simulated annealing. In Asme Design Engineering Technical Conferences/25th Biennial Mecanisms and Robotics Conference. Atlanta.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2048069&pid=S1405-5546200900030000800012&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">13. <b>Mart&iacute;nez &#150;Alfaro, H., Valdez, H., &amp; Ortega, J. </b>(1998b). Using simulated annealing to minimize operational costs in the steel making industry. In Ieee Int. Conf. on Systems, Man, &amp; Cybernetics. San Diego.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2048070&pid=S1405-5546200900030000800013&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">14. <b>Mart&iacute;nez &#150;Alfaro, H., &amp; Valenzuela&#150;Rend&oacute;n, M. </b>(2004). Using simulated annealing for paper cutting optimization. Lecture Notes In Artificial Intelligence Series: Lecture Notes In Computer Science, 11&#150;20.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2048071&pid=S1405-5546200900030000800014&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">15. <b>Metropolis, N., Rosenbluth, A., Rosenbluth, M., &amp; Teller, A. </b>(1953). Equations of state calculations by fast computing machines. J. of Chemical Physics (21), 1087&#150;1091.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2048072&pid=S1405-5546200900030000800015&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">16. <b>Rutenbar, R. </b>(1989, January). Simulated annealing algorithms: An overview. IEEE Circuits and Devices, 19&#150;26.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2048073&pid=S1405-5546200900030000800016&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --><!-- ref --><p align="justify"><font face="verdana" size="2">17. <b>Vanderbilt, D., &amp; Louie, S.</b> (1984). A monte carlo simulated annealing approach to optmization over continuous variables. J. Comput. Phys.(36), 259&#150;271.</font>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=2048074&pid=S1405-5546200900030000800017&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --> ]]></body><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Burkard]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Rendl]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A thermodynamically motivated simulation procedure for combinatorial optimization problems]]></article-title>
<source><![CDATA[European J. of Oper. Res.]]></source>
<year>1984</year>
<volume>17</volume>
<page-range>169-174</page-range></nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Elperin]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Monte carlo structural optimization in discrete variables with annealing algorithm]]></article-title>
<source><![CDATA[Int. J. for Numerical Methods in Eng.]]></source>
<year>1988</year>
<volume>26</volume>
<page-range>815-821</page-range></nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gelfand]]></surname>
<given-names><![CDATA[S. B.]]></given-names>
</name>
<name>
<surname><![CDATA[Mitter]]></surname>
<given-names><![CDATA[S. K.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Analysis of simulated annealing for optimization]]></article-title>
<source><![CDATA[]]></source>
<year>1985</year>
<month>, </month>
<day>De</day>
<conf-name><![CDATA[24th Conf. on Decision and Control]]></conf-name>
<conf-loc> </conf-loc>
<page-range>779-786</page-range><publisher-loc><![CDATA[Ft. Lauderdale ]]></publisher-loc>
</nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gielen]]></surname>
<given-names><![CDATA[G. G. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Walscharts]]></surname>
<given-names><![CDATA[H. C. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Sansen]]></surname>
<given-names><![CDATA[W. M. C.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Analog circuit design optimization based on symbolic simulation and simulated annealing]]></article-title>
<source><![CDATA[IEEE Journal of Solid-State Circuits]]></source>
<year>1990</year>
<month>, </month>
<day>Ju</day>
<volume>25</volume>
<page-range>707-713</page-range></nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kirkpatrick]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Gelatt]]></surname>
<given-names><![CDATA[C. D.]]></given-names>
</name>
<name>
<surname><![CDATA[Vecchi]]></surname>
<given-names><![CDATA[M. P.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Optimization by simulated annealing]]></article-title>
<source><![CDATA[Science]]></source>
<year>1983</year>
<volume>220</volume>
<page-range>671-680</page-range></nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kirkpatrick]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Toulouse]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Configuration space analysis of travelling salesman problems]]></article-title>
<source><![CDATA[J. Physique]]></source>
<year>1985</year>
<volume>46</volume>
<page-range>1277-1292</page-range></nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Laarhoven]]></surname>
<given-names><![CDATA[P. J. M. van]]></given-names>
</name>
<name>
<surname><![CDATA[Aarts]]></surname>
<given-names><![CDATA[E. H. L.]]></given-names>
</name>
</person-group>
<source><![CDATA[Simulated annealing: Theory and applications]]></source>
<year>1987</year>
<publisher-loc><![CDATA[Dordrecht ]]></publisher-loc>
<publisher-name><![CDATA[D. Reidel Pub. Co.]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Malhotra]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Oliver]]></surname>
<given-names><![CDATA[J. H.]]></given-names>
</name>
<name>
<surname><![CDATA[Tu]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Synthesis of spatially and intrinsically constrained curves using simulated annealing]]></article-title>
<source><![CDATA[Asme Design Engineering Technical Conferences: Advances in Design Automation]]></source>
<year>1991</year>
<page-range>145-155</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Martínez-Alfaro]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Flores-Terán]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Solving the classroom assignment problem with simulated annealing]]></article-title>
<source><![CDATA[]]></source>
<year>1998</year>
<conf-name><![CDATA[ Ieee Int. Conf. on Systems, Man, & Cybernetics]]></conf-name>
<conf-loc>San Diego CA</conf-loc>
</nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Martínez -Alfaro]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Flugrad]]></surname>
<given-names><![CDATA[D. R.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Collission-free path planning of robots and/or AGVs using B-splines and simulated annealing]]></article-title>
<source><![CDATA[]]></source>
<year>1994</year>
<month>, </month>
<day>Se</day>
<conf-name><![CDATA[23rd Biennial Mechanisms Conference]]></conf-name>
<conf-loc>Minneapolis </conf-loc>
</nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Martínez -Alfaro]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Ulloa-Pérez]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Computing near optimal paths in C-space using simulated annealing]]></article-title>
<source><![CDATA[]]></source>
<year>1996</year>
<conf-name><![CDATA[24th Design Engineering Technical ConferenceBiennial Mechanisms Conference]]></conf-name>
<conf-loc>Irvine CA</conf-loc>
</nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Martínez -Alfaro]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Valdez]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Ortega]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Linkage synthesis of a four-bar mechanism for n precision points using simulated annealing]]></article-title>
<source><![CDATA[]]></source>
<year>1998</year>
<conf-name><![CDATA[25th Design Engineering Technical ConferencesBiennial Mecanisms and Robotics Conference]]></conf-name>
<conf-loc>Atlanta </conf-loc>
</nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Martínez -Alfaro]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Valdez]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Ortega]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Using simulated annealing to minimize operational costs in the steel making industry]]></article-title>
<source><![CDATA[]]></source>
<year>1998</year>
<conf-name><![CDATA[ Ieee Int. Conf. on Systems, Man, & Cybernetics]]></conf-name>
<conf-loc>San Diego </conf-loc>
</nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Martínez -Alfaro]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Valenzuela-Rendón]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Lecture Notes In Artificial Intelligence]]></source>
<year>2004</year>
<page-range>11-20</page-range></nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Metropolis]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Rosenbluth]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Rosenbluth]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Teller]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Equations of state calculations by fast computing machines]]></article-title>
<source><![CDATA[J. of Chemical Physics]]></source>
<year>1953</year>
<volume>21</volume>
<page-range>1087-1091</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rutenbar]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Simulated annealing algorithms: An overview]]></article-title>
<source><![CDATA[IEEE Circuits and Devices]]></source>
<year>1989</year>
<month>, </month>
<day>Ja</day>
<page-range>19-26</page-range></nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Vanderbilt]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Louie]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A monte carlo simulated annealing approach to optmization over continuous variables]]></article-title>
<source><![CDATA[J. Comput. Phys.]]></source>
<year>1984</year>
<volume>36</volume>
<page-range>259-271</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
