A Mathematical Model for Container Loading Problem with Milkrun Transportation Side Constraints

Tevfik Altınalev; Alpaslan Fığlalı

Article Details

A Mathematical Model for Container Loading Problem with Milkrun Transportation Side Constraints

Authors:

Tevfik Altınalev | Alpaslan Fığlalı

Publisher:

Burdur Mehmet Akif Ersoy University

Main Topics:

Bilgi Modelleme | Yönetim ve Ontolojiler | Karar Desteği ve Grup Destek Sistemleri | Olasılıksal Analiz ve Modelleme | Yöneylem

Journal:

Mehmet Akif Ersoy Üniversitesi Fen Bilimleri Enstitüsü Dergisi Vol.15 Issue 2, pp.81-102

Document Type:

Article

Publication Date:

12/2024

Document Language:

Turkish

Document ID (Org No.):

2001335531

pISSN:

1309-2243

Keywords:

Abstract:

 Container Loading Problem is one of the common problems encountered in logistics under Cutting and Packing Problem category. Particularly, the versions with more side constraints are considered as Non-Deterministic Polynomial-Time NP Hard problem. In this research, an original Container Loading Problem, which finds a solution to the spare-part transportation problem of a company, is modeled and solved. Since the main problem has lots of variables and constraints, the solving time of the problem gets larger. Therefore, the main problem is divided into two parts and tried to be solved sequentially. Whereas the first problem is used for the allocation of the boxes into the containers and the tours of the trucks, the second problem is used for the stowage of the boxes into the used containers. When both problems are solved sequentially, the output of the first problem is provided as the input to the second problem. Finally, the results are benchmarked with the lower bound on the required number of containers. The medium size test problem, built with synthetic data, is solved with the two models sequentially and a feasible near-optimal solution is found in the reasonable time. Keywords: Vehicle Routing Problem, Rectangular Container Loading Problem, Cutting and Packing Problem, Knapsack Problem, Cutting Stock Problem, Milkrun System.

 Container Loading Problem is one of the common problems encountered in logistics under Cutting and Packing Problem category. Particularly, the versions with more side constraints are considered as Non-Deterministic Polynomial-Time NP Hard problem. In this research, an original Container Loading Problem, which finds a solution to the spare-part transportation problem of a company, is modeled and solved. Since the main problem has lots of variables and constraints, the solving time of the problem gets larger. Therefore, the main problem is divided into two parts and tried to be solved sequentially. Whereas the first problem is used for the allocation of the boxes into the containers and the tours of the trucks, the second problem is used for the stowage of the boxes into the used containers. When both problems are solved sequentially, the output of the first problem is provided as the input to the second problem. Finally, the results are benchmarked with the lower bound on the required number of containers. The medium size test problem, built with synthetic data, is solved with the two models sequentially and a feasible near-optimal solution is found in the reasonable time. Keywords: Vehicle Routing Problem, Rectangular Container Loading Problem, Cutting and Packing Problem, Knapsack Problem, Cutting Stock Problem, Milkrun System.

 Container Loading Problem is one of the common problems encountered in logistics under Cutting and Packing Problem category. Particularly, the versions with more side constraints are considered as Non-Deterministic Polynomial-Time NP Hard problem. In this research, an original Container Loading Problem, which finds a solution to the spare-part transportation problem of a company, is modeled and solved. Since the main problem has lots of variables and constraints, the solving time of the problem gets larger. Therefore, the main problem is divided into two parts and tried to be solved sequentially. Whereas the first problem is used for the allocation of the boxes into the containers and the tours of the trucks, the second problem is used for the stowage of the boxes into the used containers. When both problems are solved sequentially, the output of the first problem is provided as the input to the second problem. Finally, the results are benchmarked with the lower bound on the required number of containers. The medium size test problem, built with synthetic data, is solved with the two models sequentially and a feasible near-optimal solution is found in the reasonable time. Keywords: Vehicle Routing Problem, Rectangular Container Loading Problem, Cutting and Packing Problem, Knapsack Problem, Cutting Stock Problem, Milkrun System.

 Konteyner Yükleme Problemi, Kesme ve Paketleme Problemleri altında incelenen ve taşımacılıkta yaygın olarak kullanılan problemlerden biridir. Özellikle fazla sayıda yan kısıtlara sahip versiyonları NP-zor problemler kategorisindedir. Bu çalışmada, bir lojistik firmasının yedek parça taşıma problemini çözen özgün bir Konteyner Yükleme Problemi modellenerek, çözülmüştür. Ana problemin içermiş olduğu değişken ve kısıt sayısı fazla olduğu için çözüm süresi çok uzamaktadır. Bu nedenle ana problem ikiye bölünerek ardışık olarak çözülmeye çalışılmıştır. Birinci problem, konteynerler içerisine konulacak kutuların ayrımını ve kullanılacak tırların turlarını bulurken, ikinci problem, ayrılan kutuların konteynerlerin içerisine yerleşimini sağlamaktadır. İki problem ardışık olarak çözülürken, birinci problemin çıktısı, ikinci probleme girdi olarak verilmektedir. Daha sonra bulunan sonuç, bütün paketlerin yüklenmesi için gerekli olan konteyner sayısının alt sınırıyla karşılaştırılarak sonuçların performans değerlendirilmesi yapılmıştır. Sentetik olarak oluşturulan orta ölçekli test problemi, iki model ile ardışık olarak çözülmüş ve makul bir sürede çözülebilen, en iyi çözüme çok yakın uygun bir çözüm bulunmuştur. Anahtar Kelimeler: Araç Rotalama Problemi, Dikdörtgensel Konteyner Yükleme Problemi, Kesme ve Paketleme Problemi, Sırt Çantası Problemi, Stok Kesme Problemi, Döngüsel Taşıma Sistemi.

Article Details

A Mathematical Model for Container Loading Problem with Milkrun Transportation Side Constraints

Authors:

Tevfik Altınalev | Alpaslan Fığlalı

Publisher:

Burdur Mehmet Akif Ersoy University

Main Topics:

Bilgi Modelleme | Yönetim ve Ontolojiler | Karar Desteği ve Grup Destek Sistemleri | Olasılıksal Analiz ve Modelleme | Yöneylem

Journal:

Mehmet Akif Ersoy Üniversitesi Fen Bilimleri Enstitüsü Dergisi Vol.15 Issue 2, pp.81-102

Document Type:

Article

Publication Date:

12/2024

Document Language:

Turkish

Document ID (Org No.):

2001335531

pISSN:

1309-2243

Vehicle Routing Problem

Rectangular Container Loading Problem

Cutting and Packing Problem

Knapsack Problem

Cutting Stock Problem

Milkrun SystemAraç Rotalama Problemi

Dikdörtgensel Konteyner Yükleme Problemi

Kesme ve Paketleme Problemi

Sırt Çantası Problemi

Stok Kesme Problemi

Döngüsel Taşıma Sistemi

Issues

Article Details

Authors: Tevfik Altınalev | Alpaslan Fığlalı

Publisher: Burdur Mehmet Akif Ersoy University

Main Topics: Bilgi Modelleme | Yönetim ve Ontolojiler | Karar Desteği ve Grup Destek Sistemleri | Olasılıksal Analiz ve Modelleme | Yöneylem

Journal: Mehmet Akif Ersoy Üniversitesi Fen Bilimleri Enstitüsü Dergisi Vol.15 Issue 2, pp.81-102

Document Type: Article

Publication Date: 12/2024

Document Language: Turkish

Document ID (Org No.): 2001335531

pISSN: 1309-2243

Issues

Authors:

Tevfik Altınalev | Alpaslan Fığlalı

Publisher:

Burdur Mehmet Akif Ersoy University

Main Topics:

Bilgi Modelleme | Yönetim ve Ontolojiler | Karar Desteği ve Grup Destek Sistemleri | Olasılıksal Analiz ve Modelleme | Yöneylem

Journal:

Mehmet Akif Ersoy Üniversitesi Fen Bilimleri Enstitüsü Dergisi Vol.15 Issue 2, pp.81-102

Document Type:

Article

Publication Date:

12/2024

Document Language:

Turkish

Document ID (Org No.):

2001335531

pISSN:

1309-2243