Skip to content

Files

Latest commit

 

History

History
2 lines (2 loc) · 216 Bytes

File metadata and controls

2 lines (2 loc) · 216 Bytes

Multi-Objective-Covering-Salesman-Problem

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.