Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Open Access Guideline
Open Access Guideline
Postgraduate Thesis Guideline
Postgraduate Thesis Guideline
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
An adaptive simulated annealing algorithm-based approach for assembly line balancing and a real-life case study
Date
2016-05-01
Author
Guden, H.
Meral, Fatma Sedef
Metadata
Show full item record
This work is licensed under a
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License
.
Item Usage Stats
271
views
0
downloads
Cite This
In this study, we address the deterministic assembly line balancing problem (ALBP) in a multiple product-models environment with multiple objectives. We have been motivated by the assembly line balancing problem of a white goods product production line that is a multi-model type line with 68 stations through which four product-models are assembled, each with approximately 400 precedence relations and 300 tasks. In the plant, to cope with the increasing demand in the medium term, the efficiency of the line is to be improved first before additional lines are added to the capacity in the longer term. Due to the large size of the real ALBP, optimal line balance could not be found out by means of the exact solution methods in reasonable times. Hence, in order to find some satisfactory solutions in relatively shorter computational times for the real-life-sized problems, we propose an adaptive simulated annealing (ASA)-based approach that uses a modified COMSOAL algorithm to construct an initial solution and then two ASA algorithms in succession to improve the solution. The approach has such a flexible structure that it can provide solutions for any type of deterministic ALBP as single, mixedmodel and multi-model ALBPs with several practical constraints like zoning, and consider multiple appropriate objectives such as minimization of cycle time, minimization of the number of stations, maximization of efficiency, and maximization of smoothness over the stations on the line. The simulated annealing algorithms proposed in the approach are adaptive in the sense that they have a novel adaptive mechanism for adjusting their parameters. Our computational experiments with the proposed ASA algorithms on several test problem instances in the literature indicate that they find the optimum solution in most of the instances for the simple ALB problems, both type 1 and 2, as well as the real-life instance considered. The overall approach proposed for the multimodel ALBP is tested for the real-life case problem and found to be satisfactory.
Subject Keywords
Multi-objective
,
Meta-heuristics
,
Adaptive simulated annealing
,
Mixed-model assembly line
,
Mixed-model assembly line
,
Multi-model assembly line
,
Simple assembly line balancing
URI
https://hdl.handle.net/11511/46602
Journal
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
DOI
https://doi.org/10.1007/s00170-015-7802-y
Collections
Department of Industrial Engineering, Article
Suggestions
OpenMETU
Core
AN ADAPTIVE SIMULATED ANNEALING METHOD FOR TYPE-ONE SIMPLE ASSEMBLY LINE BALANCING: A REAL LIFE CASE STUDY
Guden, Huseyin; Meral, Fatma Sedef (2013-12-01)
In this study, real life assembly line balancing problem of a dishwasher producer is addressed. The line considered is a multi-model assembly line and real life problem instance consists of approximately 300 tasks, 400 precedence relations and 70 stations per product model. The number of stations used to meet a specified production rate is desired to be minimized. To do this, a type-one simple assembly line balancing problem instance is considered for each product model. Due to thelarge size of the problem ...
Rebalancing of assembly lines
Sancı, Ece; Azizoğlu, Meral; Department of Industrial Engineering (2015)
In this study, we consider an assembly line rebalancing problem. We assume that there is a disruption on one or more workstations that makes the current solution infeasible. After the disruption, we aim to find a rebalance so as to catch the trade-off between the efficiency measure of cycle time and the stability measure of number of tasks assigned to different workstations in the original and new solutions. We generate all nondominated objective vectors with respect to our efficiency and stability measures...
A branch and bound method for the line balancing problem in U-shaped assembly lines with equipment requirements
Ogan, Dilek; Azizoğlu, Meral (2015-07-01)
In this study we consider a U-shaped assembly line balancing problem where each task uses a specified set of equipments and each type of equipment has a specified cost. Our problem is to assign the tasks together with their equipments to the workstations so as to minimize the total equipment cost. We formulate the problem as a mixed integer linear programming model that is capable of solving small sized instances. We propose a branch and bound algorithm that uses efficient precedence relations and lower bou...
A Two stage approach for hybrid-assembly line design
Şimşek, Doğukan; Kırca, Ömer; Department of Industrial Engineering (2014)
The aim of the study is to propose an approach for hybrid assembly line design in the make-to-order and mixed-model environment. In this context, the main goal is to reduce lead-time, which is one of the key concepts of competitive markets. A systematic approach was employed for designing of hybrid assembly line in order to achieve the goal. The line is divided into two parts in a hybrid system: while the first part of the line works as a closed-loop system for instant replenishment of Constant Work in Prog...
A Methodology for Resolution Mapping for Cross-Resolution Simulation using Event-B
Kara, Ahmet; Oğuztüzün, Mehmet Halit S.; Alpdemir, M. Nedim (2015-11-01)
This paper proposes a software engineering solution for implementing simulations via the composition of models at different resolution levels with the help of formal methods. Our solution provides a systematic methodology that offers a well-defined sequence of stages to obtain executable converters for entity resolution mapping, given the types of entity attributes that are exchanged at model interfaces and the mapping specifications. Our methodology uses Event-B as the formal specification language and Dis...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
H. Guden and F. S. Meral, “An adaptive simulated annealing algorithm-based approach for assembly line balancing and a real-life case study,”
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
, pp. 1539–1559, 2016, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/46602.