The vehicle routing problem (VRP) is a combinatorial optimization and integer programming problem which asks "What is the optimal set of routes for a fleet of vehicles to traverse in order to deliver to a given set of customers. In this project, tabu search algorithm used for deliver shipments to customers with minimum cost.
-
Notifications
You must be signed in to change notification settings - Fork 0
ErkanCetinyamac/Vehicle-Routing-Problem-An-Optimization-Solution-with-Tabu-Search-Algorithm
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
An optimization solution with tabu search to VRP Problem.
Topics
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published