Un Algoritmo Heurístico para el problema de fusión de mesas en un proceso electoral
Keywords:
Heuristic, Cutting and Packing, Programming Task.Abstract
The electoral process in Peru presents among your critical activities the problem of determining the minor number of tables of suffrage and the conformation of these with better uniformity. This problem is called of merger of tables of suffrage, and can be seen as a combination problem of the packing problem and programming task problem. We present a solution for this problem that consists of an algorithm BFD to determine the minor number of tables of suffrage, and two procedures to improve the uniformity of the electors' distribution for tables. The numerical experiments on 168 electoral groups with a whole of 15,534 electors show that the proposed solution reduces in 14,46% the number of table of suffrage and improvement in 3.97 % the uniformity of the electors' distribution for table.Downloads
Downloads
Published
Issue
Section
License
Copyright (c) 2008 Jose Pintado Huamán, Rosa Delgadillo, David Mauricio
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
AUTHORS RETAIN THEIR RIGHTS:
a. Authors retain their trade mark rights and patent, and also on any process or procedure described in the article.
b. Authors retain their right to share, copy, distribute, perform and publicly communicate their article (eg, to place their article in an institutional repository or publish it in a book), with an acknowledgment of its initial publication in the Revista de investigación de Sistemas e Informática.
c. Authors retain theirs right to make a subsequent publication of their work, to use the article or any part thereof (eg a compilation of his papers, lecture notes, thesis, or a book), always indicating its initial publication in the Revista de investigación de Sistemas e Informática (the originator of the work, journal, volume, number and date).
