Skip to content
/ Doctor-Patient-Matching-using-ACO-with-Local-Search Public

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.

2 stars 1 fork Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

spectre900/Doctor-Patient-Matching-using-ACO-with-Local-Search

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
AntColonyOptimizationLS.cpp
AntColonyOptimizationLS.cpp
 
 
Project Report.pdf
Project Report.pdf
 
 
README.md
README.md
 
 
plot1.png
plot1.png
 
 
plot2.png
plot2.png
 
 
testInput.txt
testInput.txt
 
 

Repository files navigation

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

About

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.

Resources

Readme
Activity

Stars

2 stars

Watchers

1 watching

Forks

1 fork
Report repository

Releases

No releases published

Packages

No packages published

Languages