A CONSTRUCTION HEURISTICS FOR VEHICLE ROUTING PROBLEM IN FUEL DISTRIBUTION

Öz

One of the well known problems in distribution is the Vehicle Routing Problem (VRP). In this problem, vehicles start their tours from a depot, they visit the customers and finish their tours in the depot again. There are several variants of VRP. Fuel distribution provides a different kind of VRP which is called as Multi Compartment Vehicle Routing Problem (MCVRP). In MCRVP vehicles have compartments and incompatible petroleum products are delivered in different compartments of a vehicle. For both of the problems solution methods can be classified into two categories; route construction heuristics and improvemenet heuristics. While there is a significant literature on VRP regarding these heuristics, the literature on MCVRP is much more limited. The aim of this study is to offer a construction heuristics for a fuel distribution problem in Turkey. The problem has some features such as compartments, visiting customers more than once and tolerance which turns it into a MCVRP problem. Savings Algorithm (SA) and a loading algorithm is integrated to develop a construction heuristics for the problem. Proposed heuristics is tested on test problems and acceptable results obtained when compared with the literature. A real life fuel distribution problem is solved with the propsed heuristics and significant cost reduction has been achieved. The proposed method can be used as a construction method in MCVRP and as a practical solution for real life problems in fuel distribution in Turkey.

Anahtar Kelimeler

• Logistics,fuel distribution,vehicle routing problem

AKARYAKIT DAĞITIMINDA ARAÇ ROTALAMA PROBLEMİ İÇİN BİR BAŞLANGIÇ ÇÖZÜMÜ

Öz

Araç Rotalama Problemi (ARP) dağıtım alanındaki en bilinen problemlerden birisidir. Problemde bir merkez depodan turlarına başlayan araçlar, müşterileri ziyaret edip tekrar depoya dönmektedirler. ARP’nin pek çok çeşidi bulunmaktadır. Akaryakıt dağıtımı da Kompartmanlı Araç Rotalama Problemi (KARP) adı verilen ARP’nin farklı bir versiyonunu sunmaktadır. KARP’de karış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şturma sezgiselleri ve iyileştirme sezgiselleri olmak üzere iki kategoriye ayrılmaktadır. Her iki sezgisel kategorisi ile ilgili ARP ile ilgili geniş bir literatür olmasına rağmen, KARP için literatür sınırlıdır.  Bu çalışmanın amacı Türkiye’de akaryakıt dağıtım problemi için bir başlangıç çözümü önermektir. Problemi KARP haline getiren, her müşteriye birden fazla kez uğrama, kompartıman, tolerans gibi değ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 üzerinde test edilmiş ve literatürle kıyaslandığında kabul edilebilir sonuçlar vermiş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. Önerilen yöntem hem KARP problemlerinde başlangıç çözümü olarak, hem de pratik uygulama olarak Türkiye’de akaryakıt dağıtımında kullanılabilir.

Anahtar Kelimeler

• lojistik,akaryakıt dağıtımı,araç rotalama problemi

Kaynakça

1. 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.
2. Archetti, C., Speranza, M. G., & Hertz, A. (2006). A tabu search algorithm for the split delivery vehicle routing problem, Transportation science, 1, 64-73.
3. 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.
4. 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.
5. 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.
6. 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.
7. 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.
8. 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.

9. 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.
10. Current, J., & Marsh, M. (1993). Multiobjective transportation network design and routing problems: Taxonomy and annotation. European Journal of Operational Research, 65(1), 4-19.
11. Dantzig, G. B., & Ramser, J. H. (1959). The truck dispatching problem. Management science, 6(1), 80-91.
12. 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.
13. 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.
14. 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.
15. Gıllet, B. E. ve L. R. Mıller, 1974, “A Heuristic algorithm for the vehicle dispatch problem”, Operations Research, 22, 340-349.
16. Henke, T. (2018). Multi-compartment vehicle routing problems in the context of glass waste collection.
17. 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.
18. 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.
19. Reed, M., Yiannakou, A., & Evering, R. (2014). An ant colony algorithm for the multi-compartment vehicle routing problem. Applied Soft Computing, 15, 169-176.
20. Ronen, D. (1995). Dispatching petroleum products. Operations Research, 43(3), 379-387.
21. 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.
22. Pichpibul, T., Kawtummachai, R. (2012). An improved Clarke and Wright savings algorithm for the capacitated vehicle routing problem. ScienceAsia, 38(3), 307-318.
23. Toth, P., & Vigo, D. (Eds.). (2002). The vehicle routing problem. Society for Industrial and Applied Mathematics.
24. Uzar, M. F., Çatay, B. (2012). Distribution planning of bulk lubricants at BP Turkey. Omega, 40(6), 870-881.
25. http://neo.lcc.uma.es/radiaeb/WebVRP/index.html?/Problem_Instances/instances.html