Algortimos Eficientes en Problemas de Asignación
Abstract
A comparative study of methodologies to solve assignment problems has been carried out. Several reordering algorithms were implemented in a 486 PC. Both
equation- oriented techniques and methods based on graph theory were considered not only individually but also in combination. A new algorithm is proposed besides,
which is suitable for applications to process instrumentation. In all cases, the performance was assessed by trying out several case studies corresponding to existing plant sections. It was found out that the generation of boundaries with spike rows and columns is not adequate for this purpose, whereas the new approach is remarkably efficient.
equation- oriented techniques and methods based on graph theory were considered not only individually but also in combination. A new algorithm is proposed besides,
which is suitable for applications to process instrumentation. In all cases, the performance was assessed by trying out several case studies corresponding to existing plant sections. It was found out that the generation of boundaries with spike rows and columns is not adequate for this purpose, whereas the new approach is remarkably efficient.
Full Text:
PDFAsociación Argentina de Mecánica Computacional
Güemes 3450
S3000GLN Santa Fe, Argentina
Phone: 54-342-4511594 / 4511595 Int. 1006
Fax: 54-342-4511169
E-mail: amca(at)santafe-conicet.gov.ar
ISSN 2591-3522