The Traveling Salesman Pick-up Problem makes one of countless variations of the Traveling Salesman Problem, this article seeks to relate different methods of solving the Traveling Salesman’s Pick-up and Delivery Problem, to this end, a problem approach was carried out through the Variable Neighborhood Search (VNS), and from this relate to the solution through the Construction Heuristic, Greedy Algorithm, and also some Refinement Heuristics. The informational nature for those seeking to know about the performance of the VNS meta heuristic and also about the restriction of collection and delivery to the traveling salesman problem, this work can help.
-
Notifications
You must be signed in to change notification settings - Fork 0
Implementation of TSP Pickup and Delivery with Variable Neighborhood Search approach
License
costa-victor/TSP-Pickup-and-Delivery-Metaheuristics
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
Implementation of TSP Pickup and Delivery with Variable Neighborhood Search approach
Topics
Resources
License
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published