A new heuristic algorithm for multiple traveling salesman problem
| dc.contributor.author | Nuriyeva, Fidan | en_US |
| dc.contributor.author | Kızılateş, Gözde | en_US |
| dc.date.accessioned | 2020-10-12T07:04:11Z | |
| dc.date.available | 2020-10-12T07:04:11Z | |
| dc.date.issued | 2017 | |
| dc.identifier.citation | Nuriyeva, F. & Kızılateş, G. (2017). A new heuristic algorithm for multiple traveling salesman problem. TWMS Journal Of Applied And Engineering Mathematics, 7(1), 101-109. | en_US |
| dc.identifier.issn | 2146-1147 | en_US |
| dc.identifier.issn | 2587-1013 | en_US |
| dc.identifier.uri | http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/2616 | |
| dc.identifier.uri | http://jaem.isikun.edu.tr/web/index.php/archive/93-vol7no1/283 | |
| dc.description.abstract | The Multiple Traveling Salesman Problem (mTSP) is a combinatorial optimization problem in NP-hard class. The mTSP aims to acquire the minimum cost for traveling a given set of cities by assigning each of them to a different salesman in order to create m number of tours. This paper presents a new heuristic algorithm based on the shortest path algorithm to find a solution for the mTSP. The proposed method has been programmed in C language and its performance analysis has been carried out on the library instances. The computational results show the efficiency of this method. | en_US |
| dc.language.iso | en | en_US |
| dc.publisher | Işık University Press | en_US |
| dc.relation.ispartof | TWMS Journal Of Applied And Engineering Mathematics | en_US |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.rights | Attribution-NonCommercial-NoDerivs 3.0 United States | * |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/us/ | * |
| dc.subject | Multiple traveling salesman problem | en_US |
| dc.subject | Heuristic algorithms | en_US |
| dc.subject | Shortest path algorithm | en_US |
| dc.subject | Insertion heuristic | en_US |
| dc.subject | Graph theory | en_US |
| dc.title | A new heuristic algorithm for multiple traveling salesman problem | en_US |
| dc.type | Article | en_US |
| dc.description.version | Publisher's Version | en_US |
| dc.identifier.volume | 7 | |
| dc.identifier.issue | 1 | |
| dc.identifier.startpage | 101 | |
| dc.identifier.endpage | 109 | |
| dc.peerreviewed | Yes | en_US |
| dc.publicationstatus | Published | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Başka Kurum Yazarı | en_US |
Bu öğenin dosyaları:
Bu öğe aşağıdaki koleksiyon(lar)da görünmektedir.
-
JAEM 2017, Vol 7, No 1 [17]
JAEM 2017, Vol 7, No 1 koleksiyonunu içerir.
Aksi belirtilmediği sürece bu öğenin lisansı: info:eu-repo/semantics/openAccess
