Next Article in Journal
CFD Investigation of the Effect of the Feed Spacer on Hydrodynamics in Spiral Wound Membrane Modules
Previous Article in Journal
Nanofluid Convective Heat Transfer Enhancement Elliptical Tube inside Circular Tube under Turbulent Flow
Previous Article in Special Issue
Surrogate-Based Optimization Using an Open-Source Framework: The Bulbous Bow Shape Optimization Case
Article Menu
Issue 4 (December) cover image

Export Article

Open AccessArticle

U-Shaped Assembly Line Balancing by Using Differential Evolution Algorithm

1
Industrial Engineering, Department, Faculty of Engineering, Ubon Ratchathani University, Ubon Ratchathani 34190, Thailand
2
Manufacturing Engineering, Department, Faculty of Engineering, Mahasarakham University, Mahasarakham 44150, Thailand
*
Author to whom correspondence should be addressed.
Math. Comput. Appl. 2018, 23(4), 79; https://doi.org/10.3390/mca23040079
Received: 9 November 2018 / Revised: 3 December 2018 / Accepted: 10 December 2018 / Published: 12 December 2018
(This article belongs to the Special Issue Numerical and Evolutionary Optimization)
  |  
PDF [2701 KB, uploaded 13 December 2018]
  |     |  

Abstract

The objective of this research is to develop metaheuristic methods by using the differential evolution (DE) algorithm for solving the U-shaped assembly line balancing problem Type 1 (UALBP-1). The proposed DE algorithm is applied for balancing the lines (manufacturing a single product within a fixed given cycle time), where the aim is to minimize the number of workstations. After establishing the method, the results from previous research studies were compared with the results from this study. For the UALBP, two groups of benchmark problems were used for the experiments: (1) For the medium-sized UALBP (21–45 tasks), it was found that the DE algorithm DE/best/2 to Exponential Crossover 1 produced better solutions when compared to the other metaheuristic methods: it could generate 25 optimal solutions from a total of 25 instances, and the average time used for the calculation was 0.10 seconds/instance; (2) for the large-scale UALBP (75–297 tasks), it was found that the basic DE algorithm and improved differential evolution algorithm generated better solutions, and DE/best/2 to Exponential Crossover 1 generated the optimal solutions and achieved the minimum solution search time when compared to the other metaheuristic methods: it could generate 36 optimal solutions from a total of 62 instances, and the average time used for the calculation was 4.88 seconds/instance. From the comparison of the DE algorithms, it was found that the improved differential evolution algorithm generated optimal solutions with a better solution search time than the search time of the basic differential evolution algorithm. The basic and improved DE algorithm are the effective methods for balancing UALBP-1 when compared to the other metaheuristic methods. View Full-Text
Keywords: U-shaped assembly line balancing; basic differential evolution algorithm; improved differential evolution algorithm; optimal solutions U-shaped assembly line balancing; basic differential evolution algorithm; improved differential evolution algorithm; optimal solutions
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Sresracoo, P.; Kriengkorakot, N.; Kriengkorakot, P.; Chantarasamai, K. U-Shaped Assembly Line Balancing by Using Differential Evolution Algorithm. Math. Comput. Appl. 2018, 23, 79.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Math. Comput. Appl. EISSN 2297-8747 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top