SavedAdd your journal

Journals / Dokuz Eylül Üniversitesi Mühendislik Fakültesi Fen ve Mühendislik Dergisi / 2021 / Cilt: 23 - Sayı: 67

A Hybrid Genetic Algorithm for Multi-Compartment Vehicle Routing Problem

Çok Bölmeli Araç Rotalama Problemi için Bir Melez Genetik Algoritma

Kazım ERDOĞDU
Pages
71–80
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

As a result, new benchmark results were obtained for the version of MC-VRP in this study and these results were evaluated.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:In this study, a Multi-Compartment Vehicle Routing Problem (MC-VRP) was studied.
📊
Key Findings & Data:Some wastes, chemical products or fuel types need to be transported in the same vehicle separately.
💡
Conclusion & Impact:As a result, new benchmark results were obtained for the version of MC-VRP in this study and these results were evaluated.
🔬Design:Research Article
📍Scope:Comprehensive Sample
⚙️Variables:Çok Bölmeli Araç Rotalama Problemi · Melez Genetik Algoritma · Sezgisel Arama

Abstract

In this study, a Multi-Compartment Vehicle Routing Problem (MC-VRP) was studied. In daily life, markets, companies and organizations need to load their certain products into different compartments in vehicles during the delivery or collecting of these products. Some of the products need to be carried in cold temperature while others in ambient temperature. Some wastes, chemical products or fuel types need to be transported in the same vehicle separately. Therefore, the transportation fleet must have vehicles with separate compartments and the different products must be either delivered or collected in related compartments of these vehicles. The MC-VRP studied in this paper was taken into consideration with three scenarios of vehicles with one-, two-, or three-compartments. As the solution method, a hybrid Genetic Algorithm (GA) was used and applied on a well-known problem instance set in Vehicle Routing Problem (VRP) literature. As a result, new benchmark results were obtained for the version of MC-VRP in this study and these results were evaluated.

Özet

Bu çalışmada, Çok Bölmeli Araç Rotalama Problemi (ÇB-ARP) ele alınmıştır. Günlük hayatta marketler, firmalar ve kurumlar bazı ürünleri müşterilerine teslim ederken ya da belirli noktalardan toplarken, bu ürünleri araç içinde farklı bölmelere koymaları gerekmektedir. Bazı ürünlerin oda sıcaklığında, bazılarının soğuk olarak taşınması gerekmektedir. Bazı atıkların, kimyasal ürünlerin ya da yakıtların diğer ürünlerle karıştırılmadan taşınması gerekmektedir. Bu yüzden dağıtım ya da toplama yapan araç filosundaki her bir aracın birden fazla bölmeye sahip olması ve dağıtılan ya da toplanan ürünlerin ilgili bölmelerde taşınması gerekmektedir. Bu makalede çalışılan ÇB-ARP, bir, iki ve üç bölmeli araç senaryoları dahilinde ayrı ayrı ele alınmıştır. Çözüm yöntemi olarak melez bir Genetik Algoritma (GA) kullanılmış ve bu algoritma Araç Rotalama Problemi (ARP) literatüründe sıklıkla kullanılan bir problem örnek seti üzerinde uygulanmıştır. Sonuç olarak bu çalışmadaki ÇB-ARP modeli için yeni referans sonuçları üretilmiş ve sonuçlar yorumlanmıştır.

🔖

Cite This Article

ERDOĞDU, K. (2021). A Hybrid Genetic Algorithm for Multi-Compartment Vehicle Routing Problem. Dokuz Eylül Üniversitesi Mühendislik Fakültesi Fen ve Mühendislik Dergisi, Cilt: 23 - Sayı: 67, 71–80. https://ajindex.com/articles/222194

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (1)

  1. N. Christofides, A. Mingozzi, and P. Toth, “The Vehicle Routing Problem,” Rev. française d’automatique, informatique, Rech. opérationnelle. Rech. opérationnelle, vol. 10, 1979, doi: 10.1051/ro/197610V100551. A. El Fallahi, C. Prins, and R. Wolfler Calvo, “A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem,” Comput. Oper. Res., vol. 35, no. 5, pp. 1725–1741, 2008, doi: 10.1016/j.cor.2006.10.006. N. Christofides and S. Eilon, “An Algorithm for the Vehicle-Dispatching Problem,” OR, vol. 20, no. 3, p. 309, 1969, doi: 10.2307/3008733. J. E. Mendoza, B. Castanier, C. Guéret, A. L. Medaglia, and N. Velasco, “A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands,” Comput. Oper. Res., vol. 37, no. 11, pp. 1886–1898, 2010, doi: 10.1016/j.cor.2009.06.015. M. Reed, A. Yiannakou, and R. Evering, “An ant colony algorithm for the multi-compartment vehicle routing problem,” Appl. Soft Comput. J., vol. 15, pp. 169–176, 2014, doi: 10.1016/j.asoc.2013.10.017. J. C. Goodson, “A priori policy evaluation and cyclic-order-based simulated annealing for the multi-compartment vehicle routing problem with stochastic demands,” Eur. J. Oper. Res., vol. 241, no. 2, pp. 361–369, 2015, doi: 10.1016/j.ejor.2014.09.031. M. M. S. Abdulkader, Y. Gajpal, and T. Y. Elmekkawy, “Hybridized ant colony algorithm for the Multi Compartment Vehicle Routing Problem,” Appl. Soft Comput. J., vol. 37, pp. 196–203, 2015, doi: 10.1016/j.asoc.2015.08.020. T. Henke, M. G. Speranza, and G. Wäscher, “The multi-compartment vehicle routing problem with flexible compartment sizes,” Eur. J. Oper. Res., vol. 246, no. 3, pp. 730–743, 2015, doi: 10.1016/j.ejor.2015.05.020. A. Hübner and M. Ostermeier, “A multi-compartment vehicle routing problem with loading and unloading costs,” Transp. Sci., vol. 53, no. 1, pp. 282–300, 2019, doi: 10.1287/trsc.2017.0775. L. Chen, Y. Liu, and A. Langevin, “A multi-compartment vehicle routing problem in cold-chain distribution,” Comput. Oper. Res., vol. 111, pp. 58–66, 2019, doi: 10.1016/j.cor.2019.06.001. J. Chen and J. Shi, “A multi-compartment vehicle routing problem with time windows for urban distribution – A comparison study on particle swarm optimization algorithms,” Comput. Ind. Eng., 2019, doi: 10.1016/j.cie.2019.05.008. M. M. Solomon, “Algorithms for the Vehicle Routing And Scheduling Problems with Time Window Constraints,” Oper. Res., vol. 35, no. 2, pp. 254–265, 1987, doi: 10.1287/opre.35.2.254.