Skip to content

Latest commit

 

History

History
13 lines (9 loc) · 675 Bytes

File metadata and controls

13 lines (9 loc) · 675 Bytes

Doctor-Patient Matching using Ant Colony Optimization with Random Restructure Local Search

Solving the doctor-patient matching problem (NP-Hard) using Ant Colony Algorithm and further optimizing it with random restructure local search and comparing its performance against naive algorithm.

Results

Contributors

  • Pratham Nayak
  • Naveen Shenoy
  • Abhinav Bharali
  • Alimurtaza Merchant