This project contains a solution to the Travelling Salesman Person Problem and the 0/1 Knapsack Problem using a Genetic Algorithm with different customizations and setups.
Inspired by Google's Foobar challenge. It automates secretive candidate selection based on online activity, provides timed coding challenges, and allows hiring managers to evaluate submissions
Fundamental using Algorithm in python
Candidate selection using an iterative soft-thresholding algorithm
🍀 Own proposal of Selection Algorithm: Logarithmic Weighted Random Selector; choose a random element of a list; but the closer the element is to the start is more probability to appear, based on logarithmic scale.
Selection algorithm with O(n log n) worst-case runtime
A mass simulation environment for route finding selection algorithms with a minimal UI.
Add a description, image, and links to the selection-algorithms topic page so that developers can more easily learn about it.
To associate your repository with the selection-algorithms topic, visit your repo's landing page and select "manage topics."