| Literature DB >> 21225322 |
Charbel Rizk1, Jean-Paul Arnaout.
Abstract
This paper addresses the Surgical Case Assignment Problem with an objective of minimizing the total unexploited and operating cost. A two-stage ant colony optimization (ACO) algorithm is introduced and its performance is evaluated by comparing its solutions to the solutions of Branch and Bound and a global solver. The results show that ACO outperformed the other algorithms and reached better solutions in a faster computational time.Mesh:
Year: 2011 PMID: 21225322 DOI: 10.1007/s10916-010-9648-z
Source DB: PubMed Journal: J Med Syst ISSN: 0148-5598 Impact factor: 4.460