Simulated annealing and artificial immune system algorithms for cell formation with part family clustering

نویسندگان

  • Iraj Mahdavi Mazandaran University of Science and Technology, Department of Industrial Engineering, Babol, Iran.
  • Mahdi Saadat Mazandaran University of Science and Technology, Department of Industrial Engineering, Babol, Iran.
  • Mohammad Mahdi Paydar Babol Noshirvani University of Technology, Department of Industrial Engineering, Babol, Iran.
  • Sara Firouzian Mazandaran University of Science and Technology, Department of Industrial Engineering, Babol, Iran.
چکیده مقاله:

Cell formation problem (CFP) is one of the main problems in cellular manufacturing systems. Minimizing exceptional elements and voids is one of the common objectives in the CFP. The purpose of the present study is to propose a new model for cellular manufacturing systems to group parts and machines in dedicated cells using a part-machine incidence matrix to minimize the voids. After identifying the exceptional elements, the machines required for processing the remained operations of corresponding parts which are not processed in the dedicated cells are specified. This results in a new matrix called part family-machine. Then, by clustering the part family-machine incidence matrix, the part families that should be assigned to a specific cell to achieve the highest similarity can be determined. The similarity can be translated to sharing machines required for completing the processes and form new cells called shared cells to minimize the number of exceptional elements and voids. Unlike previous models in which the similarity is considered only in the dedicated cells, in the proposed model, the similarity would be monitored and observed in the entire production process. Due to the complexity of our model, two meta-heuristic algorithms including artificial immune system (AIS) and simulated annealing (SA) are proposed. The efficiency of the algorithms is compared to that of exact solutions. Also, the algorithms are compared regarding the quality of solutions. Finally, according to grouping efficacy measure, SA algorithm has a superior performance in comparison with AIS by spending less CPU time.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hybrid artificial immune system and simulated annealing algorithms for solving hybrid JIT flow shop with parallel batches and machine eligibility

This research deals with a hybrid flow shop scheduling problem with parallel batching, machine eligibility, unrelated parallel machine, and different release dates to minimize the sum of the total weighted earliness and tardiness (ET) penalties. In parallel batching situation, it is supposed that number of machine in some stages are able to perform a certain number of jobs simultaneously. First...

متن کامل

System Identification and Linearisation Using Genetic Algorithms with Simulated Annealing

This paper develops high performance system identification and linearisation techniques, using a genetic algorithm. The algorithm is fine tuned by simulated annealing, which yields a faster convergence and a more accurate search. This global search technique is used to identify the parameters of a system described by an ARMAX model in the presence of white noise and to approximate a nonlinear m...

متن کامل

Clustering and selecting suppliers based on simulated annealing algorithms

This study proposes twooptimizationmathematicalmodels for the clustering and selection of suppliers. Model 1 performs an analysis of supplier clusters, according to customer demand attributes, including production cost, product quality and production time. Model 2 uses the supplier cluster obtained in Model 1 to determine the appropriate supplier combinations. The study additionally proposes a ...

متن کامل

Energy Transforms for Metropolis and Simulated Annealing Algorithms Energy Transforms for Metropolis and Simulated Annealing Algorithms

We present here a method to speed up Metropolis algorithms which can be viewed as an alternative to simulated annealing. We show that this method of energy transformation compares favourably with simulated annealing in the asymptotic of a close to one probability of convergence. It requires an estimate of the minimum value of the energy function to be known, but if only a loose estimate is avai...

متن کامل

Comparison of Simulated Annealing, Genetic, and Tabu Search Algorithms for Fracture Network Modeling

The mathematical modeling of fracture networks is critical for the exploration and development of natural resources. Fractures can help the production of petroleum, water, and geothermal energy. They also greatly influence the drainage and production of methane gas from coal beds. Orientation and spatial distribution of fractures in rocks are important factors in controlling fluid flow. The obj...

متن کامل

Parallel Simulated Annealing Algorithms

n different nodes of the network. The two algorithms have been applied to the job shop scheduling problem (JSS) and the traveling salesman problem (TSP). Both algorithms showed very good performance in terms of solution time and solution quality. The rest of the paper is organized in the following fashion. Section II describes the simulated annealing technique. Section III presents the cluster ...

متن کامل

منابع من

با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ذخیره در منابع من قبلا به منابع من ذحیره شده

{@ msg_add @}


عنوان ژورنال

دوره 7  شماره 1

صفحات  191- 219

تاریخ انتشار 2020-07-01

با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.

میزبانی شده توسط پلتفرم ابری doprax.com

copyright © 2015-2023