Advanced Search

Query:

Fill in the form and click »Search«...

Format:

Display: entries per page entries

Zbl 1104.92018
Tavakkoli-Moghaddam, R.; Aryanezhad, M.B.; Safaei, N.; Azaron, A.
Solving a dynamic cell formation problem using metaheuristics. (English)
[J] Appl. Math. Comput. 170, No. 2, 761-780 (2005). ISSN 0096-3003

Summary: Solving a cell formation (CF) problem in dynamic conditions 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 an NP-hard problem, 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.

MSC 2000:: *92C37 Cell biology
90C59 Approximation methods and heuristics

Keywords: Dynamic cell formation; Genetic algorithm; Simulated annealing; Tabu search

Comment on this Item PDF MathML XML ASCII DVI PS BibTeX Online Ordering Article Journal

	Scientific prize winners of the ICM 2010
	Overhang
	Lie groups, physics and geometry. An introduction for physicists, engineers and chemists.

Advanced Search

Zentralblatt MATH Berlin [Germany]