Capacitated vehicle routing problem for goods delivery by using tabu search
The main purpose of this study is to optimize the route for two vehicles that start and end from central depot to each location as well as to compare the results between the greedy and Tabu Search methods. To solve this problem, C ++ programming has been used to solve the CVRP which involves large d...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
2018
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/83915/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|