ABC-GNX: A Hybrid Algorithm for Scheduling of Digital Microfluidic Biochip Operations

Rajesh, Kolluri; Kumar, JV Phani; Swain, Jyotiranjan; Pyne, Sumanta

doi:10.1109/ised48680.2019.9096254

Cited by 1 publication

(1 citation statement)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Simulation results show that it has achieved a higher number of optimal completion times and shorter execution times than existing algorithms. A preliminary version of this paper is published in Reference 12.…”

Section: Introductionmentioning

confidence: 99%

A hybrid artificial bee colony algorithm for scheduling of digital microfluidic biochip operations

Rajesh

Pyne

2021

Concurrency and Computation

Self Cite

View full text Add to dashboard Cite

Summary Digital microfluidic biochips (DMFBs) are designed to efficiently carry out biochemical and biomedical analysis in a miniaturized way. DMFBs offer various advantages over traditional laboratory techniques and reduces cost, and increases automation and software programmability. Scheduling of microfluidic operations is the first and essential step in the fluidic‐level synthesis of DMFBs, while the other two are the module placement and droplet routing. Scheduling DMFB operations is a multiconstrained optimization problem, and the particular decision problem is NP‐complete. We propose a hybrid artificial bee colony (ABC) algorithm using generalized N‐point crossover (GNX) based scheduling of DMFB operations. Proposed ABC‐GNX perturbs through search space, evaluates various schedules possible, and returns the best schedule among the evaluated schedules. Simple list scheduling based heuristic algorithms can explore a single schedule based on the sequence generated by the priority function. Iterative improvement based search algorithms explore the search space and evaluate more schedules, but the proposed ABC‐GNX algorithm produces optimal solutions in shorter execution times. Simulation results show that the proposed ABC‐GNX produces a higher number of optimal completion times and faster execution times than existing algorithms.

show abstract

Section: Introductionmentioning

confidence: 99%