Skip to content

These codes are part of MetaHeuristic Course. Algorithm of all these codes are taken from research paper.

Notifications You must be signed in to change notification settings

vivekkr2001/MetaHeuristic

Folders and files

NameName
Last commit message
Last commit date

Latest commit

f0eaa84 · May 3, 2023

History

4 Commits
May 3, 2023
May 3, 2023
May 3, 2023
May 3, 2023
May 3, 2023
May 3, 2023
May 3, 2023
May 3, 2023
May 3, 2023
May 3, 2023
May 3, 2023
May 3, 2023

Repository files navigation

MetaHeuristic

This code are part of MetaHeuristic Course. Algorithm of all these codes are taken from research paper.

Solve Travelling Salesman Problem

ga.py -> Uses Genetic Algorithm
aco_tsp.py -> Uses Ant Colony Optimisation Method
vns.py -> Uses Variable Neighbourhood Search(VNS) + Variable Neighbourhood Descent as local search

Numerical Optimisation Problem

abc_1.py -> Uses Artificial Bee Colony Method (ACS)
pso.py -> Uses Particle Swarm Optimisation Method (PSO With Inertia)
de.py -> Uses Differential Evolution Method (DE/rand/1/bin)

Other Files

benchmark.py -> Functions for Numerical Optimisation Problem
file_read.py -> To calculate Distance/Adjacent Matrix for TSP Instances provided.