SavedAdd your journal

Journals / Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi / 2018 / Cilt: 24 - Sayı: 1

A differential evolution algorithm for simple straight and U-type assembly line balancing problems

Basit düz ve U-tipi montaj hattı dengeleme problemleri için diferansiyel evrim algoritması

Feriştah ÖZÇELİK
Pages
130–140
Publication Date
2018-02-27
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 results show that the proposed approach performs quite effectively.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:An assembly line is a flow-oriented production system in which the productive units performing the operations, referred to as stations, are aligned in a serial manner.
📊
Key Findings & Data:A computational study is conducted by solving a large number of benchmark problems available in the literature to compare the performance of the proposed approach.
💡
Conclusion & Impact:The results show that the proposed approach performs quite effectively.
🔬Design:Modeling & Simulation
📍Scope:Comprehensive Sample
⚙️Variables:Basit montaj hattı dengeleme · U-tipi hatlar · Diferansiyel evrim algoritması

Abstract

An assembly line is a flow-oriented production system in which the productive units performing the operations, referred to as stations, are aligned in a serial manner. Design of efficient assembly lines has considerable importance for the production of high-quantity standardized products. In this paper, a differential evolution algorithm is proposed to solve simple straight and U-type assembly line balancing problems. As a population-based evolutionary algorithm, differential evolution algorithm is seen as an effective method to solve optimization problems in recent years. A computational study is conducted by solving a large number of benchmark problems available in the literature to compare the performance of the proposed approach. The results show that the proposed approach performs quite effectively.

Özet

Montaj hattı, seri olarak birbirine bağlı istasyonlardan oluşan bir akış tipi üretim sistemidir. Montaj hatlarının etkin olarak tasarımı, standart ürünlerin büyük miktarlarda üretiminde oldukça önemlidir. Bu çalışmada, düz ve U-tipi basit montaj hattı dengeleme problemlerinin çözümü için bir diferansiyel evrim algoritması geliştirilmiştir. Popülasyon temelli evrimsel bir algoritma olan diferansiyel evrim algoritması, son yıllarda eniyileme problemlerinin çözümünde etkin olarak kullanılan bir yöntem olarak karşımıza çıkmaktadır. Önerilen algoritmanın çözüm başarısı, literatürde yaygın olarak kullanılan çok sayıda test problemi kullanılarak gerçekleştirilen deneyler ile değerlendirilmiştir. Sonuçlar algoritmanın etkinliğini göstermektedir.

🔖

Cite This Article

ÖZÇELİK, F. (2018). A differential evolution algorithm for simple straight and U-type assembly line balancing problems. Pamukkale Üniversitesi Mühendislik Bilimleri Dergisi, Cilt: 24 - Sayı: 1, 130–140. https://ajindex.com/articles/42413

📄 Full Text PDF Viewer

📄

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

References (19)

  1. Erkut H, Baskak M. Stratejiden Uygulamaya Tesis Tasarımı. İstanbul,
  2. Türkiye, İrfan Yayınevi, 2003. Kara Y. U-Tipi Montaj Hattı Dengeleme Problemleri için Yeni Modeller ve Otomotiv Yan Sanayiinde Bir Uygulama. Doktora Tezi, Selçuk Üniversitesi,
  3. Konya, Türkiye, 2004.
  4. Ajenblit DA, Wainwright RL. “Applying genetic algorithms to the u-shaped assembly line balancing problem”. Proceedings of the 1998 IEEE International Conference on Evolutionary Computation. Anchorage, Alaska, USA, 04-09 May 1998.
  5. Salveson ME. “The assembly line balancing problem”. Journal of Industrial Engineering, 6(3), 18-25. 1955.
  6. Bowman EH. “Assembly line balancing by linear programming”. Operations Research, 8(3), 385-389, 1960.
  7. Klein M. “On assembly line balancing”. Operations Research, 11, 274-281, 1963.
  8. Patterson JH, Albracht JJ. “Assembly-line balancing: Zero-one programming with fibonacci search”. Operations Research, 23(1), 166-172, 1975.
  9. Talbot FB. Patterson JH. “An integer programming algorithm with network cuts for solving the assembly line balancing problem”. Management Science, 30(1), 85-99, 1984.
  10. Jackson JR. “A computing procedure for a line balancing with a precedence matrix”. Management Science, 2, 261-272, 1956.
  11. Held M, Karp RM, Shareshian R. “Assembly line balancing-dynamic programming with precedence constraints”. Operations Research, 11, 442-459, 1963.
  12. Schrage L, Baker KR. “Dynamic programming solution of sequencing problems with precedence constraints”. Operations Research, 26, 444-449. 1978.
  13. Johnson RV. “Assembly line balancing algorithms: Computational comparisons”. International Journal of Production Research, 19, 277-287, 1981.
  14. Liu SB, Ng KM, Ong HL. “Branch-and-bound algorithms for simple assembly line balancing problem”. International Journal of Advanced Manufacturing Technology, 36, 169-177, 2008.
  15. Dar-El EM. “MALB-a heuristic technique for balancing large scale single-model assembly lines”. AIIE Transactions, 5, 343-356, 1973.
  16. Dar-El EM, Rubinovitch Y. “MUST-A multiple solutions technique for balancing single model assembly lines”. Management Science, 25, 1105-1114, 1979.
  17. Baybars I. “An efficient heuristic method for the simple assembly line balancing problem”. International Journal of Production Research, 24, 149-166, 1986.
  18. Tonge FM. “Assembly line balancing using probabilistic combinations of heuristics”. Management Science, 11, 727-735. 1965.
  19. Moodie CL, Young HH. “A heuristic method of assembly line balancing for assumptions of constant or variable work element