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

Name: A multi-depot vehicle routing problem with time windows for daily planned maintenance and repair service planning
Author: Toru, Elif, Yılmaz, G.

İsim	A multi-depot vehicle routing problem with time windows for daily planned maintenance and repair service planning
Yazar	Toru, Elif, Yılmaz, G.
Basım Tarihi:	2023
Basım Yeri	- Pamukkale Üniversitesi
Konu	Multi depot, Vehicle routing problem, Time window
Tür	Süreli Yayın
Dil	İngilizce
Dijital	Evet
Yazma	Hayır
Kütüphane:	Özyeğin Üniversitesi
Demirbaş Numarası	10.5505/pajes.2023.99569
Kayıt Numarası	63eac4fd-a99b-4585-bfcf-7d5f526de498
Tarih	2023
Örnek Metin	A compressor manufacturer producing in Kocaeli/Dilovasi 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 personnel's 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 company's service planning predicament. To tackle large instances, we formulate a clustering algorithm that yields a proficient solution in a concise duration.
Cilt	29

Kaynağa git Özyeğin Üniversitesi

Aramaya Dön

Özyeğin Üniversitesi

Kaynağa git

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

Yazar Toru, Elif, Yılmaz, G.

Basım Tarihi 2023

Basım Yeri - Pamukkale Üniversitesi

Konu Multi depot, Vehicle routing problem, Time window

Tür Süreli Yayın

Dil İngilizce

Dijital Evet

Yazma Hayır

Kütüphane Özyeğin Üniversitesi

Demirbaş Numarası 10.5505/pajes.2023.99569

Kayıt Numarası 63eac4fd-a99b-4585-bfcf-7d5f526de498

Tarih 2023

Örnek Metin A compressor manufacturer producing in Kocaeli/Dilovasi 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 personnel's 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 company's service planning predicament. To tackle large instances, we formulate a clustering algorithm that yields a proficient solution in a concise duration.

Cilt 29