Solving a dynamic cell formation problem using metaheuristics |
| |
| Authors: | R Tavakkoli-Moghaddam MB Aryanezhad N Safaei A Azaron |
| |
| Institution: | aDepartment of Industrial Engineering, University of Tehran, Tehran, Iran;bDepartment of Industrial Engineering, Iran University of Science and Technology, Tehran, Iran;cDepartment of Artificial Complex Systems Engineering, Graduate School of Engineering, Hiroshima University, Kagamiyama 1-4-1, Higashi-Hiroshima, 739-8527, Japan |
| |
| Abstract: | In this paper, solving a cell formation (CF) problem in dynamic condition is going to be discussed by using some traditional metaheuristic methods such as genetic algorithm (GA), simulated annealing (SA) and tabu search (TS). Most of previous researches were done under the static condition. Due to the fact that CF is a NP-hard problem, then solving the model using classical optimization methods needs a long computational time. In this research, a nonlinear integer model of CF is first given and then solved by GA, SA and TS. Then, the results are compared with the optimal solution and the efficiency of the proposed algorithms is discussed. |
| |
| Keywords: | Dynamic cell formation Genetic algorithm Simulated annealing Tabu search |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
