Skip to content

Latest commit

 

History

History
26 lines (20 loc) · 723 Bytes

README.md

File metadata and controls

26 lines (20 loc) · 723 Bytes

Python-AI-Coursework

For combinatorial optimisation problem run the following command:

<PATH/TO/PYTHON/INTERPRETER>.exe ./ga-combinatorial-distrib.py

For continuous optimisation problem run the following command: <PATH/TO/PYTHON/INTERPRETER>.exe ./ga_continuous-distrib.py

Within the files FITNESS_CHOICE variable denotes a different fitness function numbered sequentially.

For continuous optimisation:

  1. Sum of Squares Function
  2. Rastrigin Function
  3. Dixon & Price Function
  4. Rosenbrock Function
  5. Schwefel Function
  6. Trid Function

For combinatorial optimisation:

  1. Sum Ones (Minimisation)
  2. Sum Ones (Maximisation)
  3. String Matching
  4. Reaching a number
  5. Knapsack problem
  6. Travelling Salesman problem