We have decided to use Traveling Salesman Problem for our implementation of a Evolutionary Algorithm.
Note: We may take inspiration online for similiar solutions to this problem, But, We should make everything from scratch.
Authors Group Members
| Name | Github handle |
|---|---|
| Johan Sollenius | 11Johan11 |
| Henrik Eriksson | Henrik-Eriksson |
| Dhruhil Patel | Dhruhil Patel |
| Rishu Kamboj | |
| Sukhveer Kaur |
Early Draft Plan
Tasks Overview
1. Implement and Evaluate the Evolutionary Solution
- The problem should be flexible, allowing the number of cities to be varied.
- Parameter Tuning: Experiment with different parameters and evaluate their performance.
- Evaluation: Measure running time and potentially compare with other known algorithms for the traveling salesman problem. Test the system's limits with larger problem sets.
2. Write a Report with Results Summary (PDF)
- Describe the problem.
- Explain the system design (representation, operations, parameter values, etc.).
- Summarize results from the experimentation.
- Provide an analysis and draw conclusions.
3. Deliverables
- A PDF (our report).
- Numerical results saved in a text file.
- A zip file containing the source code (our GitHub project).