taylorc1009/Honours-Project
My Edinburgh Napier University Honours Project: investigating the multi-objective Capacitated Vehicle Routing Problem with Time Windows (CVRPTW).
This project helps logistics and delivery managers plan the most efficient routes for multiple vehicles making deliveries. You input customer locations, delivery time windows, and vehicle capacities, and it outputs a set of optimized routes that minimize costs like total distance or the number of vehicles needed. This is designed for professionals managing complex delivery operations.
No commits in the last 6 months.
Use this if you need to optimize vehicle delivery routes while strictly adhering to vehicle capacity limits and customer-specific time windows.
Not ideal if your routing problems do not involve vehicle capacity or time window constraints, or if you require real-time dynamic route adjustments.
Stars
7
Forks
1
Language
Python
License
—
Category
Last pushed
May 30, 2022
Commits (30d)
0
Get this data via API
curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/taylorc1009/Honours-Project"
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...