Una estrategia de interconexionado de circuitos basada en algoritmos genéticos
- Fernández-Pampillón Cesteros, Ana
- Gómez Albarrán, María de las Mercedes
- Sánchez Pérez, Juan Manuel
ISSN: 0214-932X
Datum der Publikation: 1996
Ausgabe: 29
Nummer: 3
Seiten: 3-15
Art: Artikel
Andere Publikationen in: Informática y automática: revista de la Asociación Española de Informática y Automática
Zusammenfassung
Circuit routing is a problem of searching the shortest path and it is solved using high complexity algorithms. Genetic algorithms (GAs) are tough algorithms of adaptive searching, used in optimization and complex searching processes. The goal of our work is to improve a classic routing algorithm (Lee) combining it with a GA. This GA helps to reduce search space and complexities of Lee algorithm. The algorithm we propose (AGOL) obtains, if it exists, the shortest path between the circuit nodes that we are interconnecting, while overcoming the GAs drawback: finding quasi-solutions. Finally, we present a study about temporal complexity of Lee algorithm, our GA and AGOL.