Performance evaluation of heuristic methods in solving symmetric travelling salesman problems
Background and Objective: The Travelling Salesman Problem (TSP) is a challenging problem in combinatorial optimization whose main purpose is to find the shortest path reaching all interconnected cities by straight lines.In spite of many available heuristic methods for solving TSPs, no attempts have...
| Asıl Yazarlar: | , , , , |
|---|---|
| Materyal Türü: | Makale |
| Dil: | English |
| Baskı/Yayın Bilgisi: |
Science Alert
2016
|
| Konular: | |
| Online Erişim: | https://repo.uum.edu.my/id/eprint/19622/1/JAI%20%209%20%201-3%20%202016%20%2012-22.pdf |