ashishpatel26/Amazing-Collection-Vehicle-Routing-Problem
Amazing Collection Vehicle Routing Problem
This helps logistics and delivery managers plan the most efficient routes for their fleet of vehicles. You input a list of locations that need to be visited and the number of vehicles available. The project outputs optimized routes that minimize the time it takes for all deliveries or visits to be completed, ensuring no vehicle's route is excessively long. It's ideal for anyone managing a multi-stop delivery or service operation.
No commits in the last 6 months.
Use this if you need to quickly determine the best routes for multiple vehicles to visit many locations, aiming to complete all tasks as fast as possible.
Not ideal if your primary goal is to minimize the total distance traveled by all vehicles combined, rather than minimizing the completion time of the longest route.
Stars
50
Forks
18
Language
—
License
—
Category
Last pushed
Nov 22, 2019
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/ashishpatel26/Amazing-Collection-Vehicle-Routing-Problem"
Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.
Higher-rated alternatives
pdrm83/py2opt
How to solve the traveling salesman problem with the 2-opt algorithm, a fast heuristic search algorithm.
aimclub/SAMPO
Open-source framework for adaptive manufacturing processes scheduling
yining043/TSP-improve
An improvement-based Deep Reinforcement Learning Algorithm presented in paper...
albert-espin/knapsack-packing
Evolutionary Algorithm for the 2D Packing Problem combined with the 0/1 Knapsack Problem (Master Thesis)
rithinch/pareto-optimal-student-supervisor-allocation
🎓An AI tool to assist universities with optimal allocation of students to supervisors for their...