Süt Sevkiyat Problemi için Matematiksel Modeller
Loading...
Date
2021
Authors
Sinem Özkan
Damla Kizilay
Hande Öztop
DAMLA YÜKSEL
Journal Title
Journal ISSN
Volume Title
Publisher
Open Access Color
GOLD
Green Open Access
No
OpenAIRE Downloads
OpenAIRE Views
Publicly Funded
No
BIP! Indicators
Impulse
Average
Influence
Average
Popularity
Average
Abstract
Bu çalışma küçük ölçekli bir dağıtım şirketi için şişelenmiş süt sevkiyat problemini ele almaktadır. Şişelenmiş süt sevkiyat problemi ile birçok gerçek\rhayat uygulamasında karşılaşabilmektedir. Sosyal sorumluluk projesi kapsamında şirketler ve belediyeler dahil olmak üzere birçok organizasyon \rçocuklar için ilkokullara ve yoksul ailelere ücretsiz olarak süt dağıtmaktadır. Bu şirketler genellikle belli bir kapasiteye sahip araçlar kullanarak ve\rmüşterilerin (okullar ve aileler) uygun oldukları saat aralıklarını dikkate alarak dağıtım yapmaktadır. Planlama sürecinde genellikle akaryakıt ve\rdepolama maliyetleri gibi masraflar en aza indirilmek istenmektedir. Bu kısıtlar altında problemin teslim zaman aralığı ve araç kapasitesi kısıtlı\raraç rotalama problemi (CVRPTW) olduğu ortaya çıkmaktadır. Temel hedeflerden biri araçların yakıt tüketimini azaltmak için araç türünü dikkate\ralarak toplam seyahat mesafesini en aza indirmektir. Diğer bir amaç ise zamanında teslim edilemeyen sütlerin depolama maliyetini azaltmak için \rmüşterilere uygun zaman aralıklarına göre hizmet vermek ve geç ürün teslimlerini azaltmaktır. Bu hedeflere ulaşmak amacıyla probleme özgü\rkarmaşık tam sayılı doğrusal programlama (MILP) ve kısıt programlama (CP) modelleri geliştirilmiştir. Matematiksel modelleri doğrulamak ve\rkarşılaştırmak için literatürde oldukça bilinen veri setleri üzerinde probleme özgü parametreler dikkate alınarak bazı değişiklikler yapılmıştır. Detaylı\ranalizlere ve sonuçlara göre her iki modelin de çalışılan problem için oldukça rekabetçi olduğu gözlemlenmiştir. Ancak uzun planlama vadesine\rsahip veri örnekleri için MILP modelinin CP modelinden çözüm kalitesi ve çözüm süresi açısından daha iyi performans gösterdiği görülmüştür.
Description
Keywords
Bilgisayar Bilimleri- Yazılım Mühendisliği-İşletme-Kamu Yönetimi-Taşınım Bilimi ve Teknolojisi, Bilgisayar Bilimleri, Yazılım Mühendisliği, İşletme, Kamu Yönetimi, Taşınım Bilimi Ve Teknolojisi, Milk Dispatching Problem;Capacitated Vehicle Routing Problem with Time Windows;Mixed Integer Linear Programming Model;Constraint Programming Model, milk dispatching problem, Spor Hekimliği, mixed integer linear programming model, constraint programming model, Sports Medicine, Transportation and communications, capacitated vehicle routing problem with time windows, HE1-9990
Fields of Science
Citation
Amorim P. Parragh S. N. Sperandio F. & Almada-Lobo B. (2014). A rich vehicle routing problem dealing with perishable food: A case study. TOP 22(2) 489–508. https://doi.org/10.1007/s11750-012-0266-4Bae H. & Moon I. (2016). Multi-depot vehicle routing problem with time windows considering delivery and installation vehicles. Applied Mathematical Modelling 40(13–14) 6536–6549. https://doi.org/10.1016/j. apm.2016.01.059Booth K. E. C. & Beck J. C. (2019). A Constraint Programming Approach to Electric Vehicle Routing with Time Windows. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11494 LNCS pp. 129–145). Springer Verlag. https://doi.org/10.1007/978-3-030-19212-9_9Braekers K. Ramaekers K. & Van Nieuwenhuyse I. (2016 September 1). The vehicle routing problem: State of the art classification and review. Computers and Industrial Engineering. Elsevier Ltd. https:// doi.org/10.1016/j.cie.2015.12.007Butler M. Herlihy P. & Keenan P. B. (2005). Integrating information technology and operational research in the management of milk collection. Journal of Food Engineering 70(3) 341–349. https://doi. org/10.1016/j.jfoodeng.2004.02.046Caramia M. & Guerriero F. (2010). A milk collection problem with incompatibility constraints. Interfaces 40(2) 130–143. https://doi.org/10.1287/inte.1090.0475Claassen G. D. H. & Hendriks T. H. B. (2007). An application of Special Ordered Sets to a periodic milk collection problem. European Journal of Operational Research 180(2) 754–769. https://doi. org/10.1016/j.ejor.2006.03.042De Backer B. Furnon V. Shaw P. Kilby P. & Prosser P. (2000). Solving vehicle routing problems using constraint programming and metaheuristics. Journal of Heuristics 6(4) 501–523. https://doi. org/10.1023/A:1009621410177El-Sherbeny N. A. (2010). Vehicle routing with time windows: An overview of exact heuristic and metaheuristic methods. Journal of King Saud University - Science 22(3) 123–131. https://doi. org/10.1016/j.jksus.2010.03.002Fatih Demiral M. (2013a). Bulanık Doğrusal Programlama ile Süt Endüstrisinde Bir Uygulama - A Case Study at Dairy Industry with Fuzzy Linear Programming. Süleyman Demirel Üniversitesi İktisadi ve İdari Bilimler Fakültesi Dergisi 18(2) 373–397.Fatih Demiral M. (2013b). Süt Endüstrisinde Optimizasyon İmkanları ve Bir Model Önerisi - Optimization Opportunities At Dairy Industry And A Model Proposal. Mehmet Akif Ersoy Üniversitesi Sosyal Bilimler Enstitüsü Dergisi 5(8) 36–57. https://doi.org/10.20875/sb.18524Gong W. & Fu Z. (2010). ABC-ACO for perishable food vehicle routing problem with time windows. In Proceedings - 2010 International Conference on Computational and Information Sciences ICCIS 2010 (pp. 1261–1264). https://doi.org/10.1109/ICCIS.2010.311Guimarans D. Herrero R. Ramos J. J. & Padrón S. (2011). Solving Vehicle Routing Problems Using Constraint Programming and Lagrangean Relaxation in a Metaheuristics Framework. International Journal of Information Systems and Supply Chain Management (IJISSCM) 4(2) 61–81.Hà M. H. Nguyen T. D. Nguyen Duy T. Pham H. G. Do T. & Rousseau L. M. (2020). A new constraint programming model and a linear programming-based adaptive large neighborhood search for the vehicle routing problem with synchronization constraints. Computers and Operations Research 124 105085. https://doi.org/10.1016/j.cor.2020.105085Hentenryck P. Van. (1999). The OPL Optimization Programming Language. MIT Press Cambridge MA USA.Hentenryck P. Van. (2002). Constraint and Integer Programming in OPL. Informs Journal on Computing 14(4) 345–372. https://doi.org/10.1287/ijoc.14.4.345.2826Hojabri H. Gendreau M. Potvin J.-Y. & Rousseau L.-M. (2018). Large neighborhood search with constraint programming for a vehicle routing problem with synchronization constraints. Computers and Operations Research 92 87–97. https://doi.org/10.1016/j.cor.2017.11.011Johnson D. S. & Garey R. M. (1979). A Guide to the Theory of NP-Completeness. Computers and Intractability.Kumar S. N. & Panneerselvam R. (2012). A Survey on the Vehicle Routing Problem and Its Variants. Intelligent Information Management 04(03) 66–74. https://doi.org/10.4236/iim.2012.43010Lahrichi N. Crainic T. G. Gendreau M. Rei W. & Rousseau L. M. (2015). Strategic analysis of the dairy transportation problem. Journal of the Operational Research Society 66(1) 44–56. https://doi. org/10.1057/jors.2013.147Li J. qing Han Y. qi Duan P. yong Han Y. yan Niu B. Li C. dong … Liu Y. ping. (2020). Meta-heuristic algorithm for solving vehicle routing problems with time windows and synchronized visit constraints in prefabricated systems. Journal of Cleaner Production 250 119464. https://doi.org/10.1016/j.jclepro.2019.119464Masson R. Lahrichi N. & Rousseau L. M. (2016). A two-stage solution method for the annual dairy transportation problem. European Journal of Operational Research 251(1) 36–43. https://doi. org/10.1016/j.ejor.2015.10.058Nalepa J. & Blocho M. (2016). Adaptive memetic algorithm for minimizing distance in the vehicle routing problem with time windows. Soft Computing 20(6) 2309–2327. https://doi.org/10.1007/s00500-015-1642-4Öztop H. Kizilay D. & Çil Z. A. (2020). Mathematical models for the periodic vehicle routing problem with time windows and time spread constraints. International Journal of Optimization and Control: Theories and Applications 11(1) 10–23. https://doi.org/10.11121/IJOCTA.01.2021.00899Paredes-Belmar G. Lüer-Villagra A. Marianov V. Cortés C. E. & Bronfman A. (2017). The milk collection problem with blending and collection points. Computers and Electronics in Agriculture 134 109–123. https://doi.org/10.1016/j.compag.2017.01.015Paredes-Belmar G. Marianov V. Bronfman A. Obreque C. & Lüer-Villagra A. (2016). A milk collection problem with blending. Transportation Research Part E: Logistics and Transportation Review 94 26–43. https://doi.org/10.1016/j.tre.2016.07.006Paredes-Belmar G. Montero E. & Leonardini O. (2021). A milk transportation problem with milk collection centers and vehicle routing. ISA Transactions. https://doi.org/10.1016/j.isatra.2021.04.020Privé J. Renaud J. Boctor F. & Laporte G. (2006). Solving a vehicle-routing problem arising in soft-drink distribution. Journal of the Operational Research Society 57(9) 1045–1052. https://doi.org/10.1057/ palgrave.jors.2602087Rossi F. Van Beek P. & Walsh T. (2006). Handbook of Constraint Programming (Foundations of Artificial Intelligence). USA: Elsevier Science Inc.Sethanan K. & Pitakaso R. (2016). Differential evolution algorithms for scheduling raw milk transportation. Computers and Electronics in Agriculture 121 245–259. https://doi.org/10.1016/j.compag.2015.12.021Sitek P. Wikarek J. Rutczyńska-Wdowiak K. Bocewicz G. & Banaszak Z. (2021). Optimization of capacitated vehicle routing problem with alternative delivery pick-up and time windows: A modified hybrid approach. Neurocomputing 423 670–678. https://doi.org/10.1016/j.neucom.2020.02.126Sitek Pawel & Wikarek J. (2019). Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach. Annals of Operations Research 273(1– 2) 257–277. https://doi.org/10.1007/s10479-017-2722-xSolomon M. M. (1987). Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints. Operations Research 35(2) 254–265. https://doi.org/10.1287/opre.35.2.254Tarantilis C. D. & Kiranoudis C. T. (2001). A meta-heuristic algorithm for the efficient distribution of perishable foods. Journal of Food Engineering 50(1) 1–9. https://doi.org/10.1016/S0260-8774(00)00187-4Tebaldi L. Murino T. & Bottani E. (2020). An adapted version of the water wave optimization algorithm for the capacitated vehicle routing problem with time windows with application to a real case using probe data. Sustainability (Switzerland) 12(9) 3666. https://doi.org/10.3390/su12093666
WoS Q
Scopus Q
OpenCitations Citation Count
2
Source
Journal of Transportation and Logistics
Volume
6
Issue
2
Start Page
217
End Page
235
Collections
PlumX Metrics
Citations
CrossRef : 2
Captures
Mendeley Readers : 3
Google Scholar™
