A new application of the traveling salesman problem: The Turkish cashier problem

Duman, Ekrem

dc.contributor.author	Duman, Ekrem
dc.date.accessioned	2023-09-06T06:46:26Z
dc.date.available	2023-09-06T06:46:26Z
dc.date.issued	2022
dc.identifier.issn	1683-3511	en_US
dc.identifier.uri	http://hdl.handle.net/10679/8744
dc.identifier.uri	http://www.acmij.az/view.php?lang=az&menu=journal&id=588
dc.description.abstract	We define the problem of finding a route for the cashier that minimizes the cost of transportation as the Turkish Cashier Problem (TCP). It is a special case of the well-known traveling salesman problem. To solve the TCP, we developed a heuristic algorithm, constructed a tight lower bound, and show that the heuristic algorithm performs very successfully for practical instances of the problem.	en_US
dc.language.iso	eng	en_US
dc.publisher	Ministry Communications & High Technologies Republic Azerbaijan	en_US
dc.relation.ispartof	Applied and Computational Mathematics An International Journal
dc.rights	restrictedAccess
dc.title	A new application of the traveling salesman problem: The Turkish cashier problem	en_US
dc.type	Article	en_US
dc.peerreviewed	yes	en_US
dc.publicationstatus	Published	en_US
dc.contributor.department	Özyeğin University
dc.contributor.authorID	(ORCID 0000-0001-5176-6186 & YÖK ID 142351) Duman, Ekrem
dc.contributor.ozuauthor	Duman, Ekrem
dc.identifier.volume	21	en_US
dc.identifier.issue	3	en_US
dc.identifier.startpage	259	en_US
dc.identifier.endpage	268	en_US
dc.identifier.wos	WOS:000890973100003
dc.identifier.doi	10.30546/1683-6154.21.3.2022.259
dc.subject.keywords	Traveling salesman problem	en_US
dc.subject.keywords	Combinatorial optimization	en_US
dc.subject.keywords	Heuristics	en_US
dc.identifier.scopus	SCOPUS:2-s2.0-85172682122
dc.relation.publicationcategory	Article - International Refereed Journal - Institutional Academic Staff