Surveying an Approximate Solution for Traveling Salesman Problem
p. 219-225
Résumé
One of the interesting problems in 0-l programming in operation research science is called "Traveling salesman problem". In this paper two inventional methods for calculating the approximate answer have been surveyed. The first inventional method that has been surveyed is simple and its base is selecting a chain of cities that every selected city has the minimum cost with its previous city. The second inventional method is a little harder and has a special algorithm for selecting the first city and next cities. Both inventional methods are surveyed by simulation. Then it seems that the first inventional method has a big error index but the second inventional method has an acceptable error index and it can accept as a heuristic method.
Index
Texte
Citer cet article
Référence papier
Hamid Reza Kamali, « Surveying an Approximate Solution for Traveling Salesman Problem », CASYS, 21 | 2008, 219-225.
Référence électronique
Hamid Reza Kamali, « Surveying an Approximate Solution for Traveling Salesman Problem », CASYS [En ligne], 21 | 2008, mis en ligne le 30 August 2024, consulté le 20 September 2024. URL : http://popups.lib.uliege.be/1373-5411/index.php?id=2733
Auteur
Hamid Reza Kamali
Iranian ACECR Branch of Yazd