.png){kind=icon}
.png){kind=icon}
Return
ACO for the Surgical Cases Assignment Problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s10916-010-9648-z.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
Ant Colony Optimization
Surgical cases assignment problem
Integer program
Metaheuristic
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5.7
Papers:
3.5K
Citations:
7.9K