{ "article_id": 1091, "public_id": "e2e95acb-ad05-411e-8b65-c03cf3dbf413", "internal_identifier": null, "source_identifier": "42:96", "status": "published", "type": "research_article", "title": "Kapasite Kısıtlı Araç Rotalama Problemi için Melez Bir Algoritma", "title_secondary": null, "abstract": "Son yıllarda yaşanan ekonomik daralma sonucunda üretim maliyetlerini azaltmak ve kar marjlarını arttırmak firmalar için önemli bir hedef haline gelmiştir. Özellikle lojistik ve dağıtım şirketlerinin operasyonel işlemleri araç rotalama problemi olarak ele alınarak değerlendirilmesi gerekmektedir. Araç rotalama problemi (ARP) kombinasyonel optimizasyon problemlerindendir ve NP-Zor sınıfında yer almaktadır. ARP’nin temel amacı belirli sayıda müşteriye hizmet vermek koşuluyla minimum mesafeli rotaları oluşturmaktır. Problem kapasite, zaman penceresi, mesafe gibi kısıtlar eklenerek farklı türlere ayrılabilmektedir. Kapasite kısıtlı ARP’nde bir rotada yer alan müşteri talepleri toplamının araç kapasitesini aşmaması gerekmektedir. Literatürde problemin çözümünde kesin, sezgisel ve metasezgisel çözüm yöntemleri mevcut olmakla birlikte bu çalışmada kapasite kısıtlı araç rotalama probleminin çözümü için en yakın komşu algoritması, Yapay Arı Koloni (YAK) algoritması ve 2-opt algoritmalarının birlikte kullanıldığı melez bir yapı önerilmiştir. Önerilen algoritmada başlangıç çözümlerinin yarısı rassal diğer yarısı ise en yakın komşu yöntemi ile oluşturulmuştur. Başlangıç çözümlerine uygulanan YAK algoritması ile elde edilen en iyi çözüme 2-opt algoritması uygulanarak tur maliyetleri azaltılmıştır. Önerilen algoritma literatürde halihazırda var olan test problemleri üzerinde denenmiş ve karşılaştırmalı sonuçları elde edilmiştir. Önerilen algoritmanın en iyi çözümlere yakın değerler ürettiği gözlemlenmiştir. Bu çalışmada sunulan çözüm yöntemi literatüre önemli katkılar sağlayabilir ve çok çeşitli kombinasyonel optimizasyon problemlerinin çözümünde kullanılabilir.", "language": "tr", "english_title": "A Hybrid Algorithm for the Capacity-Constrained Vehicle Routing Problem", "english_abstract": "In recent years, due to the economic downturn, reducing production costs and increasing profit margins has become a significant goal for companies. In particular, the operational processes of logistics and distribution companies need to be evaluated as a vehicle routing problem. The vehicle routing problem (VRP) is a combinatorial optimization problem and belongs to the NP-Hard class. The main objective of the VRP is to create routes with minimum distances while serving a certain number of customers. The problem can be divided into different types by adding constraints such as capacity, time window, and distance. In a capacity-constrained VRP, the total number of customer requests on a route must not exceed the vehicle capacity. While exact, heuristic, and metaheuristic solution methods exist in the literature for solving the problem, this study proposes a hybrid structure using the nearest neighbor algorithm, Artificial Bee Colony (ABC) algorithm, and 2-opt algorithms together for solving the capacity-constrained vehicle routing problem. In the proposed algorithm, half of the initial solutions are generated randomly, and the other half using the nearest neighbor method. The tour costs were reduced by applying the 2-opt algorithm to the best solution obtained using the YAK algorithm applied to the initial solutions. The proposed algorithm was tested on existing test problems in the literature, and comparative results were obtained. It was observed that the proposed algorithm produced values ​​close to the best solutions. The solution method presented in this study can make significant contributions to the literature and can be used in solving a wide variety of combinatorial optimization problems.", "doi": null, "doi_url": null, "resource_url": "https://www.set-science.com/a/e2e95acb-ad05-411e-8b65-c03cf3dbf413", "pdf_url": "https://www.set-science.com/a/e2e95acb-ad05-411e-8b65-c03cf3dbf413/pdf", "og_image": "https://www.set-science.com/assets/img/og-card-v2.png", "authors": [ { "public_id": "8a587768-1b5c-4649-be8d-a723512654bd", "given": "Bilal ", "family": "BABAYIGIT  ", "full": "Bilal  BABAYIGIT  ", "literal": null, "orcid": null, "orcid_url": null, "email": "bilalb@erciyes.edu.tr", "corresponding": true, "sequence": "first", "affiliations": [ { "name": "Erciyes Üniversitesi  ", "department": null, "country": null, "country_code": null, "ror": null, "ror_url": null } ] }, { "public_id": "f5698a08-4471-48a1-b94a-d8f9e13a0b7a", "given": "Kadir ", "family": "YILDIZ  ", "full": "Kadir  YILDIZ  ", "literal": null, "orcid": null, "orcid_url": null, "email": "kadiryildizmeb@gmail.com", "corresponding": false, "sequence": "additional", "affiliations": [ { "name": "Erciyes Üniversitesi  ", "department": null, "country": null, "country_code": null, "ror": null, "ror_url": null } ] } ], "keywords": [ "Kombinasyonel Optimizasyon", "Kapasite Kısıtlı Araç Rotalama Problemi", "Yapay Arı Koloni Algoritması", "En Yakın Komşuluk", "2-opt Algoritması" ], "translations": [ { "language": "en", "title": "A Hybrid Algorithm for the Capacity-Constrained Vehicle Routing Problem", "abstract": "In recent years, due to the economic downturn, reducing production costs and increasing profit margins has become a significant goal for companies. In particular, the operational processes of logistics and distribution companies need to be evaluated as a vehicle routing problem. The vehicle routing problem (VRP) is a combinatorial optimization problem and belongs to the NP-Hard class. The main objective of the VRP is to create routes with minimum distances while serving a certain number of customers. The problem can be divided into different types by adding constraints such as capacity, time window, and distance. In a capacity-constrained VRP, the total number of customer requests on a route must not exceed the vehicle capacity. While exact, heuristic, and metaheuristic solution methods exist in the literature for solving the problem, this study proposes a hybrid structure using the nearest neighbor algorithm, Artificial Bee Colony (ABC) algorithm, and 2-opt algorithms together for solving the capacity-constrained vehicle routing problem. In the proposed algorithm, half of the initial solutions are generated randomly, and the other half using the nearest neighbor method. The tour costs were reduced by applying the 2-opt algorithm to the best solution obtained using the YAK algorithm applied to the initial solutions. The proposed algorithm was tested on existing test problems in the literature, and comparative results were obtained. It was observed that the proposed algorithm produced values ​​close to the best solutions. The solution method presented in this study can make significant contributions to the literature and can be used in solving a wide variety of combinatorial optimization problems.", "keywords": [ "Combinatorial Optimization", "Capacitated Vehicle Routing Problem", "Artificial Bee Colony Algorithm", "Nearest Neighbor", "2-opt Algorithm" ] } ], "subjects": [], "subject_names": [], "published_date": "2019-06-01", "published_year": "2019", "received_date": null, "accepted_date": null, "volume": "4", "issue": null, "page_first": "508", "page_last": "513", "article_number": null, "conference": { "short_name": "ISAS2019-ENS", "full_title": "3rd International Symposium on Innovative Approaches in Scientific Studies (Engineering and Natural Sciences)", "name": "3rd International Symposium on Innovative Approaches in Scientific Studies (Engineering and Natural Sciences)", "acronym": "ISAS2019-ENS", "location": "Ankara, Türkiye", "start_date": "2019-04-19", "end_date": null, "public_id": "ed3b36e9-38cf-4aeb-a135-833c969cc89f" }, "proceedings": { "title": "3rd International Symposium on Innovative Approaches in Scientific Studies (Engineering and Natural Sciences)", "series_title": "Setsci conference indexing system", "publisher": "SET Technology", "isbn": null, "eisbn": null, "issn": "2618-6446", "eissn": null, "doi": null, "doi_prefix": null, "slug": "setsci-volume-4-2019-legacy-42", "public_id": "24d215ef-a545-4351-9725-6e9bdb167b3c", "url": "https://www.set-science.com/p/setsci-volume-4-2019-legacy-42" }, "license": { "name": "CC BY 4.0", "url": "https://creativecommons.org/licenses/by/4.0/", "code": "CC-BY-4.0", "open_access": true }, "copyright": { "holder": "SET Technology", "year": "2019" }, "funding_statement": null, "funders": [], "references": [ { "order": 1, "raw": "M. Özcanli, H. Serin, \"Evaluation Of Soybean/Canola/Palm Biodiesel Mixture As An Alternative Diesel Fuel\", Journal of Scientific & Industrıal Research, vol. 70, pp.466-470, 2011.", "doi": null, "title": null, "authors": null, "source": null, "year": null, "volume": null, "pages": null }, { "order": 2, "raw": "G. B. Dantzig, J. M. Ramser, “The truck dispatching problem”, Management Science, vol. 6, pp. 81-91, 1959.", "doi": null, "title": null, "authors": null, "source": null, "year": null, "volume": null, "pages": null }, { "order": 3, "raw": "G. Clarke, J. W. Wright, “Scheduling of vehicles from a central depot to a number of delivery points”, Operations Research, vol. 12, pp. 568- 581, 1964.", "doi": null, "title": null, "authors": null, "source": null, "year": null, "volume": null, "pages": null }, { "order": 4, "raw": "Ç. Alabaş, B. Dengiz, “Yerel Arama Yöntemlerinde Yöre Yapısı: Araç Rotalama Problemine Bir Uygulama”, Yöneylem Araştırması/Endüstri Mühendisliği 24. Ulusal Kongresi, 2010, Gaziantep – Adana, p. 333 – 335.", "doi": null, "title": null, "authors": null, "source": null, "year": null, "volume": null, "pages": null }, { "order": 5, "raw": "M. Türkay, Optimizasyon modelleri ve çözüm metodları. (Web Sayfası: http://home.ku.edu.tr/~mturkay/indr501/Optimizasyon.pdf), (Erişim tarihi: Nisan 2019).", "doi": null, "title": null, "authors": null, "source": null, "year": null, "volume": null, "pages": null }, { "order": 6, "raw": "D. Karaboğa, Yapay Zeka Optimizasyon Algoritmaları. Atlas Yayın Dağıtım, İstanbul, 2004.", "doi": null, "title": null, "authors": null, "source": null, "year": null, "volume": null, "pages": null }, { "order": 7, "raw": "N. L. Biggs, E. K. Llyod, R. J. Wilson, Graph Theory. Clarendon Press, Oxford, UK. 1976.", "doi": null, "title": null, "authors": null, "source": null, "year": null, "volume": null, "pages": null }, { "order": 8, "raw": "R. Matai, S. P. Singh, M. L. Mittal, Traveling Salesman Problem: an Overview of Applications, Formulations, and Solution Approaches. pp. 1-24. In: Traveling Salesman Problem: Theory and Applications (Eds. D. Davendra), Intech Open Access Publisher, 2010.", "doi": null, "title": null, "authors": null, "source": null, "year": null, "volume": null, "pages": null }, { "order": 9, "raw": "B. Gavish, S. C. Graves, “The travelling salesman problem and related problems”, Technical Report OR 078-78, Operations Research Center, Massachusetts Institute of Technology, Cambridge, MA, USA. 1978..", "doi": null, "title": null, "authors": null, "source": null, "year": null, "volume": null, "pages": null }, { "order": 10, "raw": "C. Rego, \"Node-ejection chains for the vehicle routing problem: Sequential and parallel algorithms\", Parallel Computing, vol 27, pp. 201-222, 2001.", "doi": null, "title": null, "authors": null, "source": null, "year": null, "volume": null, "pages": null }, { "order": 11, "raw": "P. Toth, D. Vigo, The Vehicle Routing Problem Society for Industrial and Applied Mathematics, Philadelphia, pp. 367, 2002.", "doi": null, "title": null, "authors": null, "source": null, "year": null, "volume": null, "pages": null }, { "order": 12, "raw": "A. H. El Hassani, A. Koukam, L. Bouhafs, A hybrid ant colony system approach for the capacitated vehicle routing problem and the capacitated vehicle routing problem with time Windows. pp. 57-70. In: Vehicle Routing Problem, (Eds. T. Caric, H. Gold), INTECH Open Access Publisher, Croatia, 2008.", "doi": null, "title": null, "authors": null, "source": null, "year": null, "volume": null, "pages": null }, { "order": 13, "raw": "V. Erol, “Araç Rotalama Problemleri için Popülasyon ve Komşuluk Tabanlı Metasezgisel Bir Algoritmanın Tasarımı ve Uygulaması”, Yıldız Teknik Üniversitesi, Sistem Mühendisliği, Yüksek Lisans Tezi, Sabancı Kütüphanesi, İstanbul,2006.", "doi": null, "title": null, "authors": null, "source": null, "year": null, "volume": null, "pages": null }, { "order": 14, "raw": "C. Blum, A. Roli, “Metaheuristics in Combinatorial Optimization: Overview and Conceptual Comparison”, ACM Computing Surveys, vol. 35, 3, pp. 268-308, 2003.", "doi": null, "title": null, "authors": null, "source": null, "year": null, "volume": null, "pages": null }, { "order": 15, "raw": "D. Koržinek, R. Skoczylas, System for a Stationary Robot that Draws Vector Images Based on Photographic Analysis. Polish-Japanese Academy of Information Technology, Faculty of Multi-Agent Systems and Robotics, Yüksek Lisans Tezi, Warsaw, 2005.", "doi": null, "title": null, "authors": null, "source": null, "year": null, "volume": null, "pages": null }, { "order": 16, "raw": "V. Tereshko, “Reaction-Diffusion Model of a Honey Bee Colony’s Foraging Behaviour”, In: 6th International Conference on Parallel Problem Solving from Nature, Springer-Verlag, London, UK. 2000.", "doi": null, "title": null, "authors": null, "source": null, "year": null, "volume": null, "pages": null }, { "order": 17, "raw": "D. Karaboga, “An idea based on honey bee swarm for numerical optimization.” Technical Report TR06, Erciyes University, Engineering Faculty, Computer Engineering Department. 2005.", "doi": null, "title": null, "authors": null, "source": null, "year": null, "volume": null, "pages": null }, { "order": 18, "raw": "P. Augerat, J. M. Belenguer, E. Benavent, A. Corberán, D. Naddef, G. Rinaldi, Computational results with a branch and cut code for the capacitated vehicle routing problem. Research Report 949-M, Universite Joseph Fourier, Grenoble, France. 1995.", "doi": null, "title": null, "authors": null, "source": null, "year": null, "volume": null, "pages": null }, { "order": 19, "raw": "N. Christofides, S. Eilon, An algorithm for the vehicle-dispatching problem. Operations Research Quaterly, vol.20, pp. 309-318, 1969.", "doi": null, "title": null, "authors": null, "source": null, "year": null, "volume": null, "pages": null }, { "order": 20, "raw": "M. L. Fisher, Optimal solution of vehicle routing problems using minimum K-trees. Operations Research, vol. 42, 4, pp. 626–642, 1994.", "doi": null, "title": null, "authors": null, "source": null, "year": null, "volume": null, "pages": null } ], "statements": { "acknowledgements": null, "conflict_of_interest": null, "data_availability": null, "ai_disclosure": null }, "credit": [], "history": { "published": "2019-06-01" } }