Optimization of In-Plant Logistics Through a New Hybrid Algorithm for the Capacitated Vehicle Routing Problem with Heterogeneous Fleet

Seçil Kulaç; Nevra Kazancı

Makale detayları

Optimization of In-Plant Logistics Through a New Hybrid Algorithm for the Capacitated Vehicle Routing Problem with Heterogeneous Fleet

Yazarlar:

Seçil Kulaç | Nevra Kazancı

Yayıncı:

Sakarya University

Ana Başlıklar:

Industrial Engineering

Dergi:

Sakarya University Journal of Science Vol.28 Issue 6, pp.1242-1260

Belge Tipi:

Makale

Yayın Tarihi:

12/2024

Belge Dili:

İngilizce

Document ID (Org No.):

2001331513

pISSN:

2147-835X

Anahtar kelimeler:

Özet:

 The vehicle routing problem VRP is a crucial group of transportation problems, and traditional capacitated VRP CVRP directly handles external logistics with a homogeneous vehicle fleet. This paper examines the CVRP from an in-plant logistic view with a heterogeneous fleet in an automotive factory. The homogeneous and heterogeneous vehicle fleets are compared to address the factorys actual in-plant logistics issues. Firstly, simulated annealing SA, tabu search TS algorithms and mathematical modeling were utilized. Then, a hybrid approach was proposed, and all suggested meta-heuristic algorithms were evaluated for homogeneous and heterogeneous vehicle fleets. According to the results, the reduction rates using CVRP with the heterogeneous fleet are 17 and 36 for fleet area and distribution costs, respectively. Also, to examine the effect of the hybrid algorithm parameters on the result, traveling distance was calculated for different scenarios, and multiple regression analyses were applied. According to the multiple regression analysis, the hybrid algorithms most affected parameter was the cooling coefficient.

 The vehicle routing problem VRP is a crucial group of transportation problems, and traditional capacitated VRP CVRP directly handles external logistics with a homogeneous vehicle fleet. This paper examines the CVRP from an in-plant logistic view with a heterogeneous fleet in an automotive factory. The homogeneous and heterogeneous vehicle fleets are compared to address the factorys actual in-plant logistics issues. Firstly, simulated annealing SA, tabu search TS algorithms and mathematical modeling were utilized. Then, a hybrid approach was proposed, and all suggested meta-heuristic algorithms were evaluated for homogeneous and heterogeneous vehicle fleets. According to the results, the reduction rates using CVRP with the heterogeneous fleet are 17 and 36 for fleet area and distribution costs, respectively. Also, to examine the effect of the hybrid algorithm parameters on the result, traveling distance was calculated for different scenarios, and multiple regression analyses were applied. According to the multiple regression analysis, the hybrid algorithms most affected parameter was the cooling coefficient.

 The vehicle routing problem VRP is a crucial group of transportation problems, and traditional capacitated VRP CVRP directly handles external logistics with a homogeneous vehicle fleet. This paper examines the CVRP from an in-plant logistic view with a heterogeneous fleet in an automotive factory. The homogeneous and heterogeneous vehicle fleets are compared to address the factorys actual in-plant logistics issues. Firstly, simulated annealing SA, tabu search TS algorithms and mathematical modeling were utilized. Then, a hybrid approach was proposed, and all suggested meta-heuristic algorithms were evaluated for homogeneous and heterogeneous vehicle fleets. According to the results, the reduction rates using CVRP with the heterogeneous fleet are 17 and 36 for fleet area and distribution costs, respectively. Also, to examine the effect of the hybrid algorithm parameters on the result, traveling distance was calculated for different scenarios, and multiple regression analyses were applied. According to the multiple regression analysis, the hybrid algorithms most affected parameter was the cooling coefficient.

 The vehicle routing problem VRP is a crucial group of transportation problems, and traditional capacitated VRP CVRP directly handles external logistics with a homogeneous vehicle fleet. This paper examines the CVRP from an in-plant logistic view with a heterogeneous fleet in an automotive factory. The homogeneous and heterogeneous vehicle fleets are compared to address the factorys actual in-plant logistics issues. Firstly, simulated annealing SA, tabu search TS algorithms and mathematical modeling were utilized. Then, a hybrid approach was proposed, and all suggested meta-heuristic algorithms were evaluated for homogeneous and heterogeneous vehicle fleets. According to the results, the reduction rates using CVRP with the heterogeneous fleet are 17 and 36 for fleet area and distribution costs, respectively. Also, to examine the effect of the hybrid algorithm parameters on the result, traveling distance was calculated for different scenarios, and multiple regression analyses were applied. According to the multiple regression analysis, the hybrid algorithms most affected parameter was the cooling coefficient.

Makale detayları

Optimization of In-Plant Logistics Through a New Hybrid Algorithm for the Capacitated Vehicle Routing Problem with Heterogeneous Fleet

Yazarlar:

Seçil Kulaç | Nevra Kazancı

Yayıncı:

Sakarya University

Ana Başlıklar:

Industrial Engineering

Dergi:

Sakarya University Journal of Science Vol.28 Issue 6, pp.1242-1260

Belge Tipi:

Makale

Yayın Tarihi:

12/2024

Belge Dili:

İngilizce

Document ID (Org No.):

2001331513

pISSN:

2147-835X

Capacitated Vehicle Routing Problem

In-plant Logistics

Simulated Annealing Algorithm

Tabu Search Algorithm

Sayı

Makale detayları

Optimization of In-Plant Logistics Through a New Hybrid Algorithm for the Capacitated Vehicle Routing Problem with Heterogeneous Fleet

Yazarlar: Seçil Kulaç | Nevra Kazancı

Yayıncı: Sakarya University

Ana Başlıklar: Industrial Engineering

Dergi: Sakarya University Journal of Science Vol.28 Issue 6, pp.1242-1260

Belge Tipi: Makale

Yayın Tarihi: 12/2024

Belge Dili: İngilizce

Document ID (Org No.): 2001331513

pISSN: 2147-835X

Capacitated Vehicle Routing Problem

In-plant Logistics

Simulated Annealing Algorithm

Tabu Search Algorithm

Sayı

Yazarlar:

Seçil Kulaç | Nevra Kazancı

Yayıncı:

Sakarya University

Ana Başlıklar:

Industrial Engineering

Dergi:

Sakarya University Journal of Science Vol.28 Issue 6, pp.1242-1260

Belge Tipi:

Makale

Yayın Tarihi:

12/2024

Belge Dili:

İngilizce

Document ID (Org No.):

2001331513

pISSN:

2147-835X