A
ALNS
@N-Wouda
Adaptive large neighbourhood search (and more!) in Python.
MIT Commit 2 jaaren geleden ★ 658
Pijlers en weging
Waarom deze score
- MIT (permissive)
- Last commit 578 days ago
- OpenSSF Scorecard 3.4/10
- Top 15% by stars in Transport & Fleet::Route Optimization
Feiten
- Licentie
- MIT (Permissief)
- Taal
- Python
- GitHub-sterren
- 658
- Laatste commit
- 2025-02-25 (2 jaaren geleden)
- Laatste release
- 2024-10-21T21:12:32Z
- OpenSSF Scorecard
- 3.4/10
- Zelf hosten
- Niet vastgesteld
- Maintainer-locatie
- Onbekend
- Bron
- github-search
Alternatieven in Route-optimalisatie
01 71 02 69 03 68 04 68
T
timefold-solver
The open source Solver AI for Java and Kotlin to optimize scheduling and routing. Solve the vehicle routing problem, employee rostering, task assignment, maintenance scheduling and other planning problems.
T
timefold-quickstarts
Get started with Timefold quickstarts here. Optimize the vehicle routing problem, employee rostering, task assignment, maintenance scheduling and other planning problems.
B
bounty-targets-data
This repo contains hourly-updated data dumps of bug bounty platform scopes (like Hackerone/Bugcrowd/Intigriti/etc) that are eligible for reports
R
rl4co
A PyTorch library for all things Reinforcement Learning (RL) for Combinatorial Optimization (CO)