<?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-64232013000300002</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[A Multiobjective Algorithm for Redistricting]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Rincón-García]]></surname>
<given-names><![CDATA[E. A.]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Gutiérrez-Andrade]]></surname>
<given-names><![CDATA[M. A.]]></given-names>
</name>
<xref ref-type="aff" rid="A02"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[de-los-Cobos-Silva]]></surname>
<given-names><![CDATA[S. G.]]></given-names>
</name>
<xref ref-type="aff" rid="A02"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Lara-Velázquez]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Ponsich]]></surname>
<given-names><![CDATA[A. S.]]></given-names>
</name>
<xref ref-type="aff" rid="A01"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Mora-Gutiérrez]]></surname>
<given-names><![CDATA[R. A.]]></given-names>
</name>
<xref ref-type="aff" rid="A03"/>
</contrib>
</contrib-group>
<aff id="A01">
<institution><![CDATA[,Universidad Autónoma Metropolitana-Azcapotzalco Departamento de Sistemas ]]></institution>
<addr-line><![CDATA[México D. F.]]></addr-line>
<country>México</country>
</aff>
<aff id="A02">
<institution><![CDATA[,Universidad Autónoma Metropolitana-Iztapalapa Departamento de Ingeniería Eléctrica ]]></institution>
<addr-line><![CDATA[México D. F.]]></addr-line>
<country>México</country>
</aff>
<aff id="A03">
<institution><![CDATA[,Universidad Nacional Autónoma de México Facultad de ingeniería ]]></institution>
<addr-line><![CDATA[México D. F.]]></addr-line>
<country>México</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>06</month>
<year>2013</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>06</month>
<year>2013</year>
</pub-date>
<volume>11</volume>
<numero>3</numero>
<fpage>324</fpage>
<lpage>330</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1665-64232013000300002&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-64232013000300002&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-64232013000300002&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Redistricting is the redrawing of the boundaries of legislative districts for electoral purposes in such a way that the generated districts fulfill federal and state requirements such as contiguity, population equality and compactness. In this paper we solve the problem by means of a single objective and a multiobjective simulated annealing algorithm. These algorithms were applied in two real examples in Mexico. The results show that the performance of the multiobjective approach is better, leading to higher quality zones.]]></p></abstract>
<abstract abstract-type="short" xml:lang="es"><p><![CDATA[La distritación consiste en modificar los límites de zonas electorales de tal forma que se cumplan los requerimientos federales y estatales tales como conexidad, compacidad y equilibrio poblacional. En este trabajo se utiliza un algoritmo basado en recocido simulado y un algoritmo multiobjetivo basado en recocido simulado para diseñar zonas con dichas características. Ambos algoritmos fueron aplicados a dos estados de México. Los resultados muestran que la técnica multiobjetivo es superior, obteniéndose soluciones de mayor calidad]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[redistricting]]></kwd>
<kwd lng="en"><![CDATA[simulated annealing]]></kwd>
<kwd lng="en"><![CDATA[mutiobjective]]></kwd>
</kwd-group>
</article-meta>
</front><body><![CDATA[  	    <p align="center"><font face="verdana" size="4"><b>A Multiobjective Algorithm for Redistricting</b></font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="center"><font face="verdana" size="2"><b>E. A. Rinc&oacute;n&#45;Garc&iacute;a*<sup>1</sup>, M. A. Guti&eacute;rrez&#45;Andrade,<sup>2</sup> S. G. de&#45;los&#45;Cobos&#45;Silva,<sup>2</sup> P. Lara&#45;Vel&aacute;zquez,<sup>1</sup> A. S. Ponsich,<sup>1</sup> R. A. Mora&#45;Guti&eacute;rrez<sup>3</sup></b></font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="justify"><font face="verdana" size="2"><sup>1</sup><i> Universidad Aut&oacute;noma Metropolitana&#45;Azcapotzalco Departamento de Sistemas M&eacute;xico, D. F., M&eacute;xico.</i> *<a href="mailto:rigaeral@correo.azc.uam.mx">rigaeral@correo.azc.uam.mx</a>.</font></p>  	    <p align="justify"><font face="verdana" size="2"><sup>2</sup><i> Universidad Aut&oacute;noma Metropolitana&#45;Iztapalapa Departamento de Ingenier&iacute;a El&eacute;ctrica M&eacute;xico, D. F., M&eacute;xico.</i></font></p>  	    <p align="justify"><font face="verdana" size="2"><sup>3</sup><i> Universidad Nacional Aut&oacute;noma de M&eacute;xico Facultad de ingenier&iacute;a M&eacute;xico, D. F., M&eacute;xico.</i></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>  	    ]]></body>
<body><![CDATA[<p align="justify"><font face="verdana" size="2">Redistricting is the redrawing of the boundaries of legislative districts for electoral purposes in such a way that the generated districts fulfill federal and state requirements such as contiguity, population equality and compactness. In this paper we solve the problem by means of a single objective and a multiobjective simulated annealing algorithm. These algorithms were applied in two real examples in Mexico. The results show that the performance of the multiobjective approach is better, leading to higher quality zones.</font></p>  	    <p align="justify"><font face="verdana" size="2"><b>Keywords:</b> redistricting, simulated annealing, mutiobjective.</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">La distritaci&oacute;n consiste en modificar los l&iacute;mites de zonas electorales de tal forma que se cumplan los requerimientos federales y estatales tales como conexidad, compacidad y equilibrio poblacional. En este trabajo se utiliza un algoritmo basado en recocido simulado y un algoritmo multiobjetivo basado en recocido simulado para dise&ntilde;ar zonas con dichas caracter&iacute;sticas. Ambos algoritmos fueron aplicados a dos estados de M&eacute;xico. Los resultados muestran que la t&eacute;cnica multiobjetivo es superior, obteni&eacute;ndose soluciones de mayor calidad.</font></p>  	    <p align="justify"><font face="verdana" size="2">&nbsp;</font></p>  	    <p align="justify"><font face="verdana" size="2"><a href="/pdf/jart/v11n3/v11n3a2.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"><i><b>References</b></i></font></p>  	    <!-- ref --><p align="justify"><font face="verdana" size="2">&#91;1&#93; R.G. Gonz&aacute;lez&#45;Ram&iacute;rez et al., "A Hybrid Metaheuristic Approach to Optimize the Districting Design of a Parcel Company", Journal of Applied Research and Technology, vol. 9, no. 1, pp. 19&#45;35, 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=4847304&pid=S1665-6423201300030000200001&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; M. Altman, "Is Automation the Answer: The Computational Complexity of Automated Redistricting", Rutgers Computer and Law Technology Journal, vol. 23, pp. 81&#45;141, 1997.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4847306&pid=S1665-6423201300030000200002&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;3&#93; K. C. Gilbert et al., "A Multiobjective Discrete Optimization Model for Land Allocation", Management Science, vol. 31, pp. 1509&#45;1522, 1985.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4847308&pid=S1665-6423201300030000200003&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; M. A. Guti&eacute;rrez&#45;Andrade and E. A. Rinc&oacute;n&#45;Garc&iacute;a, "Redistriccting by square cells", LNAI 5845, vol. 5845, pp. 669&#45;679, 2009.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4847310&pid=S1665-6423201300030000200004&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; C. Chou and S. P. Li, "Spin systems and political districting problem", Journal of Magnetism and Magnetic Materials, vol. 310, pp. 2889&#45;2891, 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=4847312&pid=S1665-6423201300030000200005&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; H. P. Young, "Measuring the Compactness Of Legislative Districts", Legislative Studies Quarterly, vol. 13, pp. 105&#45;115, 1988.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4847314&pid=S1665-6423201300030000200006&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; R. G. Niemi et al., "Measuring Compactness and the Role of a Compactness Standard in a Test for Partisian and Racial Gerrymandering", Journal of Politics, vol. 52, pp. 1155&#45;1181, 1990.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4847316&pid=S1665-6423201300030000200007&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;8&#93; S. Kirkpatrick et al., "Optimization by simulated annealing", Science, vol. 220, pp. 671&#45;680, 1983.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4847318&pid=S1665-6423201300030000200008&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; A. Suppapitnarm et al., "Simulated annealing: An alternative approach to true multiobjective optimization", Engineering Optimization, vol. 33, pp.59, 2000.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4847320&pid=S1665-6423201300030000200009&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; L. E. Ulungu et al., "MOSAMethod: A Tool for Solving Multiobjective Combinatorial Optimization Problems", Journal of Multicriteria Decision Analysis, vol. 8, pp. 221&#45;236, 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=4847322&pid=S1665-6423201300030000200010&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; S. Balram, "Study of simulated annealing based algorithms for multiobjective optimization of a constrained problem", Computers and Chemical Engineering, vol. 28, pp. 1849&#45;1871, 2004.    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;[&#160;<a href="javascript:void(0);" onclick="javascript: window.open('/scielo.php?script=sci_nlinks&ref=4847324&pid=S1665-6423201300030000200011&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[González-Ramírez]]></surname>
<given-names><![CDATA[R.G.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A Hybrid Metaheuristic Approach to Optimize the Districting Design of a Parcel Company]]></article-title>
<source><![CDATA[Journal of Applied Research and Technology]]></source>
<year>2011</year>
<volume>9</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>19-35</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[Altman]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Is Automation the Answer: The Computational Complexity of Automated Redistricting]]></article-title>
<source><![CDATA[Rutgers Computer and Law Technology Journal]]></source>
<year>1997</year>
<volume>23</volume>
<page-range>81-141</page-range></nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gilbert]]></surname>
<given-names><![CDATA[K. C.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[A Multiobjective Discrete Optimization Model for Land Allocation]]></article-title>
<source><![CDATA[Management Science]]></source>
<year>1985</year>
<volume>31</volume>
<page-range>1509-1522</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gutiérrez-Andrade]]></surname>
<given-names><![CDATA[M. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Rincón-García]]></surname>
<given-names><![CDATA[E. A.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Redistriccting by square cells]]></article-title>
<source><![CDATA[LNAI]]></source>
<year>2009</year>
<volume>5845</volume>
<page-range>669-679</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[Chou]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[S. P.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Spin systems and political districting problem]]></article-title>
<source><![CDATA[Journal of Magnetism and Magnetic Materials]]></source>
<year>2007</year>
<volume>310</volume>
<page-range>2889-2891</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[Young]]></surname>
<given-names><![CDATA[H. P.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Measuring the Compactness Of Legislative Districts]]></article-title>
<source><![CDATA[Legislative Studies Quarterly]]></source>
<year>1988</year>
<volume>13</volume>
<page-range>105-115</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[Niemi]]></surname>
<given-names><![CDATA[R. G.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Measuring Compactness and the Role of a Compactness Standard in a Test for Partisian and Racial Gerrymandering]]></article-title>
<source><![CDATA[Journal of Politics]]></source>
<year>1990</year>
<volume>52</volume>
<page-range>1155-1181</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[Kirkpatrick]]></surname>
<given-names><![CDATA[S.]]></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="B9">
<label>9</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Suppapitnarm]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Simulated annealing: An alternative approach to true multiobjective optimization]]></article-title>
<source><![CDATA[Engineering Optimization]]></source>
<year>2000</year>
<volume>33</volume>
<page-range>59</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[Ulungu]]></surname>
<given-names><![CDATA[L. E.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[MOSAMethod: A Tool for Solving Multiobjective Combinatorial Optimization Problems]]></article-title>
<source><![CDATA[Journal of Multicriteria Decision Analysis]]></source>
<year>1999</year>
<volume>8</volume>
<page-range>221-236</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[Balram]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang="en"><![CDATA[Study of simulated annealing based algorithms for multiobjective optimization of a constrained problem]]></article-title>
<source><![CDATA[Computers and Chemical Engineering]]></source>
<year>2004</year>
<volume>28</volume>
<page-range>1849-1871</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
