HEURISTIC ALGORITHM FOR RING TOPOLOGY NETWORK OPTIMIZATION
The Travelling Salesman Problem (TSP) is to find a routing of a salesman who starts from a home location, visits a prescribed set of cities and returns to the original location such in such a way that the total distance travelled is minimum and each city visited exactly once. TSP has a widespread...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/50576 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |
