Aylak zamanı enküçükleyen tur oluşturma problemlerinin geri izleme yöntemi ile çözümüne ilişkin bir yazılım geliştirme uygulaması
A software development application for solving round trip slack time minimizing problems using backtracking method
Author(s): Şahin İnanç, Hayrettin Kemal SezenSubject(s): Business Economy / Management, ICT Information and Communications Technologies, Transport / Logistics
Published by: Rating Academy
Keywords: Vehicle Routing Problem; Traveling Salesman Problem; Branch and Bound Technique; Backtracking Approach;
Summary/Abstract: Even a small advantages can be important in the competition conditions that are increasing day by day in the enterprises, logistics is becoming more important with each passing day. A significant part of the expenses of enterprises constitute logistics. This study was carried out with a (exact, exact) method, which guarantees the optimal solution so as to minimize the total time spent waiting for the vehicles of a lojstik company carrying road passenger. The software was developed with the C# programming language for the solution. The method of solution of the problem was followed by the Backtracking approach of the Branch and Bound technique. This method used; has the ability to reduce total completed counting.
Journal: Journal of Life Economics
- Issue Year: 10/2023
- Issue No: 4
- Page Range: 247-256
- Page Count: 10
- Language: Turkish