.png){kind=icon}
.png){kind=icon}
Return
A simulated annealing algorithm for solving the bi-objective facility layout problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2010.09.117.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this article, a bi-objective facility layout problem (BOFLP) is considered by combining the objectives of minimization of the total material handling cost (quantitative) and the maximization of total closeness rating scores (qualitative), with the predetermined weights are assigned to the respective objectives. A simulated annealing (SA) algorithm is proposed to solve the BOFLP, as well as a comparison of SA with the previous works is provided. It is shown that the SA algorithm works better than the previous works; thus proving the fact that the proposed SA algorithm is an efficient method for solving BOFLP. (C) 2010 Elsevier Ltd. All rights reserved.
Keywords:
Facility layout problem
Simulated annealing
Bi-objective
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
2.9W
Citations:
10.2W