🗺️ Visualize and control algorithms for the traveling salesman problem
Tries to create a list of popular movies based on a series of heuristics
A python library with implementations of 15 classical heuristics for the capacitated vehicle routing problem.
a python grammar for evolutionary algorithms and heuristics
A 2D/3D visualization of the Traveling Salesman Problem main heuristics
SparklingGraph provides easy to use set of features that will give you ability to proces large scala graphs using Spark and GraphX.
Coursera's Data Structures and Algorithms Specialization
Heuristics for software design, development, testing, and maintenance programming.
A MSc's Dissertation Project which focuses on Vehicle Routing Problem with Time Windows (VRPTW), using both exact method and heuristic approach (General Variable Neighbourhood Search)
Program for managing orders, planning and scheduling in job shop production system using popular heuristics alghorithms.
better google maps for block game
Next-generation firewall (NGFW) that supports blocking SocialClub Overlay notifications.
An improvement-based Deep Reinforcement Learning Algorithm presented in paper https://arxiv.org/abs/1912.05784v2 for solving the TSP problem.
Humble 3D knapsack / bin packing solver
OptFrame - C++17 (and C++20) Optimization Framework in Single or Multi-Objective. Supports classic metaheuristics and hyperheuristics: Genetic Algorithm, Simulated Annealing, Tabu Search, Iterated Local Search, Variable Neighborhood Search, NSGA-II, Genetic Programming etc. Examples for Traveling Salesman, Vehicle Routing, Knapsack Problem, etc.
Some usefull info when reverse engineering Kernel Mode Anti-Cheat
ALNS header-only library (loosely) based on the original implementation by Stefan Ropke.
A Pytorch implementation of Generative Adversarial Network for Heuristics of Sampling-based Path Planning
Functions, examples and data from the first and the second edition of "Numerical Methods and Optimization in Finance" by M. Gilli, D. Maringer and E. Schumann (2019, ISBN:978-0128150658). This repository mirrors https://gitlab.com/NMOF/NMOF .
BFS, IDS, Greedy & A* applied to the 8-puzzle problem. ⚙️
Add a description, image, and links to the heuristics topic page so that developers can more easily learn about it.
To associate your repository with the heuristics topic, visit your repo's landing page and select "manage topics."