A multi-depot vehicle routing problem with time windows for daily planned maintenance and repair service planning

Görkem Yılmaz

Makale detayları

A multi-depot vehicle routing problem with time windows for daily planned maintenance and repair service planning

Yazarlar:

Görkem Yılmaz

Yayıncı:

Pamukkale University

Ana Başlıklar:

Algoritmalar ve Hesaplama Kuramı

Dergi:

Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi Vol.29 Issue 8, pp.913-919

Belge Tipi:

Makale

Yayın Tarihi:

12/2023

Belge Dili:

Türkçe

Document ID (Org No.):

2001308560

pISSN:

2147-5881

Anahtar kelimeler:

Özet:

 A compressor manufacturer producing in KocaeliDilovası region makes vehicle routing and employee planning daily to fulfill the maintenance and repair requests of the Marmara region and its surroundings the next day. The service types and times are agreed upon with the customer before service planning. The vehicles and their respective operators for a given planning day are known, with the service personnels starting and ending points being the residences. All the planned services must be satisfied in the time windows customers give. We approach the issue as a multi-depot vehicle routing problem with time windows MDVRPTW and construct a mixed-integer linear programming framework. The solution is deemed adequate in resolving the companys service planning predicament. To tackle large instances, we formulate a clustering algorithm that yields a proficient solution in a concise duration.

 A compressor manufacturer producing in KocaeliDilovası region makes vehicle routing and employee planning daily to fulfill the maintenance and repair requests of the Marmara region and its surroundings the next day. The service types and times are agreed upon with the customer before service planning. The vehicles and their respective operators for a given planning day are known, with the service personnels starting and ending points being the residences. All the planned services must be satisfied in the time windows customers give. We approach the issue as a multi-depot vehicle routing problem with time windows MDVRPTW and construct a mixed-integer linear programming framework. The solution is deemed adequate in resolving the companys service planning predicament. To tackle large instances, we formulate a clustering algorithm that yields a proficient solution in a concise duration.

 A compressor manufacturer producing in KocaeliDilovası region makes vehicle routing and employee planning daily to fulfill the maintenance and repair requests of the Marmara region and its surroundings the next day. The service types and times are agreed upon with the customer before service planning. The vehicles and their respective operators for a given planning day are known, with the service personnels starting and ending points being the residences. All the planned services must be satisfied in the time windows customers give. We approach the issue as a multi-depot vehicle routing problem with time windows MDVRPTW and construct a mixed-integer linear programming framework. The solution is deemed adequate in resolving the companys service planning predicament. To tackle large instances, we formulate a clustering algorithm that yields a proficient solution in a concise duration.

 KocaeliDilovası bölgesinde üretim yapan bir kompresör üreticisi, Marmara bölgesi ve çevresinin ertesi günkü bakım ve onarım talebini karşılamak için günlük olarak araç rotalama ve personel planlaması yapmaktadır. Servis planlamasından önce servis türleri ve süreleri müşteri ile kararlaştırılır. Servis personelinin başlangıç ve bitiş noktaları ikametgah adresleri olmak üzere, belirli bir planlama günü için araçlar ve ilgili operatörleri bilinmektedir. Tüm talepler, müşteriler tarafından verilen zaman pencerelerinde karşılanır. Problem, Zaman Pencereli Çok Depolu Araç Rotalama problemi MDVRPTW olarak ele alınmaktadır ve bir karma tamsayılı doğrusal programlama modeli geliştirilmiştir. Matematiksel model çözümü şirketin problemini çözmeye yeterlidir. Büyük örnekleri çözmek için, kısa sürede yeterli bir çözüm sağlayan bir kümeleme algoritması geliştirilmiştir.

Makale detayları

A multi-depot vehicle routing problem with time windows for daily planned maintenance and repair service planning

Yazarlar:

Görkem Yılmaz

Yayıncı:

Pamukkale University

Ana Başlıklar:

Algoritmalar ve Hesaplama Kuramı

Dergi:

Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi Vol.29 Issue 8, pp.913-919

Belge Tipi:

Makale

Yayın Tarihi:

12/2023

Belge Dili:

Türkçe

Document ID (Org No.):

2001308560

pISSN:

2147-5881

Multi depot

Vehicle routing problem

Time windowÇoklu depo

Araç rotalama problemi

Zaman penceresi

Sayı

Makale detayları

A multi-depot vehicle routing problem with time windows for daily planned maintenance and repair service planning

Yazarlar: Görkem Yılmaz

Yayıncı: Pamukkale University

Ana Başlıklar: Algoritmalar ve Hesaplama Kuramı

Dergi: Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi Vol.29 Issue 8, pp.913-919

Belge Tipi: Makale

Yayın Tarihi: 12/2023

Belge Dili: Türkçe

Document ID (Org No.): 2001308560

pISSN: 2147-5881

Multi depot

Vehicle routing problem

Time windowÇoklu depo

Araç rotalama problemi

Zaman penceresi

Sayı

Yazarlar:

Görkem Yılmaz

Yayıncı:

Pamukkale University

Ana Başlıklar:

Algoritmalar ve Hesaplama Kuramı

Dergi:

Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi Vol.29 Issue 8, pp.913-919

Belge Tipi:

Makale

Yayın Tarihi:

12/2023

Belge Dili:

Türkçe

Document ID (Org No.):

2001308560

pISSN:

2147-5881