Web Service-Based Two-Dimensional Vehicle Pallet Loading with Routing for a Real-World Problem

Since increasing oil prices and vehicle costs increase transportation costs in order delivery systems, the optimal vehicle loading and routing is very crucial for the companies in competitive conditions. Although there are many studies related to optimal vehicle loading and routing by using linear programming and heuristic algorithms, there is not enough practical web service-based application in the literature. In this study, we propose a hybrid model to solve the problem of two-dimensional vehicle pallet loading with routing for a real-world data by combining Knapsack Problem solver algorithms such as MaxRects, Skyline and Guillotine with Dijkstra's algorithm for loading and routing respectively as a web service-based application. © 2022 IEEE.

Süresiz Ambargo
Görüntülenme
158
27.02.2023 tarihinden bu yana
İndirme
1
27.02.2023 tarihinden bu yana
Son Erişim Tarihi
02 Eylül 2024 05:23
Google Kontrol
Tıklayınız
Tam Metin
Süresiz Ambargo
Detaylı Görünüm
Eser Adı
(dc.title)
Web Service-Based Two-Dimensional Vehicle Pallet Loading with Routing for a Real-World Problem
Yazar
(dc.contributor.author)
Metin Zontul
Yayın Yılı
(dc.date.issued)
2022
Yayıncı
(dc.publisher)
Conference Proceedings
Tür
(dc.type)
Bildiri
Açık Erişim Tarihi
(dc.date.available)
2022-01-01
Özet
(dc.description.abstract)
Since increasing oil prices and vehicle costs increase transportation costs in order delivery systems, the optimal vehicle loading and routing is very crucial for the companies in competitive conditions. Although there are many studies related to optimal vehicle loading and routing by using linear programming and heuristic algorithms, there is not enough practical web service-based application in the literature. In this study, we propose a hybrid model to solve the problem of two-dimensional vehicle pallet loading with routing for a real-world data by combining Knapsack Problem solver algorithms such as MaxRects, Skyline and Guillotine with Dijkstra's algorithm for loading and routing respectively as a web service-based application. © 2022 IEEE.
DOI
(dc.identifier.doi)
10.1109/ICTACSE50438.2022.10009852
ISBN
(dc.identifier.isbn)
979-8-3503-3162-2
Orcid
(dc.identifier.orcid)
0000-0002-7557-2981
Dil
(dc.language.iso)
En
ISSN
(dc.identifier.issn)
979-835033162-2
Konu Başlıkları
(dc.subject)
knapsack problem
Konu Başlıkları
(dc.subject)
optimal vehicle loading
Konu Başlıkları
(dc.subject)
optimal vehicle routing
Konu Başlıkları
(dc.subject)
Python Flask Framework
Konu Başlıkları
(dc.subject)
web service-based application
Dergi
(dc.relation.journal)
2022 Internatıonal Conference On Theoretıcal And Applıed Computer Scıence And Engıneerıng (Ictasce)
Esere Katkı Sağlayan
(dc.contributor.other)
Zontul, Metin
Esere Katkı Sağlayan
(dc.contributor.other)
Nacakli, Ilker
Esere Katkı Sağlayan
(dc.contributor.other)
Guzel, Sadi
Department
(dc.contributor.department)
Bilgisayar Mühendisliği
wosauthorid
(dc.contributor.wosauthorid)
EIV-4571-2022
Wos No
(dc.identifier.wos)
WOS:000932842500027
Bitiş Sayfası
(dc.identifier.endpage)
156
Başlangıç Sayfası
(dc.identifier.startpage)
153
Veritabanları
(dc.source.platform)
Wos
Veritabanları
(dc.source.platform)
Scopus
Analizler
Yayın Görüntülenme
Yayın Görüntülenme
Erişilen ülkeler
Erişilen şehirler
6698 sayılı Kişisel Verilerin Korunması Kanunu kapsamında yükümlülüklerimiz ve çerez politikamız hakkında bilgi sahibi olmak için alttaki bağlantıyı kullanabilirsiniz.
Tamam

creativecommons
Bu site altında yer alan tüm kaynaklar Creative Commons Alıntı-GayriTicari-Türetilemez 4.0 Uluslararası Lisansı ile lisanslanmıştır.
Platforms