Document Detail


ACO for the Surgical Cases Assignment Problem.
MedLine Citation:
PMID:  21225322     Owner:  NLM     Status:  Publisher    
Abstract/OtherAbstract:
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.
Authors:
Charbel Rizk; Jean-Paul Arnaout
Publication Detail:
Type:  JOURNAL ARTICLE     Date:  2011-1-12
Journal Detail:
Title:  Journal of medical systems     Volume:  -     ISSN:  0148-5598     ISO Abbreviation:  -     Publication Date:  2011 Jan 
Date Detail:
Created Date:  2011-1-12     Completed Date:  -     Revised Date:  -    
Medline Journal Info:
Nlm Unique ID:  7806056     Medline TA:  J Med Syst     Country:  -    
Other Details:
Languages:  ENG     Pagination:  -     Citation Subset:  -    
Affiliation:
Industrial and Mechanical Engineering Department, Lebanese American University, P.O. Box 36, Byblos, 101-F, Lebanon, charbelrizk@narizk.com.
Export Citation:
APA/MLA Format     Download EndNote     Download BibTex
MeSH Terms
Descriptor/Qualifier:

From MEDLINE®/PubMed®, a database of the U.S. National Library of Medicine


Previous Document:  Response to Induced Relaxation During Pregnancy: Comparison of Women with High Versus Low Levels of ...
Next Document:  Quantitative Effect of Reducing Body Thickness on Visualizing Murine Deep Abdominal Lymph Nodes by I...