The dynamic plant layout problem (DPLP) deals with the design of multi-period layout plans. The problem of rearranging manufacturing facilities is known as Dynamic Facility Layout Problem (DFLP). The objective of the paper is to minimize the sum of the material handling and the rearrangement costs in DFLP with equal-area facilities. The problem is NP-hard so that only small-sized problems can be solved in reasonable time. Hence, in the paper, a hybrid heuristics method is applied to solve the DFLP; i.e. Clonal Selection Algorithm (CSA) and Simulated Annealing (SA). The results show that the hybrid heuristic method provides better solutions than other applied algorithm.
کلید واژگان :Dynamic facility layout problems, Clonal selection algorithm, Simulated Annealing
ارزش ریالی : 300000 ریال
با پرداخت الکترونیک
جزئیات مقاله
- کد شناسه : 6142036067628923
- سال انتشار : 2011
- نوع مقاله : مقاله کامل پذیرفته شده در کنفرانس ها
- زبان : انگلیسی
- محل پذیرش : 4th International Conference of Iranian Operations Research Society, Department of Mathematics University of Guilan, May 18-19,
- برگزار کنندگان : Department of Mathematics University of Guilan,
- تاریخ ثبت : 1393/10/14 12:07:56
- ثبت کننده : Se Pid
- تعداد بازدید : 313
- تعداد فروش : 0