In this project Covering Salesman problem is solved using Genetic Algorithm. Two objectives are in focus here i.e minimizing the tour length and maximizing the coverage.
-
Notifications
You must be signed in to change notification settings - Fork 0
subhadip00/Multi-Objective-Covering-Salesman-Problem
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
In this project Covering Salesman problem is solved using Genetic Algorithm. Two objectives are in focus here i.e minimizing the tour length and maximizing the coverage.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published