Return
Bi-objective dependent location quadratic assignment problem: Formulation and solution using a modified artificial bee colony algorithm
DOI:10.1016/j.cie.2018.05.018.png)
Abstract
En 中文
Combinatorial optimization problems arise from various real life situations and the quadratic assignment problem (QAP) to model a facility layout problem or a plant location problem is such an example. While examining the facility layout of a semi-automated bus body manufacturing unit, a bi-objective facility layout optimization problem is identified in which the solution space of the second objective function depends and changes upon the feasible solutions of the first objective function. In this paper, the said problem is first defined in the form of a biobjective quadratic dependent location assignment problem (bi-d-QAP), a heuristic solution approach is then provided, and finally, a modified artificial bee colony algorithm is proposed while combining both the genetic and neighborhood search algorithms to solve the considered bi-d-QAP. The data obtained from the abovementioned manufacturing unit are utilized to show how the proposed algorithm performs better in comparison to some of the popular state-of-the-art optimization algorithms.
Keywords:
Combinatorial optimization
Multi-objective QAP
Interwoven systems
Artificial bee colony algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6.5
Papers:
1.0W
Citations:
3.8W
Organization
Cited Papers
Neoproterozoic amorphous “ekanite” (Ca2Th0.9U0.1Si8O20) from Okkampitiya, Sri Lanka: A metamict gemstone with excellent lead-retention performance
Geology
IF0

