Atıf Sayısı
2
Görüntüleme
23
İndirme
21
Giderek artan küresel rekabet ortamında şirketler, tedarik zinciri süreçlerini en verimli ve etkin şekilde yönetmek için çeşitli yöntemlere başvurmaktadır. Bu konuda önemli yöntemlerden biri dağıtım ağlarının doğru tasarlanması yönündedir. Dağıtım ağı tasarımında önemli bileşenler tesislerin yer seçimi ve araçların rotalanmasıdır. Mümkünse, dağıtım maliyetini en aza indirmek amacıyla, yer seçimi ve rotalama problemindeki iki karar beraber dikkate alınmalıdır. Ancak, pratikte birçok sektörde yer seçimini etkileyen çok daha farklı ve ağırlığı fazla faktörler bulunabilmekle beraber, zamanla değişen ihtiyaçlar rotalama noktalarının değişmesine neden olabilmektedir. Ayrıca bu çalışmanın başlangıçta yapılmadığı durumlarda, yer değiştirme maliyeti çok daha yüksek olacağı için, çalışmalar sadece rotalama problemi olarak ele alınabilmektedir. Araç rotalama problemi, bir veya birkaç noktadan, belirli müşterilere ürün dağıtımı veya toplanması olarak tanımlanabilir. Bu problemlerde, araç kapasiteleri ve müşterilerin servis süresi gibi kısıtlar dikkate alınarak etkin kullanım hedeflenmektedir. Araç rotalama problemleri, birçok alanda gerçek hayatta karşılaşılan problemlerdir. Bu durum bu konuda çalışmalar yapılmasını ve verimli sonuçlar ortaya koyan algoritmalar sunulmasında fayda sağlamıştır. Bu çalışmada ise, karşılaşılan problemin çözüme ulaşması adına, model eş zamanlı topla-dağıt döngüsel araç rotalama problemi olarak kurgulanmıştır. Eş zamanlı topla-dağıt döngüsel araç rotalama problemi müşterilerin dağıtım ve toplama taleplerinin, başlangıç ve bitiş noktaları aynı (işletme) olacak şekilde araçlar için belirli bir rota belirlenerek eş zamanlı olarak karşılandığı bir problemdir. Bu çalışma kapsamında, endüstriyel bıçak bileme fabrikası üzerinden 8 farklı şehirde 20 müşteriye lojistik hizmet oluşturulması üzerine rotalama problemi ele alınmıştır. Probleme konu olan şirket, mevcutta var olan yöntemde ürün lojistiği kargo firmaları ile sağlanmaktadır. Maliyetleri düşürmek adına şirketin kendi lojistik ağının kurulması üzere çalışma yapılmıştır. Bu çalışmada, minimum sayıda araç kullanımı ile toplam kat edilen mesafenin minimumda tutulması ile birlikte, kısıtlar göz önüne alınarak, minimum maliyet hedeflenmiştir. Problem çözümü için doğrusal programlama kullanılmış ve GAMS üzerinden çözüme ulaşılmıştır.
In an increasingly global competitive environment, companies are using a variety of methods to manage supply chain processes in the most efficient and efficient way. One of the important methods in this regard is the direction of proper design of distribution networks. Important components in the design of the distribution network are the location selection of facilities and the rotation of vehicles. If possible, in order to minimize the distribution costs, two decisions on the issue of location selection and rotating should be taken together. However, in practice in many sectors there are far more different and more weight factors that affect the location choice, but the time-changing needs can lead to a change in rotating points. Also, in cases where this work is not done at the beginning, as the replacement cost will be much higher, the work can only be treated as a rotating problem. Vehicle rotating problem, from one or more points, can be defined as product distribution or collection to specific customers. In these problems, effective use is aimed at taking into account limitations such as vehicle capacity and customer service time. Vehicle rotating problems are problems that are faced in real life in many areas. This has contributed to the study and the presentation of algorithms that show effective results. In this study, for the purpose of achieving a solution to the problem faced, the model was established as a simultaneous collection-distribution cycle vehicle rotating problem. The simultaneous collection-distribution cycle vehicle rotation problem is a problem in which customers’ distribution and collection requests are simultaneously addressed by determining a specific route for the vehicles so that the starting and end points will be the same (business). In the framework of this study, the rotating problem was addressed on the creation of logistics services to 20 customers in 8 different cities through the industrial knife knowing factory. The problem is that the company is supplied with the existing method of product logistics shipping companies. In order to reduce the costs, the company has been working to establish its own logistics network. In this study, the minimum cost targeted, taking into account the limits, with the minimum number of vehicles used and with the minimum retention of the total duplicated distance. Linear programming has been used to solve the problem and has been achieved through GAMS.
In an increasingly global competitive environment, companies use a variety of ways to manage their supply chain processes in the most efficient and effective manner. One of the important methods is to design the distribution networks correctly. Important components in the distribution network design are the location selection of facilities and routing of vehicles. Where possible, two decisions in site selection and routing should be considered together to minimize the cost of distribution. However, in practice, there are many different and weighty factors that affect the choice of place in many sectors, but the changing needs over time may lead to changing routing points. In addition, in the absence of this study at the beginning, since the cost of displacement will be much higher, only studies can be considered as routing problem. Vehicle-routing problem can be defined as product distribution or collection to specific customers from one or several points. In these problems, effective use is aimed by taking into consideration the constraints such as vehicle capacities and customer service time. Vehicle routing problems are real life problems in many areas. This situation has been beneficial in carrying out studies on this subject and presenting algorithms that yield productive results. To solve the problem encountered in this study, the model was created as a vehicle routing problem with simultaneous pickup and delivery. Vehicle routing problem with simultaneous pickup and delivery; It is a problem that the distribution and collection demands of the customers are met simultaneously by setting a specific route for vehicles with the same starting and ending points (firm). Within the scope of this study, routing problem on creating logistics services for 20 customers in 8 different cities over the factory was discussed. The company that is the subject of the problem is provided by the cargo logistics companies in the present case. In order to reduce costs, efforts were made to establish the company's own logistics network. The aim of this study is to keep the total distance traveled to a minimum by using the minimum number of vehicles, and to minimize the costs. Linear programming was used for problem solving and the solution was reached via GAMS.
Alan : Sosyal, Beşeri ve İdari Bilimler
Dergi Türü : Ulusal
Makale Detay 
Atıf Yapanlar
Benzer Makaleler
PDF Görüntüle
Dergi Bilgisi
Eseri Dinleyin
Bu Sayfayı Yazdırın
Paylaş
Mendeley
