We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
GEZGİN SATICI PROBLEMİNİN OYUN TEORİSİ MALİYET TAHSİS YÖNTEMLERİ İLE İNCELENMESİ.
- Authors
SAVAŞ, Ulviye; OLGUN, Mehmet Onur
- Abstract
In this study, travelling salesman problem (TSP), which is one of the Integer Programming models, is used. The purpose in TSP is to find the shortest way to return to the starting point by going to each point only once from the points to be made, in order to make the works more efficient and not create extra cost in situations such as distribution, supply and logistics. While calculating this route, the cost to be obtained as a result of the tour should be lower than all other routes. Then, cost sharing related to the problem is allocated by using cooperative game theory. In the event that players (firms) share a coalition between them, the cost of each player is obtained by two different cost allocation methods, Shapley value and nucleolus methods. Comparing the numerical results obtained, it is observed that the Shapley value has a lower cost compared to the nucleolus method and the cost reduction rates of the three players were calculated as 47.04%, 48.74%, 25.91%, respectively.
- Subjects
TRAVELING salesman problem; COOPERATIVE game theory; COST allocation; COST shifting; COST control
- Publication
SDU Journal of Engineering Sciences & Design / Mühendislik Bilimleri ve Tasarım Dergisi, 2020, Vol 8, p58
- ISSN
1308-6693
- Publication type
Article
- DOI
10.21923/jesd.829133