optimization-algorithms

Optimization Course Project

3D web-based simulator for visualizing and comparing metaheuristic optimization algorithms on diverse mathematical landscapes

Convex optimization algorithms, duality theory, proximal gradient methods, and applied solver implementations.

The application was created to introduce the user with the concept of the knapsack problem and to solve optimization problems with the help of available algorithms.

Demo of Real-Time image optimization algorithm based on Weber–Fechner law and Color difference formula that corrects sun exposure on LCD screens

Interactive airport flight-path optimizer implementing Prim's Minimum Spanning Tree algorithm with live network visualization.

Simple CLI written to optimize images with following extensions: jpg, gif, svg, png. Under the hood, it uses a imagemin packages.

🧠 Deterministic Parallel Reasoning Engine (DPRE) — A high-integrity tactical decision-optimization framework using multi-round mathematical competition and AI-driven scoring.

This interface allows small businesses in a township to interact with the chatbot

The Travelling Salesman Problem (TSP) finds the shortest route visiting all cities once. Genetic Algorithms (GA) solve it by evolving route solutions through selection, crossover, and mutation, efficiently approaching near-optimal paths without brute-force search.

A quadtree implementation for two dimensional position search, implemented using p5.js

This is a interative web demo for Genetic Algorithm

Prepare your wedding at best by seating your guests in the best possible way based on each guest's interaction with the others

A demonstration of the Monte Carlo method and its relation with entropy

Phenotype is a genetic algorithm library for JavaScript.

A Web-based Particle Swarm Optimization Simulator

AI-powered staff rostering system with automated scheduling, manual assignment, and real-time shift coverage tracking.

Game of Knights where 6 knights should hit the one at their left with a random amount of damage of a range. Then they should fight until there's only one knight standing. All actions should be displayed (knight 1 hits 2 with X damage, knight 4 dies, knight 5 wins)

Diagonal method of global optimization