Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Video

Updated: Jun 5, 2026

Intraoperative Strategy under Complex Vascular Adhesion for Laparoscopic Radical Resection of Bismuth-Corlette Type IIIb Perihilar Cholangiocarcinoma
05:22

Intraoperative Strategy under Complex Vascular Adhesion for Laparoscopic Radical Resection of Bismuth-Corlette Type IIIb Perihilar Cholangiocarcinoma

Published on: February 13, 2026

ACO for the surgical cases assignment problem.

Charbel Rizk1, Jean-Paul Arnaout

  • 1Industrial and Mechanical Engineering Department, Lebanese American University, Byblos, Lebanon. charbelrizk@narizk.com

Journal of Medical Systems
|January 13, 2011
PubMed
Summary

This study introduces a novel two-stage ant colony optimization (ACO) algorithm to solve the Surgical Case Assignment Problem, significantly reducing costs and improving efficiency compared to existing methods.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Bioinspired polarization vision enables underwater geolocalization.

Science advancesยท2018
See all related articles

Area of Science:

  • Operations Research
  • Computer Science
  • Healthcare Management

Background:

  • The Surgical Case Assignment Problem (SCAP) is a complex optimization challenge in healthcare.
  • Minimizing unexploited resources and operational costs is crucial for efficient hospital management.

Purpose of the Study:

  • To develop and evaluate an optimized algorithm for the Surgical Case Assignment Problem.
  • To minimize total unexploited and operating costs in surgical scheduling.

Main Methods:

  • A two-stage Ant Colony Optimization (ACO) algorithm was designed and implemented.
  • The ACO algorithm's performance was benchmarked against Branch and Bound and a global solver.

Main Results:

  • The ACO algorithm demonstrated superior performance in solving the SCAP.
  • ACO achieved better solutions with significantly reduced computational time compared to traditional methods.

Conclusions:

  • The proposed two-stage ACO algorithm is an effective and efficient approach for the Surgical Case Assignment Problem.
  • This method offers a promising solution for optimizing surgical scheduling and reducing healthcare costs.

More Related Videos

Single-Port Robotic-assisted Transaxillary Breast-conserving Surgery: A Prospective, Single-arm, Non-randomized Phase IIa Clinical Trial
03:07

Single-Port Robotic-assisted Transaxillary Breast-conserving Surgery: A Prospective, Single-arm, Non-randomized Phase IIa Clinical Trial

Published on: August 19, 2025

Related Experiment Videos

Last Updated: Jun 5, 2026

Intraoperative Strategy under Complex Vascular Adhesion for Laparoscopic Radical Resection of Bismuth-Corlette Type IIIb Perihilar Cholangiocarcinoma
05:22

Intraoperative Strategy under Complex Vascular Adhesion for Laparoscopic Radical Resection of Bismuth-Corlette Type IIIb Perihilar Cholangiocarcinoma

Published on: February 13, 2026

Single-Port Robotic-assisted Transaxillary Breast-conserving Surgery: A Prospective, Single-arm, Non-randomized Phase IIa Clinical Trial
03:07

Single-Port Robotic-assisted Transaxillary Breast-conserving Surgery: A Prospective, Single-arm, Non-randomized Phase IIa Clinical Trial

Published on: August 19, 2025