A simulated annealing heuristic for the dynamic layout problem with budget constraint

A simulated annealing heuristic for the dynamic layout problem with budget constraint

0.00 Avg rating0 Votes
Article ID: iaor20116516
Volume: 59
Issue: 2
Start Page Number: 308
End Page Number: 313
Publication Date: Sep 2010
Journal: Computers & Industrial Engineering
Authors: , ,
Keywords: optimization: simulated annealing, heuristics, location
Abstract:

Facility layout problem has been extensively studied in the literature because the total material handling cost can be a significant portion in the operational costs for a company and in the manufacturing cost of a product. Today’s severe global competition, rapid changes in technology and shortening life cycle of products force companies to evaluate and modify their facility layout in a periodic fashion. This type of layout problems is categorized as the dynamic facility layout problem (DFLP). As a realistic dimension of the problem, one has to consider also the limited budget to cover the cost of changing the layout. In this study, we propose a simulated annealing heuristic for the DFLP with budget constraint, and show the effectiveness of this heuristic on a set of numerical experiments.

Reviews

Required fields are marked *. Your email address will not be published.