ACO for the Surgical Cases Assignment Problem

Authors:
Charbel Rizk;Jean-Paul Arnaout
Affiliations:
Industrial and Mechanical Engineering Department, Lebanese American University, Byblos, Lebanon 101-F;Industrial and Mechanical Engineering Department, Lebanese American University, Byblos, Lebanon 101-F
Venue:
Journal of Medical Systems
Year:
2012

Citing 4
Cited 1

Mount Sinai Hospital Uses Integer Programming to Allocate Operating Room Time

Interfaces
Ant Colony Optimization

Ant Colony Optimization
Heuristics for the Maximization of Operating Rooms Utilization Using Simulation

Simulation
A two-stage Ant Colony Optimization algorithm to minimize the makespan on unrelated parallel machines with sequence-dependent setup times

Journal of Intelligent Manufacturing

Combining case-based reasoning with Bee Colony Optimization for dose planning in well differentiated thyroid cancer treatment

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

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.