Journals / Endüstri Mühendisliği / 2009 / Cilt: 20 - Sayı: 3

Scheduling and routing of trucks for Arçelik's domestic supply chain

Arçelik yurt içi tedarik zinciri için araç sevkiyat ve rotalama sistemi

Pages
22–38
Publication Date
2022-10-18
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

The interface program allows to use both models with ease and without having to rely on technical knowledge.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:In this study, a decision support system is designed to optimally determine the set of routes and shipment schedules to be used for collecting materials from domestic suppliers to be delivered to Arçelik Dishwasher Company.
📊
Key Findings & Data:The system consists of three main components: A mathematical model, a simulation model, and an interface program.
💡
Conclusion & Impact:The interface program allows to use both models with ease and without having to rely on technical knowledge.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

In this study, a decision support system is designed to optimally determine the set of routes and shipment schedules to be used for collecting materials from domestic suppliers to be delivered to Arçelik Dishwasher Company. The system consists of three main components: A mathematical model, a simulation model, and an interface program. In case of minor changes in demands or in the current set of suppliers, the simulation model is used to evaluate solutions that are proposed in response to changes. For major changes, the mathematical model is solved relative to the new situation and a new optimum is obtained. The interface program allows to use both models with ease and without having to rely on technical knowledge.

Özet

Bu çalışmada tedarikçilerden gelen malzemelerin Arçelik Bulaşık Makinesi İşletmesi’ne taşınması için kullanılacak rotaların ve taşıyıcıların hareket çizelgelerinin optimal veya optimale yakın bulunması amacıyla bir karar destek sistemi oluşturulmuştur. Sistem matematiksel model, benzetim modeli ve arayüz olmak üzere üç ana öğeden oluşmaktadır. Tedarikçi kümesinde veya tedarikçi taleplerinde olabilecek olası küçük değişimlere karşı önerilen çözümler benzetim modeli yoluyla hızlı bir şekilde değerlendirilebilmekte, büyük değişimler olduğunda ise matematik model yeniden çözülerek yeni optimal çözüm elde edilmektedir. Arayüz programı, her iki modelin teknik bilgilere sahip olunmasa bile daha kolay kullanılmasını sağlamaktadır.

🔖

Cite This Article

SEZGİN, G., DAŞYÜREK, F., TANSEL, B., KAYA, Ö., ŞAHİNOĞLU, E., EREN, S. (2022). Scheduling and routing of trucks for Arçelik's domestic supply chain. Endüstri Mühendisliği, Cilt: 20 - Sayı: 3, 22–38. https://ajindex.com/articles/501232

📄 Full Text PDF Viewer

📄

PDF görüntüleyici hazırlanıyor...

References (12)

  1. Clarke, G. ve Wright, J. V. 1964. “Scheduling of Vehicles From a Central Depot to a Number of Delivery Points”, Operations Research, 12, 568-581
  2. Dantzig, G.B. ve Ramser, J.H. 1959. “The Truck Dispatching Problem”, Management Science, 6, 80
  3. Desrochers, M., Desrosiers, J. ve Solomon, M. A. 1992. “A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows”, Operations Research, 40, 342-354
  4. Desrochers, M., Lenstra, J.K. ve Savelsbergh, M.W.P. 1990. “A Classification Scheme for Vehicle Routing and Scheduling Problems”, Journal of Operational Research Society, 46, 322-332
  5. Fisher, M.L. 1995. “Vehicle Routing”, Handbook in Operations Research and Management Science 8: Network Routing, North-Holland, Amsterdam. Editörler: Ball, M.O., Magnanti, T.L., Monma, C.L. ve Nemhauser, G.L., Bölüm 1, 1-33
  6. Laporte, G. ve Nobert, Y. 1987. “Exact algorithms for the Vehicle Routing Problem”, Annals of Discrete Mathematics, 31, 147-184
  7. Laporte, G. 1992. “The Vehicle Routing Problem, An Overview of Exact and Approximate Algorithms”, European Journal of Operational Research, 59, 345-358
  8. Miller, C., Tucker, A. ve Zemlin, R. 1960. “Integer Programming Formulation of Travelling Salesman Problems”, Journal of the ACM, 7, 326-329
  9. Repoussis, P.P., Tarantilis, C.D. ve Ioannou, G. 2006. “The Open Vehicle Routing Problem with Time Windows”, Journal of the Operational Research Society, AOR 1/2/06 doi 10.1057/palgrave.jors.2602143
  10. Sariklis, D. ve Powell, S. 2000. “A Heuristic Method for the Open Vehicle Routing Problem”, Journal of the Operational Research Society, 51, 564-573
  11. Tansel, B.Ç. 2009. “Mathematical Programming Models for the Milk-run Problem”, Araştırma Notları, Bilkent Üniversitesi, Endüstri Mühendisliği Bölümü, 06800 Bilkent, Ankara
  12. Toth, P. ve Vigo, D. 1998. “Exact Solution of the Vehicle Routing Problem”, Fleet Management and Logistics, Kluwer, Boston, MA. Editörler: Crainic, T. ve Laporte, G. Bölüm 1, 1-31.