Abstract
Araç rotalama problemi, belli bir müşteri kümesine hizmet sunmak için bir veya birden fazla depodan, bir araç filosu için optimal rotaların bulunması problemidir. Bu çalışmada Kırıkkale’de faaliyet gösteren atık sektöründeki bir toplayıcı isletmenin, müşteri grubunda yer alan sağlık kurumlarından tıbbi atık toplama için aracın kullandıkları en uygun rotanın belirlenmesi ve önerilen rotanın maliyetinin en küçüklenmesi amaçlanmıştır. Problemin çözümde, tamsayılı programlama modeli kullanılmıştır. Söz konusu isletmenin, hizmet ettikleri sağlık kurumlarının konumları, dijital haritada belirlenip birbirleriyle olan uzaklıkları hesaplanmıştır. Daha sonra geliştirilen modelinin önerdiği çözümle aracın izledikleri rotalar bir aylık verilerle karşılaştırılmıştır. Elde edilen sonuçlarla mevcut sistem karşılaştırılmış ve önerilen modelin firmanın bir aylık toplam yol mesafesini % 20.63 oranında iyileştirdiği tespit edilmiştir.
References
- [1] U. Pradhan, „Sustainable solid waste management in a mountain ecosystem”, Darjeeling West Bengal, India, 2008. [2] EPA/US, “Medical Waste Management and Disposal US, Pollution Technology”, Review no 200 Noyas Data Corporation, New Jersey, 1991. [3] M. Borat, “Hastane Atıkları Eğitim El Kitabı”, T.C. Çevre ve Orman Bakanlığı, İzmir İli Çevre Koruma Vakfı, 1991. [4] S. Takacs, A. Tatar, “Trace elements in the environment and in human organs”, Environmental Research, 42, 1987, 312-320. [5] Ç. Bayır, “Ülkemizde tıbbi atık yönetimi, bertaraf edilmesi ve mevcut durumun incelenmesi”, Muğla Üniversitesi Fen Bilimleri Enstitüsü, Yüksek Lisans Tezi, Muğla, 2011. [6] S. Kaçtıoğlu, Ü. Şengül, “Erzurum kenti ambalaj atıklarının geri dönüşümü için tersine lojistik ağı tasarımı ve bir karma tamsayılı programlama modeli”, Atatürk Üniversitesi İktisadi ve İdari Bilimler Dergisi, 24:1, 2010, 89-112. [7] WHO MDI/EIP, “Marketing and Dissemination”, Wastes from Health“, Care Activities, Genova, 2000. [8] A. Rushton, P. Croucher, P. Baker, “Handbook of Logistics and Distribution Management”, 3rd Edition, Kogan Page, Limited, 2006. [9] M. Demircioğlu, “Araç rotalama probleminin sezgisel bir yaklaşım ile çözümlenmesi üzerine bir uygulama”, Çukurova Üniversitesi, Sosyal Bilimler Enstitüsü, Doktora tezi, Adana, 2009. [10] G.B. Dantzig, J.H. Ramser, “The Truck Dispatching Problem”, Management Science, 6, 1959, 80-91. [11] P. Toth, D. Vigo, “The Vehicle Routing Problem”, Siam, Bologna, 2002. [12] G. Clarke, J.W. Wright, “Scheduling of Vehicles from a Central Depot to a Number of Delivery Points”, Operations Research, 12, 1964, 568-581. [13] G. Nagy, S. Salhi, “Heuristic Algorithms for Single and Multiple Depot Vehicle Routing Problems with Pickups and Deliveries”, European Journal of Operational Research, 162, 2003, 126-141. [14] H. Min, “The Multiple Vehicle Routing Problem with Simultaneous Delivery and Pick-Up Points”, Transportation Research Part A, 23:5, 1989, 377-386. [15] F.A.T. Montane, R.D. Galvao, “A Tabu Search Algorithm for the Vehicle Routing Problem with Simultaneous Pick-Up and Delivery Service”, Computers and Operations Research, 33, 2006, 595–619. [16] P. Chen, H. Huang, X. Dong, “An ant colony system based heuristic algorithm for the vehicle routing problem with simultaneous delivery and pickup”, ICIEA 2007: 2007 Second IEEE Conference on Industrial Electronics and Applications, 136-141, 2007. [17] E.E. Zachariadis, C.D. Tarantilis, C.T. Kiranoudis, “Hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service”, Expert System with Applications, 36, 2009, 1070-1081. [18] E.E. Zachariadis, C.D. Tarantilis, C.T. Kiranoudis, “An adaptive memory methodology optimization for the vehicle routing problem with simultaneous pick-ups and deliveries”, European Journal of Operational Research,
Abstract
The vehicle routing problem is a problem which calls for the determination of the optimal routes used by a fleet of vehicles, based at one or more depots, to serve a set of customers.
The aim of this study is to determine the suitable route for the vehicle which serve to healthcare services and to minimize the cost of the recommended route of a collection company, which takes place in medical waste sector in Kırıkkale. In the solution of the problem integer programming mathematical model is used. The locations of healthcare services, that are served by the company, are defined and the distances are calculated in digital map. Subsequently, the monthly data are compared with the routes of the vehicle that are suggested by developed model. The present system is compared with the developed solution and it is observed that the recommended model improved the total monthly travel distance by 20,63%.
References
- [1] U. Pradhan, „Sustainable solid waste management in a mountain ecosystem”, Darjeeling West Bengal, India, 2008. [2] EPA/US, “Medical Waste Management and Disposal US, Pollution Technology”, Review no 200 Noyas Data Corporation, New Jersey, 1991. [3] M. Borat, “Hastane Atıkları Eğitim El Kitabı”, T.C. Çevre ve Orman Bakanlığı, İzmir İli Çevre Koruma Vakfı, 1991. [4] S. Takacs, A. Tatar, “Trace elements in the environment and in human organs”, Environmental Research, 42, 1987, 312-320. [5] Ç. Bayır, “Ülkemizde tıbbi atık yönetimi, bertaraf edilmesi ve mevcut durumun incelenmesi”, Muğla Üniversitesi Fen Bilimleri Enstitüsü, Yüksek Lisans Tezi, Muğla, 2011. [6] S. Kaçtıoğlu, Ü. Şengül, “Erzurum kenti ambalaj atıklarının geri dönüşümü için tersine lojistik ağı tasarımı ve bir karma tamsayılı programlama modeli”, Atatürk Üniversitesi İktisadi ve İdari Bilimler Dergisi, 24:1, 2010, 89-112. [7] WHO MDI/EIP, “Marketing and Dissemination”, Wastes from Health“, Care Activities, Genova, 2000. [8] A. Rushton, P. Croucher, P. Baker, “Handbook of Logistics and Distribution Management”, 3rd Edition, Kogan Page, Limited, 2006. [9] M. Demircioğlu, “Araç rotalama probleminin sezgisel bir yaklaşım ile çözümlenmesi üzerine bir uygulama”, Çukurova Üniversitesi, Sosyal Bilimler Enstitüsü, Doktora tezi, Adana, 2009. [10] G.B. Dantzig, J.H. Ramser, “The Truck Dispatching Problem”, Management Science, 6, 1959, 80-91. [11] P. Toth, D. Vigo, “The Vehicle Routing Problem”, Siam, Bologna, 2002. [12] G. Clarke, J.W. Wright, “Scheduling of Vehicles from a Central Depot to a Number of Delivery Points”, Operations Research, 12, 1964, 568-581. [13] G. Nagy, S. Salhi, “Heuristic Algorithms for Single and Multiple Depot Vehicle Routing Problems with Pickups and Deliveries”, European Journal of Operational Research, 162, 2003, 126-141. [14] H. Min, “The Multiple Vehicle Routing Problem with Simultaneous Delivery and Pick-Up Points”, Transportation Research Part A, 23:5, 1989, 377-386. [15] F.A.T. Montane, R.D. Galvao, “A Tabu Search Algorithm for the Vehicle Routing Problem with Simultaneous Pick-Up and Delivery Service”, Computers and Operations Research, 33, 2006, 595–619. [16] P. Chen, H. Huang, X. Dong, “An ant colony system based heuristic algorithm for the vehicle routing problem with simultaneous delivery and pickup”, ICIEA 2007: 2007 Second IEEE Conference on Industrial Electronics and Applications, 136-141, 2007. [17] E.E. Zachariadis, C.D. Tarantilis, C.T. Kiranoudis, “Hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service”, Expert System with Applications, 36, 2009, 1070-1081. [18] E.E. Zachariadis, C.D. Tarantilis, C.T. Kiranoudis, “An adaptive memory methodology optimization for the vehicle routing problem with simultaneous pick-ups and deliveries”, European Journal of Operational Research,
Details
| Journal Section | Articles |
|---|---|
| Authors | |
| Publication Date | January 15, 2012 |
| Submission Date | October 23, 2017 |
| Published in Issue | Year 2012 Volume: 4 Issue: 1 |
All Rights Reserved. Kırıkkale University, Faculty of Engineering.