Zaman pencereli araç rotalama problemi: Saha ekiplerinde bir uygulama
[ X ]
Tarih
2024
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Kırıkkale Üniversitesi
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
Günümüzde artan rekabet ile gerek hizmet sektöründe gerekse üretim sektöründe lojistik maliyetlerinin azaltılması büyük önem arz etmektedir. Bu konuda önemli bir yer tutan kalemlerden biri de dağıtım maliyetidir. Üretilen ürünün ya da hizmetin müşterilere en kısa yoldan ulaştırılması söz konusu maliyetin optimize edilmesi noktasında temel unsurlardan biridir. Bu çalışmada Telekom sektöründe faaliyet gösteren bir şirkette Araç Rotalama Probleminin bir türü olan Zaman Pencereli Araç Rotalama Problemi (ZARP) ele alınmıştır. Şirketin abonelerine sunduğu geniş bir hizmet türü portföyü bulunmaktadır. En önemlileri de DSL ve Fiber altyapısında sunulan Ses ve İnternet hizmet türleridir. Yeni kurulum, nakil siparişlerine ait işler, randevulu ise müşterinin istediği zaman aralığında, randevusuz ise belirli sla süreleri içerisinde saha ekipleri tarafından tamamlanması gerekmektedir. Araç rotalama ile hem şirket maliyetleri optimize edilmiş hem de zamanında yapılan iş dolayısıyla da müşteri deneyiminin artırılması sağlanmış olacaktır. Bu çalışmada geliştirilen modelin sonuçları şirketin mevcut ekip rakamları ile kıyaslanarak modelle birlikte oluşan fayda ortaya konulmaya çalışılacaktır. Aynı zamanda da literatürde birçok çeşidi olan ve çoğu gerçek hayatta karşılaşılan problemleri çözmeyi amaçlayan Araç Rotalama Problemleri için literatüre özgün bir çalışma kazandırılması hedeflenmiştir. Anahtar kelimeler: Araç Rotalama, Zaman Pencereli Araç Rotalama, En Kısa Yol, Dağıtım, Lineer Programlama
Nowadays, with increasing competition, reducing logistics costs in both the service sector and the production sector is of great importance. One of the significant items in this regard is the distribution cost. Delivering the produced product or service to customers in the shortest way is one of the basic elements of optimizing the distribution cost. In this study, the Vehicle Routing Problem with Time Windows (VRPTW), a variant of the Vehicle Routing Problem (VRP), is addressed for a company operating in the telecommunications sector. The company has a wide portfolio of service types offered to its subscribers. The most important ones are the Voice and Internet service types offered on DSL and Fiber infrastructure. Jobs related to new installations and transfer orders must be completed by field teams. If the job is appointment-based, it should be done within the time frame requested by the customer; if it is not appointment-based, it should be completed within specified SLA time limits. With vehicle routing, company costs will be optimized, and the timely completion of jobs will enhance the customer experience. The results of the model developed in this study will be compared with the company's current team figures and the benefits created by the model will be revealed. At the same time, it is aimed to provide an original study to the literature for Vehicle Routing Problems, which have many types in the literature and aim to solve problems most encountered in real life. Key Words: Vehicle Routing, Time Window Vehicle Routing, Shortest Path, Distribution, Linear Programming
Nowadays, with increasing competition, reducing logistics costs in both the service sector and the production sector is of great importance. One of the significant items in this regard is the distribution cost. Delivering the produced product or service to customers in the shortest way is one of the basic elements of optimizing the distribution cost. In this study, the Vehicle Routing Problem with Time Windows (VRPTW), a variant of the Vehicle Routing Problem (VRP), is addressed for a company operating in the telecommunications sector. The company has a wide portfolio of service types offered to its subscribers. The most important ones are the Voice and Internet service types offered on DSL and Fiber infrastructure. Jobs related to new installations and transfer orders must be completed by field teams. If the job is appointment-based, it should be done within the time frame requested by the customer; if it is not appointment-based, it should be completed within specified SLA time limits. With vehicle routing, company costs will be optimized, and the timely completion of jobs will enhance the customer experience. The results of the model developed in this study will be compared with the company's current team figures and the benefits created by the model will be revealed. At the same time, it is aimed to provide an original study to the literature for Vehicle Routing Problems, which have many types in the literature and aim to solve problems most encountered in real life. Key Words: Vehicle Routing, Time Window Vehicle Routing, Shortest Path, Distribution, Linear Programming
Açıklama
Fen Bilimleri Enstitüsü, Endüstri Mühendisliği Ana Bilim Dalı
Anahtar Kelimeler
Endüstri ve Endüstri Mühendisliği, Industrial and Industrial Engineering
