TY  - JOUR
T1  - AKARYAKIT DAĞITIMINDA ARAÇ ROTALAMA PROBLEMİ İÇİN BİR BAŞLANGIÇ ÇÖZÜMÜ
TT  - A CONSTRUCTION HEURISTICS FOR VEHICLE ROUTING PROBLEM IN FUEL DISTRIBUTION
AU  - Çetin, Onur
AU  - Özçakar, Necdet
PY  - 2019
DA  - December
DO  - 10.26468/trakyasobed.470669
JF  - Trakya Üniversitesi Sosyal Bilimler Dergisi
JO  - Trakya Üniversitesi Sosyal Bilimler Dergisi
PB  - Trakya University
WT  - DergiPark
SN  - 1305-7766
SP  - 461
EP  - 474
VL  - 21
IS  - 2
LA  - tr
AB  - Araç Rotalama Problemi (ARP) dağıtım alanındaki enbilinen problemlerden birisidir. Problemde bir merkez depodan turlarınabaşlayan araçlar, müşterileri ziyaret edip tekrar depoya dönmektedirler. ARP’ninpek çok çeşidi bulunmaktadır. Akaryakıt dağıtımı da Kompartmanlı Araç RotalamaProblemi (KARP) adı verilen ARP’nin farklı bir versiyonunu sunmaktadır. KARP’dekarışmaması gereken akaryakıt ürünleri farklı kompartımanlarda taşınmaktadır.ARP’de olduğu gibi KARP için çözüm yöntemleri de genelde rota oluşturmasezgiselleri ve iyileştirme sezgiselleri olmak üzere iki kategoriyeayrılmaktadır. Her iki sezgisel kategorisi ile ilgili ARP ile ilgili geniş birliteratür olmasına rağmen, KARP için literatür sınırlıdır. Bu çalışmanın amacı Türkiye’de akaryakıtdağıtım problemi için bir başlangıç çözümü önermektir. Problemi KARP halinegetiren, her müşteriye birden fazla kez uğrama, kompartıman, tolerans gibideğişkenler bulunmaktadır. Tasarruf Algoritması (TA) bir yükleme algoritmasıile entegre edilerek problem için bir başlangıç çözümü önerilmiştir. Önerilen yöntem test problemleri üzerindetest edilmiş ve literatürle kıyaslandığında kabul edilebilir sonuçlarvermiştir. Önerilen yöntemle gerçek hayat akaryakıt dağıtım problemiçözülmüştür ve önemli maliyet iyileştirmesi gerçekleştirilmiştir. Önerilenyöntem hem KARP problemlerinde başlangıç çözümü olarak, hem de pratik uygulamaolarak Türkiye’de akaryakıt dağıtımında kullanılabilir.
KW  - lojistik
KW  - akaryakıt dağıtımı
KW  - araç rotalama problemi
N2  - Oneof the well known problems in distribution is the Vehicle Routing Problem(VRP). In this problem, vehicles start their tours from a depot, they visit thecustomers and finish their tours in the depot again. There are several variantsof VRP. Fuel distributionprovides a different kind of VRP which is called as Multi Compartment VehicleRouting Problem (MCVRP). In MCRVP vehicles have compartments and incompatiblepetroleum products are delivered in different compartments of a vehicle. Forboth of the problems solution methods can be classified into two categories;route construction heuristics and improvemenet heuristics. While there is asignificant literature on VRP regarding these heuristics, the literature onMCVRP is much more limited. The aim of this study is to offer a constructionheuristics for a fuel distribution problem in Turkey. The problem has somefeatures such as compartments, visiting customers more than once and tolerancewhich turns it into a MCVRP problem. Savings Algorithm (SA) and a loadingalgorithm is integrated to develop a construction heuristics for the problem.Proposed heuristics is tested on test problems and acceptable results obtainedwhen compared with the literature. A real life fuel distribution problem issolved with the propsed heuristics and significant cost reduction has beenachieved. The proposed method can be used as a construction method in MCVRP andas a practical solution for real life problems in fuel distribution in Turkey.
CR  - Abdelaziz, F. B., Roucairol, C., & Bacha, C. (2002). Deliveries of liquid fuels to SNDP gas stations using vehicles with multiple compartments, In Systems, Man and Cybernetics, 2002 IEEE International Conference,1, 478-483.
CR  - Archetti, C., Speranza, M. G., & Hertz, A. (2006). A tabu search algorithm for the split delivery vehicle routing problem, Transportation science, 1, 64-73.
CR  - Avella, P., Boccia, M., & Sforza, A. (2004). Solving a fuel delivery problem by heuristic and exact approaches, European Journal of Operational Research, 152, 170-179.
CR  - Breedam, V. A. (2002). A parametric analysis of heuristics for the vehicle routing problem with side-constraints. European Journal of Operational Research, 137, 348-370.
CR  - Brown, G. G., Ellis, C. J., Graves, G. W., & Ronen, D. (1987). Real-time, wide area dispatch of mobil tank trucks. Interfaces, 17, 107-120.
CR  - Clarke, G., & Wright, J. W. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations research, 12(1), 568-581.
CR  - Cordeau, J. F., Gendreau, M., Laporte, G., Potvin, J. Y., & Semet, F. (2002). A guide to vehicle routing heuristics, Journal of the Operational Research society, 53(5), 512-522.
CR  - Cornillier, F., Boctor, F. F., Laporte, G., & Renaud, J. (2008a). A heuristic for the multi-period petrol station replenishment problem. European Journal of Operational Research, 191(2), 295-305.
CR  - Cornillier, F., Boctor, F. F., Laporte, G., & Renaud, J. (2008b). An exact algorithm for the petrol station replenishment problem,  Journal of the Operational Research Society, 59(5), 607-615.
CR  - Current, J., & Marsh, M. (1993). Multiobjective transportation network design and routing problems: Taxonomy and annotation. European Journal of Operational Research, 65(1), 4-19.
CR  - Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management science, 6(1), 80-91.
CR  - Deng, X., Liang, J., Che, L., Zhang, L., & Sun, R. (2018). Optimization of multi-compartment vehicle routing problem in delivery mode. In Proceedings of the Fifth International Forum on Decision Sciences (pp. 11-22). Springer, Singapore.
CR  - Derigs, U., Gottlieb, J., Kalkoff, J., Piesche, M., Rothlauf, F., & Vogel, U. (2011). Vehicle routing with compartments: applications, modelling and heuristics. OR spectrum, 33(4), 885-914.
CR  - Fallahi, A., Prins, C., & Calvo, R. W. (2008). A memetic algorithm and a tabu search for the multi-compartment vehicle routing problem. Computers & Operations Research, 35(5), 1725-1741.
CR  - Gıllet, B. E. ve L. R. Mıller, 1974, “A Heuristic algorithm for the vehicle dispatch problem”, Operations Research, 22, 340-349.
CR  - Henke, T. (2018). Multi-compartment vehicle routing problems in the context of glass waste collection.
CR  - Mendoza, J. E., Castanier, B., Guéret, C., Medaglia, A. L., & Velasco, N. (2010). A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands. Computers & Operations Research, 37(11), 1886-1898.
CR  - Muyldermans, L., & Pang, G. (2010). On the benefits of co-collection: experiments with a multi-compartment vehicle routing algorithm. European Journal of Operational Research, 206(1), 93-103.
CR  - Reed, M., Yiannakou, A., & Evering, R. (2014). An ant colony algorithm for the multi-compartment vehicle routing problem. Applied Soft Computing, 15, 169-176.
CR  - Ronen, D. (1995). Dispatching petroleum products. Operations Research, 43(3), 379-387.
CR  - Pena, T. Pinto and M. Sameiro Carvalho (2017). A constructive heuristic for the multi-compartment vehicle routing problem: an approach for a fuel distribution company, CIE47 Proceedings, 11-13 October 2017, Lisbon.
CR  - Pichpibul, T., Kawtummachai, R. (2012). An improved Clarke and Wright savings algorithm for the capacitated vehicle routing problem. ScienceAsia, 38(3), 307-318.
CR  - Toth, P., & Vigo, D. (Eds.). (2002). The vehicle routing problem. Society for Industrial and Applied Mathematics.
CR  - Uzar, M. F.,  Çatay, B. (2012). Distribution planning of bulk lubricants at BP Turkey. Omega, 40(6), 870-881.
CR  - http://neo.lcc.uma.es/radiaeb/WebVRP/index.html?/Problem_Instances/instances.html
UR  - https://doi.org/10.26468/trakyasobed.470669
L1  - https://dergipark.org.tr/en/download/article-file/880337
ER  -