Simulated Annealing, Telkom University

Simulated Annealing Algorithm

An implementation of Coupled Simulated Annealing methaeuristics using parallelism with OpenMP.

sRACIPE for bioconductor

This project focuses on implementing existing artificial intelligence algorithms in games and providing a comparison of the used algorithms.

AI University Search Algorithms - Genetic & Simulated Annealing

Applying the Ant Colony Optimization (ACO) and Simulated Annealing (SA) algorithms to solve the Travelling Salesperson Problem

Solve traveling salesman problem using simulated annealing

This project was presented for the Artificial Intelligence course for the academic year 2022/2023. It explores various methods to solve the N-Queens problem, including Random Search, Backtracking, Hill-Climbing, Simulated Annealing, and Genetic Algorithms. Each method is evaluated for its efficiency and effectiveness in finding solutions.

Benchmarking non-traditional optimisation algorithms using the 0-1 Knapsack problem.

Solution to the Traveling Tournament using simulated annealing

A machine learning project that uses the simulated annealing approach to minimize a function.

Using Simulated Annealing to Break a Playfair Cipher

GUI quadratic assignment problem

Follow up to the tsp project. Implements approximation algorithms.

Quadratix is a student Project that assigns a machine to a place.

01110110110010011011010011101001010101100000010001

CS170 2019Fall project at UC, Berkeley. An approximation algorithm for partial TSP with multiple cost.

Implementation of simulated annealing optimization algorithm for different tasks