Meta-Heuristic Algorithm for Travelling Salesman Problem

genetic-algorithm tsp particle-swarm-optimization soft-computing discrete-optimization swarm-intelligence travelling-salesman-problem meta-heuristic-algorithm nature-inspired-algorithms approximation-algorithm whale-optimization-algorithm mealpy

• Updated May 20, 2022
• Python

Implements a traveling salesperson problem (TSP) approximation algorithm in order to optimize routes for package deliveries. Written in Python. Supports multiple delivery vehicles, real time changes to delivery schedules and addresses, and provides detailed status updates for each package at any time before, during, or after delivery.

python nearest-neighbor-search tsp traveling-salesman-problem approximation-algorithm

• Updated Jan 12, 2021
• Python

Approximate Shortest Superstring Generator

python3 greedy scs greedy-algorithm string-algorithms shortest-common-superstrings stringology approximation-algorithm superstring

• Updated Oct 17, 2026
• Python

Empirical comparison of an exact Θ(n·2ⁿ) brute force vs. a Θ(n log n) modified greedy heuristic (provable 1/2-approximation) on the Subset Sum problem. Brute force fits 1.868ⁿ with R²=0.9955; heuristic achieves 0.9848 mean quality ratio.

python algorithms jupyter-notebook np-complete greedy-algorithm complexity-analysis subset-sum brute-force-algorithm sabanci-university cs301 approximation-algorithm empirical-analysis

• Updated May 18, 2026
• Jupyter Notebook

An implementation of Chakrabarty and Goel's approximationalgorithm for the maximum budgeted allocation problem.

python approximation-algorithm maximum-budgeted-allocation

• Updated Mar 1, 2026
• Python

A Java approximation algorithm for the Traveling Salesman problem (graph, nodes, edges, delivery solver).

java algorithms graph traveling-salesman-problem approximation-algorithm

• Updated May 25, 2026
• Java

The folder contains implemented approaches of curves fitting of Non-Specific binding of Blood Plasma proteins to the sensor surface

proteins optimization ode conjugation chemical-kinetics fitting-algorithm optimization-algorithms adsorption odeint langmuir approximation-algorithm surface-plasmon-resonance

• Updated Nov 11, 2022
• Jupyter Notebook

A program that breaks cycles in undirected and directed graphs (with and without weights), that is, to find the minimum feedback arc set in given graphs.

cplusplus graph-algorithms np-hard dfs heuristics kruskal-algorithm minimum-spanning-tree approximation-algorithm

• Updated Dec 11, 2023
• C++

Orthogonal regression polynomial approximation: no SLE, fast, high precision, no dependencies

polynomial-regression orthogonal-polynomials approximation-algorithm polynomial-approximation

• Updated Dec 25, 2023
• PHP

constraint-programming heuristic optimization-algorithms greedy-algorithm approximation-algorithms linear-extension topological-sorts incomparable-elements approximation-algorithm

• Updated Oct 6, 2019
• C++