<?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>1665-6423</journal-id>
<journal-title><![CDATA[Journal of applied research and technology]]></journal-title>
<abbrev-journal-title><![CDATA[J. appl. res. technol]]></abbrev-journal-title>
<issn>1665-6423</issn>
<publisher>
<publisher-name><![CDATA[Universidad Nacional Autónoma de México, Instituto de Ciencias Aplicadas y Tecnología]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1665-64232014000300001</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[A Model and Solution Method for Solving the Real-world and Complex Problem of Scheduling Visits to Customers]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Baldoquin de la Peña]]></surname>
<given-names><![CDATA[M.G.]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Escalera Fariñas]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<xref ref-type="aff" rid="A02"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Linfati]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<xref ref-type="aff" rid="A03"/>
</contrib>
</contrib-group>
<aff id="A01">
<institution><![CDATA[,Pontificia Universidad Javeriana Cali Facultad de Ingeniería ]]></institution>
<addr-line><![CDATA[Cali ]]></addr-line>
<country>Colombia</country>
</aff>
<aff id="A02">
<institution><![CDATA[,Instituto Superior Politécnico José Antonio Echeverría Centro de Estudios de Matemática ]]></institution>
<addr-line><![CDATA[La Habana ]]></addr-line>
<country>Cuba</country>
</aff>
<aff id="A03">
<institution><![CDATA[,Universidad del Bío Departamento de Ingeniería Industrial ]]></institution>
<addr-line><![CDATA[Concepción ]]></addr-line>
<country>Chile</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>00</month>
<year>2014</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>00</month>
<year>2014</year>
</pub-date>
<volume>12</volume>
<numero>3</numero>
<fpage>333</fpage>
<lpage>342</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1665-64232014000300001&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1665-64232014000300001&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1665-64232014000300001&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Some of the complex logistical problems faced by companies combine the needs for strategic and tactical decisions concerning the interrelated issues of clustering, scheduling, and routing. Various strategies can be used to solve these problems. We present a problem of this type, involving a company whose fundamental objective is the commercialization of its product in the domestic market. The paper focuses on a model of and method for a solution to the problem of scheduling visits to customers, taking into account the relationship with other phases of product marketing. The model is nonlinear, involves binary and continuous variables, and solved heuristically. Computational experiments show that the proposed solution performed very well for both real-life and theoretical instances.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[logistics]]></kwd>
<kwd lng="en"><![CDATA[scheduling]]></kwd>
<kwd lng="en"><![CDATA[heuristic]]></kwd>
</kwd-group>
</article-meta>
</front><body><![CDATA[  	    <p align="center"><font face="verdana" size="4"><b>A Model and Solution Method for Solving the Real&#45;world and Complex Problem of Scheduling Visits to Customers</b></font></p>     <p align="center">&nbsp;</p>  	    <p align="center"><font face="verdana" size="2"><b>M.G. Baldoquin de la Pe&ntilde;a<sup>1</sup>, A. Escalera Fari&ntilde;as<sup>2</sup> and R. Linfati*<sup>3</sup></b></font></p>     <p align="center">&nbsp;</p>  	    <p align="justify"><font face="verdana" size="2"><sup>1</sup>&nbsp;<i>Facultad de Ingenier&iacute;a, Pontificia Universidad Javeriana Cali Cali, Colombia.</i></font></p>  	    <p align="justify"><font face="verdana" size="2"><sup>2</sup>&nbsp;<i>Centro de Estudios de Matem&aacute;tica, ISPJAE La Habana, Cuba.</i></font></p>  	    <p align="justify"><font face="verdana" size="2"><sup>3</sup>&nbsp;<i>Departamento de Ingenier&iacute;a Industrial, Universidad del B&iacute;o&#45;B&iacute;o Concepci&oacute;n, Chile.</i> * <a href="mailto:rlinfati@ubiobio.cl">rlinfati@ubiobio.cl</a></font></p>     <p align="justify">&nbsp;</p>  	    <p align="justify"><font face="verdana" size="2"><b>Abstract</b></font></p>  	    ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2">Some of the complex logistical problems faced by companies combine the needs for strategic and tactical decisions concerning the interrelated issues of clustering, scheduling, and routing. Various strategies can be used to solve these problems. We present a problem of this type, involving a company whose fundamental objective is the commercialization of its product in the domestic market. The paper focuses on a model of and method for a solution to the problem of scheduling visits to customers, taking into account the relationship with other phases of product marketing. The model is nonlinear, involves binary and continuous variables, and solved heuristically. Computational experiments show that the proposed solution performed very well for both real&#45;life and theoretical instances.</font></p>  	    <p align="justify"><font face="verdana" size="2"><b>Keywords:</b> logistics, scheduling, heuristic.</font></p>     <p align="justify">&nbsp;</p> 	    <p align="justify"><font face="verdana" size="2"><a href="/pdf/jart/v12n3/v12n3a1.pdf" target="_blank">DESCARGAR ART&Iacute;CULO EN FORMATO PDF</a></font></p> 	    <p align="justify">&nbsp;</p>  	    <p align="justify"><font face="verdana" size="2"><b><i>References</i></b></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;1&#93;&nbsp;B.Y. Zhao, J. Kubiatowicz, and A.D. Joseph, "Tapestry: An infrastructure for fault&#45;tolerant wide&#45;area location and routing," Computer Science, vol. 74, no. 46, pp. 11&#45;20, 2001.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4845287&pid=S1665-6423201400030000100001&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;2&#93; G. Nagy and S. Salhi. "Location&#45;routing: Issues, models and methods," European Journal of Operational Research, vol. 177, no. 2, pp. 649&#45;672, 2007.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4845289&pid=S1665-6423201400030000100002&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2">&#91;3&#93; M.E. Cort&eacute;s, and R.A. Garc&iacute;a, "Soluci&oacute;n al problema de asignaci&oacute;n&#45;distribuci&oacute;n. Mosaicos Matem&aacute;ticos," Memorias de la XVII Semana Regional de Investigaci&oacute;n y Docencia en Matem&aacute;ticas, Universidad de Sonora M&eacute;xico, vol. 20, pp. 51&#45;57, 2007.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4845291&pid=S1665-6423201400030000100003&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;4&#93; Y. Deng and J.F. Bard, "A reactive GRASP with path relinking for capacitated clustering," Journal of Heuristics, vol. 17, no. 2, pp. 119&#45;152, 2011.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4845293&pid=S1665-6423201400030000100004&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;5&#93; G. Gonz&aacute;lez and F. Gonz&aacute;lez, "Metaheur&iacute;sticas aplicadas al ruteo de veh&iacute;culos. Un caso de estudio, Parte 3: Genetic clustering and Tabu routing," Ing. Investig., vol. 27, no. 2, pp. 106&#45;113, 2007.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4845295&pid=S1665-6423201400030000100005&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;6&#93; R. Freling, D. Huisman and A.P.M. Wagelmans, "Models and algorithms for integration of vehicle and crew scheduling," Journal of Scheduling, vol. 6 no. 1, pp. 63&#45;85, 2003.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4845297&pid=S1665-6423201400030000100006&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;7&#93; J.E. Korsvik and K. Fagerholt, "A tabu search heuristic for ship routing and scheduling with flexible cargo quantities," Journal of Heuristics, vol. 16 no. 2, pp. 117&#45;137, 2010.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4845299&pid=S1665-6423201400030000100007&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2">&#91;8&#93; I. Averbakh and O. Berman, "A simple heuristic for machine flow&#45;shop and its applications in routing&#45;scheduling problems," Operations Research, vol. 47, no. 1, pp. 165&#45;170, 1999.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4845301&pid=S1665-6423201400030000100008&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;9&#93; V. Jayaraman, "Transportation, facility location and inventory issues in distribution network design," International Journal of Operations &amp; Production Management, vol. 18, no. 5, pp. 471&#45;494, 1998.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4845303&pid=S1665-6423201400030000100009&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;10&#93; P. Chakroborty, "Genetic algorithms for optimal urban transit network design," Computer&#45;Aided Civil and Infrastructure Engineering, vol. 18, no. 3, pp. 184&#45;200, 2003.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4845305&pid=S1665-6423201400030000100010&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;11&#93;&nbsp;S. Guill&eacute;n&#45;Burguete, H. S&aacute;nchez&#45;Larios, J.G. V&aacute;zquez&#45;V&aacute;zquez, "An Optimal Transportation Schedule of Mobile Equipment," Journal of Applied Research and Technology, vol. 10, no. 5, pp. 713&#45;723, 2012.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4845307&pid=S1665-6423201400030000100011&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;12&#93; A. Caprara, M. Monaci and P. Toth, A global method for crew planning in railway applications. In: Daduna, J., Voss, S. (eds.) Computer&#45;Aided Transit Scheduling. Lecture Notes in Economics and Mathematical Systems, 505, pp. 17&#45;36. Springer, New York. 2001.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4845309&pid=S1665-6423201400030000100012&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2">&#91;13&#93; J. Bar&#45;Ilan, G. Kortsarz and D. Peleg, "How to allocate network centers," J. Algorithms, vol. 15, no. 3, pp. 385&#45;41, 1993.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4845311&pid=S1665-6423201400030000100013&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;14&#93; D.W. Pentico, "Assignment problems: A golden anniversary survey," European Journal of Operational Research, vol. 176, no. 2, pp. 774&#45;793, 2007.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4845313&pid=S1665-6423201400030000100014&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;15&#93; A. Letchford and S. Burer, "Non&#45;convex mixed&#45;integer nonlinear programming: a survey," Surveys in Operations Research and Management Science, vol. 17, no. 2, pp. 97&#45;106, 2012.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4845315&pid=S1665-6423201400030000100015&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;16&#93; A. Escalera, "Sistema soporte a la decisi&oacute;n para el agrupamiento en zonas de distribuci&oacute;n de los customeres de BRASCUBA S.A.," Tesis de maestr&iacute;a en Ciencias en Inform&aacute;tica Empresarial, La Habana, Cuba, Mayo 2011.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4845317&pid=S1665-6423201400030000100016&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;17&#93; J. Pacheco and M. Beltr&aacute;n, "An&aacute;lisis de nuevos m&eacute;todos de clasificaci&oacute;n. Un ejemplo ilustrativo de su uso en la agrupaci&oacute;n de los municipios de Castilla y Le&oacute;n," Estad&iacute;stica Espa&ntilde;ola, vol. 43, no. 148, pp. 209&#45;224, 2001.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4845319&pid=S1665-6423201400030000100017&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>      ]]></body>
<body><![CDATA[<!-- ref --><p align="justify"><font face="verdana" size="2">&#91;18&#93; E. Taillard, "Heuristic Methods for Large Centroid Clustering Problems," Journal of Heuristics, vol. 9, no. 1, pp. 51&#45;73, 2003.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4845321&pid=S1665-6423201400030000100018&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;19&#93; J. Homberger, Extended SOLOMON's VRPTW instances (online), 1998, <a href="http://www.fernunihagen.de/WINF/touren/inhalte/probinst.htm" target="_blank">http://www.fernunihagen.de/WINF/touren/inhalte/probinst.htm</a>.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4845323&pid=S1665-6423201400030000100019&lng=','','width=640,height=500,resizable=yes,scrollbars=1,menubar=yes,');">Links</a>&#160;]<!-- end-ref --></font></p>      ]]></body><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Zhao]]></surname>
<given-names><![CDATA[B.Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Kubiatowicz]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Joseph]]></surname>
<given-names><![CDATA[A.D.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Tapestry: An infrastructure for fault-tolerant wide-area location and routing]]></article-title>
<source><![CDATA[Computer Science]]></source>
<year>2001</year>
<volume>74</volume>
<numero>46</numero>
<issue>46</issue>
<page-range>11-20</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[Nagy]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Salhi]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Location-routing: Issues, models and methods]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2007</year>
<volume>177</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>649-672</page-range></nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cortés]]></surname>
<given-names><![CDATA[M.E.]]></given-names>
</name>
<name>
<surname><![CDATA[García]]></surname>
<given-names><![CDATA[R.A.]]></given-names>
</name>
</person-group>
<article-title xml:lang="es"><![CDATA[Solución al problema de asignación-distribución. Mosaicos Matemáticos]]></article-title>
<source><![CDATA[Memorias de la XVII Semana Regional de Investigación y Docencia en Matemáticas]]></source>
<year>2007</year>
<volume>20</volume>
<page-range>51-57</page-range><publisher-name><![CDATA[Universidad de Sonora México]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Deng]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Bard]]></surname>
<given-names><![CDATA[J.F.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A reactive GRASP with path relinking for capacitated clustering]]></article-title>
<source><![CDATA[Journal of Heuristics]]></source>
<year>2011</year>
<volume>17</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>119-152</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[González]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[González]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang="es"><![CDATA[Metaheurísticas aplicadas al ruteo de vehículos. Un caso de estudio, Parte 3: Genetic clustering and Tabu routing]]></article-title>
<source><![CDATA[Ing. Investig.]]></source>
<year>2007</year>
<volume>27</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>106-113</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[Freling]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Huisman]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Wagelmans]]></surname>
<given-names><![CDATA[A.P.M.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Models and algorithms for integration of vehicle and crew scheduling]]></article-title>
<source><![CDATA[Journal of Scheduling]]></source>
<year>2003</year>
<volume>6</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>63-85</page-range></nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Korsvik]]></surname>
<given-names><![CDATA[J.E.]]></given-names>
</name>
<name>
<surname><![CDATA[Fagerholt]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A tabu search heuristic for ship routing and scheduling with flexible cargo quantities]]></article-title>
<source><![CDATA[Journal of Heuristics]]></source>
<year>2010</year>
<volume>16</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>117-137</page-range></nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Averbakh]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Berman]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A simple heuristic for machine flow-shop and its applications in routing-scheduling problems]]></article-title>
<source><![CDATA[Operations Research]]></source>
<year>1999</year>
<volume>47</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>165-170</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Jayaraman]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Transportation, facility location and inventory issues in distribution network design]]></article-title>
<source><![CDATA[International Journal of Operations & Production Management]]></source>
<year>1998</year>
<volume>18</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>471-494</page-range></nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Chakroborty]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Genetic algorithms for optimal urban transit network design]]></article-title>
<source><![CDATA[Computer-Aided Civil and Infrastructure Engineering]]></source>
<year>2003</year>
<volume>18</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>184-200</page-range></nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Guillén-Burguete]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Sánchez-Larios]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Vázquez-Vázquez]]></surname>
<given-names><![CDATA[J.G.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[An Optimal Transportation Schedule of Mobile Equipment]]></article-title>
<source><![CDATA[Journal of Applied Research and Technology]]></source>
<year>2012</year>
<volume>10</volume>
<numero>5</numero>
<issue>5</issue>
<page-range>713-723</page-range></nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Caprara]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Monaci]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Toth]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A global method for crew planning in railway applications]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Daduna]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Voss]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Computer-Aided Transit Scheduling]]></source>
<year>2001</year>
<page-range>17-36</page-range><publisher-loc><![CDATA[New York ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bar-Ilan]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Kortsarz]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Peleg]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[How to allocate network centers]]></article-title>
<source><![CDATA[J. Algorithms]]></source>
<year>1993</year>
<volume>15</volume><volume>3</volume>
<page-range>385-41</page-range></nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pentico]]></surname>
<given-names><![CDATA[D.W.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Assignment problems: A golden anniversary survey]]></article-title>
<source><![CDATA[European Journal of Operational Research]]></source>
<year>2007</year>
<volume>176</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>774-793</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[Letchford]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Burer]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Non-convex mixed-integer nonlinear programming: a survey]]></article-title>
<source><![CDATA[Surveys in Operations Research and Management Science]]></source>
<year>2012</year>
<volume>17</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>97-106</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Escalera]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Sistema soporte a la decisión para el agrupamiento en zonas de distribución de los customeres de BRASCUBA S.A.]]></source>
<year></year>
</nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Pacheco]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Beltrán]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Análisis de nuevos métodos de clasificación. Un ejemplo ilustrativo de su uso en la agrupación de los municipios de Castilla y León]]></article-title>
<source><![CDATA[Estadística Española]]></source>
<year>2001</year>
<volume>43</volume>
<numero>148</numero>
<issue>148</issue>
<page-range>209-224</page-range></nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Taillard]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Heuristic Methods for Large Centroid Clustering Problems]]></article-title>
<source><![CDATA[Journal of Heuristics]]></source>
<year>2003</year>
<volume>9</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>51-73</page-range></nlm-citation>
</ref>
<ref id="B19">
<label>19</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Homberger]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Extended SOLOMON's VRPTW instances (online)]]></source>
<year>1998</year>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
