Pin-Count and Wire Length Optimization for Electrowetting-on-Dielectric Chips: A Metaheuristics-Based Routing Algorithm

Electrowetting-on-dielectric chips are gaining momentum as efficient alternatives to conventional biochemical laboratories due to their flexibility and low power consumption. In this chapter, we present a novel two-stage metaheuristic algorithm to optimize electrode interconnect routing for pin-cons...

Full description

Saved in:
Bibliographic Details
Published inComputational Intelligence in Digital and Network Designs and Applications pp. 271 - 294
Main Authors Ibrahim, Mohamed, Salama, Cherif, El-Kharashi, M. Watheq, Wahba, Ayman
Format Book Chapter
LanguageEnglish
Published Cham Springer International Publishing
Subjects
Channel Path
Compatibility Graph
Total Wire Length
Travel Salesman Problem
Wire Length
Online AccessGet full text

Cover

More Information
Summary:Electrowetting-on-dielectric chips are gaining momentum as efficient alternatives to conventional biochemical laboratories due to their flexibility and low power consumption. In this chapter, we present a novel two-stage metaheuristic algorithm to optimize electrode interconnect routing for pin-constrained chips. The first stage models channel routing as a traveling salesman problem and solves it using the ant colony optimization algorithm. The second stage provides detailed wire routes over a grid model. The algorithm is benchmarked over a set of real-life chip specifications. On average, comparing our results to previous work, we obtain reductions of approximately 39 % and 35 % on pin-count and total wire length, respectively.
ISBN:3319200704
9783319200705
DOI:10.1007/978-3-319-20071-2_10